There are 0 repository under open-addressing topic.
Templated type-safe hashmap implementation in C using open addressing and linear probing for collision resolution.
Faster.Map — A blazing-fast, memory-efficient HashMap library for .NET. Featuring SIMD-optimized DenseMap, lock-free CMap, and high-performance BlitzMap implementations designed for extreme speed, scalability, and low memory overhead. Ideal for real-time systems, caching engines, and high-density data workloads.
A collection of std-like containers written in C++11. Features fast unordered flat map/set, configurable double-ended vector and sparse deque.
Comparison of Hashing Algorithms - Double Hashing, Robin Hood Hashing Cuckoo Hashing with Java's inbuilt HashMap/ HastSet over million of add(), contains() and remove() operations.
Data structures and algorithms implementation in pure C#!
Yet another efficient hashmap implementation for Golang based on the hopscotch open addressing scheme.
C Program For Open Address Collision
Implementing Hash-Table Lexicon using open-addressing and quadratic probing.
The project on comparison of different hashing approaches
This repository contains all the data structures and their application in Java.
Hash-Table implementation using Python. (Chaining, Open Addressing & Resizing)
In this project, I used CSV module to implement CRUD operations on CSV file using Python Programming Language. The CSV file has over 400,000 records of phone numbers. Searching them linearly may cause a lot of time. Therefore, I used Hash Table to search phone numbers in O(1).
Hash Table implementation using Open addressing & Linear probing.
CS 261 Data Structures portfolio assignment: Hashmap using open addressing & chaining
C implementation of a hash table with open addressing, double hashing, prime-sized buckets, and automatic resizing.
🚀 C-based hashmap with 🔑 char* keys and 🔢 integer values. Supports setting/getting values, deletion, and auto-resizing.
🌳 A subtree occurrence finder implemented with an Open Addressing Hash Table in C.
Two HashMap implementations: 1) Separate chaining with singly linked lists; 2) Open addressing with quadratic probing
A Data-Structure project that aims to count the occurrences of various strings, using a hashtable in which the collisions are handled with linear probing.
Implementation of Hashing with collision handling, utilizing Chaining, Linear Probing, Quadratic Probing and Double Hashing.
A fast Robin Hood hash table library in C
Hash table implementation in c (Detailed comments on operation)
A simple open-addressing hash table with friendly user interface.
Hashing Algorithms in C++
Implementation of hash table with Rust. Using open addressing for handling collision and djb2 as the hash function.
Java project implementing various hashing techniques .
Educational Java implementations of core data structures and algorithms (sorting, hashing, hash tables) with step-by-step console visualizations.