/simpletypesystem/trunk

/* c-basic-offset: 2; tab-width: 2; indent-tabs-mode: nil

 * vi: set shiftwidth=2 tabstop=2 expandtab:

 * :indentSize=2:tabSize=2:noTabs=true:

 */

/*

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 "DynamicArray.h"

struct

SDynamicArray {

  FreeFunc free_func;

  FuncPointer to_json;

  FuncPointer from_json;

  size_t max_size;

  size_t last_item;

  spointer * array;

};

void

_private_for_each_item_free (SDynamicArray * self, spointer item,

                             spointer data);

SDynamicArray *

s_dynamic_array_new_full (size_t len,

                          FreeFunc free_func,

                          FuncPointer to_json,

                          FuncPointer from_json) {

  SDynamicArray * self = s_malloc (sizeof(SDynamicArray));

  self->max_size = len;

  self->last_item = 0;

  if (free_func == NULL) {

    self->free_func = s_free;

  } else {

    self->free_func = free_func;

  }

  self->to_json = to_json;

  self->from_json = from_json;

  self->array = s_calloc (len ,sizeof (spointer));

  return self;

}

SDynamicArray *

s_dynamic_array_new (size_t len,

                     FreeFunc free_func) {

  SDynamicArray * self = s_dynamic_array_new_full (len, free_func, NULL, NULL);

  return self;

}

SDynamicArray *

s_dynamic_array_new_json (size_t len,

                          FreeFunc free_func,

                          FuncPointer to_json,

                          FuncPointer from_json) {

  SDynamicArray * self = s_dynamic_array_new_full (len, free_func, to_json, from_json);

  return self;

}

void

s_dynamic_array_free (SDynamicArray * self, sboolean free_data) {

  if (free_data) {

    if (self->free_func != NULL) {

      s_dbg_print ("SDynamicArray: free data.");

      s_dynamic_array_for_each (self,

                                FOREACHFUNC (_private_for_each_item_free),

                                NULL);

    }

  }

  s_free (self->array);

  s_free (self);

}

spointer

s_dynamic_array_get (SDynamicArray * self, size_t index) {

  if (index > self->max_size) {

    s_err_print ("Index out of range:\n\tMax index: %zd requested index:%zd",

                 self->max_size, index);

    return NULL;

  }

  if (self->max_size < 1) {

    return NULL;

  }

  return self->array[index];

}

void

s_dynamic_array_set (SDynamicArray * self, size_t index, spointer item) {

  if (self->max_size <= index) {

    size_t new_size = round_up (index + ARRAY_PADDING, ARRAY_PADDING) + 1;

    s_dbg_print ("Index: %zu current array size: %zu new array size: %zu ",

                 index, self->max_size, new_size);

    size_t old_size = self->max_size;

    self->max_size = new_size;

    self->array = s_realloc (self->array,

                             (sizeof (spointer) * (self->max_size)));

    /* Zero new momery */

    for (size_t i = old_size; i < new_size; i++) {

      self->array[i] = NULL;

    }

  }

  if (self->last_item < index) {

    self->last_item = index;

  }

  self->array[index] = item;

}

void

s_dynamic_array_append (SDynamicArray * self,

                        spointer item) {

  size_t next_pos = s_dynamic_array_last_item (self) + 1;

  s_dynamic_array_set (self, next_pos, item);

}

size_t

s_dynamic_array_size (SDynamicArray * self) {

  return self->max_size;

}

size_t

s_dynamic_array_last_item (SDynamicArray * self) {

  return self->last_item;

}

spointer *

s_dynamic_array_dump_array (SDynamicArray * self,

                            size_t * out_size) {

  spointer * ret_val = s_calloc (self->last_item + 1, sizeof (* self->array));

  for (size_t i = 0; i <= self->last_item; i++) {

    ret_val[i] = self->array[i];

  }

  *out_size = self->last_item + 1;

  ret_val[*out_size] = NULL;

  ret_val = s_realloc (ret_val, *out_size * sizeof (* self->array));

  return ret_val;

}

void

s_dynamic_array_for_each (SDynamicArray * self,

                          ForEachFunc func,

                          spointer data) {

  s_dbg_print ("Size: %zd", self->max_size);

  for (int i = 0; i < self->max_size && i <= self->last_item; i++) {

    spointer item = self->array[i];

    if (item) {

      s_dbg_print ("Item Found.");

      func (self, item, data);

    }

  }

}

void

_private_for_each_item_free (SDynamicArray * self, spointer item,

                             spointer data) {

  s_dbg_print ("Removing item from array");

  FreeFunc func = self->free_func;

  if (func) {

    func (item);

  }

}