)
# token f not present
# path=[{b=>[b] f=>[f]}]
# got off=2 s=0 path_add=[{b=>[b] f=>[f]}]
# got final=[t {a=>[a] i=>[i]} {b=>[b] f=>[f]}]
# p1=[t {a=>[a] i=>[i]} {b=>[b] f=>[f]}]
# _insert_path [t {a=>[a] i=>[i]} s] into [t {a=>[a] i=>[i]} {b=>[b] f=>[f]}]
# at path ( {a i} {b f})
# p0=[t {a=>[a] i=>[i]} {b=>[b] f=>[f]}]
# insert node({a=>[a] i=>[i]}:[s]) (key=[ai]) at path=[{a=>[a] i=>[i]} {b=>[b] f=>[f]}]
# identical nodes [{a=>[a] i=>[i]}]
# insert at 2 s:[] into [{b=>[b] f=>[f]}]
# _insert_path [s] into [{b=>[b] f=>[f]}]
# at (off=0 len=1) {b=>[b] f=>[f]}
# add path (s:[]) into [{b=>[b] f=>[f]}] at off=0 to end=0
# got off=2 s=0 path_add=[{b=>[b] f=>[f] s=>[s]}]
# got final=[t {a=>[a] i=>[i]} {b=>[b] f=>[f] s=>[s]}]
# p1=[t {a=>[a] i=>[i]} {b=>[b] f=>[f] s=>[s]}]
# | _do_reduce common=[t] tail=[{a=>[a] i=>[i]} {b=>[b] f=>[f] s=>[s]}]
# |_reduce_node 1 common=[t] tail=[{a=>[a] i=>[i]} {b=>[b] f=>[f] s=>[s]}]
#| head=[t] tail=[{a=>[a] i=>[i]} {b=>[b] f=>[f] s=>[s]}]
#| tail nr=2 t0=HASH n=2
#| scan k=a p=[a]
#| scan k=i p=[i]
# _reduce_path 0 out head=[t] tail=[{a=>[a] i=>[i]} {b=>[b] f=>[f] s=>[s]}]
# final head=[t] tail=[{a=>[a] i=>[i]} {b=>[b] f=>[f] s=>[s]}]
# unrev path in [{a=>[a] i=>[i]} {b=>[b] f=>[f] s=>[s]}]
# unrev node in {b=>[b] f=>[f] s=>[s]} opt=0
# _unrev path fast [b]# -> [b]
# _unrev path fast [s]# -> [s]
# _unrev path fast [f]# -> [f]
# unrev node out {b=>[b] f=>[f] s=>[s]}
# unrev node in {a=>[a] i=>[i]} opt=0
# _unrev path fast [a]# -> [a]
# _unrev path fast [i]# -> [i]
# unrev node out {a=>[a] i=>[i]}
# unrev path out [{b=>[b] f=>[f] s=>[s]} {a=>[a] i=>[i]}]
# _unrev path fast [t]# -> [t]
# final path=[{b=>[b] f=>[f] s=>[s]} {a=>[a] i=>[i]} t]
ok 43
# _insert_path [s p l a t] into [s p l i t]
# at path ( p l i t)
# at path (s l i t)
# at path (s p i t)
# at path (s p l t)
# token a not present
# path=[s p l {a=>[a t] i=>[i t]}]
# _insert_path [s l i t] into [s p l {a=>[a t] i=>[i t]}]
# at path ( p l {a i})
# at path (s l {a i})
# token l not present
# path=[s {l=>[l i t] p=>[p l {a=>[a t] i=>[i t]}]}]
# _insert_path [s l a t] into [s {l=>[l i t] p=>[p l {a=>[a t] i=>[i t]}]}]
# at path ( {l p})
# at (off=1 len=2) {l=>[l i t] p=>[p l {a=>[a t] i=>[i t]}]}
# descend key=l [l i t]
# at path ( i t)
# at path (l t)
# token a not present
# path=[l {a=>[a t] i=>[i t]}]
# _insert_path [f l a t] into [s {l=>[l {a=>[a t] i=>[i t]}] p=>[p l {a=>[a t] i=>[i t]}]}]
# at path ( {l p})
# token f not present
# path=[{f=>[f l a t] s=>[s {l=>[l {a=>[a t] i=>[i t]}] p=>[p l {a=>[a t] i=>[i t]}]}]}]
# _insert_path [f l i t] into [{f=>[f l a t] s=>[s {l=>[l {a=>[a t] i=>[i t]}] p=>[p l {a=>[a t] i=>[i t]}]}]}]
# at (off=0 len=1) {f=>[f l a t] s=>[s {l=>[l {a=>[a t] i=>[i t]}] p=>[p l {a=>[a t] i=>[i t]}]}]}
# descend key=f [f l a t]
# at path ( l a t)
# at path (f a t)
# at path (f l t)
# token i not present
# path=[f l {a=>[a t] i=>[i t]}]
# _reduce_path 0 [{f=>[f l {a=>[a t] i=>[i t]}] s=>[s {l=>[l {a=>[a t] i=>[i t]}] p=>[p l {a=>[a t] i=>[i t]}]}]}]
# _reduce_node 1 in {f=>[f l {a=>[a t] i=>[i t]}] s=>[s {l=>[l {a=>[a t] i=>[i t]}] p=>[p l {a=>[a t] i=>[i t]}]}]} opt=0
# |_scan_node head=[s] tail={l=>[l {a=>[a t] i=>[i t]}] p=>[p l {a=>[a t] i=>[i t]}]}
# _reduce_node 3 in {l=>[l {a=>[a t] i=>[i t]}] p=>[p l {a=>[a t] i=>[i t]}]} opt=0
# |_scan_node head=[l] tail={a=>[a t] i=>[i t]}
# _reduce_node 5 in {a=>[a t] i=>[i t]} opt=0
# |_scan_node push reduce (t:[a])
# |_scan_node push reduce (t:[i])
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={t=>[[t a] [t i]]} fail=[]
# | do [[t a] [t i]]
# _insert_path [t i] into [t a]
# at path ( a)
# at path (t )
# token i not present
# path=[t {a=>[a] i=>[i]}]
# | _do_reduce common=[t] tail={a=>[a] i=>[i]}
# |_reduce_node 5 common=[t] tail={a=>[a] i=>[i]}
# |_scan_node ++recovered common=[t] tail={a=>[a] i=>[i]} path=[l]
# |_scan_node head=[l p] tail={a=>[a t] i=>[i t]}
# _reduce_node 5 in {a=>[a t] i=>[i t]} opt=0
# |_scan_node push reduce (t:[a])
# |_scan_node push reduce (t:[i])
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={t=>[[t a] [t i]]} fail=[]
# | do [[t a] [t i]]
# _insert_path [t i] into [t a]
# at path ( a)
# at path (t )
# token i not present
# path=[t {a=>[a] i=>[i]}]
# | _do_reduce common=[t] tail={a=>[a] i=>[i]}
# |_reduce_node 5 common=[t] tail={a=>[a] i=>[i]}
# |_scan_node ++recovered common=[t] tail={a=>[a] i=>[i]} path=[l p]
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={t=>[[t {a=>[a] i=>[i]} l] [t {a=>[a] i=>[i]} l p]]} fail=[]
# | do [[t {a=>[a] i=>[i]} l] [t {a=>[a] i=>[i]} l p]]
# _insert_path [t {a=>[a] i=>[i]} l p] into [t {a=>[a] i=>[i]} l]
# at path ( {a i} l)
# p0=[t {a=>[a] i=>[i]} l]
# insert node({a=>[a] i=>[i]}:[l p]) (key=[ai]) at path=[{a=>[a] i=>[i]} l]
# identical nodes [{a=>[a] i=>[i]}]
# identical nodes [l]
# convert opt {* p=>[p]}
# p1=[t {a=>[a] i=>[i]} l {* p=>[p]}]
# | _do_reduce common=[t] tail=[{a=>[a] i=>[i]} l {* p=>[p]}]
# |_reduce_node 3 common=[t] tail=[{a=>[a] i=>[i]} l {* p=>[p]}]
# |_scan_node ++recovered common=[t] tail=[{a=>[a] i=>[i]} l {* p=>[p]}] path=[s]
# |_scan_node head=[l f] tail={a=>[a t] i=>[i t]}
# _reduce_node 3 in {a=>[a t] i=>[i t]} opt=0
# |_scan_node push reduce (t:[a])
# |_scan_node push reduce (t:[i])
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={t=>[[t a] [t i]]} fail=[]
# | do [[t a] [t i]]
# _insert_path [t i] into [t a]
# at path ( a)
# at path (t )
# token i not present
# path=[t {a=>[a] i=>[i]}]
# | _do_reduce common=[t] tail={a=>[a] i=>[i]}
# |_reduce_node 3 common=[t] tail={a=>[a] i=>[i]}
# |_scan_node ++recovered common=[t] tail={a=>[a] i=>[i]} path=[l f]
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={t=>[[t {a=>[a] i=>[i]} l {* p=>[p]} s] [t {a=>[a] i=>[i]} l f]]} fail=[]
# | do [[t {a=>[a] i=>[i]} l {* p=>[p]} s] [t {a=>[a] i=>[i]} l f]]
# _insert_path [t {a=>[a] i=>[i]} l {* p=>[p]} s] into [t {a=>[a] i=>[i]} l f]
# at path ( {a i} l f)
# p0=[t {a=>[a] i=>[i]} l f]
# insert node({a=>[a] i=>[i]}:[l {* p=>[p]} s]) (key=[ai]) at path=[{a=>[a] i=>[i]} l f]
# identical nodes [{a=>[a] i=>[i]}]
# identical nodes [l]
# insert at 3 HASH(0xc41c1c):[s] into [f]
# _insert_path [{* p=>[p]} s] into [f]
# p0=[f]
# insert node({* p=>[p]}:[s]) (key=p?) at path=[f]
# atom->node {f=>[f] p?=>[{* p=>[p]} s]}
# out=[{f=>[f] p?=>[{* p=>[p]} s]}]
# p1=[{f=>[f] p?=>[{* p=>[p]} s]}]
# got off=3 s=1 path_add=[{f=>[f] p?=>[{* p=>[p]} s]}]
# got final=[t {a=>[a] i=>[i]} l {f=>[f] p?=>[{* p=>[p]} s]}]
# p1=[t {a=>[a] i=>[i]} l {f=>[f] p?=>[{* p=>[p]} s]}]
# | _do_reduce common=[t] tail=[{a=>[a] i=>[i]} l {f=>[f] p?=>[{* p=>[p]} s]}]
# |_reduce_node 1 common=[t] tail=[{a=>[a] i=>[i]} l {f=>[f] p?=>[{* p=>[p]} s]}]
#| head=[t] tail=[{a=>[a] i=>[i]} l {f=>[f] p?=>[{* p=>[p]} s]}]
#| tail nr=3 t0=HASH n=2
#| scan k=a p=[a]
#| scan k=i p=[i]
# _reduce_path 0 out head=[t] tail=[{a=>[a] i=>[i]} l {f=>[f] p?=>[{* p=>[p]} s]}]
# final head=[t] tail=[{a=>[a] i=>[i]} l {f=>[f] p?=>[{* p=>[p]} s]}]
# unrev path in [{a=>[a] i=>[i]} l {f=>[f] p?=>[{* p=>[p]} s]}]
# unrev node in {f=>[f] p?=>[{* p=>[p]} s]} opt=0
# unrev path in [{* p=>[p]} s]
# unrev node in {p=>[p]} opt=1
# _unrev path fast [p]# -> [p]
# unrev node out {* p=>[p]}
# unrev path out [s {* p=>[p]}]
# _unrev path fast [f]# -> [f]
# unrev node out {f=>[f] s=>[s {* p=>[p]}]}
# unrev node in {a=>[a] i=>[i]} opt=0
# _unrev path fast [a]# -> [a]
# _unrev path fast [i]# -> [i]
# unrev node out {a=>[a] i=>[i]}
# unrev path out [{f=>[f] s=>[s {* p=>[p]}]} l {a=>[a] i=>[i]}]
# _unrev path fast [t]# -> [t]
# final path=[{f=>[f] s=>[s {* p=>[p]}]} l {a=>[a] i=>[i]} t]
ok 44
# _insert_path [b c k x] into [b c k t x]
# at path ( c k t x)
# at path (b k t x)
# at path (b c t x)
# at path (b c k x)
# token x not present
# path=[b c k {t=>[t x] x=>[x]}]
# _insert_path [b d i x] into [b c k {t=>[t x] x=>[x]}]
# at path ( c k {x t})
# at path (b k {x t})
# token d not present
# path=[b {c=>[c k {t=>[t x] x=>[x]}] d=>[d i x]}]
# _insert_path [b d k t x] into [b {c=>[c k {t=>[t x] x=>[x]}] d=>[d i x]}]
# at path ( {c d})
# at (off=1 len=2) {c=>[c k {t=>[t x] x=>[x]}] d=>[d i x]}
# descend key=d [d i x]
# at path ( i x)
# at path (d x)
# token k not present
# path=[d {i=>[i x] k=>[k t x]}]
# _insert_path [b d k x] into [b {c=>[c k {t=>[t x] x=>[x]}] d=>[d {i=>[i x] k=>[k t x]}]}]
# at path ( {c d})
# at (off=1 len=2) {c=>[c k {t=>[t x] x=>[x]}] d=>[d {i=>[i x] k=>[k t x]}]}
# descend key=d [d {i=>[i x] k=>[k t x]}]
# at path ( {k i})
# at (off=1 len=2) {i=>[i x] k=>[k t x]}
# descend key=k [k t x]
# at path ( t x)
# at path (k x)
# token x not present
# path=[k {t=>[t x] x=>[x]}]
# _reduce_path 0 [b {c=>[c k {t=>[t x] x=>[x]}] d=>[d {i=>[i x] k=>[k {t=>[t x] x=>[x]}]}]}]
# _reduce_node 1 in {c=>[c k {t=>[t x] x=>[x]}] d=>[d {i=>[i x] k=>[k {t=>[t x] x=>[x]}]}]} opt=0
# |_scan_node head=[d] tail={i=>[i x] k=>[k {t=>[t x] x=>[x]}]}
# _reduce_node 3 in {i=>[i x] k=>[k {t=>[t x] x=>[x]}]} opt=0
# |_scan_node push reduce (x:[i])
# |_scan_node head=[k] tail={t=>[t x] x=>[x]}
# _reduce_node 5 in {t=>[t x] x=>[x]} opt=0
# |_scan_node push reduce (x:[])
# |_scan_node push reduce (x:[t])
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={x=>[[x] [x t]]} fail=[]
# | do [[x] [x t]]
# _insert_path [x t] into [x]
# at path ()
# at path (x)
# added remaining [x {* t=>[t]}]
# | _do_reduce common=[x] tail={* t=>[t]}
# |_reduce_node 5 common=[x] tail={* t=>[t]}
# |_scan_node ++recovered common=[x] tail={* t=>[t]} path=[k]
# | slide in h=[x] t={* t=>[t]} p=[k]
# | slide potential [t] over [k]
# | slide path [t]
# | slide out h=[x] s={* t=>[t]} p=[k]
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={x=>[[x i] [x {* t=>[t]} k]]} fail=[]
# | do [[x i] [x {* t=>[t]} k]]
# _insert_path [x {* t=>[t]} k] into [x i]
# at path ( i)
# p0=[x i]
# insert node({* t=>[t]}:[k]) (key=t?) at path=[i]
# atom->node {i=>[i] t?=>[{* t=>[t]} k]}
# out=[x {i=>[i] t?=>[{* t=>[t]} k]}]
# p1=[x {i=>[i] t?=>[{* t=>[t]} k]}]
# | _do_reduce common=[x] tail={i=>[i] t?=>[{* t=>[t]} k]}
# |_reduce_node 3 common=[x] tail={i=>[i] t?=>[{* t=>[t]} k]}
# |_scan_node ++recovered common=[x] tail={i=>[i] t?=>[{* t=>[t]} k]} path=[d]
# |_scan_node head=[k c] tail={t=>[t x] x=>[x]}
# _reduce_node 3 in {t=>[t x] x=>[x]} opt=0
# |_scan_node push reduce (x:[])
# |_scan_node push reduce (x:[t])
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={x=>[[x] [x t]]} fail=[]
# | do [[x] [x t]]
# _insert_path [x t] into [x]
# at path ()
# at path (x)
# added remaining [x {* t=>[t]}]
# | _do_reduce common=[x] tail={* t=>[t]}
# |_reduce_node 3 common=[x] tail={* t=>[t]}
# |_scan_node ++recovered common=[x] tail={* t=>[t]} path=[k c]
# | slide in h=[x] t={* t=>[t]} p=[k c]
# | slide potential [t] over [k c]
# | slide path [t]
# | slide out h=[x] s={* t=>[t]} p=[k c]
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={x=>[[x {i=>[i] t?=>[{* t=>[t]} k]} d] [x {* t=>[t]} k c]]} fail=[]
# | do [[x {i=>[i] t?=>[{* t=>[t]} k]} d] [x {* t=>[t]} k c]]
# _insert_path [x {* t=>[t]} k c] into [x {i=>[i] t?=>[{* t=>[t]} k]} d]
# at path ( {t? i} d)
# p0=[x {i=>[i] t?=>[{* t=>[t]} k]} d]
# insert node({* t=>[t]}:[k c]) (key=t?) at path=[{i=>[i] t?=>[{* t=>[t]} k]} d]
# +bifurcate new={(?:t?k|i)=>[{i=>[i] t?=>[{* t=>[t]} k]} d] t?=>[{* t=>[t]} k c]}
# p1=[x {(?:t?k|i)=>[{i=>[i] t?=>[{* t=>[t]} k]} d] t?=>[{* t=>[t]} k c]}]
# | _do_reduce common=[x] tail={(?:t?k|i)=>[{i=>[i] t?=>[{* t=>[t]} k]} d] t?=>[{* t=>[t]} k c]}
# |_reduce_node 1 common=[x] tail={(?:t?k|i)=>[{i=>[i] t?=>[{* t=>[t]} k]} d] t?=>[{* t=>[t]} k c]}
#| head=[x] tail={(?:t?k|i)=>[{i=>[i] t?=>[{* t=>[t]} k]} d] t?=>[{* t=>[t]} k c]}
#| push b leaves []
#| tail nr=2 t0=HASH n=2
#| scan k=t? p=[{* t=>[t]} k c]
#| scan k=(?:t?k|i) p=[{i=>[i] t?=>[{* t=>[t]} k]} d]
# _reduce_path 0 out head=[x] tail=[{(?:t?k|i)=>[{i=>[i] t?=>[{* t=>[t]} k]} d] t?=>[{* t=>[t]} k c]} b]
# final head=[x] tail=[{(?:t?k|i)=>[{i=>[i] t?=>[{* t=>[t]} k]} d] t?=>[{* t=>[t]} k c]} b]
# unrev path in [{(?:t?k|i)=>[{i=>[i] t?=>[{* t=>[t]} k]} d] t?=>[{* t=>[t]} k c]} b]
# unrev node in {(?:t?k|i)=>[{i=>[i] t?=>[{* t=>[t]} k]} d] t?=>[{* t=>[t]} k c]} opt=0
# unrev path in [{* t=>[t]} k c]
# unrev node in {t=>[t]} opt=1
# _unrev path fast [t]# -> [t]
# unrev node out {* t=>[t]}
# unrev path out [c k {* t=>[t]}]
# unrev path in [{i=>[i] t?=>[{* t=>[t]} k]} d]
# unrev node in {i=>[i] t?=>[{* t=>[t]} k]} opt=0
# unrev path in [{* t=>[t]} k]
# unrev node in {t=>[t]} opt=1
# _unrev path fast [t]# -> [t]
# unrev node out {* t=>[t]}
# unrev path out [k {* t=>[t]}]
# _unrev path fast [i]# -> [i]
# unrev node out {i=>[i] k=>[k {* t=>[t]}]}
# unrev path out [d {i=>[i] k=>[k {* t=>[t]}]}]
# unrev node out {c=>[c k {* t=>[t]}] d=>[d {i=>[i] k=>[k {* t=>[t]}]}]}
# unrev path out [b {c=>[c k {* t=>[t]}] d=>[d {i=>[i] k=>[k {* t=>[t]}]}]}]
# _unrev path fast [x]# -> [x]
# final path=[b {c=>[c k {* t=>[t]}] d=>[d {i=>[i] k=>[k {* t=>[t]}]}]} x]
ok 45 - bcktx bckx bdix bdktx bdkx
# _insert_path [g r i t] into [g a i t]
# at path ( a i t)
# at path (g i t)
# token r not present
# path=[g {a=>[a i t] r=>[r i t]}]
# _insert_path [w a i t] into [g {a=>[a i t] r=>[r i t]}]
# at path ( {a r})
# token w not present
# path=[{g=>[g {a=>[a i t] r=>[r i t]}] w=>[w a i t]}]
# _insert_path [w r i t] into [{g=>[g {a=>[a i t] r=>[r i t]}] w=>[w a i t]}]
# at (off=0 len=1) {g=>[g {a=>[a i t] r=>[r i t]}] w=>[w a i t]}
# descend key=w [w a i t]
# at path ( a i t)
# at path (w i t)
# token r not present
# path=[w {a=>[a i t] r=>[r i t]}]
# _reduce_path 0 [{g=>[g {a=>[a i t] r=>[r i t]}] w=>[w {a=>[a i t] r=>[r i t]}]}]
# _reduce_node 1 in {g=>[g {a=>[a i t] r=>[r i t]}] w=>[w {a=>[a i t] r=>[r i t]}]} opt=0
# |_scan_node head=[g] tail={a=>[a i t] r=>[r i t]}
# _reduce_node 3 in {a=>[a i t] r=>[r i t]} opt=0
# |_scan_node push reduce (t:[i a])
# |_scan_node push reduce (t:[i r])
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={t=>[[t i a] [t i r]]} fail=[]
# | do [[t i a] [t i r]]
# _insert_path [t i r] into [t i a]
# at path ( i a)
# at path (t a)
# at path (t i )
# token r not present
# path=[t i {a=>[a] r=>[r]}]
# | _do_reduce common=[t i] tail={a=>[a] r=>[r]}
# |_reduce_node 3 common=[t i] tail={a=>[a] r=>[r]}
# |_scan_node ++recovered common=[t i] tail={a=>[a] r=>[r]} path=[g]
# |_scan_node head=[w] tail={a=>[a i t] r=>[r i t]}
# _reduce_node 3 in {a=>[a i t] r=>[r i t]} opt=0
# |_scan_node push reduce (t:[i a])
# |_scan_node push reduce (t:[i r])
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={t=>[[t i a] [t i r]]} fail=[]
# | do [[t i a] [t i r]]
# _insert_path [t i r] into [t i a]
# at path ( i a)
# at path (t a)
# at path (t i )
# token r not present
# path=[t i {a=>[a] r=>[r]}]
# | _do_reduce common=[t i] tail={a=>[a] r=>[r]}
# |_reduce_node 3 common=[t i] tail={a=>[a] r=>[r]}
# |_scan_node ++recovered common=[t i] tail={a=>[a] r=>[r]} path=[w]
# |_scan_node counts: reduce=1 fail=0
# |_scan_node done opt=0 reduce={t=>[[t i {a=>[a] r=>[r]} g] [t i {a=>[a] r=>[r]} w]]} fail=[]
# | do [[t i {a=>[a] r=>[r]} g] [t i {a=>[a] r=>[r]} w]]
# _insert_path [t i {a=>[a] r=>[r]} w] into [t i {a=>[a] r=>[r]} g]
# at path ( i {a r} g)
# at path (t {a r} g)
# p0=[t i {a=>[a] r=>[r]} g]
# insert node({a=>[a] r=>[r]}:[w]) (key=[ar]) at path=[{a=>[a] r=>[r]} g]
# identical nodes [{a=>[a] r=>[r]}]
# insert at 3 w:[] into [g]
# _insert_path [w] into [g]
# at path ()
# token w not present
# path=[{g=>[g] w=>[w]}]
# got off=3 s=0 path_add=[{g=>[g] w=>[w]}]
# got final=[t i {a=>[a] r=>[r]} {g=>[g] w=>[w]}]
# p1=[t i {a=>[a] r=>[r]} {g=>[g] w=>[w]}]
# | _do_reduce common=[t i] tail=[{a=>[a] r=>[r]} {g=>[g] w=>[w]}]
# |_reduce_node 1 common=[t i] tail=[{a=>[a] r=>[r]} {g=>[g] w=>[w]}]
#| head=[t i] tail=[{a=>[a] r=>[r]} {g=>[g] w=>[w]}]
#| tail nr=2 t0=HASH n=2
#| scan k=a p=[a]
#| scan k=r p=[r]
# _reduce_path 0 out head=[t i] tail=[{a=>[a] r=>[r]} {g=>[g] w=>[w]}]
# final head=[t i] tail=[{a=>[a] r=>[r]} {g=>[g] w=>[w]}]
# unrev path in [{a=>[a] r=>[r]} {g=>[g] w=>[w]}]
# unrev node in {g=>[g] w=>[w]} opt=0
# _unrev path fast [w]# -> [w]
# _unrev path fast [g]# -> [g]
# unrev node out {g=>[g] w=>[w]}
# unrev node in {a=>[a] r=>[r]} opt=0
# _unrev path fast [a]# -> [a]
# _unrev path fast [r]# -> [r]
# unrev node out {a=>[a] r=>[r]}
# unrev path out [{g=>[g] w=>[w]} {a=>[a] r=>[r]}]
# _unrev path fast [t i]# -> [i t]
# final path=[{g=>[g] w=>[w]} {a=>[a] r=>[r]} i t]
ok 46
# _insert_path [g r i t] into [g a i t]
# at path ( a i t)
# at path (g