children parent
registers parent-index ;
-M: node equal? over node? [ [ number>> ] bi@ = ] [ 2drop f ] if ;
+M: node equal? over node? [ [ number>> ] same? ] [ 2drop f ] if ;
M: node hashcode* nip number>> ;
: verify-children ( trees -- trees )
dup [ flatten-tree ] map concat
nodes get
- { [ [ length ] bi@ = ] [ set= ] } 2&&
+ { [ [ length ] same? ] [ set= ] } 2&&
[ nodes get node-missing-children ] unless ;
: verify-trees ( trees -- trees )