law first_key_is_own

near-v-framework@0.4.0.0 · general/rose/LAWS.bend:5

import Base
import near-v-framework@0.4.0.0/general/rose/type.bend as R
import near-v-framework@0.4.0.0/general/rose/ops.bend as O

5# LAW: a tree's first key is its own
6law first_key_is_own:
7  for -N: Data
8  for +r: R.Rose<N>
9  {O.first(O.keys(N, [r])) == O.key(N, r) : String}