GLib is a cross-platform utility library. It started life as part of the GTK+ project, but is now used by other applications. While it was originally a convenient library to collect low-level code in, it has since expanded into offering wrapper functions for functionality that is typically different across platforms. GLib is now the cross-platform component that makes applications portable across different operating systems. Initially created for the graphics program the GIMP, the GIMP Toolkit — abbreviated as GTK+ — is one of the two most popular widget toolkits for the X Window System, intended for creating graphical user interfaces. ...

Some features of GLib include:

• basic types and their limits
• standard macros
• type conversions
• byte order
• memory allocation
• warnings and assertions
• message logging
• timers
• string utilities
• hook functions
• a lexical scanner
• dynamic loading of modules
• threads
• pools
• automatic string completion.
• a type system, GType
• an object system, GObject

A number of data structures (and their related operations) are also defined, including: Macro (meaning large or wide) is also applied to macroeconomics, and macroscopic or macro lenses. ... This article needs to be cleaned up to conform to a higher standard of quality. ... Endianness generally refers to whichever of two arbitrary sequencing methods are used in a one-dimensional system (such as writing or computer memory). ... It has been suggested that this article or section be merged with Dynamic memory allocation. ... A timer is a specialized type of clock. ... A lexicon is a list of words together with additional word-specific information, i. ... A module is a self-contained component of a system, which has a well-defined interface to the other components; something is modular if it is constructed so as to facilitate easy assembly, flexible arrangement, and/or repair of the components. ... A thread in computer science is short for a thread of execution. ... Memory pools allow dynamic memory allocation comparable to malloc or the operator new in C++. As those implementations suffer from fragmentation because of variable block sizes, it can be impossible to use them in a real time system due to performance. ... A typical piece of GObject class initialization code. ... GObject is a library and framework which provides Object-oriented programming for the C programming language. ...

• memory chunks
• doubly-linked lists
• singly-linked lists
• hash tables
• strings (which can grow dynamically)
• string chunks (groups of strings)
• arrays (which can grow in size as elements are added)
• balanced binary trees
• N-ary trees
• quarks (a two-way association of a string and a unique integer identifier)
• keyed data lists (lists of data elements accessible by a string or integer id)
• relations and tuples (tables of data which can be indexed on any number of fields)
• caches.

In computer science, a linked list is one of the fundamental data structures used in computer programming. ... In computer science, a hash table is a data structure that speeds up searching for information by a particular aspect of that information, called a key. ... In computer programming, an array, also known as a vector or list, is one of the simplest data structures. ... In computer science, a binary tree is a tree data structure in which each node has at most two children. ... In mathematics, a tuple is a finite sequence of objects, that is, a list of a limited number of objects (an infinite sequence is a family). ... Cache algorithms are optimizing instructions â€“ algorithms â€“ that a computer program can follow to manage a cache of information stored on the computer. ...

External links

• GLib page in GTK+ documentation
• GLib API