Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. freeList :: FrozenDictionary (ks :: Type -> Type) k (vs :: Type -> Type) v -> !Int

   vector-hashtables	Data.Vector.Hashtables.Internal

   No documentation available.

2. fromList :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => [(k, v)] -> m (Dictionary (PrimState m) ks k vs v)

   vector-hashtables	Data.Vector.Hashtables.Internal

   O(n) Convert list to a Dictionary.

3. getFreeList :: Int

   vector-hashtables	Data.Vector.Hashtables.Internal

   No documentation available.

4. toList :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => Dictionary (PrimState m) ks k vs v -> m [(k, v)]

   vector-hashtables	Data.Vector.Hashtables.Internal

   O(n) Convert Dictionary to a list.

5. type ValidationList = [Text]

   xlsx	Codec.Xlsx.Types.DataValidation

   No documentation available.

6. ValidationTypeList :: ListOrRangeExpression -> ValidationType

   xlsx	Codec.Xlsx.Types.DataValidation

   No documentation available.

7. maybePlainValidationList :: ValidationType -> Maybe ValidationList

   xlsx	Codec.Xlsx.Types.DataValidation

   Attempt to obtain a plain list expression

8. readListFormulas :: Formula -> Maybe ListOrRangeExpression

   xlsx	Codec.Xlsx.Types.DataValidation

   No documentation available.

9. fromList :: List l => [a] -> l a

   List	Data.List.Class

   Convert a list to a MonadPlus

   > fromList [] :: Maybe Int
   Nothing
   > fromList [5] :: Maybe Int
   Just 5
   

10. runList :: List l => l a -> ItemM l (ListItem l a)

    List	Data.List.Class

    No documentation available.

Page 154 of many | Previous | Next