def finite_entry
bend-collections-laws-math@1.0.0.0 · proofs/lib/lemmas/src/cache.bend:276
import bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/src/cache.bend as Cache
import Base
import bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/types/model.bend as T
import bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/src/time.bend as Time
276def finite_entry(-K: Data, -V: Data, e: Maybe<&2, T.Entry<K, V>>) -> Bool:
277 match e:
278 case None{}:
279 False{}
280 case Some{T.Item{k, v, d}}:
281 Bool.not(Time.is_zero(d))