2 Mar 00 - 18 Oct 14
GLib Reference Manual
Table of Contents
— standard GLib types, defined for ease-of-use and portability.
Limits of Basic Types
— portable method of determining the limits of the standard types.
— commonly-used macros.
Type Conversion Macros
— a portable method for storing
Byte Order Macros
— a portable way to convert between different byte orders.
— specialised macros which are not used often.
GLib Core Application Support
The Main Event Loop
— manages all available sources of events.
— thread abstraction; including mutexes, conditions and thread private data.
Dynamic Loading of Modules
— portable method for dynamically loading 'plug-ins'.
— general memory-handling.
— portable support for using files, pipes and sockets.
Message Output and Debugging Functions
— functions to output messages and help debug applications.
— versatile support for logging messages with different levels of importance.
String Utility Functions
— various string-related functions.
Date and Time Functions
— calendrical calculations and miscellaneous time stuff.
— support for manipulating lists of hook functions.
Miscellaneous Utility Functions
— a selection of portable utility functions.
— a general purpose lexical scanner.
Automatic String Completion
— support for automatic completion using a group of target strings.
— functions to time operations.
Windows Compatability Functions
— functions to support portability to the Windows environment.
GLib Data Types
— 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.
— 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 optimised 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
— associate groups of data elements with particular memory locations.
Relations and Tuples
— tables of data which can be indexed on any number of fields.
— allows sharing of complex data structures to save resources.
— allocates chunks of memory for
Next Page >>>