smart-tool / smart
String Matching Algorithms Research Tool
☆99Updated 9 months ago
Alternatives and similar repositories for smart:
Users that are interested in smart are comparing it to the libraries listed below
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 7 years ago
- A fast alternative to the modulo reduction☆306Updated 3 years ago
- Succinct data structures in C/C++☆83Updated 3 months ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Robin Hood hash map library☆60Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆51Updated 7 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆131Updated 5 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- Automatically exported from code.google.com/p/libhhash☆32Updated 9 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- MergedTrie code☆12Updated 5 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆154Updated last week
- Header-only binary fuse and xor filter library☆357Updated this week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C library implementing the ridiculously fast CLHash hashing function☆270Updated 9 months ago
- Hashing functions and PRNGs based on them☆155Updated this week
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆87Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 8 months ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Fastest Histogram Construction☆68Updated 3 years ago
- C library to remove white space from strings as fast as possible☆152Updated 4 months ago
- For details, see the blog post:☆32Updated last year
- Fast Approximate Membership Filters (C++)☆273Updated last month
- A benchmark for sorting algorithms☆59Updated 3 years ago