Core.count_unknown: def of bend-schema-lib@0.4.1.0
Import: import bend-schema-lib@0.4.1.0/core.bend as Core
Lines 1395-1405 of bend-schema-lib@0.4.1.0/core.bend: https://jend.leeeet.dev/read.txt?path=bend-schema-lib@0.4.1.0/core.bend&start_line=1395&end_line=1405

import Base

# ---- the claim the strict law makes ----
#
# How many keys of r are not in ns, counted rather than walked with a
# Bool.and: a second algorithm, so that a no_extra that lets a key through
# (or refuses a named one) disagrees with it.
def count_unknown(+ns: List<&2, String>, r: Raw) -> Nat:
  match r:
    case RKey{+k, v, o}:
      Nat.add(one_if_there(in_names(k, ns)), count_unknown(ns, o))
    case _:
      0n

Uses (7):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=String
  https://jend.leeeet.dev/definition.txt?path=bend-schema-lib@0.4.1.0/core.bend&name=Raw
  https://jend.leeeet.dev/definition.txt?path=bend-schema-lib@0.4.1.0/core.bend&name=in_names
  https://jend.leeeet.dev/definition.txt?path=bend-schema-lib@0.4.1.0/core.bend&name=one_if_there