Part 13. Collections and Data Structures

An ArrayList is one of the most important data structures in Zig.

10 items

Section	Title
1	Importing ArrayList
2	The Basic Idea
3	Why StringHashMap Exists
4	Why Linked Lists Exist
5	The Basic Difference
6	Why Bit Sets Matter
7	The Core Idea
8	Why Trees Matter
9	Start with the Rule
10	Start with the Operations

Writes › Book › Zig › Part 13. Collections and Data Structures ›

Importing ArrayList

An ArrayList is one of the most important data structures in Zig.

Writes › Book › Zig › Part 13. Collections and Data Structures ›

The Basic Idea

A HashMap is a data structure for storing values by key.

Writes › Book › Zig › Part 13. Collections and Data Structures ›

Why StringHashMap Exists

A StringHashMap is a hash map where the key is a string.

Writes › Book › Zig › Part 13. Collections and Data Structures ›

Why Linked Lists Exist

A linked list is a collection where each item points to the next item.

Writes › Book › Zig › Part 13. Collections and Data Structures ›

The Basic Difference

Queues and stacks are two simple ways to organize a collection of items.

Writes › Book › Zig › Part 13. Collections and Data Structures ›

Why Bit Sets Matter

A bit set is a compact collection of yes-or-no values.

Writes › Book › Zig › Part 13. Collections and Data Structures ›

The Core Idea

A ring buffer is a fixed-size queue that reuses its storage.

Writes › Book › Zig › Part 13. Collections and Data Structures ›

Why Trees Matter

A tree is a collection made of nodes.

Writes › Book › Zig › Part 13. Collections and Data Structures ›

Start with the Rule

A collection is a type that stores many values.

Writes › Book › Zig › Part 13. Collections and Data Structures ›

Start with the Operations

A data structure is never just a container.