 | Level: Intermediate Tom Copeland (tom@infoether.com), Developer, InfoEther
27 Jun 2005 In this tutorial, learn how to use the GLib collection data structures to effectively manage data within C programs. In particular, you'll see how to use GLib's built-in data structures/containers -- linked lists, hash tables, arrays, trees, queues, and relations -- to fill the need for them in C.
In this tutorial
- Organizing data
- Singly- and doubly-linked lists
- Hash tables, arrays, trees, queues, and relations
Objectives
This tutorial shows you how to use the GLib collections to manage data efficiently and elegantly within your C programs. The GLib collections are the result of many years of refinement and are used by numerous open source programs. These collections provide the more complex data structures/containers (the functions and variables you need to manage data) that are in short supply in the C language.
Prerequisites
This tutorial is written for Linux or UNIX programmers whose skills and experience are at a beginning to intermediate level. You should have a general familiarity with using a UNIX command-line shell.
System requirements
To get the most out of this tutorial and its follow-along examples, you need:
- Basic programming tools to compile the source code examples, such as a compiler like GCC
- The GLib runtime and development libraries installed (most modern Linux distributions come with the GLib runtime installed)
Duration
More than two hours
Formats html, pdf
| | | |
