libFirm
 All Data Structures Functions Variables Typedefs Enumerations Enumerator Groups Pages
Abstract Data Structures

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

Modules

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

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.