def sfrom

bend-kit-collections@0.1.4.1 · PROOF.bend:140

import Base
import bend-kit-collections@0.1.4.1/LAWS.bend as Laws

140# The list is sorted and its first element lies above lb.
141def sfrom(~K: Data, ~cmp: K -> K -> Cmp, lb: Maybe<&2, K>, xs: List<&2, K>) -> Bool:
142  match lb:
143    case None{}:
144      Laws.sorted(~K, ~cmp, xs)
145    case Some{b}:
146      Laws.sorted.go(~K, ~cmp, xs, b)