Array

---

Object Hierarchy:

Description:

Content:

Creation methods:

• public Array (bool zero_terminated = true, bool clear = true, ulong element_size = sizeof ( G ?))
• public Array.sized (bool zero_terminated = true, bool clear = true, ulong element_size = sizeof ( G ?), uint reserved_size = 0)
• public Array.take (owned G[] data, bool clear = true, size_t element_size = sizeof ( G ?))
  Creates a new `GArray` with data as array data, data.length as length and a reference count of 1.
• public Array.take_zero_terminated (owned G[] data, bool clear = true, size_t element_size = sizeof ( G ?))
  Creates a new `GArray` with data as array data, computing the length of it and setting the reference count to 1.

Methods:

• public void _remove_index (uint index)
• public void _remove_index_fast (uint index)
• public void _remove_range (uint index, uint length)
• public void append_val (owned G value)
• public void append_vals (void* data, uint len)
• public bool binary_search (G target, CompareFunc<G> compare_func, out uint match_index)
• public Array<unowned G> copy ()
• public unowned G index (uint index)
• public void insert_val (uint index, owned G value)
• public void insert_vals (uint index, void* data, uint len)
• public void prepend_val (owned G value)
• public void prepend_vals (void* data, uint len)
• public G remove_index (uint index)
• public G remove_index_fast (uint index)
• public G[] remove_range (uint index, uint length)
• public void set_clear_func (DestroyNotify clear_func)
• public void set_size (uint length)
• public void sort (CompareFunc<G> compare_func)
• public void sort_with_data (CompareDataFunc<G> compare_func)
• public G[] steal ()

Fields:

• public G[] data
• public uint length