Method max

crates/kernel/src/env.rs:176–203

Largest single cache size. Cheap proxy for "how big did this block get" without summing. (Sum is misleading because the same content hash can appear in multiple caches.)

(&self)

    }
  }

  /// Read-only fast path: return the canonical interned universe for
  /// `key` if already present. The key must be built from CANONICAL
  /// children (their uids). Plain callers should use `intern_univ`.
  #[inline]
  pub fn try_get_univ(&self, key: &UnivKey) -> Option<KUniv<M>> {
    self.univs.get(key).cloned()
  }

  /// Read-only fast path counterpart of `try_get_univ` for expressions.
  #[inline]
  pub fn try_get_expr(&self, key: &ExprKey) -> Option<KExpr<M>> {
    self.exprs.get(key).cloned()
  }

  /// Intern a universe: returns the canonical value for its structural
  /// identity, recursively canonicalizing children as needed so the
  /// shallow key is meaningful.
  pub fn intern_univ(&mut self, u: KUniv<M>) -> KUniv<M> {
    use super::level::UnivData;
    crate::profile::bump_intern_nodes();
    if self.canon_univs.contains(u.addr()) {
      return u;
    }
    // Canonicalize children first; rebuild only if any child changed.
    let u = match u.data() {
      UnivData::Succ(inner, _) => {
        let ci = self.intern_univ(inner.clone());
        if ci.ptr_eq(inner) {
          u
        } else {