def entries_go

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/lemmas/src/cache.bend:294

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

294def entries_go(-K: Data, -V: Data, order: List<&2, String>, +table: Map<&2, Maybe<&2, T.Entry<K, V>>>) -> List<&2, T.Entry<K, V>>:
295  match order:
296    case Nil{}:
297      Nil{}
298    case Con{k, rest}:
299      collect_entry(K, V, lookup_result(K, V, Map.get(Maybe<&2, T.Entry<K, V>>, None{}, table, k)), entries_go(K, V, rest, table))