Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. fromList :: Ord k => [([k], v)] -> TreeMap k v

   tasty-autocollect	Test.Tasty.AutoCollect.Utils.TreeMap

   Convert the given list of values into a TreeMap. For example, fromList [[A, B, C], [A, B], [A, C, D], [Z]] would become TreeMap { value = Nothing , children = Map.fromList [ (A, TreeMap { value = Nothing , children = Map.fromList [ (B, TreeMap { value = Just ... , children = Map.fromList (C, [ TreeMap { value = Just ... , children = Map.empty } ]) }) , (C, TreeMap { value = Nothing , children = Map.fromList [ (D, TreeMap { value = Just ... , children = Map.empty }) ] }) ] }) , (Z, TreeMap { value = Just ... , children = Map.empty }) ] }

2. fromList :: [a] -> Pattern a

   tidal	Sound.Tidal.Boot

   Turns a list of values into a pattern, playing one of them per cycle. The following are equivalent:

   d1 $ n (fromList [0, 1, 2]) # s "superpiano"
   d1 $ n "<0 1 2>" # s "superpiano"
   

3. fromList :: [(Key, a)] -> PrefixMap a

   tomland	Toml.Type.PrefixTree

   Constructs PrefixMap structure from the given list of Key and value pairs.

4. fromList :: Ord c => [([c], a)] -> TMap c a

   trie-simple	Data.Trie.Map

   No documentation available.

5. fromList :: Ord c => [[c]] -> TSet c

   trie-simple	Data.Trie.Set

   No documentation available.

6. fromList :: (Eq k, Hashable k) => [(k, v)] -> IO (Map k v)

   ttrie	Control.Concurrent.STM.Map

   O(n * log n). Construct a map from a list of key/value pairs.

7. fromList :: Unboxable a => [a] -> Vector a

   unboxing-vector	Data.Vector.Unboxing

   No documentation available.

8. fromList :: forall (n :: Nat) a . SNatI n => [a] -> Maybe (Vec n a)

   vec	Data.Vec.DataFamily.SpineStrict

   Convert list [a] to Vec n a. Returns Nothing if lengths don't match exactly.

   >>> fromList "foo" :: Maybe (Vec N.Nat3 Char)
   Just ('f' ::: 'o' ::: 'o' ::: VNil)
   

   >>> fromList "quux" :: Maybe (Vec N.Nat3 Char)
   Nothing
   

   >>> fromList "xy" :: Maybe (Vec N.Nat3 Char)
   Nothing
   

9. fromList :: forall (n :: Nat) a . SNatI n => [a] -> Maybe (Vec n a)

   vec	Data.Vec.Lazy

   Convert list [a] to Vec n a. Returns Nothing if lengths don't match exactly.

   >>> fromList "foo" :: Maybe (Vec N.Nat3 Char)
   Just ('f' ::: 'o' ::: 'o' ::: VNil)
   

   >>> fromList "quux" :: Maybe (Vec N.Nat3 Char)
   Nothing
   

   >>> fromList "xy" :: Maybe (Vec N.Nat3 Char)
   Nothing
   

10. fromList :: forall (n :: Nat) a . SNatI n => [a] -> Maybe (Vec n a)

    vec	Data.Vec.Lazy.Inline

    Convert list [a] to Vec n a. Returns Nothing if lengths don't match exactly.

    >>> fromList "foo" :: Maybe (Vec N.Nat3 Char)
    Just ('f' ::: 'o' ::: 'o' ::: VNil)
    

    >>> fromList "quux" :: Maybe (Vec N.Nat3 Char)
    Nothing
    

    >>> fromList "xy" :: Maybe (Vec N.Nat3 Char)
    Nothing
    

Page 35 of many | Previous | Next