GLib Reference Manual
GLib Data Types
Table of Contents
- efficient way to allocate groups of equal-sized chunks of memory.
- linked lists containing integer values or pointers to data, with the ability to iterate over the list in both directions.
- linked lists containing integer values or pointers to data, limited to iterating over the list in one direction.
- double-ended queue data structure.
- maintain a stack of unused allocated memory chunks.
- associations between keys and values so that given a key the value can be found quickly.
- text buffers which grow automatically as text is added.
- efficient storage of groups of strings.
- arrays of arbitrary elements which grow automatically as elements are added.
- arrays of pointers to any type of data, which grow automatically as new elements are added.
- arrays of bytes, which grow automatically as elements are added.
Balanced Binary Trees
- a sorted collection of key/value pairs optimized for searching and traversing in order.
- trees of data with any number of branches.
- a 2-way association between a string and a unique integer identifier.
Keyed Data Lists
- lists of data elements which are accessible by a string or GQuark identifier.
- associate groups of data elements with particular memory locations.
Relations and Tuples
- tables of data which can be indexed on any number of fields.
- caches allow sharing of complex data structures to save resources.
- allocates chunks of memory for GList, GSList and GNode.
<< Windows Compatibility Functions
Memory Chunks >>