def oldest_entry

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

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

272def oldest_entry(-K: Data, -V: Data, +c: Cache<K, V>) -> Maybe<&2, T.Entry<K, V>>:
273  State{cap, m, order, life, counts, cb} = c
274  first_entry(K, V, c, order)