;;; Manually constructed common tree tests.

:;; insertion
= _ 5+ ! 6+ ! 7+ ! 8+ ! 9+ ! 10+ ! 11+ K
    1+ ! 2+ ! 3+ ! 4+ K

:
:;; initial population for upcoming tests
= _ 1+ ! 2+ ! 3+ ! 4+ ! 5+ ! 6+ ! 7+ ! 8+ ! 9+ K

:
:;; lookup
5?n 10?n
4,?n 9,?n

:
:;; iteration
i j

:
:;; path motion and ascension
"
[pk^ >pk^ >pk^ >pk^ -
]pk^ <pk^ <pk^
5@p^ <pk^
4@p^ <p^ }p^
4@p^ >p^ {p^
0@p^ >p^
10@p^ <p^

6@ rlp un un un un un
tp^ up

=_ tp^ [p^ 1+ tp^ [p^
)

:
:;; remove
" 7k- ! 6k- ! 4k- ! [k- ! ]<<k- ! 2k- ! 3k- ! 8k- ! 9k- i ! )

:
:;; join
" ( 11+ 13+ 12+ K *k~ K )
" ( 11+ 13+ 12+ K 10k~ K )
" ( 11+ K 10k~ K )
" ( K 10k~ K )
" ( K *k~ K )
" ( 11+ 12+ 13+ 14+ 15+ 16+ 17+ 18+ 19+ 20+ K 10k~ K )

:
:;; split
=_ #31B K
" 18@p/ K ) K ) K )
" 17,@{p/ K ) K ) K )
" 18@}p/ K ) K ) K )
" 17k- 17@p/ K ) K ) K )
" 19k- 18,@{p/ K ) K ) K )

:
:;; set ops
= _
   1+  3+  5+  7+  9+ 11+ 13+ 15+ K
(  2+  3+  6+  7+ 10+ 11+ 14+ 15+ K
|
:union
K )
:intersection
K

= _
:a
   1+  3+  5+  7+  9+ 11+ 13+ 15+ K
:b
(  2+  3+  6+  7+ 10+ 11+ 14+ 15+ K
\
:difference
K )
:intersection
K )
:a original
K

:
:;; clear everything.
= _

:
:;;;----- That's all, folks -------------------------------------------------