WojciechMula / parsing-int-series
Parse multiple decimal integers separated by arbitrary number of delimiters
☆32Updated 7 months ago
Related projects: ⓘ
- Quick 'n' Dirty benchmarks for various integer parsing methods in C++☆40Updated 4 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆56Updated 5 years ago
- Create man pages from information used by Intel Intrinsics Guide and optionally uops.info☆42Updated 2 years ago
- String to Float Benchmark☆19Updated 5 years ago
- Collection of C++ containers extracted from LLVM☆26Updated 3 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆47Updated 3 years ago
- Quick sort code using AVX2 instructions☆67Updated 7 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆35Updated 4 years ago
- A collection of formatting benchmarks☆43Updated last month
- C++20 SIMD Within A Register library☆18Updated 3 weeks ago
- SIMDized check which bytes are in a set☆27Updated 5 years ago
- Methods and Benchmarks for Random Numbers in a Range☆32Updated 6 years ago
- Fast Hash Functions Using AES Intrinsics☆79Updated 5 years ago
- Reproducible experimeents on UTF-8 validation using SIMD instructions☆40Updated 3 weeks ago
- C++17 sports two low-level character conversion functions, std::from_chars and std::to_chars, but they have a usage model that can be ea…☆8Updated 5 years ago
- A hash function library☆20Updated 2 months ago
- performance experiments for C++ exception handling☆29Updated 2 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated 10 months ago
- A performant, parallel, probabilistic, random acyclic-graph, low-latency, perfect hash generation library.☆65Updated last week
- A benchmark for cache efficient data structures.☆28Updated 5 years ago
- O(n log n) In-place Stable Quicksort☆13Updated last month
- C++ interface to CPU affinity management☆30Updated 6 years ago
- Sequence data structure with efficient random access insert and erase☆13Updated last year
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆30Updated 7 years ago
- Bitset Sort, a faster std::sort replacement.☆77Updated 2 years ago
- For details, see the blog post:☆31Updated 9 months ago
- A small DFA for under 16 states☆52Updated 6 years ago
- World's fastest integer to ASCII conversion, C++14 template meta-programming implementation, any size integer 8,16,32,64-bit, signed or u…☆27Updated 8 years ago
- ☆104Updated 7 months ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆15Updated 9 years ago