/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 SDynamicArrayPrivate {

  FreeFunc free_func;

  spointer * array;

};

void _private_for_each_item_free (SDynamicArray * self, spointer item,

                                    spointer data);

SDynamicArray * s_dynamic_array_new (size_t len, FreeFunc free_func) {

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

  self->priv = malloc (sizeof (SDynamicArrayPrivate));

  self->max_size = len;

  self->len = 0;

  self->priv->free_func = free_func;

  self->priv->array = malloc (len * sizeof (* self->priv->array));

  return self;

}

void s_dynamic_array_free (SDynamicArray * self) {

  if (self->priv->free_func != NULL) {

    s_dynamic_array_for_each (self, (ForEachFunc) _private_for_each_item_free,

                            NULL);

  } else {

    for (int i = 0; i < self->len; i++) {

      free (self->priv->array[i]);

    }

  }

  free (self->priv->array);

  free (self);

}

spointer s_dynamic_array_get (SDynamicArray * self, size_t index) {

  return self->priv->array[index];

}

size_t s_dynamic_array_len (SDynamicArray * self) {

  return self->len;

}

size_t s_dynamic_array_size (SDynamicArray * self) {

  return self->max_size;

}

void s_dynamic_array_add (SDynamicArray * self, spointer data) {

  if (self->len >= self->max_size - 1) {

    self->priv->array = realloc (self->priv->array,

                          (sizeof (* self->priv->array) *

                          (self->max_size + ARRAY_PADDING)));

    self->max_size = self->max_size + ARRAY_PADDING;

  }

  self->priv->array[self->len] = data;

  self->len++;

}

spointer * s_dynamic_array_dump_array (SDynamicArray * self) {

  spointer * ret_val = malloc (sizeof (* self->priv->array) * (self->len + 1));

  for (int i = 0; i < self->len; i++) {

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

  }

  ret_val[self->len] = NULL;

  return ret_val;

}

void s_dynamic_array_for_each (SDynamicArray * self, ForEachFunc func,

                             spointer data) {

  for (int i = 0; i < self->len; i++) {

    func (self, self->priv->array[i], data);

  }

}

void _private_for_each_item_free (SDynamicArray * self, spointer item,

                                    spointer data) {

  FreeFunc func = self->priv->free_func;

  func (item);

}