| .. |
|
BAVL.h
|
34317a2a39
structure: BAVL: rename BAVL_DEBUG to BAVL_AUTO_VERIFY
|
13 rokov pred |
|
BHeap.h
|
0d99d6a26a
switch to using the New BSD License
|
14 rokov pred |
|
CAvl.h
|
a5aa5517ab
structure: add CAvl, a very generic and embeddable AVL tree
|
13 rokov pred |
|
CAvl_decl.h
|
c14d248662
structure: CAvl: add option to not have lookup operations
|
13 rokov pred |
|
CAvl_footer.h
|
c14d248662
structure: CAvl: add option to not have lookup operations
|
13 rokov pred |
|
CAvl_header.h
|
c14d248662
structure: CAvl: add option to not have lookup operations
|
13 rokov pred |
|
CAvl_impl.h
|
48ce9a8148
structure: CAvl: rename CAVL_PARAM_VERIFY to CAVL_AUTO_VERIFY, because it's meant to be used globally rather than as
|
13 rokov pred |
|
CHash.h
|
7e67cc16e2
structure: add CHash, a generic hash table implemented with the help of the C preprocessor
|
13 rokov pred |
|
CHash_decl.h
|
79f824fb65
structure: CHash: rework, remove unused features
|
13 rokov pred |
|
CHash_footer.h
|
d18f1246ea
structure: CHash: add option to indicate entry hashes can be obtained efficiently, and use this to speed up lookups.
|
13 rokov pred |
|
CHash_header.h
|
d18f1246ea
structure: CHash: add option to indicate entry hashes can be obtained efficiently, and use this to speed up lookups.
|
13 rokov pred |
|
CHash_impl.h
|
d18f1246ea
structure: CHash: add option to indicate entry hashes can be obtained efficiently, and use this to speed up lookups.
|
13 rokov pred |
|
CStringTrie.h
|
a3f8ed4d59
structure: add CStringTrie, which generalizes BStringTrie to allow specifying the value type, and specifying the number of significant
|
13 rokov pred |
|
CStringTrie_decl.h
|
a3f8ed4d59
structure: add CStringTrie, which generalizes BStringTrie to allow specifying the value type, and specifying the number of significant
|
13 rokov pred |
|
CStringTrie_footer.h
|
a3f8ed4d59
structure: add CStringTrie, which generalizes BStringTrie to allow specifying the value type, and specifying the number of significant
|
13 rokov pred |
|
CStringTrie_header.h
|
a3f8ed4d59
structure: add CStringTrie, which generalizes BStringTrie to allow specifying the value type, and specifying the number of significant
|
13 rokov pred |
|
CStringTrie_impl.h
|
a3f8ed4d59
structure: add CStringTrie, which generalizes BStringTrie to allow specifying the value type, and specifying the number of significant
|
13 rokov pred |
|
ChunkBuffer2.h
|
0d99d6a26a
switch to using the New BSD License
|
14 rokov pred |
|
IndexedList.h
|
e9e0285a80
structure: CAvl: cosmetic changes
|
13 rokov pred |
|
IndexedList_tree.h
|
c14d248662
structure: CAvl: add option to not have lookup operations
|
13 rokov pred |
|
LinkedList0.h
|
0d99d6a26a
switch to using the New BSD License
|
14 rokov pred |
|
LinkedList1.h
|
0d99d6a26a
switch to using the New BSD License
|
14 rokov pred |
|
LinkedList2.h
|
0d99d6a26a
switch to using the New BSD License
|
14 rokov pred |
|
LinkedList3.h
|
0d99d6a26a
switch to using the New BSD License
|
14 rokov pred |
|
SAvl.h
|
b4a52f1a7a
structure: add SAvl, a wrapper around CAvl assuming links are pointers
|
13 rokov pred |
|
SAvl_decl.h
|
b2ed2bb8d2
structure: SAvl: fix typo
|
13 rokov pred |
|
SAvl_footer.h
|
b4a52f1a7a
structure: add SAvl, a wrapper around CAvl assuming links are pointers
|
13 rokov pred |
|
SAvl_header.h
|
b4a52f1a7a
structure: add SAvl, a wrapper around CAvl assuming links are pointers
|
13 rokov pred |
|
SAvl_impl.h
|
68fcc72651
structure: SAvl: add count overflow assertion in Insert()
|
13 rokov pred |
|
SAvl_tree.h
|
b4a52f1a7a
structure: add SAvl, a wrapper around CAvl assuming links are pointers
|
13 rokov pred |
|
SLinkedList.h
|
9323a5e812
structure: add SLinkedList
|
13 rokov pred |
|
SLinkedList_decl.h
|
9323a5e812
structure: add SLinkedList
|
13 rokov pred |
|
SLinkedList_footer.h
|
9323a5e812
structure: add SLinkedList
|
13 rokov pred |
|
SLinkedList_header.h
|
9323a5e812
structure: add SLinkedList
|
13 rokov pred |
|
SLinkedList_impl.h
|
9323a5e812
structure: add SLinkedList
|
13 rokov pred |
ambrop7
ebb625af4f
structure: remove BStringTrie