0 views collected around this technical thread.
This article explains how hash tables store key‑value pairs as array entries, describes hash collisions when different keys map to the same index, and outlines two common resolution methods—open addressing and chaining—while also providing visual illustrations and practical insights.
This article explains how Java's HashMap stores key‑value pairs using an array of nodes, how hash functions map keys to array indices, how collisions are handled with linked lists and red‑black trees, and why proper hashCode implementations are crucial for performance.
This article explains how Java's HashMap stores key‑value pairs using an array‑plus‑linked‑list structure, details the hash function, index calculation, collision handling, resizing, and the conditions under which linked lists are replaced by red‑black trees, illustrated with concrete code examples.
This guide demonstrates how to enable touch‑based movement for a hero character, add directional walking animations, integrate animation logic, and implement physics‑based collision detection with walls in Cocos Creator, including code snippets for event handling, animation state management, and physics component setup.
This tutorial explains how to use the Tiled map editor to design tile‑based levels, import and configure the generated maps in a Cocos Creator project, add animations, replace maps, and switch to curve‑based collision walls for smoother gameplay.
This article explains the internal structure of Java's HashMap, covering its array‑plus‑linked‑list‑plus‑red‑black‑tree implementation, hash function and collision resolution, the detailed put operation, resizing mechanics, and considerations for thread‑safe usage.
This article provides a comprehensive overview of Java's HashMap, covering its place in the Set and Map families, internal implementation details, the relationship between hashCode() and equals(), collision resolution strategies, basic operations, differences from Hashtable, and several classic interview problems such as Top‑K frequency and LRU cache design.
This article explains how hashing transforms data lookup from linear or logarithmic time to constant O(1) time by using hash functions and hash tables, illustrates the concept with a simple modulo‑based example, and discusses load factor and collision issues.
This article explains how Java's HashMap stores key‑value pairs, details the hash calculation, index mapping, collision handling via linked lists, the role of load factor, resizing mechanics, and provides annotated source code for core methods such as put, get, and internal Entry class.