Provides extended array functions.

Represents Least Recently Used (LRU) cache supporting concurrency. The capacity must be positive and decides how many entries to store.

Represents an error raised when an operation requires a non-empty persistent queue.

Represents an error raised when an operation requires a non-empty random access queue.

Represents a factory that creates a value on a cache miss.

Provides functions for creating or manipulating interval maps.

Represents an interval map, which is a map based on an interval tree. This maps an interval (i.e., AddrRange) to a value of type 'V. We currently implement this using the functional finger tree. Intervals in this map are not necessarily disjoint and can overlap. To disallow overlapping intervals, consider using NoOverlapIntervalMap instead.

Provides functions for creating or manipulating interval sets.

Represents an interval-tree-based set, which stores intervals (AddrRange) that can overlap unlike NoOverlapIntervalMap.

Represents an error raised when a register set is created with an invalid size.

Represents a Least Recently Used (LRU) cache that does not support concurrency. The capacity must be positive.

Provides functions for creating or manipulating non-overlapping interval maps.

Represents a non-overlapping interval map. By interval map, we mean a map based on an interval tree, which maps an interval (i.e., AddrRange) to a value. We currently implement this using a red-black tree, which follows the implementation of the paper written by Kimball Germane and Matthew Might: "Deletion: The Curse of the Red-Black Tree", Journal of Functional Programming, vol. 24, no. 4, 2014.

Provides functions to create or manipulate persistent queues.

Represents a persistent queue. Uses two lists internally to represent the queue.

Provides functions for creating or manipulating random access queues.

Represents a random access queue: a sequence of elements that can be accessed by index.

Represents a set of register IDs. This is an efficient and architecture-agnostic set data structure that internally uses bit arrays. Since RegisterIDs always start from 0 for any architecture, we can use it directly as an index to the bit array.

Provides extended functionality for the generic SortedList collection.

Represents a queue that stores each element at most once.

Represents a thread-safe weak interning table. Values are grouped by a caller-supplied hash, and each bucket stores only weak references to the interned values.