1 /* GObject - GLib Type, Object, Parameter and Signal Library
2 * Copyright (C) 2001 Red Hat, Inc.
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General
15 * Public License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place, Suite 330,
17 * Boston, MA 02111-1307, USA.
24 #include "gvaluearray.h"
26 #include <stdlib.h> /* qsort() */
30 /* --- functions --- */
32 g_value_array_get_nth (GValueArray *value_array,
35 g_return_val_if_fail (value_array != NULL, NULL);
36 g_return_val_if_fail (index < value_array->n_values, NULL);
38 return value_array->values + index;
42 g_value_array_new (guint n_prealloced)
44 GValueArray *value_array = g_new0 (GValueArray, 1);
46 value_array->n_values = n_prealloced;
47 value_array->values = g_renew (GValue, value_array->values, value_array->n_values);
48 memset (value_array->values, 0, value_array->n_values * sizeof (value_array->values[0]));
54 g_value_array_free (GValueArray *value_array)
58 g_return_if_fail (value_array != NULL);
60 for (i = 0; i < value_array->n_values; i++)
62 GValue *value = value_array->values + i;
64 if (G_VALUE_TYPE (value) != 0) /* we allow unset values in the array */
65 g_value_unset (value);
67 g_free (value_array->values);
72 g_value_array_copy (const GValueArray *value_array)
74 GValueArray *new_array;
77 g_return_val_if_fail (value_array != NULL, NULL);
79 new_array = g_new0 (GValueArray, 1);
80 new_array->n_values = value_array->n_values;
81 new_array->values = g_renew (GValue, new_array->values, new_array->n_values);
82 memset (new_array->values, 0, new_array->n_values * sizeof (new_array->values[0]));
83 for (i = 0; i < new_array->n_values; i++)
84 if (G_VALUE_TYPE (value_array->values + i) != 0)
86 GValue *value = new_array->values + i;
88 g_value_init (value, G_VALUE_TYPE (value_array->values + i));
89 g_value_copy (value_array->values + i, value);
95 g_value_array_prepend (GValueArray *value_array,
98 g_return_val_if_fail (value_array != NULL, NULL);
100 return g_value_array_insert (value_array, 0, value);
104 g_value_array_append (GValueArray *value_array,
107 g_return_val_if_fail (value_array != NULL, NULL);
109 return g_value_array_insert (value_array, value_array->n_values, value);
113 g_value_array_insert (GValueArray *value_array,
119 g_return_val_if_fail (value_array != NULL, NULL);
120 g_return_val_if_fail (index <= value_array->n_values, value_array);
122 /* we support NULL for "value" as a shortcut for an unset value */
124 i = value_array->n_values++;
125 value_array->values = g_renew (GValue, value_array->values, value_array->n_values);
126 if (index + 1 < value_array->n_values)
127 g_memmove (value_array->values + index + 1, value_array->values + index,
128 (i - index) * sizeof (value_array->values[0]));
129 memset (value_array->values + index, 0, sizeof (value_array->values[0]));
132 g_value_init (value_array->values + index, G_VALUE_TYPE (value));
133 g_value_copy (value, value_array->values + index);
139 g_value_array_remove (GValueArray *value_array,
142 g_return_val_if_fail (value_array != NULL, NULL);
143 g_return_val_if_fail (index < value_array->n_values, value_array);
145 if (G_VALUE_TYPE (value_array->values + index) != 0)
146 g_value_unset (value_array->values + index);
147 value_array->n_values--;
148 if (index < value_array->n_values)
149 g_memmove (value_array->values + index, value_array->values + index + 1,
150 (value_array->n_values - index) * sizeof (value_array->values[0]));
151 value_array->values = g_renew (GValue, value_array->values, value_array->n_values);
157 g_value_array_sort (GValueArray *value_array,
158 GCompareFunc compare_func)
160 g_return_val_if_fail (compare_func != NULL, NULL);
162 if (value_array->n_values)
163 qsort (value_array->values,
164 value_array->n_values,
165 sizeof (value_array->values[0]),
171 g_value_array_sort_with_data (GValueArray *value_array,
172 GCompareDataFunc compare_func,
175 g_return_val_if_fail (value_array != NULL, NULL);
176 g_return_val_if_fail (compare_func != NULL, NULL);
178 if (value_array->n_values)
179 g_qsort_with_data (value_array->values,
180 value_array->n_values,
181 sizeof (value_array->values[0]),
182 compare_func, user_data);