tupelo.lexical-v1 — tupelo 0.9.179

Utils for lexical sorting and searching

->sorted-set clj

(->sorted-set)

(->sorted-set some-set)

Inputs: ([] [some-set :- (s/cond-pre tsk/Set tsk/Vec)]) Returns: Set

Converts a set into a lexically-sorted set

bound-lower clj

(bound-lower val)

Inputs: [val :- tsk/Vec] Returns: tsk/Vec

Given a lexical value as a vector such as [1 :a], returns a lower bound like [1]

compare-lex clj

(compare-lex a b)

Inputs: [a :- tsk/Vec b :- tsk/Vec] Returns: s/Int

Performs a lexical comparison of 2 sequences, sorting as follows: [1] [1 nil] [1 :a] [1 :b] [1 :b 3] [2] [3] [3 :y]

Map clj

prefix-match? clj

(prefix-match? pattern sample)

Inputs: [pattern :- Val sample :- Val] Returns: s/Bool

Returns true if the sample value equals the pattern when truncated to the same length

Set clj

split-key-prefix clj

(split-key-prefix match-val lex-set)

Inputs: [match-val :- Val lex-set :- Set] Returns: #:s{Keyword Set}

Like clojure.data.avl/split-key, but allows prefix matches. Given a lexically sorted set like: #{[:a 1] [:a 2] [:a 3] [:b 1] [:b 2] [:b 3] [:c 1] [:c 2]} splits data by prefix match for patterns like [:b], returning a map of 3 sorted sets like: {:smaller #{[:a 1] [:a 2] [:a 3]} :matches #{[:b 1] [:b 2] [:b 3]} :larger #{[:c 1] [:c 2]} ]

Val clj