LibCDS

Integration Test (Travis CI)

Objective

LibCDS implements several kinds of classic containers by C. It offers uniform APIs for convenient container interaction.

Container Category

API Reference Manual

• Tree
  • SimpleTree -- The basic binary search tree.
  • BalancedTree -- The balanced binary search tree implemented with red black tree.
• List
  • DLinkedList -- The doubly linked list.
• Array
  • Vector -- The dynamically growable array.
• Map
  • OrderedMap -- The key-value pair container leveraging balanced binary search tree.
• Heap
  • BinaryHeap -- The basic ordered heap.
  • BinomailHeap -- The advanced ordered heap.
• Queue
  • PriorityQueue -- The priority queue leveraging ordered heap.