smart-tool / smartLinks
String Matching Algorithms Research Tool
☆106Updated last year
Alternatives and similar repositories for smart
Users that are interested in smart are comparing it to the libraries listed below
Sorting:
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- C library to remove white space from strings as fast as possible☆155Updated last year
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Testing common random-number generators (RNG)☆189Updated 2 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆158Updated last month
- A simple bitset library in C☆137Updated 7 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- C library implementing the ridiculously fast CLHash hashing function☆280Updated last year
- A fast alternative to the modulo reduction☆312Updated 4 years ago
- SIMD (SWAR/SSE/SSE4/AVX2/AVX512F/ARM Neon) of Karp-Rabin algorithm's modification☆261Updated 3 years ago
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆204Updated 5 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆220Updated 3 weeks ago
- A fast SIMD parser for CSV files☆156Updated 3 years ago
- Compile-time TRIE based string matcher (C++11)☆52Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆135Updated 6 years ago
- How fast can we shuffle values?☆38Updated last year
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- ☆39Updated 4 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 months ago
- For details, see the blog post:☆33Updated last year
- Different algorithms for converting binary to decimal floating-point numbers☆124Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Fast and Reliable (but not Secure) Hash☆54Updated 7 years ago
- Storage for my snippets, toy programs, etc.☆366Updated 6 months ago