hadeaninc / libzinc

Related projects: ⓘ

• gerben-s / quicksort-blog-post
  ☆39Updated 3 years ago
• pramalhe / CX
  A Wait-Free Universal Construct for Large Objects
  ☆95Updated 4 years ago
• LiveAsynchronousVisualizedArchitecture / lava
  Live Asynchronous Visualized Architecture
  ☆93Updated 5 years ago
• celtera / ahsohtoa
  Structure-of-array synthesis in C++20
  ☆78Updated 2 years ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆79Updated 5 years ago
• keur / virtual_vec
  ☆32Updated 3 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆114Updated 4 months ago
• johnmcfarlane / SG14
  A library for Study Group 14 of Working Group 21 (C++)
  ☆35Updated 6 years ago
• skarupke / heap
  Looking into the performance of heaps, starting with the Min-Max Heap
  ☆62Updated 3 years ago
• backtrace-labs / dynamic_flag
  A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case
  ☆69Updated last year
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆37Updated 6 months ago
• patrykstefanski / libfev
  A library for events and fibers
  ☆35Updated 3 years ago
• drti / drti
  Dynamic runtime inlining with LLVM
  ☆65Updated 3 years ago
• RedBedHed / blipsort
  Branchless-Lomuto in Pattern-Defeating Quicksort
  ☆47Updated 2 months ago
• eloraiby / tcpm
  Tiny Cooperative Process Management Library/Embedded Bounded Queue Actor Model (C11)
  ☆40Updated 5 years ago
• jwtowner / lug
  C++ embedded domain specific language for expressing parsers as extended parsing expression grammars (PEGs)
  ☆68Updated last month
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆80Updated 8 months ago
• mikekazakov / eytzinger
  Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++
  ☆30Updated 7 years ago
• waywardgeek / datadraw
  ☆40Updated last year
• joaquintides / transrangers
  An efficient, composable design pattern for range processing
  ☆106Updated 3 years ago
• orlp / devector
  Resizable contiguous sequence container with fast appends on either end.
  ☆37Updated 7 years ago
• damageboy / vxsort-cpp
  My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)
  ☆30Updated 10 months ago
• michaeljclark / ethical_hashmap
  Fast open addressing hash table
  ☆41Updated 9 months ago
• backtrace-labs / poireau
  Poireau: a sampling allocation debugger
  ☆86Updated 2 years ago
• philsquared / hash_trie
  A persistent hash array-mapped trie for C++
  ☆90Updated last year
• senderista / hashtable-benchmarks
  An Evaluation of Linear Probing Hashtable Algorithms
  ☆29Updated 9 months ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆77Updated 2 years ago
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆57Updated 3 years ago
• naskitis / Efficient-Data-Structures-for-Cache-Architectures
  My PhD thesis, provided for your online reading. Learn how to code high-performance string data structures and data management algorithms…
  ☆66Updated 7 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆16Updated 5 years ago