OkCupid / sfsliteLinks
SFSlite C++ development libraries
☆54Updated 4 years ago
Alternatives and similar repositories for sfslite
Users that are interested in sfslite are comparing it to the libraries listed below
Sorting:
- Library containing high-performance datastructures and utilities for C++☆75Updated 8 years ago
- A dependency-based coroutine scheduler☆45Updated 9 years ago
- Code samples for using libjit☆91Updated 8 years ago
- A library for Rapid {C|Concurrency|Correct} Development☆34Updated 10 years ago
- fast SIMD-able JIT regular expression compiler☆197Updated 10 years ago
- generate perfect hashes (alpha)☆79Updated 3 years ago
- RIBS (Robust Infrastructure for Backend Systems) version 2☆130Updated 6 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- C++ extensions for readable event-driven programming☆27Updated 2 years ago
- A C++ library for concurrent programming☆71Updated 4 years ago
- multi-way atomic compare-and-swap with x64/TSX☆85Updated 8 years ago
- The OK Web Server☆264Updated 4 years ago
- C based ordered key-value ACID DB using a skip list data structure☆164Updated 10 years ago
- Distributed search engine in C++14, using nanomsg for communication, bond for serialization.☆67Updated 10 years ago
- A threaded, continuations-based I/O event library for manycore NUMA machines☆76Updated 4 years ago
- Hash Array Mapped Trie (C++ Templates)☆125Updated 2 years ago
- libpaxos-cpp is a C++ implementation of the Paxos distributed consensus protocol☆67Updated 12 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated 11 months ago
- Legacy repo, migrated to cheerp-compiler monorepo☆183Updated 4 years ago
- STM (Software Transactional Memory) implementation in C, based on memory-mapping.☆60Updated 16 years ago
- A C implementation of a dynamically resizeable binary SHA-256 hash tree (Merkle Tree).☆137Updated 10 years ago
- Compiler intermediate language for static analysis.☆107Updated 7 years ago
- Raft implementation based on libcppa☆21Updated 10 years ago
- Generates benchmark data for two different data structures, then renders some graphs.☆112Updated 6 years ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆276Updated 4 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- IncludeOS C++ Web Application Framework☆71Updated 6 years ago
- No sane compiler would optimize atomics: the presentation☆108Updated 9 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- The world's first Web-scale memory allocator☆109Updated 7 years ago