def keys
import near-v-framework@0.4.0.0/general/rose/ops.bend as Opsimport Base
import near-v-framework@0.4.0.0/general/rose/type.bend as R
9# Every key in a forest, each tree's own key before its children's.
10def keys(-N: Data, rs: List<&2, R.Rose<N>>) -> List<&2, String>:
11 match rs:
12 case []:
13 []
14 case r <> rest:
15 match r:
16 case R.Rose{k, _, kids}:
17 k <> List.append(&2, String, keys(N, kids), keys(N, rest))