Allocate and initialize a new #GValueArray, optionally preserve space
for n_prealloced elements. New arrays always contain 0 elements,
regardless of the value of n_prealloced.
number of values to preallocate space for
number of values contained in the array
array of values
Insert a copy of value as last element of value_array. If value is
%NULL, an uninitialized value is appended.
#GValue to copy into #GValueArray, or %NULL
Construct an exact copy of a #GValueArray by duplicating all its contents.
Return a pointer to the value at index_ containd in value_array.
index of the value of interest
Insert a copy of value at specified position into value_array. If value
is %NULL, an uninitialized value is inserted.
insertion position, must be <= value_array->;n_values
#GValue to copy into #GValueArray, or %NULL
Insert a copy of value as first element of value_array. If value is
%NULL, an uninitialized value is prepended.
#GValue to copy into #GValueArray, or %NULL
Remove the value at position index_ from value_array.
position of value to remove, which must be less than value_array->n_values
Sort value_array using compare_func to compare the elements according
to the semantics of #GCompareDataFunc.
The current implementation uses the same sorting algorithm as standard C qsort() function.
function to compare elements
Allocate and initialize a new #GValueArray, optionally preserve space
for n_prealloced elements. New arrays always contain 0 elements,
regardless of the value of n_prealloced.
number of values to preallocate space for
A #GValueArray contains an array of #GValue elements.