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. foldMap1 :: forall s a (n :: Nat) . Semigroup s => (a -> s) -> Tree n a -> s

   ral	Data.RAVec.Tree

   No documentation available.

2. foldr1Map :: forall a b (n :: Nat) . (a -> b -> b) -> (a -> b) -> Tree n a -> b

   ral	Data.RAVec.Tree

   No documentation available.

3. ifoldMap :: forall m (n :: Nat) a . Monoid m => (Wrd n -> a -> m) -> Tree n a -> m

   ral	Data.RAVec.Tree

   No documentation available.

4. ifoldMap1 :: forall s (n :: Nat) a . Semigroup s => (Wrd n -> a -> s) -> Tree n a -> s

   ral	Data.RAVec.Tree

   No documentation available.

5. ifoldr1Map :: forall (n :: Nat) a b . (Wrd n -> a -> b -> b) -> (Wrd n -> a -> b) -> Tree n a -> b

   ral	Data.RAVec.Tree

   No documentation available.

6. imap :: forall (n :: Nat) a b . (Wrd n -> a -> b) -> Tree n a -> Tree n b

   ral	Data.RAVec.Tree

   >>> imap (,) $ Node (Leaf True) (Leaf False)
   Node (Leaf (0b0,True)) (Leaf (0b1,False))
   

7. foldMap :: forall a (n :: Nat) m . (Monoid m, SNatI n) => (a -> m) -> Tree n a -> m

   ral	Data.RAVec.Tree.DF

   See Foldable.

8. foldMap1 :: forall s a (n :: Nat) . (Semigroup s, SNatI n) => (a -> s) -> Tree n a -> s

   ral	Data.RAVec.Tree.DF

   See Foldable1.

9. foldr1Map :: forall a b (n :: Nat) . SNatI n => (a -> b -> b) -> (a -> b) -> Tree n a -> b

   ral	Data.RAVec.Tree.DF

   No documentation available.

10. ifoldMap :: forall a (n :: Nat) m . (Monoid m, SNatI n) => (Wrd n -> a -> m) -> Tree n a -> m

    ral	Data.RAVec.Tree.DF

    See FoldableWithIndex.

Page 1211 of many | Previous | Next