3.2 Functional Data Structures

Immutable lists, stacks, queues, heaps, HAMTs, functional BSTs, lazy evaluation, structural sharing, and deforestation.

3.2 Functional data structures, 35

index slug name
1 functional-data-structure Functional Data Structure
2 persistent-list Persistent List
3 functional-stack Functional Stack
4 functional-queue Functional Queue
5 banker's-queue Bankers Queue
6 real-time-queue Real Time Queue
7 functional-deque Functional Deque
8 finger-tree-functional Finger Tree
9 functional-heap Functional Heap
10 binomial-heap-functional Functional Binomial Heap
11 pairing-heap-functional Functional Pairing Heap
12 skew-binomial-heap Skew Binomial Heap
13 functional-set Functional Set
14 functional-map Functional Map
15 hamt Hash Array Mapped Trie
16 functional-trie Functional Trie
17 functional-bst Functional BST
18 red-black-functional Functional Red Black Tree
19 functional-sequence Functional Sequence
20 lazy-evaluation-structure Lazy Structure
21 stream-structure Stream
22 amortized-functional-analysis Amortized Analysis
23 worst-case-functional-analysis Worst Case Analysis
24 structural-sharing-functional Structural Sharing
25 persistent-functional Persistent Functional
26 functional-memory-layout Memory Layout
27 functional-garbage-collection Garbage Collection
28 functional-concurrency Concurrency
29 functional-lock-free Lock Free
30 functional-invariant-check Invariant Check
31 functional-benchmarking Benchmarking
32 functional-debugging Debugging
33 functional-fusion Fusion
34 functional-deforestation Deforestation
35 functional-composability Composability