Gets the element at the given index.
If the index is out of bounds, the array will be extended with shallow copies of default_value.
Gets the element at the given index.
If the index is out of bounds, the array will be extended with the result of f(index).
Locates the insertion point for target in sorted_arr to maintain sorted order.
If target is already present, the insertion point is to the left of any existing entries.
Locates the insertion point for target in sorted_arr to maintain sorted order.
If target is already present, the insertion point is to the right of any existing entries.
Adds a value v to the array associated with key k inside a Map-backed multimap.
Partition an array into two arrays based on a predicate.
Partitions an array into a Map-based multimap using a key extractor function.
Accesses a nested record at the given path, returning both the current value and a setter function.
Recursively merges a patch object into a base object.
Represents a double-ended queue (deque) with amortized O(1) insertion and removal at both ends. The implementation stores items inside a sparse index map so the head and tail can grow independently without costly array shifts.