Structs§
- Generic
Error - RaxIterator
- RaxMap
- Redis has a beautiful Radix Tree implementation in ANSI C. This brings it to Rust and creates a safe Map like wrapper for it. This is very similar in utility to a BTreeMap, but RAX is likely much faster and more efficient. Naive testing showed a 2x-4x improvement for all common operations. The only disadvantage to BTreeMap is that BTree’s allow much more flexibility in regards to comparing keys. Radix trees are lexicographically only. Composite keys where the non-last member is variable length could be something BTrees could handle much easier.
- RaxSet
- RaxMap but without the values. The “isnull” bit will be set for all entries. #Examples
- rax
- raxIterator
- raxNode
- raxStack
Enums§
Constants§
- BEGIN
- END
- EQUAL
- GREATER
- GREATER_
EQUAL - LESSER
- LESSER_
EQUAL - RAX_
ITER_ EOF - RAX_
ITER_ JUST_ SEEKED - RAX_
ITER_ SAFE - RAX_
ITER_ STATIC_ LEN - RAX_
NODE_ MAX_ SIZE - RAX_
STACK_ STATIC_ ITEMS
Statics§
Traits§
Functions§
- allocator⚠
- Return the existing Rax allocator.
- raxCompare⚠
- raxEOF⚠
- raxFind⚠
- raxFree⚠
- raxFree
With ⚠Callback - raxInsert⚠
- raxIterator
New ⚠ - raxIterator
Size ⚠ - raxNew⚠
- raxNext⚠
- raxPrev⚠
- raxRandom
Walk ⚠ - raxRemove⚠
- raxSeek⚠
- raxShow⚠
- raxSize⚠
- raxStart⚠
- raxStop⚠
- raxTry
Insert ⚠ - set_
allocator ⚠ - Rax internally makes calls to “malloc”, “realloc” and “free” for all of it’s heap memory needs. These calls can be patched with the supplied hooks. Do not call this method after Rax has been used at all. This must be called before using or calling any other Rax API function.