libFirm
Abstract Data Structures

This module contains abstract datatypes like lists and hashmaps. More...

Modules

 Arrays
 Linked Lists
 Doubly linked lists.
 Double Ended Queue
 Implementation if a double ended queue datastructure for generic pointers.
 Pointer Map
 Pointer->Pointer hashmap.
 Priority Queue
 A priority queue.
 Pointer Set
 (Hash)sets containing pointers.
 Generic Hashset
 Generic Hashset.
 Union-Find
 Union-Find datastructure.
 Memory Allocation

Detailed Description

This module contains abstract datatypes like lists and hashmaps.

They're provided as a convenience, the firm API is fully functionaly without them so you can just as well use a library like glib and libapr or write your own.