Alternatives and similar repositories for Enhanced-Suffix-Arrays:

Users that are interested in Enhanced-Suffix-Arrays are comparing it to the libraries listed below

• queertypes / boost-bloom-filters
  A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.
  ☆23Updated 7 years ago
• lantiga / tinydnnc
  ☆11Updated 8 years ago
• arminkz / InvertedIndexSearchEngine
  Simple C++/Qt Project for Searching in text files using BST / TST / Trie / Hash Data Structures.
  ☆11Updated 8 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• krareT / terark-hashmap
  A very fast and small(memory efficient) hash map
  ☆7Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 6 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• ronmrdechai / Pie
  Provide an idiomatic C++ interface to CPython's C API.
  ☆27Updated 7 years ago
• google / refr
  A framework for building reranking models.
  ☆28Updated 9 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• maciekgajewski / coroutines
  Go-style coroutines and channels for C++
  ☆33Updated 11 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 8 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 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
• jianingy / libtrie
  An Implementation of Two-Trie and Tail-Trie using Double Array
  ☆21Updated 12 years ago
• abique / melon
  M:N fiber implementation, with transparent IO reactor and timeouts, POSIX like APIs.
  ☆16Updated 12 years ago
• abique / mimosa
  My personal C++ framework :^)
  ☆42Updated last year
• jamboree / act
  ASIO Cooperative Task for await-based coroutine
  ☆16Updated 6 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆18Updated 10 years ago
• matovitch / cosche
  A dependency-based coroutine scheduler
  ☆46Updated 8 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆73Updated 7 years ago
• chapuni / llvm
  Chapuni's branch based on http://llvm.org/git/llvm.git
  ☆28Updated 9 years ago
• pcarrier / cdb64
  Format-incompatible 64-bit version of cdb (no 4GB limit)
  ☆14Updated 11 years ago
• abhishekkr / goshare
  Go Share your TimeSeries/NameSpace/KeyVal DataStore (using leveldb) over HTTP &/or ZeroMQ
  ☆61Updated 9 years ago
• erenon / pipeline
  Pipeline implementation based on n3534
  ☆20Updated 10 years ago