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. fmapTCMT :: forall (m :: Type -> Type) a b . Functor m => (a -> b) -> TCMT m a -> TCMT m b

   Agda	Agda.TypeChecking.Monad.Base

   No documentation available.

2. openThingCheckpointMap :: Open a -> Map CheckpointId Substitution

   Agda	Agda.TypeChecking.Monad.Base

   No documentation available.

3. type PragmaPolarities = List1 Ranged Occurrence

   Agda	Agda.TypeChecking.Positivity.Occurrence

   List of polarities stemming from POLARITY pragma.

4. foldMapA :: (Alternative f, Foldable t) => (a -> f b) -> t a -> f b

   Agda	Agda.Utils.Applicative

   Branch over a Foldable collection of values using the supplied action.

5. module Agda.Utils.BiMap

   Partly invertible finite maps. Time complexities are given under the assumption that all relevant instance functions, as well as arguments of function type, take constant time, and "n" is the number of keys involved in the operation.

6. data BiMap k v

   Agda	Agda.Utils.BiMap

   Finite maps from k to v, with a way to quickly get from v to k for certain values of type v (those for which tag is defined). Every value of this type must satisfy biMapInvariant.

7. BiMap :: !Map k v -> !Map (Tag v) k -> BiMap k v

   Agda	Agda.Utils.BiMap

   No documentation available.

8. biMapBack :: BiMap k v -> !Map (Tag v) k

   Agda	Agda.Utils.BiMap

   No documentation available.

9. biMapInvariant :: (Eq k, Eq v, Ord (Tag v), HasTag v) => BiMap k v -> Bool

   Agda	Agda.Utils.BiMap

   The invariant for BiMap.

10. biMapThere :: BiMap k v -> !Map k v

    Agda	Agda.Utils.BiMap

    No documentation available.

Page 1114 of many | Previous | Next