What are the main features of jamesroutley/write-a-hash-table?

The main features of jamesroutley/write-a-hash-table are: Computer Science Fundamentals, Open Addressing Implementations, Hash Tables, Hash Table Operations, Key-Value Stores, Linear Probing Sequences, Index Mapping Functions, Key Deletion Operations.

What are some open-source alternatives to jamesroutley/write-a-hash-table?

Open-source alternatives to jamesroutley/write-a-hash-table include: trekhleb/javascript-algorithms — This repository is a comprehensive collection of data structures and algorithms implemented in JavaScript, designed… kezhenxu94/cache-lite — An extremely lite-weight cache framework in Kotlin, demonstrating how cache works. ronami/minipack — 📦 A simplified example of a modern module bundler written in JavaScript. leandromoreira/cdn-up-and-running — This project is a content delivery network implementation that uses a web server and scripting language to cache… g-plane/tiny-package-manager — Learn how npm or Yarn v1 works. gyoogle/tech-interview-for-developer — This project is a comprehensive technical interview preparation resource and computer science interview guide. It…

Write A Hash Table - build a hash table in C

Name: jamesroutley/write-a-hash-table
Author: jamesroutley

Write A Hash Table

This project is a pedagogical implementation of a hash table in C, built from scratch using open addressing and linear probing for collision resolution. It serves as a computer science algorithm demo, demonstrating how to construct a fundamental key-value store at a low level.

The implementation covers the core operations of an associative array: inserting a key-value pair, looking up a value by its key, and deleting a pair. It uses a hash function to compute storage locations, maps hash values to array indices with the modulo operator, and resolves collisions by scanning sequentially through a contiguous memory block for the next available slot.

The project walks through building an open-addressed hash map that stores all key-value pairs directly in a single, pre-allocated array, rejecting duplicate keys on insert and doing nothing when attempting to delete a non-existent key.

Features

Computer Science Fundamentals - A pedagogical implementation of a fundamental hash table algorithm for educational purposes.
Open Addressing Implementations - Stores all key-value pairs directly in a contiguous array, using probing to resolve collisions.
Hash Tables - Walks through building an open-addressed, double-hashed hash table from scratch in C.
Hash Table Operations - Implements insert, search, and delete operations for associative pairs in a hash table.
Key-Value Stores - A low-level implementation of key-value pair storage, retrieval, and deletion using hash functions.
Linear Probing Sequences - Resolves hash collisions by scanning sequentially through the array for the next available slot.
Index Mapping Functions - Maps hash values to array indices using the modulo operator for in-bounds storage.
Key Deletion Operations - Removes a key-value pair from an associative array by its key, doing nothing if the key does not exist.
Key Insertion Operations - Inserts a key-value pair into an associative array, rejecting duplicate keys.
Key Lookup Operations - Retrieves the value associated with a given key from an associative array, returning null if the key is absent.
Core Systems and Utilities - Building a fundamental data structure to understand memory and collision handling.
System Programming - Implementation guide for fundamental data structures.
System Utilities - Implementation guide for fundamental data structures.
Systems Programming - Learn to implement a hash table data structure.
Systems Programming Projects - A tutorial on implementing a hash table from scratch.

Star history

How this analysis was created: This summary and feature list were written by an AI model that read the project's README and public documentation pages. Each feature links to the documentation it came from; stars, license and language come straight from the GitHub API. The model does not read the source code, and the analysis is refreshed when the project is re-analysed. Learn more on our About page.

Write A Hash Table

Features

Computer Science Fundamentals - A pedagogical implementation of a fundamental hash table algorithm for educational purposes.
Open Addressing Implementations - Stores all key-value pairs directly in a contiguous array, using probing to resolve collisions.
Hash Tables - Walks through building an open-addressed, double-hashed hash table from scratch in C.
Hash Table Operations - Implements insert, search, and delete operations for associative pairs in a hash table.
Key-Value Stores - A low-level implementation of key-value pair storage, retrieval, and deletion using hash functions.
Linear Probing Sequences - Resolves hash collisions by scanning sequentially through the array for the next available slot.
Index Mapping Functions - Maps hash values to array indices using the modulo operator for in-bounds storage.
Key Deletion Operations - Removes a key-value pair from an associative array by its key, doing nothing if the key does not exist.
Key Insertion Operations - Inserts a key-value pair into an associative array, rejecting duplicate keys.
Key Lookup Operations - Retrieves the value associated with a given key from an associative array, returning null if the key is absent.
Core Systems and Utilities - Building a fundamental data structure to understand memory and collision handling.
System Programming - Implementation guide for fundamental data structures.
System Utilities - Implementation guide for fundamental data structures.
Systems Programming - Learn to implement a hash table data structure.
Systems Programming Projects - A tutorial on implementing a hash table from scratch.

Open-source alternatives to Write A Hash Table

Similar open-source projects, ranked by how many features they share with Write A Hash Table.

trekhleb/javascript-algorithms
trekhleb/javascript-algorithms
196,089View on GitHub
This repository is a comprehensive collection of data structures and algorithms implemented in JavaScript, designed primarily as an educational resource for computer science study and technical interview preparation. It provides modular implementations of fundamental programming concepts, allowing developers to explore algorithmic logic and data organization through self-contained, verifiable code examples. The library distinguishes itself by pairing every implementation with formal Big O notation, providing predictable insights into time and space scaling requirements. Each algorithm is stru
JavaScriptalgorithmalgorithmscomputer-science
View on GitHub196,089
kezhenxu94/cache-lite
kezhenxu94/cache-lite
166View on GitHub
An extremely lite-weight cache framework in Kotlin, demonstrating how cache works.
View on GitHub166
g-plane/tiny-package-manager
g-plane/tiny-package-manager
462View on GitHub
Learn how npm or Yarn v1 works.
TypeScript
View on GitHub462
leandromoreira/cdn-up-and-running
leandromoreira/cdn-up-and-running
3,677View on GitHub
This project is a content delivery network implementation that uses a web server and scripting language to cache content at the edge and reduce latency for end users. It functions as a distributed system designed to store backend responses on edge nodes and route incoming client requests through a proxy. The system utilizes custom request logic to handle edge caching strategies, including the delivery of stale content during origin failures. It implements request coalescing to merge simultaneous requests for the same resource into a single upstream call to prevent backend overload. The proje
Lua
View on GitHub3,677

See all 30 alternatives to Write A Hash Table

Frequently asked questions

What does jamesroutley/write-a-hash-table do?

jamesroutleywrite-a-hash-table