replace element right of the current status

check if at inside-most left point of a container

check if at inside-most point of a container

check if at left-most point of a container

check if at outside-most point of the tree

check if at right-most point of a container

check if can step left inside a container

check if can step down from current status

check if can step left from current status

(-> (from-status ’[1 2 3 | 4]) (can-step-left?)) => true

(-> (from-status ’[1 2 | 3 4]) (can-step-left?)) => false

check if can step up from current status

check if can step right from current status

(-> (from-status ’[1 2 3 | 4]) (can-step-right?)) => true

(-> (from-status ’[1 2 3 4 |]) (can-step-right?)) => false

checks that the zipper contains valid functions

checks that the meta contains valid functions

all elements left and right of current position

delete element/s left of the current status

delete element/s right of the current status

displays the zipper

helper function for the rest of the find series

steps status left to search predicate

step status through the tree in depth first order to the first matching element

step status through the tree in reverse order to the last matching element

steps status right to search for predicate

creates a form zip

unwraps nils for the zipper

wraps nils for the zipper

returns a zipper given a data structure with | as the status

gets the value of the zipper

replace element right of the current status

insert element/s left of the current status

insert element/s right of the current status

checks zip given a predicate

checks if node on either side is a container

(-> (vector-zip 1 2 3) (is-container? :right)) => true

(-> (vector-zip 1 2 3) (is-container? :left)) => false

check if current container is empty

(-> (vector-zip []) (is-empty-container?)) => true

element directly left of current position

all elements left of current position

performs a match at the same level

lists elements of a container

performs a match at each level

emulates std.lib.walk/postwalk behavior with zipper

emulates std.lib.walk/prewalk behavior with zipper

registers a zip type

replace element left of the current status

replace element right of the current status

element directly right of current position

all elements right of current position

accesses the top level node

constructs a sequence zipper

returns the form with the status showing

returns the string form of the status

steps status to container directly at end

step down from current status

steps into the form on the left side

step to at-inside-most point of current container

steps all the way inside to the left side

step left from current status

step to left-most point of current container

step status through the tree in depth first order

step out to the current container

step to outside-most point of the tree

step to outside-most point of the tree to the right

the right of the current container

step status in reverse through the tree in depth first order

step right from current status

step to right-most point of current container

nests elements in current block within another container

unregisters a zip type

unwraps an element

updates elements of a container

constructs a vector based zipper

constructs a zipper

checks to see if an object is a zipper