Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- newtype TagTreePosStateT str f a = TagTreePosStateT (TagTreePos str -> f (Maybe (TagTreePos str, a)))
- type TagTreePosState str a = TagTreePosStateT str Identity a
- tagTreePosState :: (TagTreePos str -> Maybe (TagTreePos str, a)) -> TagTreePosState str a
- runTagTreePosStateT :: TagTreePosStateT str f a -> TagTreePos str -> f (Maybe (TagTreePos str, a))
- evalTagTreePosStateT :: Functor f => TagTreePosStateT str f a -> TagTreePos str -> f (Maybe a)
- execTagTreePosStateT :: Functor f => TagTreePosStateT str f a -> TagTreePos str -> f (Maybe (TagTreePos str))
- runTagTreePosState :: TagTreePosState str a -> TagTreePos str -> Maybe (TagTreePos str, a)
- evalTagTreePosState :: TagTreePosState str a -> TagTreePos str -> Maybe a
- execTagTreePosState :: TagTreePosState str a -> TagTreePos str -> Maybe (TagTreePos str)
- modifyTagTreePosStateT :: Functor f => (TagTreePos x -> f (Maybe (TagTreePos x))) -> TagTreePosStateT x f ()
- modifyTagTreePosState :: (TagTreePos x -> Maybe (TagTreePos x)) -> TagTreePosState x ()
- getsTagTreePosStateT :: Functor f => (TagTreePos x -> f (Maybe a)) -> TagTreePosStateT x f a
- getsTagTreePosState :: (TagTreePos x -> Maybe a) -> TagTreePosState x a
- maybeTagTreePosStateT :: Functor f => f (Maybe a) -> TagTreePosStateT x f a
- maybeTagTreePosState :: Maybe a -> TagTreePosState x a
- putTagTreePosStateT :: Functor f => f (Maybe (TagTreePos x)) -> TagTreePosStateT x f ()
- putTagTreePosState :: Maybe (TagTreePos x) -> TagTreePosState x ()
- getTagTreePos :: TagTreePosState x (TagTree x)
- root :: TagTreePosState str ()
- parent :: TagTreePosState str ()
- firstChild :: TagTreePosState str ()
- lastChild :: TagTreePosState str ()
- prevSibling :: TagTreePosState str ()
- nextSibling :: TagTreePosState str ()
- content :: TagTreePosState x (TagTree x)
- before :: TagTreePosState x [TagTree x]
- after :: TagTreePosState x [TagTree x]
- parents :: TagTreePosState x [TagTreePosParent x]
- liftTagTreePosState :: Applicative f => TagTreePosState str a -> TagTreePosStateT str f a
- putTagTree :: Monad f => TagTree str -> TagTreePosStateT str f ()
- opticContent :: ((a -> Const (First a) a) -> TagTree str -> Const (First a) (TagTree str)) -> TagTreePosState str a
- findTreeT :: Monad f => TagTreePosStateT str f a -> TagTreePosStateT str f b -> (TagTree str -> f (Maybe x)) -> TagTreePosStateT str f x
- findTree :: TagTreePosState str a -> TagTreePosState str b -> (TagTree str -> Maybe x) -> TagTreePosState str x
- depthFirstFindTreeT :: Monad f => (TagTree str -> f (Maybe x)) -> TagTreePosStateT str f x
- depthFirstFindTree :: (TagTree str -> Maybe x) -> TagTreePosState str x
- breadthFirstFindTreeT :: Monad f => (TagTree str -> f (Maybe x)) -> TagTreePosStateT str f x
- breadthFirstFindTree :: (TagTree str -> Maybe x) -> TagTreePosState str x
- findContentUntil :: Monad f => TagTreePosStateT str f a -> (TagTree str -> Bool) -> TagTreePosStateT str f ()
- findUntil :: Monad f => TagTreePosStateT str f a -> TagTreePosStateT str f b -> TagTreePosStateT str f b
- tagBranchLeafText :: TagTreePosState a (a, a)
Documentation
newtype TagTreePosStateT str f a Source #
TagTreePosStateT (TagTreePos str -> f (Maybe (TagTreePos str, a))) |
Instances
type TagTreePosState str a = TagTreePosStateT str Identity a Source #
tagTreePosState :: (TagTreePos str -> Maybe (TagTreePos str, a)) -> TagTreePosState str a Source #
runTagTreePosStateT :: TagTreePosStateT str f a -> TagTreePos str -> f (Maybe (TagTreePos str, a)) Source #
evalTagTreePosStateT :: Functor f => TagTreePosStateT str f a -> TagTreePos str -> f (Maybe a) Source #
execTagTreePosStateT :: Functor f => TagTreePosStateT str f a -> TagTreePos str -> f (Maybe (TagTreePos str)) Source #
runTagTreePosState :: TagTreePosState str a -> TagTreePos str -> Maybe (TagTreePos str, a) Source #
evalTagTreePosState :: TagTreePosState str a -> TagTreePos str -> Maybe a Source #
execTagTreePosState :: TagTreePosState str a -> TagTreePos str -> Maybe (TagTreePos str) Source #
modifyTagTreePosStateT :: Functor f => (TagTreePos x -> f (Maybe (TagTreePos x))) -> TagTreePosStateT x f () Source #
modifyTagTreePosState :: (TagTreePos x -> Maybe (TagTreePos x)) -> TagTreePosState x () Source #
getsTagTreePosStateT :: Functor f => (TagTreePos x -> f (Maybe a)) -> TagTreePosStateT x f a Source #
getsTagTreePosState :: (TagTreePos x -> Maybe a) -> TagTreePosState x a Source #
maybeTagTreePosStateT :: Functor f => f (Maybe a) -> TagTreePosStateT x f a Source #
maybeTagTreePosState :: Maybe a -> TagTreePosState x a Source #
putTagTreePosStateT :: Functor f => f (Maybe (TagTreePos x)) -> TagTreePosStateT x f () Source #
putTagTreePosState :: Maybe (TagTreePos x) -> TagTreePosState x () Source #
getTagTreePos :: TagTreePosState x (TagTree x) Source #
root :: TagTreePosState str () Source #
parent :: TagTreePosState str () Source #
firstChild :: TagTreePosState str () Source #
lastChild :: TagTreePosState str () Source #
prevSibling :: TagTreePosState str () Source #
nextSibling :: TagTreePosState str () Source #
content :: TagTreePosState x (TagTree x) Source #
before :: TagTreePosState x [TagTree x] Source #
after :: TagTreePosState x [TagTree x] Source #
parents :: TagTreePosState x [TagTreePosParent x] Source #
liftTagTreePosState :: Applicative f => TagTreePosState str a -> TagTreePosStateT str f a Source #
putTagTree :: Monad f => TagTree str -> TagTreePosStateT str f () Source #
opticContent :: ((a -> Const (First a) a) -> TagTree str -> Const (First a) (TagTree str)) -> TagTreePosState str a Source #
findTreeT :: Monad f => TagTreePosStateT str f a -> TagTreePosStateT str f b -> (TagTree str -> f (Maybe x)) -> TagTreePosStateT str f x Source #
findTree :: TagTreePosState str a -> TagTreePosState str b -> (TagTree str -> Maybe x) -> TagTreePosState str x Source #
depthFirstFindTreeT :: Monad f => (TagTree str -> f (Maybe x)) -> TagTreePosStateT str f x Source #
depthFirstFindTree :: (TagTree str -> Maybe x) -> TagTreePosState str x Source #
breadthFirstFindTreeT :: Monad f => (TagTree str -> f (Maybe x)) -> TagTreePosStateT str f x Source #
breadthFirstFindTree :: (TagTree str -> Maybe x) -> TagTreePosState str x Source #
findContentUntil :: Monad f => TagTreePosStateT str f a -> (TagTree str -> Bool) -> TagTreePosStateT str f () Source #
findUntil :: Monad f => TagTreePosStateT str f a -> TagTreePosStateT str f b -> TagTreePosStateT str f b Source #
tagBranchLeafText :: TagTreePosState a (a, a) Source #
produces `(x, t)` in `TagBranch x _ [TagLeaf (TagText t)]`