def above_lower

bend-collections@1.0.0.0 · src/containers/balanced_search_tree.bend:586

import Base

586def above_lower(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +k: K, bound: Bound<K>) -> Bool:
587  match bound:
588    case Unbounded{}:
589      True{}
590    case Inclusive{lo}:
591      ordering_ok(cmp(lo, k), True{})
592    case Exclusive{lo}:
593      ordering_ok(cmp(lo, k), False{})