def below_upper

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

import Base

595def below_upper(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, +k: K, bound: Bound<K>) -> Bool:
596  match bound:
597    case Unbounded{}:
598      True{}
599    case Inclusive{hi}:
600      ordering_ok(cmp(k, hi), True{})
601    case Exclusive{hi}:
602      ordering_ok(cmp(k, hi), False{})