def searchtree
import bend-kit-collections@0.1.4.1/LAWS.bend as LAWSimport Base
import bend-kit-collections@0.1.4.1/omap.bend as O
135def searchtree(~K: Data, ~V: Data, ~cmp: K -> K -> Cmp, m: O.OMap<K, V>) -> Bool:
136 bounded(~K, ~V, ~cmp, m, None{}, None{})