Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. dmap :: Decoration t => (a -> b) -> t a -> t b

   Agda	Agda.Utils.Functor

   Any decoration is traversable with traverse = traverseF. Just like any Traversable is a functor, so is any decoration, given by just traverseF, a functor.

2. dagComponentMap :: DAG n -> IntMap (SCC n)

   Agda	Agda.Utils.Graph.AdjacencyMap.Unidirectional

   No documentation available.

3. dagNodeMap :: DAG n -> Map n Int

   Agda	Agda.Utils.Graph.AdjacencyMap.Unidirectional

   No documentation available.

4. neighboursMap :: Ord n => n -> Graph n e -> Map n e

   Agda	Agda.Utils.Graph.AdjacencyMap.Unidirectional

   neighboursMap u g consists of all nodes v for which there is an edge from u to v in g, along with the corresponding edge labels. O(log n).

5. type LensMap o i = i -> i -> o -> o

   Agda	Agda.Utils.Lens

   No documentation available.

6. concatMap1 :: (a -> List1 b) -> List1 a -> List1 b

   Agda	Agda.Utils.List1

   No documentation available.

7. unmapListT :: (ListT m a -> ListT n b) -> m (Maybe (a, ListT m a)) -> n (Maybe (b, ListT n b))

   Agda	Agda.Utils.ListT

   Inverse to mapListT.

8. concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]

   Agda	Agda.Utils.Monad

   No documentation available.

9. module Agda.Utils.RangeMap

   Maps containing non-overlapping intervals.

10. class IsBasicRangeMap a m | m -> a

    Agda	Agda.Utils.RangeMap

    A class that is intended to make it easy to swap between different range map implementations. Note that some RangeMap operations are not included in this class.

Page 1115 of many | Previous | Next