| ▼Cscire::AContainer< Type, SzType > | Container Inferface |
| ▼Cscire::AQueue< Type, SzType > | A Queue should support Enque(), Deque() and Front() operations |
| Cscire::Queue< Type, SzType > | Linked List implementation of Queue |
| Cscire::QueueCrate< Type, SzType > | Array implementation of Queue |
| ▼Cscire::AStack< Type, SzType > | Standard stack abstraction (Push, Pop, Top) |
| Cscire::Stack< Type, SzType > | Linked list implementation of stack |
| Cscire::StackCrate< Type, SzType > | Array implementation of stack |
| Cscire::SinglyList< Type, SzType > | A Singly Linked List class |
| Cscire::Actor< type > | |
| Cscire::BinaryTree< Type > | |
| Cscire::CharStringUtil | |
| Cscire::ClassName | |
| Cscire::CountingSort< InT, SzT > | |
| Cscire::FileType | |
| Cscire::GaleShapley | |
| Cscire::Hash | Static utility routines for hash algorithms |
| ▼Cscire::ICrate< Type, SzType > | Crate contains elements in an arrays |
| Cscire::QueueCrate< Type, SzType > | Array implementation of Queue |
| Cscire::StackCrate< Type, SzType > | Array implementation of stack |
| ▼Cscire::IHashAlgo< SzType, Ui32t, ByteT, SByteT > | Common interface for Hash Algorithms |
| Cscire::MD5< SzType, Ui32t, ByteT, SByteT > | MD5 Message-Digest Algorithm |
| Cscire::SinglyList< Type, SzType >::Node | Represent an item node in Singly Linked List |
| Cscire::StringMatchKMP< CharType, SzType > | The Knuth-Morris-Pratt (KMP) algorithm for string-matching problem |
| Cscire::UnionFind< type > | |
1.8.7 
