Alternatives and similar repositories for malloc_count

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

• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆348Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆266Updated 2 weeks ago
• ekg / intervaltree
  a minimal C++ interval tree implementation
  ☆230Updated 4 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆32Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆426Updated 3 months ago
• mavam / libbf
  Bloom filters for C++11
  ☆362Updated 3 years ago
• PatwinchIR / ultra-sort
  DSL for SIMD Sorting on AVX2 & AVX512
  ☆31Updated 6 years ago
• david-grs / geiger
  C++ micro benchmark library
  ☆97Updated 8 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆16Updated 11 years ago
• bonitao / cmph
  ☆20Updated 3 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆234Updated 2 months ago
• noporpoise / BitArray
  C bit array structs and methods
  ☆211Updated 3 years ago
• aguinet / pector
  A C++11 std::vector-compliant implementation with a customizable size type and growing algorithm
  ☆68Updated 10 years ago
• tudordavid / libslock
  Cross-platform atomic operations and lock algorithm library
  ☆98Updated 6 years ago
• alasdairmackintosh / google-concurrency-library
  Automatically exported from code.google.com/p/google-concurrency-library
  ☆35Updated 9 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆110Updated 7 months ago
• lemire / fastmod
  A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.
  ☆323Updated 8 months ago
• stxxl / stxxl
  STXXL: Standard Template Library for Extra Large Data Sets
  ☆491Updated last year
• GorNishanov / await
  ☆127Updated 2 years ago
• lakshayg / google_benchmark_plot
  A handy script to visualize google benchmark output
  ☆56Updated 2 years ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆17Updated 4 years ago
• rchikhi / benchmphf
  Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)
  ☆13Updated 8 years ago
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆45Updated 5 years ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆163Updated 6 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆281Updated 7 months ago
• tlx / tlx
  TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers
  ☆417Updated 6 months ago
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆346Updated last year
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆386Updated 5 years ago