Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. foldMapFC :: forall f m . (FoldableFC t, Monoid m) => (forall (x :: k) . () => f x -> m) -> forall (x :: l) . () => t f x -> m

   parameterized-utils	Data.Parameterized.TraversableFC

   Map each element of the structure to a monoid, and combine the results.

2. foldMapFCDefault :: (TraversableFC t, Monoid m) => (forall (x :: k) . () => f x -> m) -> forall (x :: l) . () => t f x -> m

   parameterized-utils	Data.Parameterized.TraversableFC

   This function may be used as a value for foldMap in a Foldable instance.

3. ifoldMapFC :: forall f m (z :: l) . (FoldableFCWithIndex t, Monoid m) => (forall (x :: k) . () => IndexF (t f z) x -> f x -> m) -> t f z -> m

   parameterized-utils	Data.Parameterized.TraversableFC.WithIndex

   Like foldMapFC, but with an index.

   foldMapFC f ≡ ifoldMapFC (const f)
   

4. imapFC :: forall f g (z :: l) . FunctorFCWithIndex t => (forall (x :: k) . () => IndexF (t f z) x -> f x -> g x) -> t f z -> t g z

   parameterized-utils	Data.Parameterized.TraversableFC.WithIndex

   Like fmapFC, but with an index.

   fmapFC f ≡ imapFC (const f)
   

5. contextMap :: (PointedList a -> b) -> PointedList a -> PointedList b

   pointedlist	Data.List.PointedList

   Map over the PointedLists created via positions, such that f is called with each element of the list focused in the provided PointedList. An example makes this easier to understand:

   contextMap atStart (fromJust $ fromList [1..5])
   

6. contextMap :: (PointedList a -> b) -> PointedList a -> PointedList b

   pointedlist	Data.List.PointedList.Circular

   Map over the PointedLists created via positions, such that f is called with each element of the list focused in the provided PointedList. An example makes this easier to understand:

   contextMap atStart (fromJust $ fromList [1..5])
   

7. foldMapBuilder :: Vector v a => (a -> Builder) -> v a -> Builder

   proto-lens	Data.ProtoLens.Encoding.Bytes

   Loop over the elements of a vector and concatenate the resulting Builders. This function has been hand-tuned to perform better than a naive implementation using, e.g., Vector.foldr or a manual loop.

8. unsafeMapMonotonic :: (k -> p -> v -> (q, w)) -> HashPSQ k p v -> HashPSQ k q w

   psqueues	Data.HashPSQ

   O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.

9. unsafeMapMonotonic :: (Key -> p -> v -> (q, w)) -> IntPSQ p v -> IntPSQ q w

   psqueues	Data.IntPSQ

   O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.

10. unsafeMapMonotonic :: forall k p q v w . (k -> p -> v -> (q, w)) -> OrdPSQ k p v -> OrdPSQ k q w

    psqueues	Data.OrdPSQ

    O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.

Page 582 of many | Previous | Next