Skip to content

3.2 Functional Data Structures

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

indexslugname
1functional-data-structureFunctional Data Structure
2persistent-listPersistent List
3functional-stackFunctional Stack
4functional-queueFunctional Queue
5banker’s-queueBankers Queue
6real-time-queueReal Time Queue
7functional-dequeFunctional Deque
8finger-tree-functionalFinger Tree
9functional-heapFunctional Heap
10binomial-heap-functionalFunctional Binomial Heap
11pairing-heap-functionalFunctional Pairing Heap
12skew-binomial-heapSkew Binomial Heap
13functional-setFunctional Set
14functional-mapFunctional Map
15hamtHash Array Mapped Trie
16functional-trieFunctional Trie
17functional-bstFunctional BST
18red-black-functionalFunctional Red Black Tree
19functional-sequenceFunctional Sequence
20lazy-evaluation-structureLazy Structure
21stream-structureStream
22amortized-functional-analysisAmortized Analysis
23worst-case-functional-analysisWorst Case Analysis
24structural-sharing-functionalStructural Sharing
25persistent-functionalPersistent Functional
26functional-memory-layoutMemory Layout
27functional-garbage-collectionGarbage Collection
28functional-concurrencyConcurrency
29functional-lock-freeLock Free
30functional-invariant-checkInvariant Check
31functional-benchmarkingBenchmarking
32functional-debuggingDebugging
33functional-fusionFusion
34functional-deforestationDeforestation
35functional-composabilityComposability