3 * libEtPan! -- a mail stuff library
5 * carray - Implements simple dynamic pointer arrays
7 * Copyright (c) 1999-2000, Gaƫl Roualland <gael.roualland@iname.com>
8 * interface changes - 2002 - DINH Viet Hoa
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the libEtPan! project nor the names of its
20 * contributors may be used to endorse or promote products derived
21 * from this software without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44 carray * carray_new(unsigned int initsize) {
47 array = (carray *) malloc(sizeof(carray));
48 if (!array) return NULL;
51 array->max = initsize;
52 array->array = (void **) malloc(sizeof(void *) * initsize);
60 int carray_add(carray * array, void * data, unsigned int * index) {
63 r = carray_set_size(array, array->len + 1);
67 array->array[array->len - 1] = data;
69 * index = array->len - 1;
74 int carray_set_size(carray * array, unsigned int new_size)
76 if (new_size > array->max) {
77 unsigned int n = array->max * 2;
83 new = (void **) realloc(array->array, sizeof(void *) * n);
89 array->len = new_size;
94 int carray_delete_fast(carray * array, unsigned int indx) {
95 if (indx >= array->len)
98 array->array[indx] = NULL;
103 int carray_delete(carray * array, unsigned int indx) {
104 if (indx >= array->len)
107 if (indx != --array->len)
108 array->array[indx] = array->array[array->len];
112 int carray_delete_slow(carray * array, unsigned int indx) {
113 if (indx >= array->len)
116 if (indx != --array->len)
117 memmove(array->array + indx, array->array + indx + 1,
118 (array->len - indx) * sizeof(void *));
123 void ** carray_data(carray * array) {
127 unsigned int carray_count(carray * array) {
131 void * carray_get(carray * array, unsigned int indx) {
132 return array->array[indx];
135 void carray_set(carray * array, unsigned int indx, void * value) {
136 array->array[indx] = value;
140 void carray_free(carray * array) {