The document compares different data structures including lists, sets, heaps, and queues. It evaluates each data structure based on criteria such as amortized worst case time complexity, support for strict or lazy evaluation, ability to handle persistent data, use of suspensions, and scheduling capabilities. Some examples highlighted include lazy binomial heaps supporting persistence through tree list suspensions, and bankers queues enabling lazy rebuilding.

1. Name Section Bounds Evaluation Ready for Components Rebuilding
Amortized Worst Case only Strict Strict/Lazy persistent usage susp Stream Schedule
Lists
List 2.1 - - ✔ - - - -
Stream 4.2 - - ✔ - α StreamCell susp - - -
Sets
UnbalancedSet 2.2 ✔ ✔ ✔
RedBlackTree 3.3 ✔ ✔ ✔
Heaps
LeftistHeap 3.1 ✔ ✔ ✔
BinomialHeap 3.2, 5.3 ✔ ✔
LazyBinomialHeap 6.4.1 ✔ ✔ ✔ Tree list susp
ScheduledBinomialHeap 7.3 ✔ ✔ ✔ ✔ ✔
SplayHeap 5.3 ✔ ✔
PairingHeap 5.4 ✔ ✔
LazyPairingHeap 6.5 ✔ ✔ ✔ Heap susp
Queues
BatchedQueue 5.2 ✔ ✔ Batched Rebuilding
BankersQueue 6.3.2, 8.3 ✔ ✔ ✔ ✔ Lazy Rebuilding
RealTimeQueue 7.2 ✔ ✔ ✔ ✔ ✔
OutputRestrictedDeque 8.4.1 ✔ ✔ ✔ ✔
BankersDeque 8.4.2 ✔ ✔ ✔ ✔ Lazy Rebuilding
RealTimeDeque 8.4.3 ✔ ✔ ✔ ✔ ✔ Lazy Rebuilding
PhysistsQueue 6.4.2 ✔ ✔ ✔ α list susp
HoodMelvilleQueue 8.3 ✔ ✔ ✔ Global Rebuilding
Sortable Collections
BottomUpMergeSort 6.4.3 ✔ ✔ ✔ Elem.T list list susp
ScheduledBottomUpMergeSort 7.4 ✔ ✔ ✔ ✔ ✔