simait / TinyTimber
TinyTimber is a C implementation of the concurrent reactive objects of Timber. For more information about the full Timber language, see:
☆12Updated 12 years ago
Alternatives and similar repositories for TinyTimber:
Users that are interested in TinyTimber are comparing it to the libraries listed below
- BabbleSim base/common components. Any BabbleSim user will want some of these.☆14Updated last week
- finding set bits in large bitmaps☆15Updated 9 years ago
- Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.☆13Updated 11 years ago
- A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs☆13Updated 7 years ago
- Implementation of Alexander A. Stepanov inverted Index Compression algorithms☆21Updated 9 years ago
- Optimising Compiler for Lua and its derivatives☆8Updated 8 years ago
- RLU resizable hash-table☆16Updated 9 years ago
- A small little tool for dumping a floating-point number in its native format☆55Updated 9 years ago
- Useful macros for debugging purposes.☆16Updated 10 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64☆10Updated 4 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- Multiplying... backward?☆13Updated 4 years ago
- A splaytree ADT written in C with a BSD license☆17Updated 4 years ago
- Counting the collisions with perl hash tables per function☆12Updated 5 years ago
- Implements a Min-Heap / Priority Queue in C using an indirection table for memory efficiency.☆28Updated 10 years ago
- Quick experiment to see how expensive safety is in C, for research☆12Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- A library to support streaming data applications☆24Updated 3 years ago
- Intrusive data structures and asynchronous IO library☆19Updated 4 years ago
- Some variations on Lemire's Fast Random Integer Generation in an Interval☆15Updated 5 years ago
- Durable dead simple queue that allows zero copy semantics. Durable under failure!☆18Updated 9 years ago
- Backtrace.io's resilient log record framing format☆37Updated 3 years ago
- An implementation of Tarjan's Strongly Connected Components algorithm☆13Updated 5 years ago
- LuaJIT General Purpose Routines☆15Updated 4 years ago
- A sparse and compressed bitmap library.☆11Updated 10 years ago
- ☆13Updated 3 years ago