def first_entry

bend-collections-laws-math@1.0.0.0 · proofs/lib/lemmas/src/cache.bend:265

import Base
import bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/types/model.bend as T

265def first_entry(-K: Data, -V: Data, c: Cache<K, V>, order: List<&2, String>) -> Maybe<&2, T.Entry<K, V>>:
266  match order:
267    case Nil{}:
268      None{}
269    case Con{k, rest}:
270      lookup(K, V, c, k)