FindMatch finds the Entry in PrefixSorter which matches the span prefix on a prefix subset of its keys, including a zero-length match in the case of the DEFAULT partition.

FindMatchOnSingleColumn finds the Entry in PrefixSorter with a prefix length of 1 or less which matches the span prefix, including a zero-length match in the case of the DEFAULT partition.

MakeCompositeKey constructs an N-dimensional key from the given slice of values.

MakeKey constructs a simple one dimensional key having the given value.

MakeKeyContext initializes a KeyContext.

ParseConstraint parses a constraint in the format of Constraint.String, e.g: "/1/2/3: [/1 - /2]".

ParseSpan parses a span in the format of Span.String, e.g: [/1 - /2].

SingleConstraint creates a Set with a single Constraint.

SingleSpanConstraint creates a Set with a single constraint which has one span.

ExcludeBoundary indicates that the boundary does not include the respective key.

ExtendHigh specifies that the key is conceptually suffixed with a value that sorts after all values for purposes of comparison.

ExtendLow specifies that the key is conceptually suffixed with a value that sorts before all values for purposes of comparison.

IncludeBoundary indicates that the boundary does include the respective key.

Contradiction is a special constraint set which indicates there are no possible values for the expression; it will always yield the empty result set.

EmptyKey has zero values.

Unconstrained is an empty constraint set which does not impose any constraints on any columns.

UnconstrainedSpan is the span without any boundaries.

Columns identifies the columns which correspond to the values in a Key (and consequently the columns of a Span or Constraint).

Constraint specifies the possible set of values that one or more columns will have in the result set.

Key is a composite of N typed datum values that are ordered from most significant to least significant for purposes of sorting.

KeyContext contains the necessary metadata for comparing Keys.

Set is a conjunction of constraints that are inferred from scalar filter conditions.

Span represents the range between two composite keys.

Spans is a collection of spans.

KeyExtension is an enumeration used when comparing keys.

SpanBoundary specifies whether a span endpoint is inclusive or exclusive of its start or end key.