def entries

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

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

301# Raw enumeration. Public protocol Keys/Values first finish the oldest-only purge.
302def entries(-K: Data, -V: Data, c: Cache<K, V>) -> List<&2, T.Entry<K, V>>:
303  State{cap, table, order, life, counts, cb} = c
304  entries_go(K, V, order, table)