def remove_found

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

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

90def remove_found(-K: Data, -V: Data, c: Cache<K, V>, key: String, evict: Bool, found: Maybe<&2, T.Entry<K, V>>) -> Step<K, V>:
91  match found:
92    case None{}:
93      Out{c, None{}, False{}, Nil{}}
94    case Some{entry}:
95      remove_present(K, V, c, key, evict, entry)