Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

1. foldMap :: Monoid m => (a -> m) -> RadixTree a -> m

   radix-tree	Data.RadixTree.Word8.Strict

   Map each element in the tree to a monoid and combine the results.

2. foldMapWithKey :: Monoid m => (Build -> a -> m) -> RadixTree a -> m

   radix-tree	Data.RadixTree.Word8.Strict

   Map each element in the tree to a monoid and combine the results.

3. ifoldMap :: Monoid m => (Int -> a -> m) -> RAList a -> m

   ral	Data.RAList

   No documentation available.

4. imap :: (Int -> a -> b) -> RAList a -> RAList b

   ral	Data.RAList

   >>> imap (,) $ fromList ['a' .. 'f']
   fromList [(0,'a'),(1,'b'),(2,'c'),(3,'d'),(4,'e'),(5,'f')]
   

5. foldMap1 :: forall a s . Semigroup s => (a -> s) -> NERAList a -> s

   ral	Data.RAList.NonEmpty

   No documentation available.

6. foldr1Map :: (a -> b -> b) -> (a -> b) -> NERAList a -> b

   ral	Data.RAList.NonEmpty

   No documentation available.

7. ifoldMap :: Monoid m => (Int -> a -> m) -> NERAList a -> m

   ral	Data.RAList.NonEmpty

   No documentation available.

8. ifoldMap1 :: forall a s . Semigroup s => (Int -> a -> s) -> NERAList a -> s

   ral	Data.RAList.NonEmpty

   >>> import Data.Semigroup (Min (..))
   

   >>> ifoldMap1 (\_ x -> Min x) $ fromNonEmpty $ 5 :| [3,1,2,4]
   Min {getMin = 1}
   

   >>> ifoldMap1 (\i x -> Min (i + x)) $ fromNonEmpty $ 5 :| [3,1,2,4]
   Min {getMin = 3}
   

9. ifoldr1Map :: (Int -> a -> b -> b) -> (Int -> a -> b) -> NERAList a -> b

   ral	Data.RAList.NonEmpty

   No documentation available.

10. imap :: (Int -> a -> b) -> NERAList a -> NERAList b

    ral	Data.RAList.NonEmpty

    >>> imap (,) (fromNonEmpty ('a' :| ['b'..'f']))
    fromNonEmpty ((0,'a') :| [(1,'b'),(2,'c'),(3,'d'),(4,'e'),(5,'f')])
    

Page 1208 of many | Previous | Next