A generic zipper with a root object of type root.

Create a zipper. The focus starts at the root of the object.

Move up a zipper to the root and return the root object.

Move left. Returns Nothing iff already at leftmost sibling.

Move right. Returns Nothing iff already at rightmost sibling.

Move down. Moves to rightmost immediate child. Returns Nothing iff at a leaf and thus no children exist.

Move down. Move to the leftmost immediate child. Returns Nothing iff at a leaf and thus no children exist.

Move up. Returns Nothing iff already at root and thus no parent exists.

Apply a generic query to the hole.

Apply a generic transformation to the hole.

Apply a generic monadic transformation to the hole

Get the value in the hole. Returns Nothing iff a is not the type of the value in the hole.

Set the value in the hole. Does nothing iff a is not the type of the value in the hole.

Set the value in the hole. Returns Nothing iff a is not the type of the value in the hole.

Apply a generic query using the specified movement operation.

Apply a generic query to the left sibling if one exists.

Apply a generic query to the right sibling if one exists.

Apply a generic query to the parent if it exists.

Apply a generic query to the rightmost child if one exists.

Apply a generic transformer using the specified movement operations.

Apply a generic transformer to the left sibling if one exists. Otherwise, leaves the zipper unchanged.

Apply a generic transformer to the right sibling if one exists. Otherwise, leaves the zipper unchanged.

Apply a generic transformer to the rightmost child if one exists. Otherwise, leaves the zipper unchanged.

Apply a generic transformer to the parent if it exists. Otherwise, leaves the zipper unchanged.

Apply a generic monadic transformer using the specified movement operations.

Apply a generic monadic transformer to the right sibling if one exists.

Apply a generic monadic transformer to the rightmost child if one exists.

Apply a generic monadic transformer to the parent if it exists.

Move to the leftmost sibling.

Move to the rightmost sibling.

Apply a generic query to the immediate children.

Apply a generic transformation to the immediate children.

Apply a generic monadic transformation to the immediate children.

Apply a generic monadic transformation to at least one child that does not fail.

Apply a generic transformation everywhere in a bottom-up manner.

Apply a generic transformation everywhere in a top-down manner.

Apply a generic monadic transformation once at the topmost leftmost successful location.

Repeatedly apply a monadic Maybe generic transformation at the top-most, left-most position that the transformation returns Just. Behaves like iteratively applying zsomewhere but is more efficient because it re-evaluates the transformation at only the parents of the last successful application.