/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.

*/

#include "Map.h"

#include "LinkedList.h"

#include <stdlib.h>

struct

SMap {

  size_t len; // Length

  SDynamicArray * array; /**< This is what holds the buckets. These buckets are

                          * in turn also SDynamicArrays; or in template speak:

                          * SDynamicArray<SLinkedList<SMapItem*>*>*

                          */

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

  HashFunc key_hash_func;

  FreeFunc free_key;

  FreeFunc free_value;

};

void

_s_map_internal_free_array_for_each (SDynamicArray * obj,

                                     SLinkedList * item,

                                     SMap * self);

void

_s_map_internal_free_bucket_for_each (SDynamicArray * obj,

                                      SMapItem * item,

                                      SMap * self);

SLinkedList *

_s_map_internal_find_bucket (SMap * self,

                             spointer key);

SMapItem *

_s_map_internal_find_item_in_bucket (SMap * self,

                                     SLinkedList * bucket,

                                     spointer key);

SMapItem *

s_map_item_new (void * key, void * value) {

  SMapItem * self = malloc (sizeof (SMapItem));

  self->key = key;

  self->value = value;

  return self;

}

void

s_map_item_free (SMapItem * self,

                 FreeFunc free_key,

                 FreeFunc free_value) {

  free_key (self->key);

  free_value (self->value);

  free (self);

}

SMap *

s_map_new (CompFunc comp_func,

           HashFunc key_hash_func,

           FreeFunc free_key,

           FreeFunc free_value) {

  SMap * self = malloc (sizeof (SMap));

  self->len = 0;

  self->is_equal = comp_func;

  /* free_* functions need to be checked if they are null and set the pointer

   * to free or s_base_object_free ()... Have to decide which...?

   */

  if (free_key) {

    self->free_key = free_key;

  } else {

    self->free_key = FREEFUNC(free);

  }

  if (free_value) {

    self->free_value = free_value;

  } else {

    self->free_value = FREEFUNC(free);

  }

  /* if no func is set we have to use some other metod of 

   */

  if (key_hash_func == NULL){

    self->key_hash_func = s_hash_object;

  } else {

    self->key_hash_func = key_hash_func;

  }

  /* We do our own freeing of objects. */

  self->array = s_dynamic_array_new (S_MAP_DEFAULT_NUMBER_OF_BUCKETS,

                                           NULL);

  return self;

}

void

s_map_free (SMap * self) {

  s_dynamic_array_for_each (self->array,

                            FOREACHFUNC(_s_map_internal_free_array_for_each),

                            self);

  s_dynamic_array_free (self->array, FALSE);

  free (self);

}

void

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

  SDynamicArray * array = self->array;

  SMapItem * item = s_map_item_new (key, value);

  /* We have to generate a key to use as an index in the DynamicArray. */

  HashFunc hash_func = self->key_hash_func;

  hash_t hash = hash_func (key);

  /* We need to mod it with the max size of the array. */

  hash = hash % S_MAP_DEFAULT_NUMBER_OF_BUCKETS;

  if (self->len == 0) {

    /* Since we know that there are no items in the array we can skip the

     * check if the new place is taken. and just and an array to it.

     */

    SLinkedList * bucket = s_linked_list_new (NULL);

    s_dynamic_array_set (array, hash, bucket);

    s_linked_list_append (bucket, item);

  } else {

    /* Figure out if the bucket exists. */

    SLinkedList * bucket = _s_map_internal_find_bucket (self, key);

    if (bucket == NULL) {

      bucket = s_linked_list_new (NULL);

    }

    if (_s_map_internal_find_item_in_bucket (self, bucket, key)) {

      s_warn_print ("Key already exists in SMap\n");

      return;

    }

    s_linked_list_append (bucket, item);

  }

}

spointer

s_map_get (SMap * self, spointer key) {

  spointer ret_val = NULL;

  SLinkedList * bucket = _s_map_internal_find_bucket (self, key);

  if (bucket) {

    SMapItem * item = _s_map_internal_find_item_in_bucket (self, bucket, key);

    if (item) {

      ret_val = item->value;

    }

  }

  return ret_val;

}

void

s_map_remove (SMap * self, spointer key) {

  SLinkedList * bucket = _s_map_internal_find_bucket (self, key);

  if (bucket) {

    SMapItem * item = _s_map_internal_find_item_in_bucket (self, bucket, key);

    if (item) {

      s_map_item_free (item, self->free_key, self->free_value);

      return;

    }

  }

  s_dbg_print ("Could not find item in SMap.\n");

}

SLinkedList *

_s_map_internal_find_bucket (SMap * self,

                             spointer key) {

  SLinkedList * ret_val = NULL;

  HashFunc hash_func = self->key_hash_func;

  hash_t hash = hash_func (key);

  ret_val = s_dynamic_array_get (self->array, hash);

  return ret_val;

}

SMapItem *

_s_map_internal_find_item_in_bucket (SMap * self,

                                     SLinkedList * bucket,

                                     spointer key) {

  for (size_t i = 0; i <= s_linked_list_len (bucket) + 1; i++) {

    SMapItem * item = SMAPITEM (s_linked_list_get_current (bucket));

    if (self->is_equal (item->key, key)) {

      return item;

    }

    s_linked_list_next (bucket);

  }

  return NULL;

}

void

_s_map_internal_free_array_for_each (SDynamicArray * obj,

                                     SLinkedList * item,

                                     SMap * self) {

  s_linked_list_for_each (item,

                          FOREACHFUNC(_s_map_internal_free_bucket_for_each),

                          self);

  s_linked_list_free (item, FALSE);

}

void

_s_map_internal_free_bucket_for_each (SDynamicArray * obj,

                                     SMapItem * item,

                                     SMap * self) {

  s_map_item_free (item, self->free_key, self->free_value);

}