BestHub
Sign in
Tag

Data Structure

0 views collected around this technical thread.

Rare Earth Juejin Tech Community
Rare Earth Juejin Tech Community
May 5, 2025 · Frontend Development

Design and Implementation Considerations for Building a Rich Text Editor from Scratch

This article explores the motivations, architectural choices, zero‑width character handling, data‑structure design, and implementation strategies—including execCommand, ContentEditable, and Canvas approaches—for creating a custom rich‑text editor that balances flexibility, performance, and browser compatibility.

ContentEditableData StructureJavaScript
0 likes · 29 min read
Design and Implementation Considerations for Building a Rich Text Editor from Scratch
Java Tech Enthusiast
Java Tech Enthusiast
Apr 2, 2025 · Backend Development

Understanding the Underlying Mechanism of Java HashMap

Java’s HashMap stores entries in a hash‑based array where a key’s hash determines the bucket index, resolves collisions with linked lists that become red‑black trees for long chains, resizes when the load factor exceeds 0.75, and requires ConcurrentHashMap for safe multithreaded updates, a core concept often asked in interviews.

BackendData StructureHashMap
0 likes · 6 min read
Understanding the Underlying Mechanism of Java HashMap
php中文网 Courses
php中文网 Courses
Apr 2, 2025 · Fundamentals

Implementing a Queue Using Two Stacks in PHP

This article explains the principles of queues and stacks, demonstrates how to simulate a FIFO queue using two LIFO stacks in PHP, provides full source code, usage examples, complexity analysis, and discusses practical applications and possible extensions.

Data StructurePHPQueue
0 likes · 5 min read
Implementing a Queue Using Two Stacks in PHP
Test Development Learning Exchange
Test Development Learning Exchange
Feb 26, 2025 · Fundamentals

Understanding Python Tuples: Definition, Features, and Practical Examples

This article introduces Python tuples, explaining their immutable ordered nature, core characteristics, and provides eleven practical code examples ranging from basic definition and indexing to unpacking, concatenation, using tuples as dictionary keys, and converting them to lists, illustrating common use cases and best practices.

Data StructureExampleImmutable
0 likes · 8 min read
Understanding Python Tuples: Definition, Features, and Practical Examples
Deepin Linux
Deepin Linux
Dec 21, 2024 · Fundamentals

Understanding Linux Kernel Bitmap Data Structure and Its APIs

This article explains the Linux kernel bitmap data structure, its definition, macro-based declarations, related assembly instructions, core bitmap APIs such as set_bit and test_bit, various bit‑operation functions, and practical applications ranging from PID allocation to device management and file‑system indexing.

Bit OperationsBitMapData Structure
0 likes · 27 min read
Understanding Linux Kernel Bitmap Data Structure and Its APIs
Mike Chen's Internet Architecture
Mike Chen's Internet Architecture
Aug 11, 2024 · Fundamentals

Understanding the Underlying Data Structure of Java HashMap

This article explains the internal architecture of Java's HashMap, covering its array of buckets, linked‑list handling of hash collisions, and the conversion to red‑black trees for high‑collision scenarios, supplemented with code examples and visual diagrams.

Data StructureHashMapJava
0 likes · 5 min read
Understanding the Underlying Data Structure of Java HashMap
IT Services Circle
IT Services Circle
Apr 12, 2024 · Fundamentals

Understanding Prefix Trees (Trie) with a Complete Java Implementation

This article explains the concept of a prefix tree (Trie), demonstrates how to build and use it for prefix searches, insertions, and deletions, and provides a complete Java implementation with detailed examples and visual illustrations.

Data StructureJavaPrefix Tree
0 likes · 9 min read
Understanding Prefix Trees (Trie) with a Complete Java Implementation
Java Tech Enthusiast
Java Tech Enthusiast
Feb 1, 2024 · Fundamentals

Understanding Bloom Filters: Theory, Implementation, and Applications

Bloom filters are space‑efficient probabilistic structures that test set membership using multiple hash functions, offering fast, low‑memory checks with a controllable false‑positive rate, and can be implemented manually in Java, via Guava’s library, or deployed at scale with RedisBloom for distributed applications.

Bloom FilterData StructureGuava
0 likes · 14 min read
Understanding Bloom Filters: Theory, Implementation, and Applications
Architects Research Society
Architects Research Society
Nov 27, 2023 · Databases

Formal Naming of Data Schemas, Structures, and Models: Distinctions and Methodology

The article explains the differences between data schemas, data structures, and data models, proposes a systematic naming approach, and outlines a five‑schema architecture—including business, view, logical, deployment, and physical schemas—while addressing terminology challenges and normalization processes.

Data ModelingData StructureDatabase Design
0 likes · 12 min read
Formal Naming of Data Schemas, Structures, and Models: Distinctions and Methodology
Test Development Learning Exchange
Test Development Learning Exchange
Aug 12, 2023 · Fundamentals

Understanding Python Dictionaries: Definition, Implementation, Operations, and Comprehensions

This article explains what Python dictionaries are, how they are implemented using hash tables, their key characteristics, various ways to create and access them, how to perform add, delete, and update operations, view their contents, and use dictionary comprehensions for concise construction.

CRUDData StructurePython
0 likes · 13 min read
Understanding Python Dictionaries: Definition, Implementation, Operations, and Comprehensions
Sohu Tech Products
Sohu Tech Products
Jul 26, 2023 · Databases

Understanding Redis Sorted Set Implementation and Real‑World Leaderboard Use Cases

This article explains the Redis Sorted Set data type, its underlying storage mechanisms (listpack and skiplist + dict), the internal structures and algorithms, and demonstrates how to build a real‑time game leaderboard using ZADD, ZRANGE and ZREVRANK commands.

Data StructureDatabaseListpack
0 likes · 14 min read
Understanding Redis Sorted Set Implementation and Real‑World Leaderboard Use Cases
Tencent Cloud Developer
Tencent Cloud Developer
Dec 30, 2022 · Backend Development

Implementation and Optimization of Generic Skip List in Go (stl4go)

stl4go provides a generic Go 1.18 container library that implements an optimized skip‑list‑based ordered map, using adaptive levels, efficient random‑level generation, type‑specific paths, and cache‑friendly node structures to achieve near‑C++ performance, surpassing existing Go generic collections.

Data StructureGoGo 1.18
0 likes · 18 min read
Implementation and Optimization of Generic Skip List in Go (stl4go)
Sohu Tech Products
Sohu Tech Products
Oct 12, 2022 · Fundamentals

Understanding the Underlying Principles of Java HashMap

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.

Data StructureHashMapJava
0 likes · 20 min read
Understanding the Underlying Principles of Java HashMap
Architect's Guide
Architect's Guide
Sep 10, 2022 · Fundamentals

Java Implementation of an O(1) LRU Cache Using a Doubly Linked List and HashMap

This article explains the design and Java implementation of an LRU (Least Recently Used) cache that achieves O(1) time complexity for get and put operations by combining a doubly linked list with a hash map, and provides full source code and usage examples.

Data StructureJavaO(1)
0 likes · 10 min read
Java Implementation of an O(1) LRU Cache Using a Doubly Linked List and HashMap
Tencent Cloud Developer
Tencent Cloud Developer
Aug 18, 2022 · Fundamentals

Perfect Hash Functions and Their Use in High‑Performance HashMaps

The article explains perfect hash functions, their collision‑free construction methods such as FCH, CHD, and PTHash, compares them to conventional hash tables, reviews common and cryptographic hash functions, and shows how read‑only perfect‑hash maps deliver faster lookups and lower memory use for static key sets.

Data Structurealgorithmbenchmark
0 likes · 21 min read
Perfect Hash Functions and Their Use in High‑Performance HashMaps
Top Architect
Top Architect
May 18, 2022 · Backend Development

Designing Efficient Read/Unread Tracking for Group Chat Messages Using Bitmaps

The article analyzes the memory inefficiency of storing per‑user read/unread lists for group chat messages, proposes a bitmap‑based solution with user‑to‑map ID mapping, discusses handling of member exits, and evaluates the storage savings and scalability of the new design.

BitMapData StructureGroup Chat
0 likes · 7 min read
Designing Efficient Read/Unread Tracking for Group Chat Messages Using Bitmaps
Selected Java Interview Questions
Selected Java Interview Questions
Apr 2, 2022 · Databases

Advanced Redis Bit Operations: Commands, Underlying Data Structures, Complexity, Storage Calculation, and Use Cases

This article explains Redis bitmap (bit) operations, covering command syntax for SETBIT, GETBIT, BITCOUNT, and BITOP, analyzing the underlying SDS data structure, detailing time‑complexity and storage calculations, and presenting practical application scenarios such as user sign‑in tracking and online status monitoring.

BITCOUNTBITOPBitMap
0 likes · 8 min read
Advanced Redis Bit Operations: Commands, Underlying Data Structures, Complexity, Storage Calculation, and Use Cases
Java Captain
Java Captain
Mar 13, 2022 · Fundamentals

Understanding the Underlying Data Structure and Mechanics of Java HashMap

This article explains Java HashMap's internal structure, including the array‑linked list and red‑black tree design, load factor, collision resolution methods, resizing process, key selection, thread‑safety concerns, and the hash calculation algorithm, providing detailed insights for developers.

Data StructureHashMapJDK
0 likes · 17 min read
Understanding the Underlying Data Structure and Mechanics of Java HashMap
Top Architect
Top Architect
Mar 5, 2022 · Fundamentals

Understanding Skip Lists and Their Implementation in Redis

This article explains the concept of skip lists as an ordered random data structure, illustrates how Redis uses skip lists for sorted sets, and provides a complete Java implementation with detailed code examples and analysis of their performance characteristics.

Data StructureJavaRedis
0 likes · 13 min read
Understanding Skip Lists and Their Implementation in Redis