| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Implementing HASH node `remove_key` function | Katharina Fey | 2019-07-14 | 1 | -1/+4 |
| | | |||||
| * | Adding initial support for HASH nodes | Katharina Fey | 2019-07-13 | 1 | -8/+11 |
| | | | | | | | | | | | | | | | | | This PR adds initial support for HASH data nodes in libbowl. This allows a performant key-value store lookup in a node tree. The hashing code implements the "murmur" hash, which has shown good performance over at [`libcuckoo`]. Currently there is no extended hashing strategy, which should definitely be changed. [`libcuckoo`]: https://github.com/qaul/libcuckoo (currently a collision will cause a recursive re-alloc) Some of the type-level hacks also begs the question if a PAIR data node might be warranted, even though it would break the simple design around bowl->data. | ||||
| * | Restructuring the main API and project | Katharina Fey | 2019-06-09 | 1 | -347/+66 |
| | | | | | | | | | | This commit rewrites pretty much the entire library. It is now much smaller and more maintainable (split over multiple files). It will now also support more features (that aren't implemented yet). Adding two examples to show how to use the new API. Also changing the name of the library everywhere. | ||||
| * | Changing library name and project structure | Katharina Fey | 2019-06-04 | 1 | -0/+378 |
 |
index : libbowl | |
| A versatile C datastructure library | Katharina Fey |
| aboutsummaryrefslogtreecommitdiff |