Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. mapSearcher :: Hashable b => (a -> b) -> Searcher a -> Searcher b

   alfred-margaret	Data.Text.AhoCorasick.Searcher

   Modify the values associated with the needles.

2. mapAccumL :: (Traversable t, Backprop b, Backprop c, Reifies s W) => (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

   backprop	Prelude.Backprop

   Lifted version of mapAccumL. Prior to v0.2.3, required a Backprop constraint on t b.

3. mapAccumR :: (Traversable t, Backprop b, Backprop c, Reifies s W) => (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

   backprop	Prelude.Backprop

   Lifted version of mapAccumR. Prior to v0.2.3, required a Backprop constraint on t b.

4. mapAccumL :: (Traversable t, Reifies s W) => AddFunc b -> AddFunc c -> ZeroFunc b -> ZeroFunc c -> (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

   backprop	Prelude.Backprop.Explicit

   mapAccumL, but taking explicit add and zero.

5. mapAccumR :: (Traversable t, Reifies s W) => AddFunc b -> AddFunc c -> ZeroFunc b -> ZeroFunc c -> (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

   backprop	Prelude.Backprop.Explicit

   mapAccumR, but taking explicit add and zero.

6. mapAccumL :: (Traversable t, Num b, Num c, Reifies s W) => (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

   backprop	Prelude.Backprop.Num

   mapAccumL, but with Num constraints instead of Backprop constraints. Prior to v0.2.3, required a Num constraint on t b.

7. mapAccumR :: (Traversable t, Num b, Num c, Reifies s W) => (BVar s a -> BVar s b -> (BVar s a, BVar s c)) -> BVar s a -> BVar s (t b) -> (BVar s a, BVar s (t c))

   backprop	Prelude.Backprop.Num

   mapAccumR, but with Num constraints instead of Backprop constraints. Prior to v0.2.3, required a Num constraint on t b.

8. mapMaybe :: (a -> Maybe b) -> Trie a -> Maybe (Trie b)

   bcp47	Data.BCP47.Trie

   No documentation available.

9. mapMaybe :: (a -> Maybe b) -> Trie a -> Maybe (Trie b)

   bcp47	Data.BCP47.Trie.Internal

   No documentation available.

10. mapMaybe2 :: (a -> Maybe b) -> Trie2 a -> Maybe (Trie2 b)

    bcp47	Data.BCP47.Trie.Internal

    No documentation available.

Page 236 of many | Previous | Next