Count kmers with a more efficient (faster) hash table
-
Updated
Jun 8, 2024 - C++
Count kmers with a more efficient (faster) hash table
Leetcode problem solutions 🗳️
C++ implementation of a fast hash map and hash set using hopscotch hashing
A thread-safe hash map implementation in C++ with support for concurrent read and write operations.
DSA Practice with C++ using GeeksforGeeks and Leetcode Questions
C++ template containers with optimized memory consumption
C++ implementation of a fast hash map and hash set using robin hood hashing
A comprehensive C++ library for efficient data management using hash tables. Features customizable hashing, collision resolution.
🛄 Sets, hashtables, arrays and more - written in C
discrete_map: A STL-compliant, fully customisable hash map with decoupled keys and values
Tool to build/maintain hash-map of source file/dev/image blocks and incrementally sync those with least reads/writes
Very fast, high-quality hash function, discrete-incremental and streamed hashing-capable (non-cryptographic, inline C/C++) 26GB/s + PRNG
C++ hash map and hash set which preserve the order of insertion
C++ implementation of a memory efficient hash map and hash set
C++ implementation of a fast and memory efficient hash map and hash set specialized for strings
Алгоритмы и структуры данных
Everything I need to know to get the better job.
An efficient hash table implementation in written Rust
Add a description, image, and links to the hash-map topic page so that developers can more easily learn about it.
To associate your repository with the hash-map topic, visit your repo's landing page and select "manage topics."