Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

Exact lookup

1. fromList :: forall input (length :: Nat) output . (KnownNat length, ILL input length output) => [output] -> Maybe input

   indexed-list-literals	Data.IndexedListLiterals

   > fromList [1,2,3] :: Maybe (Int, Int, Int)
   Just (1,2,3)
   

   > fromList ["word","up"] :: Maybe (String, String, String)
   Nothing
   

   > fromList ['z'] :: Maybe (Only Char)
   Just (Only 'z')
   

2. fromList :: [Int] -> IntSet

   intern	Data.Interned.IntSet

   O(n*min(n,W)). Create a set from a list of integers.

3. fromList :: [Item (KVITable v)] -> KVITable v

   kvitable	Data.KVITable

   Converts a list of ([(Key,Val)], Value) tuples to a KVI table.

4. fromList :: SymEnv -> [(KVar, a)] -> [(KVar, b)] -> [(KVar, Hyp)] -> HashMap KVar IBindEnv -> [(BindId, EbindSol)] -> SEnv (BindId, Sort) -> Sol a b

   liquid-fixpoint	Language.Fixpoint.Types.Solutions

   Create a Solution ---------------------------------------------------------

5. fromList :: [(Path, a)] -> Trie a

   liquid-fixpoint	Language.Fixpoint.Utils.Trie

   No documentation available.

6. fromList :: Ord key => Maybe Integer -> [(key, val)] -> LRU key val

   lrucache	Data.Cache.LRU

   Build a new LRU from the given maximum size and list of contents, in order from most recently accessed to least recently accessed.

7. fromList :: Ord key => Maybe Integer -> [(key, val)] -> IO (AtomicLRU key val)

   lrucache	Data.Cache.LRU.IO

   Build a new LRU from the optional maximum size and list of contents. See fromList for the semantics.

8. fromList :: Ord key => Maybe Integer -> [(key, val)] -> IO (AtomicLRU key val)

   lrucache	Data.Cache.LRU.IO.Internal

   Build a new LRU from the optional maximum size and list of contents. See fromList for the semantics.

9. fromList :: Ord key => Maybe Integer -> [(key, val)] -> LRU key val

   lrucache	Data.Cache.LRU.Internal

   Build a new LRU from the given maximum size and list of contents, in order from most recently accessed to least recently accessed.

10. fromList :: [a] -> AList a

    monad-par-extras	Control.Monad.Par.AList

    O(1) convert an ordinary list to an AList

Page 23 of many | Previous | Next