com.hapgood.zipper — com.hapgood/zipii 0.3.0

nth-child clj/s

(nth-child loc n)

Treeish clj/s protocol

branches clj/s

(branches this)

Return a seq of the child branches of this tree, or nil if it is a leaf (not a branch)

tree clj/s

(tree this)

Return the pure treeish data structure

Zip clj/s protocol

Perform up-and-down zip operations. Like a stack, up is guaranteed to never be called without a preceeding dn

z-dn clj/s

(z-dn this t)

(z-dn this t k)

Return a pair of a sequence of child branches (or a three-tuple pivoting on k) and a possibly updated Zip, or nil if t is not a branch.

z-up clj/s

(z-up this branches)

Return a pair of a new tree with with the supplied branches and a possibly updated Zip

Zipper clj/s protocol

change clj/s

(change loc t)

Replace the tree at this loc with t, without moving.

left clj/s

(left loc)

Return the loc of the left sibling of the tree at this loc, or nil.

down clj/s

(down loc)

Return the loc of the leftmost child of the tree at this loc, or nil if no children.

delete clj/s

(delete loc)

Delete the tree at loc, returning the loc that would have preceded it in a depth-first walk.

up clj/s

(up loc)

Return the loc of the parent of the tree at this loc (reflecting any changes), or nil if at the top.

insert-right clj/s

(insert-right loc t)

Insert t as the right sibling of the tree at this loc, without moving.

insert-down clj/s

(insert-down loc t)

Insert t as the leftmost child of the tree (which must be a branch) at this loc, moving to the newly inserted t.

insert-left clj/s

(insert-left loc t)

Insert t as the left sibling of the tree at this loc, without moving.

right clj/s

(right loc)

Return the loc of the right sibling of the tree at this loc, or nil.