BestHub
Sign in
Tagged articles
9 articles
Page 1 of 1
NiuNiu MaTe
NiuNiu MaTe
Sep 1, 2025 · Backend Development

How Does Java’s HashMap Resolve Hash Collisions? From Linked Lists to Red‑Black Trees

Java’s HashMap tackles hash collisions through a combination of perturbation functions, chaining, open addressing, and, since JDK 8, converting long chains into red‑black trees, with detailed explanations of the underlying algorithms, resizing mechanics, threshold choices, and performance trade‑offs for developers and interview candidates.

Hash CollisionHashMapJava
0 likes · 17 min read
How Does Java’s HashMap Resolve Hash Collisions? From Linked Lists to Red‑Black Trees
BirdNest Tech Talk
BirdNest Tech Talk
Feb 28, 2025 · Fundamentals

How Go’s New Swiss Table Map Boosts Performance: A Deep Dive

This article traces the evolution of hash tables from early chain‑based designs to modern open‑addressing Swiss Table implementations, explains Go 1.24’s map redesign with groups, control words, and SIMD tricks, and examines the challenges of incremental growth, iteration semantics, and future performance improvements.

Go mapSwiss Tablehash table
0 likes · 17 min read
How Go’s New Swiss Table Map Boosts Performance: A Deep Dive
Xiao Lou's Tech Notes
Xiao Lou's Tech Notes
Feb 17, 2025 · Backend Development

Swiss Tables in Go 1.24: Open Addressing, SIMD, and Metadata Secrets

The article explains how Go 1.24’s new Swiss Tables hash‑map implementation replaces the traditional bucket‑based design with open addressing, SIMD‑accelerated probing, and metadata separation, detailing the underlying principles, performance advantages, handling of clustering and deletions, and a comparison with previous Go maps and Java’s HashMap.

GoSIMDhash map
0 likes · 16 min read
Swiss Tables in Go 1.24: Open Addressing, SIMD, and Metadata Secrets
Top Architecture Tech Stack
Top Architecture Tech Stack
Feb 7, 2024 · Fundamentals

Understanding Hash Tables: Concepts, Collision Resolution, and Python Implementations

This article explains the concept of hashing and hash tables, describes their characteristics and common collision‑resolution strategies such as open addressing, linear and quadratic probing, chaining, and rehashing, and provides complete Python implementations including a simple hash class, a dynamic map class, and a custom dictionary.

Data Structureschainingcollision-resolution
0 likes · 13 min read
Understanding Hash Tables: Concepts, Collision Resolution, and Python Implementations
Selected Java Interview Questions
Selected Java Interview Questions
May 12, 2022 · Fundamentals

How Hash Tables Store Data and Resolve Collisions

This article explains the basic structure of hash tables, how keys are mapped to array indices, the problem of hash collisions, and two common resolution strategies—open addressing and chaining—illustrated with diagrams and a concise summary.

Data Structureschainingcollision-resolution
0 likes · 3 min read
How Hash Tables Store Data and Resolve Collisions
MaGe Linux Operations
MaGe Linux Operations
Jun 8, 2017 · Fundamentals

How Python’s dict Uses Hash Tables and Open Addressing Explained

This article explains how Python implements dictionaries with hash tables, details the hash function for strings, demonstrates collision handling via open addressing and quadratic probing, and walks through the underlying C structures, initialization, insertion, resizing, and deletion processes.

Pythonc-implementationdict
0 likes · 8 min read
How Python’s dict Uses Hash Tables and Open Addressing Explained