An ArrayList is one of the most important data structures in Zig.
| 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 |
Importing ArrayListAn ArrayList is one of the most important data structures in Zig.
The Basic IdeaA HashMap is a data structure for storing values by key.
Why StringHashMap ExistsA StringHashMap is a hash map where the key is a string.
Why Linked Lists ExistA linked list is a collection where each item points to the next item.
The Basic DifferenceQueues and stacks are two simple ways to organize a collection of items.
Why Bit Sets MatterA bit set is a compact collection of yes-or-no values.
The Core IdeaA ring buffer is a fixed-size queue that reuses its storage.
Why Trees MatterA tree is a collection made of nodes.
Start with the RuleA collection is a type that stores many values.
Start with the OperationsA data structure is never just a container.