Alternatives and similar repositories for pdstl:

Users that are interested in pdstl are comparing it to the libraries listed below

• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• lemire / costofsafety
  Quick experiment to see how expensive safety is in C, for research
  ☆12Updated 5 years ago
• ronmrdechai / Pie
  Provide an idiomatic C++ interface to CPython's C API.
  ☆27Updated 7 years ago
• cruppstahl / sparsemap
  A sparse and compressed bitmap library.
  ☆11Updated 10 years ago
• google-research / automemcpy
  ☆20Updated 2 years ago
• dlbeer / libdlb
  Intrusive data structures and asynchronous IO library
  ☆19Updated 4 years ago
• piperchester / cpp-btree
  Optimized for systems that read and write large blobs.
  ☆12Updated 9 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆46Updated 8 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 8 years ago
• sillycross / mlpds
  MlpIndex - Extremely fast ordered index via memory level parallelism
  ☆12Updated 5 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• jamboree / niji
  Generic 2D graphics library for C++14
  ☆28Updated 3 weeks ago
• scandum / octosort
  Octosort is an in-place stable adaptive block merge sort.
  ☆18Updated 2 years ago
• Keith-Cancel / k-hashv
  A vectorized single header hash function.
  ☆19Updated 3 months ago
• max0x7ba / parse-integers-benchmark
  Benchmarking reading and parsing integers from a file in C++.
  ☆9Updated 4 years ago
• KWillets / range_generator
  Some variations on Lemire's Fast Random Integer Generation in an Interval
  ☆15Updated 5 years ago
• willemt / splay-tree
  A splaytree ADT written in C with a BSD license
  ☆17Updated 4 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• hostilefork / nocycle
  Directed Acyclic Graph For C++ With Cached Transitive Closure
  ☆28Updated 5 years ago
• vteromero / VTEnc
  VTEnc C library
  ☆37Updated 2 years ago
• giucamp / density
  C++ heterogeneous and lock-free containers
  ☆13Updated 6 years ago
• ldionne / cppnow-2015-hana
  Presentation on Hana for C++Now 2015
  ☆10Updated 6 years ago
• xant / libiomux
  iomux - High performance aynchronous I/O multiplexing and timers
  ☆14Updated 9 years ago
• jakogut / tinybloom
  A small, simple, easy to use bloom filter written in C.
  ☆35Updated 13 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆51Updated last year
• t3rm1n4l / lightkv
  A light weight, low level embedded key-value database library
  ☆32Updated 11 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated last year
• robertsdotpm / h.h
  Multi-platform, single-file, header-only, C / C++11 include for bootstrapping new projects.
  ☆14Updated 4 years ago