/simpletypesystem/trunk

/*

Copyright (c) 2013-2014 Gustav Hartvigsson

Permission is hereby granted, free of charge, to any person obtaining a copy

of this software and associated documentation files (the "Software"), to deal

in the Software without restriction, including without limitation the rights

to use, copy, modify, merge, publish, distribute, sublicense, and/or sell

copies of the Software, and to permit persons to whom the Software is

furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in

all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR

IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,

FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE

AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER

LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,

OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN

THE SOFTWARE.

*/

#ifndef __H_MAP__

#define __H_MAP__

#include "Func.h"

#include "defs.h"

#include "utils.h"

#include "hash.h"

#include "DynamicArray.h"

BEGIN_DECLS

#define S_MAP_DEFAULT_NUMBER_OF_BUCKETS 128

/**

 * @file

 * @defgroup SMap SMap

 * @addtogroup SMap

 * @{

 * An SMap is a data structure that holds many mappings of objects to objects:

 * say, a string to an other string. This can be likened to the Dict structure

 * in python, but not fully.

 * 

 * An SMap is made up of SMapItems, each MapItem holds two pointers to data.

 * The first pointer is the key, the secold is the value.

 *

 * please note that SMaps can be slow and are unordered.

 *

 * TODO: Total rewrite.

 */

/** @brief

 * SMapItem holds the mapping of a key to a value.

 */

typedef struct SMapItem SMapItem;

/** @brief

 * An SMap is a map many SMapItems. Mapping between a key and a value.

 * 

 * An SMap is not dependent on SObject, because it should be more generic

 * and have the ability to be used more easily in other SObject based classes

 * without causing circular dependencies.

 *

 * @sa SDynamicArray

 * @sa SLinkedList

 */

typedef struct SMap SMap;

typedef struct SMapClass SMapClass;

typedef struct SMapPrivate SMapPrivate;

/**

 * Data structure representing an SMapItem

 */

struct

SMapItem {

  void * key; /**< The Key */

  void * value; /**< The Value */

};

/** @brief

 * Data structure representing an SMap

 */

struct

SMap {

  SMapClass * klass;

  SMapPrivate * priv; /**< Private data pointer */

};

struct

SMapClass {

  CompFunc is_equal; /** method to check if items are equal. */

  HashFunc key_hash_func;

  FuncPointer free_key;

  FuncPointer free_value;

};

/* -------------------------------

 * The SMapItem functions.

 * -------------------------------

 */

/** @breif

 * create a new SMapItem.

 *

 * @param key The key to be added to the item.

 * @param value The value to be added to the item.

 */

SMapItem *

s_map_item_new (void * key, void * value);

/** @breif

 * Frees a SMapItem.

 * 

 * @param self the item to be freed.

 * @param free_key The function to be used to free the key.

 * @param free_value The function to be used to free the value.

 */

void

s_map_item_free (SMapItem * self, FuncPointer free_key,

                                       FuncPointer free_value);

/* -------------------------------

 * The SMap functions.

 * -------------------------------

 */

/** @brief

 * s_map_new creates a new SMap object, it takes a CompFunc as an argument.

 *

 * @param comp_func tells the SMap object if the key already exists when

 * adding key/value pares or when searching after a key when retrieving a value.

 *

 * The @c CompFunc returns true if the first and second parameters are equal,

 * otherwise false.

 *

 * @todo

 * Check if free_key and/or free_value is null and set them to something

 * appropriate.

 */

SMap *

s_map_new (CompFunc comp_func,

                  HashFunc key_hash_func,

                  FuncPointer free_key,

                  FuncPointer free_value);

/** @breif

 * This function frees an instance of an SMap.

 * 

 * @param self the object to free.

 */

void

s_map_free (SMap * self);

/** @breif

 * This function adds a key/value pair to an SMap.

 * 

 * @param self the SMap to add the key/value pair to.

 * @param key the key that is used to

 *

 * @todo

 *  make it return false on failure, or some other nastiness.

 */

void

s_map_add (SMap * self, spointer key, spointer value);

/** @breif

 * Get a value using using a key.

 * 

 * @param self the SMap that you want to retrieve a value from.

 * @param key the key that you use to retrieve the value from the SMap from

 *            with.

 */

spointer

s_map_get (SMap * self, spointer key);

/**

 * @todo

 */

void

s_map_remove (SMap * self, spointer key);

/**

 *

 */

int

s_map_ref (SMap * self);

/**

 *

 */

int

s_map_unref (SMap * self);

/** @} */

END_DECLS

#endif