zipper -is:module -package:nonempty-zipper -package:zipper-extra -package:uniplate

zipper :: a -> Top :>> a
zippers Control.Zipper Control.Zipper.Internal
Construct a Zipper that can explore anything, and start it at the Top.
zipper :: Traversable t => t a -> Maybe (Zipper t a)
comonad-extras Control.Comonad.Store.Zipper
package zipper
Uses
Not on Stackage, so not searched. Generic zipper for families of recursive datatypes
class Zipper z
Agda Agda.Utils.Zipper
newtype Zipper a b
product-profunctors Data.Profunctor.Product.Examples
Zipper :: Traverse ZipList a b -> Zipper a b
product-profunctors Data.Profunctor.Product.Examples
data Zipper a
ListZipper Data.List.Zipper, streams Data.Stream.Infinite.Functional.Zipper
type Zipper a = Maybe (Stack a)
xmonad-contrib XMonad.Util.Stack
data Zipper h i a
zippers Control.Zipper Control.Zipper.Internal
This is the type of a Zipper. It visually resembles a "breadcrumb trail" as used in website navigation. Each breadcrumb in the trail represents a level you can move up to. This type operator associates to the left, so you can use a type like 
Top :>> (String,Double) :>> String :>> Char
to represent a Zipper from (String,Double) down to Char that has an intermediate crumb for the String containing the Char. You can construct a Zipper into *any* data structure with zipper. You can repackage up the contents of a Zipper with rezip. 
>>> rezip $ zipper 42
42
The combinators in this module provide lot of things you can do to the Zipper while you have it open. Note that a value of type h :> s :> a doesn't actually contain a value of type h :> s -- as we descend into a level, the previous level is unpacked and stored in Coil form. Only one value of type _ :> _ exists at any particular time for any particular Zipper.
Zipper :: !Coil h i a -> Int -> Int -> !Path i a -> i -> a -> Zipper h i a
zippers Control.Zipper.Internal
data Zipper t a
comonad-extras Control.Comonad.Store.Zipper
data Zipper (c :: * -> Constraint) root
traverse-with-class Data.Generics.Traversable.Zipper
A generic zipper with a root object of type root.
package zippers
Uses
Traversal based zippers Traversal based zippers.
zipper1 :: Traversable1 t => t a -> Zipper t a
comonad-extras Control.Comonad.Store.Zipper
package ZipperAG
Uses
Not on Stackage, so not searched. An implementationg of Attribute Grammars using Functional Zippers
data NTZipper a
hxt Data.Tree.NTree.Zipper.TypeDefs
Zipper for rose trees A zipper consist of the current tree and the branches on the way back to the root
fromNTZipper :: NTZipper a -> NTree a
hxt Data.Tree.NTree.Zipper.TypeDefs
Conversion of a navigatable rose tree into an ordinary rose tree. The context, the parts for moving up to the root are just removed from the tree. So when transforming a navigatable tree by moving around and by changing some nodes, one has to navigate back to the root, else that parts are removed from the result
toNTZipper :: NTree a -> NTZipper a
hxt Data.Tree.NTree.Zipper.TypeDefs
Conversion of a rose tree into a navigatable rose tree
package text-zipper
Uses
A text editor zipper library This library provides a zipper and API for editing text.
data TextZipper a
text-zipper Data.Text.Zipper
clearZipper :: Monoid a => TextZipper a -> TextZipper a
text-zipper Data.Text.Zipper
Empty a zipper.
mkZipper :: Monoid a => (Char -> a) -> (Int -> a -> a) -> (Int -> a -> a) -> (a -> Int) -> (a -> Char) -> (a -> a) -> (a -> Bool) -> (a -> [a]) -> (a -> [Char]) -> [a] -> Maybe Int -> TextZipper a
text-zipper Data.Text.Zipper
Create a zipper using a custom text storage type. Takes the initial text as well as all of the functions necessary to manipulate the underlying text values.
stringZipper :: [String] -> Maybe Int -> TextZipper String
text-zipper Data.Text.Zipper
Construct a zipper from list values.
textZipper :: [Text] -> Maybe Int -> TextZipper Text
text-zipper Data.Text.Zipper
Construct a zipper from Text values.
vectorZipper :: [Vector Char] -> Maybe Int -> TextZipper (Vector Char)
text-zipper Data.Text.Zipper
Construct a zipper from vectors of characters.