Difference between revisions of "Glib"
Jump to navigation
Jump to search
Line 5: | Line 5: | ||
* {{C}} | * {{C}} | ||
− | * {{ | + | * {{GNOME}} |
Latest revision as of 13:39, 15 April 2023
GLib provides advanced data structures, such as memory chunks, doubly and singly linked lists, hash tables, dynamic strings and string utilities, such as a lexical scanner, string chunks (groups of strings), dynamic arrays, balanced binary trees, N-ary trees, quarks (a two-way association of a string and a unique integer identifier), keyed data lists, relations, and tuples
Advertising: