Skip to content

IOrderedRange

Defined in: packages/data/src/ordered-range/iordered-range.ts:22

Ordering operations shared by anything whose iteration order follows a comparator.

T is what is stored and returned; Q is what a query is made with — Q = T for a set, Q = K (the key) for a map over T = SortedMapEntry<K, V>. This is the resolution to “should ISortedSet/ISortedMap be one parameterised interface”: not by one extending the other, but by both composing this shared, query-type-aware mixin.

T

The type returned by min/max/floor/ceiling/range.

Q = T

The type a query is made with.

readonly comparator: Comparator<Q>

Defined in: packages/data/src/ordered-range/iordered-range.ts:23

ceiling(query): T | undefined

Defined in: packages/data/src/ordered-range/iordered-range.ts:27

Q

T | undefined


floor(query): T | undefined

Defined in: packages/data/src/ordered-range/iordered-range.ts:26

Q

T | undefined


max(): T | undefined

Defined in: packages/data/src/ordered-range/iordered-range.ts:25

T | undefined


min(): T | undefined

Defined in: packages/data/src/ordered-range/iordered-range.ts:24

T | undefined


range(from?, to?): IterableIterator<T>

Defined in: packages/data/src/ordered-range/iordered-range.ts:28

Q

Q

IterableIterator<T>