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
46 typedef GPtrArray carray;
48 /* Creates a new array of pointers, with initsize preallocated cells */
49 static inline carray *carray_new(guint initsize)
51 carray *res = g_ptr_array_new();
52 gint n = (gint) initsize;
54 g_ptr_array_set_size(res, n);
58 static inline gint carray_add(carray *array, void *data, guint *index)
60 g_ptr_array_add(array, data);
61 *index = array->len - 1;
65 static inline gint carray_set_size(carray *array, guint new_size)
67 gint n = (gint) new_size;
69 g_ptr_array_set_size(array, n);
73 static inline gint carray_delete(carray *array, guint indx)
77 if (n >= array->len) return -1;
78 g_ptr_array_remove_index_fast(array, n);
82 static inline gint carray_delete_slow(carray *array, guint indx)
86 return g_ptr_array_remove_index(array, n) ? 0 : -1;
89 static inline gint carray_delete_fast(carray *array, guint indx)
93 g_ptr_array_index(array, n) = NULL;
97 static inline gint carray_free(carray *array)
99 g_ptr_array_free(array, TRUE);
102 static inline gpointer carray_get(carray *array, guint index)
104 gint n = (gint) index;
105 if (n < 0) return NULL;
106 return g_ptr_array_index(array, n);
109 static inline carray_set(carray *array, guint index, gpointer value)
111 gint n = (gint) index;
113 g_ptr_array_index(array, n) = value;
116 static guint carray_count(carray *array)
118 /* NOTE: We're hosed when len < 0, but that won't occur */
119 return (guint) array->len;