rekola / radix-cpp Goto Github PK
View Code? Open in Web Editor NEWRadix set/map implementation
License: MIT License
Radix set/map implementation
License: MIT License
Either leave tomb stones or move other nodes
It assumes size_t is 64 bit
Or total value count
They should be compared as bits, not as floating point types, since floating point comparison is not literal (e.g. 0.0 == -0.0)
Different possibilities:
This way all the work can be moved to create_nodes_for_key() from emplace() or insert_or_assign().
A. Ignore broken branches and just go to forward
B. Check if the branches are needed and mark them deleted if not
Fix the iterator
This way we can simplify collision handling to only increment the node pointer, check for sentinel, and loop if necessary
It should also be done before evaluation.
As in Swiss Tables
It should be a part of the prefix key since strings, for example, already know their depth
Add it to combined field
Ordinal, prefix and key should be all readable from Node.
A. ordinal and prefix in Node: key read as append(prefix, ordinal)
B. ordinal and key in Node: prefix read as prefix(key)
C. prefix and key in Node: ordinal read as top(key)
D. prefix, key and ordinal in node
For 64bit: xxHash64, City64, Farm64 or SpookyV2-64
For 32bit: xxHash32, City32, Farm32
It can be deduced from the presence of valkey
The pointer could point to either Node or value_type (since iterators can only temporarily point to non-final nodes). If the pointer points to Node, at least offset can be left out. If the pointer points to value_type, everything can be left out, since they can be recostructed from value_type.
What if the original key gets erased?
Normally next direction is forward, but if current Node is final but also has children, the next direction. This may not be possible, since if new node is added, the direction can change.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.