Cache.finite_entry: def of bend-collections-laws-math@1.0.0.0
Import: import bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/src/cache.bend as Cache
Lines 276-281 of bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/src/cache.bend: https://jend.leeeet.dev/read.txt?path=bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/src/cache.bend&start_line=276&end_line=281

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

def finite_entry(-K: Data, -V: Data, e: Maybe<&2, T.Entry<K, V>>) -> Bool:
  match e:
    case None{}:
      False{}
    case Some{T.Item{k, v, d}}:
      Bool.not(Time.is_zero(d))

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.not
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/src/time.bend&name=is_zero
  https://jend.leeeet.dev/definition.txt?path=bend-collections-laws-math@1.0.0.0/proofs/lib/lemmas/types/model.bend&name=Entry