Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. fromList :: Ord a => [a] -> Set a

   rio	RIO.Set

   Create a set from a list of elements. If the elements are ordered, a linear-time implementation is used.

2. fromList :: Vector v a => [a] -> v a

   rio	RIO.Vector

   No documentation available.

3. fromList :: [a] -> Vector a

   rio	RIO.Vector.Boxed

   No documentation available.

4. fromList :: Storable a => [a] -> Vector a

   rio	RIO.Vector.Storable

   No documentation available.

5. fromList :: Unbox a => [a] -> Vector a

   rio	RIO.Vector.Unboxed

   No documentation available.

6. fromList :: (HashTable h, Eq k, Hashable k) => [(k, v)] -> ST s (h s k v)

   hashtables	Data.HashTable.Class

   Create a hash table from a list of key-value pairs. O(n).

7. fromList :: (HashTable h, Eq k, Hashable k) => [(k, v)] -> IO (IOHashTable h k v)

   hashtables	Data.HashTable.IO

   See the documentation for this function in fromList.

8. fromList :: Indexed sh => sh -> [Index sh] -> Array sh

   comfort-array	Data.Array.Comfort.Bool

   No documentation available.

9. fromList :: C sh => sh -> [a] -> Array sh a

   comfort-array	Data.Array.Comfort.Boxed

   No documentation available.

10. fromList :: C sh => sh -> [a] -> Array sh a

    comfort-array	Data.Array.Comfort.Boxed.Unchecked

    No documentation available.

Page 4 of many | Previous | Next