tagsoup-navigate 0.1.0.1 → 0.1.0.2
raw patch · 3 files changed
+20/−31 lines, 3 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: after :: Monad f => TagTreePosStateT x f [TagTree x]
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: after :: TagTreePosState x [TagTree x]
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: before :: Monad f => TagTreePosStateT x f [TagTree x]
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: before :: TagTreePosState x [TagTree x]
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: content :: Monad f => TagTreePosStateT x f (TagTree x)
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: content :: TagTreePosState x (TagTree x)
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: firstChild :: Monad f => TagTreePosStateT str f ()
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: firstChild :: TagTreePosState str ()
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: getTagTreePos :: Applicative f => TagTreePosStateT x f (TagTree x)
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: getTagTreePos :: TagTreePosState x (TagTree x)
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: getsTagTreePosState :: Applicative f => (TagTreePos x -> Maybe a) -> TagTreePosStateT x f a
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: getsTagTreePosState :: (TagTreePos x -> Maybe a) -> TagTreePosState x a
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: lastChild :: Monad f => TagTreePosStateT str f ()
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: lastChild :: TagTreePosState str ()
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: maybeTagTreePosState :: Applicative f => Maybe a -> TagTreePosStateT x f a
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: maybeTagTreePosState :: Maybe a -> TagTreePosState x a
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: modifyTagTreePosState :: Applicative f => (TagTreePos x -> Maybe (TagTreePos x)) -> TagTreePosStateT x f ()
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: modifyTagTreePosState :: (TagTreePos x -> Maybe (TagTreePos x)) -> TagTreePosState x ()
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: nextSibling :: Monad f => TagTreePosStateT str f ()
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: nextSibling :: TagTreePosState str ()
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: parent :: Monad f => TagTreePosStateT str f ()
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: parent :: TagTreePosState str ()
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: parents :: Monad f => TagTreePosStateT x f [TagTreePosParent x]
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: parents :: TagTreePosState x [TagTreePosParent x]
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: prevSibling :: Monad f => TagTreePosStateT str f ()
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: prevSibling :: TagTreePosState str ()
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: putTagTreePosState :: Applicative f => Maybe (TagTreePos x) -> TagTreePosStateT x f ()
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: putTagTreePosState :: Maybe (TagTreePos x) -> TagTreePosState x ()
- Text.HTML.TagSoup.Navigate.Types.TagTreePosState: root :: Monad f => TagTreePosStateT str f ()
+ Text.HTML.TagSoup.Navigate.Types.TagTreePosState: root :: TagTreePosState str ()
Files
- changelog.md +4/−0
- src/Text/HTML/TagSoup/Navigate/Types/TagTreePosState.hs +15/−30
- tagsoup-navigate.cabal +1/−1
changelog.md view
@@ -1,3 +1,7 @@+0.1.0.2++* change `TagPosTreeState` combinators to use `Identity`.+ 0.1.0.1 * more functions.
@@ -231,9 +231,8 @@ TagTreePosStateT (fmap (fmap (\q -> (q, ()))) . k) modifyTagTreePosState ::- Applicative f => (TagTreePos x -> Maybe (TagTreePos x))- -> TagTreePosStateT x f ()+ -> TagTreePosState x () modifyTagTreePosState k = modifyTagTreePosStateT (pure . k) @@ -245,9 +244,8 @@ TagTreePosStateT (\p -> fmap (fmap (\a -> (p, a))) (k p)) getsTagTreePosState ::- Applicative f => (TagTreePos x -> Maybe a)- -> TagTreePosStateT x f a+ -> TagTreePosState x a getsTagTreePosState k = getsTagTreePosStateT (pure . k) @@ -259,9 +257,8 @@ getsTagTreePosStateT . pure maybeTagTreePosState ::- Applicative f => Maybe a- -> TagTreePosStateT x f a+ -> TagTreePosState x a maybeTagTreePosState = getsTagTreePosState . pure @@ -273,75 +270,63 @@ TagTreePosStateT (pure (fmap (fmap (\p -> (p, ()))) x)) putTagTreePosState ::- Applicative f => Maybe (TagTreePos x)- -> TagTreePosStateT x f ()+ -> TagTreePosState x () putTagTreePosState = putTagTreePosStateT . pure getTagTreePos ::- Applicative f =>- TagTreePosStateT x f (TagTree x)+ TagTreePosState x (TagTree x) getTagTreePos = liftTagTreePosState getTagTreePos root ::- Monad f =>- TagTreePosStateT str f ()+ TagTreePosState str () root = modify (view (from tagsoupTagTreePos) . TagSoup.root . view tagsoupTagTreePos) parent ::- Monad f =>- TagTreePosStateT str f ()+ TagTreePosState str () parent = modifyTagTreePosState (fmap (view (from tagsoupTagTreePos)) . TagSoup.parent . view tagsoupTagTreePos) firstChild ::- Monad f =>- TagTreePosStateT str f ()+ TagTreePosState str () firstChild = modifyTagTreePosState (fmap (view (from tagsoupTagTreePos)) . TagSoup.firstChild . view tagsoupTagTreePos) lastChild ::- Monad f =>- TagTreePosStateT str f ()+ TagTreePosState str () lastChild = modifyTagTreePosState (fmap (view (from tagsoupTagTreePos)) . TagSoup.lastChild . view tagsoupTagTreePos) prevSibling ::- Monad f =>- TagTreePosStateT str f ()+ TagTreePosState str () prevSibling = modifyTagTreePosState (fmap (view (from tagsoupTagTreePos)) . TagSoup.prevSibling . view tagsoupTagTreePos) nextSibling ::- Monad f =>- TagTreePosStateT str f ()+ TagTreePosState str () nextSibling = modifyTagTreePosState (fmap (view (from tagsoupTagTreePos)) . TagSoup.nextSibling . view tagsoupTagTreePos) content ::- Monad f =>- TagTreePosStateT x f (TagTree x)+ TagTreePosState x (TagTree x) content = gets (view tagTreePosContent) before ::- Monad f =>- TagTreePosStateT x f [TagTree x]+ TagTreePosState x [TagTree x] before = gets (view tagTreePosBefore) after ::- Monad f =>- TagTreePosStateT x f [TagTree x]+ TagTreePosState x [TagTree x] after = gets (view tagTreePosAfter) parents ::- Monad f =>- TagTreePosStateT x f [TagTreePosParent x]+ TagTreePosState x [TagTreePosParent x] parents = gets (view tagTreePosParents)
@@ -1,5 +1,5 @@ name: tagsoup-navigate-version: 0.1.0.1+version: 0.1.0.2 synopsis: Tagsoup Navigate description: Lenses and data types for navigating tagsoup license: BSD3