/simpletypesystem/trunk : contents of src/DynamicArray.c at revision 61

: (revision 61)

To get this branch, use:

bzr branch
http://gegoxaren.bato24.eu/bzr/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->last_item = 0;
  
  self->priv->free_func = free_func;
  
  self->priv->array = calloc (len ,sizeof (* self->priv->array));
  
  return self;
}

void
s_dynamic_array_free (SDynamicArray * self, sboolean free_data) {
  if (free_data) {
    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->last_item; i++) {
        free (self->priv->array[i]);
      }
    }
  }
  
  free (self->priv->array);
  free (self->priv);
  free (self);
}

spointer
s_dynamic_array_get (SDynamicArray * self, size_t index) {
  return self->priv->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);
    
    self->max_size = new_size;
    
    self->priv->array = realloc (self->priv->array,
                          (sizeof (* self->priv->array) * (self->max_size)));
  }
  
  if (self->last_item < index) {
    self->last_item = index;
  }
  
  self->priv->array[index] = 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) {
  spointer * ret_val = calloc (self->last_item + 1, sizeof (* self->priv->array));
  for (int i = 0; i < self->last_item; i++) {
    ret_val[i] = self->priv->array[i];
  }
  ret_val[self->last_item] = NULL;
  return ret_val;
}

void
s_dynamic_array_for_each (SDynamicArray * self, ForEachFunc func,
                             spointer data) {
  for (int i = 0; i < self->max_size && i <= self->last_item; i++) {
    spointer item = self->priv->array[i];
    if (item) {
      func (self, item, data);
    }
  }
}


void
_private_for_each_item_free (SDynamicArray * self, spointer item,
                                    spointer data) {
  FreeFunc func = self->priv->free_func;
  func (item);
}


5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	1	/* c-basic-offset: 2; tab-width: 2; indent-tabs-mode: nil
	2	* vi: set shiftwidth=2 tabstop=2 expandtab:
	3	* :indentSize=2:tabSize=2:noTabs=true:
	4	*/
	5
	6	/*
5.2.9 by Gustav Hartvigsson * Added license to files	7	Copyright (c) 2013-2014 Gustav Hartvigsson
	8
	9	Permission is hereby granted, free of charge, to any person obtaining a copy
	10	of this software and associated documentation files (the "Software"), to deal
	11	in the Software without restriction, including without limitation the rights
	12	to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
	13	copies of the Software, and to permit persons to whom the Software is
	14	furnished to do so, subject to the following conditions:
	15
	16	The above copyright notice and this permission notice shall be included in
	17	all copies or substantial portions of the Software.
	18
	19	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
	20	IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
	21	FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
	22	AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
	23	LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
	24	OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
	25	THE SOFTWARE.
	26	*/
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	27
30 by Gustav Hartvigsson * Made the code compile using CMake.	28	#include "DynamicArray.h"
	29
46 by Gustav Hartvigsson * Renamed DynamicArray to SDynamicArray.	30	struct SDynamicArrayPrivate {
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	31	FreeFunc free_func;
30 by Gustav Hartvigsson * Made the code compile using CMake.	32	spointer * array;
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	33	};
	34
61 by Gustav Hartvigsson * Made the code more easy to read.	35	void
61 by Gustav Hartvigsson * Made the code more easy to read.	36	_private_for_each_item_free (SDynamicArray * self, spointer item,
30 by Gustav Hartvigsson * Made the code compile using CMake.	37	spointer data);
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	38
46 by Gustav Hartvigsson * Renamed DynamicArray to SDynamicArray.	39	SDynamicArray * s_dynamic_array_new (size_t len, FreeFunc free_func) {
	40	SDynamicArray * self = malloc (sizeof(SDynamicArray));
	41
	42	self->priv = malloc (sizeof (SDynamicArrayPrivate));
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	43
	44	self->max_size = len;
	45
48 by Gustav Hartvigsson * Finnished SLinkedList.	46	self->last_item = 0;
48 by Gustav Hartvigsson * Finnished SLinkedList.	47
46 by Gustav Hartvigsson * Renamed DynamicArray to SDynamicArray.	48	self->priv->free_func = free_func;
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	49
47 by Gustav Hartvigsson * Added a few skeletal functions to Callback.h	50	self->priv->array = calloc (len ,sizeof (* self->priv->array));
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	51
	52	return self;
	53	}
	54
61 by Gustav Hartvigsson * Made the code more easy to read.	55	void
61 by Gustav Hartvigsson * Made the code more easy to read.	56	s_dynamic_array_free (SDynamicArray * self, sboolean free_data) {
48 by Gustav Hartvigsson * Finnished SLinkedList.	57	if (free_data) {
	58	if (self->priv->free_func != NULL) {
	59	s_dynamic_array_for_each (self, (ForEachFunc) _private_for_each_item_free,
	60	NULL);
	61	} else {
	62	for (int i = 0; i < self->last_item; i++) {
	63	free (self->priv->array[i]);
	64	}
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	65	}
	66	}
48 by Gustav Hartvigsson * Finnished SLinkedList.	67
46 by Gustav Hartvigsson * Renamed DynamicArray to SDynamicArray.	68	free (self->priv->array);
48 by Gustav Hartvigsson * Finnished SLinkedList.	69	free (self->priv);
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	70	free (self);
	71	}
	72
61 by Gustav Hartvigsson * Made the code more easy to read.	73	spointer
61 by Gustav Hartvigsson * Made the code more easy to read.	74	s_dynamic_array_get (SDynamicArray * self, size_t index) {
46 by Gustav Hartvigsson * Renamed DynamicArray to SDynamicArray.	75	return self->priv->array[index];
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	76	}
	77
61 by Gustav Hartvigsson * Made the code more easy to read.	78	void
61 by Gustav Hartvigsson * Made the code more easy to read.	79	s_dynamic_array_set (SDynamicArray * self, size_t index, spointer item) {
47 by Gustav Hartvigsson * Added a few skeletal functions to Callback.h	80	if (self->max_size <= index) {
	81	size_t new_size = round_up (index + ARRAY_PADDING, ARRAY_PADDING) + 1;
48 by Gustav Hartvigsson * Finnished SLinkedList.	82	s_dbg_print ("Index: %zu current array size: %zu new array size: %zu ",
47 by Gustav Hartvigsson * Added a few skeletal functions to Callback.h	83	index, self->max_size, new_size);
	84
	85	self->max_size = new_size;
	86
	87	self->priv->array = realloc (self->priv->array,
	88	(sizeof (* self->priv->array) * (self->max_size)));
	89	}
	90
	91	if (self->last_item < index) {
	92	self->last_item = index;
	93	}
	94
	95	self->priv->array[index] = item;
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	96	}
	97
61 by Gustav Hartvigsson * Made the code more easy to read.	98	size_t
61 by Gustav Hartvigsson * Made the code more easy to read.	99	s_dynamic_array_size (SDynamicArray * self) {
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	100	return self->max_size;
	101	}
	102
61 by Gustav Hartvigsson * Made the code more easy to read.	103	size_t
61 by Gustav Hartvigsson * Made the code more easy to read.	104	s_dynamic_array_last_item (SDynamicArray * self) {
47 by Gustav Hartvigsson * Added a few skeletal functions to Callback.h	105	return self->last_item;
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	106	}
	107
61 by Gustav Hartvigsson * Made the code more easy to read.	108	spointer *
61 by Gustav Hartvigsson * Made the code more easy to read.	109	s_dynamic_array_dump_array (SDynamicArray * self) {
47 by Gustav Hartvigsson * Added a few skeletal functions to Callback.h	110	spointer * ret_val = calloc (self->last_item + 1, sizeof (* self->priv->array));
	111	for (int i = 0; i < self->last_item; i++) {
46 by Gustav Hartvigsson * Renamed DynamicArray to SDynamicArray.	112	ret_val[i] = self->priv->array[i];
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	113	}
47 by Gustav Hartvigsson * Added a few skeletal functions to Callback.h	114	ret_val[self->last_item] = NULL;
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	115	return ret_val;
	116	}
	117
61 by Gustav Hartvigsson * Made the code more easy to read.	118	void
61 by Gustav Hartvigsson * Made the code more easy to read.	119	s_dynamic_array_for_each (SDynamicArray * self, ForEachFunc func,
30 by Gustav Hartvigsson * Made the code compile using CMake.	120	spointer data) {
47 by Gustav Hartvigsson * Added a few skeletal functions to Callback.h	121	for (int i = 0; i < self->max_size && i <= self->last_item; i++) {
	122	spointer item = self->priv->array[i];
	123	if (item) {
	124	func (self, item, data);
	125	}
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	126	}
	127	}
	128
	129
61 by Gustav Hartvigsson * Made the code more easy to read.	130	void
61 by Gustav Hartvigsson * Made the code more easy to read.	131	_private_for_each_item_free (SDynamicArray * self, spointer item,
30 by Gustav Hartvigsson * Made the code compile using CMake.	132	spointer data) {
46 by Gustav Hartvigsson * Renamed DynamicArray to SDynamicArray.	133	FreeFunc func = self->priv->free_func;
5.2.8 by Gustav Hartvigsson * Copied over LinkedList and DynamicArray from c_sdl_js	134	func (item);
	135	}
	136