Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

  1. fromListWithSizeHint :: (HashTable h, Eq k, Hashable k) => Int -> [(k, v)] -> IO (IOHashTable h k v)

    hashtables Data.HashTable.IO

    See the documentation for this function in fromListWithSizeHint.

  2. fromListWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> f v -> f v) -> [DSum k2 f] -> DMap k2 f

    dependent-map Data.Dependent.Map

    O(n*log n). Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey.

  3. fromListN :: IsList l => Int -> [Item l] -> l

    relude Relude.Container.Reexport

    The fromListN function takes the input list's length and potentially uses it to construct the structure l more efficiently compared to fromList. If the given number does not equal to the input list's length the behaviour of fromListN is not specified.

    fromListN (length xs) xs == fromList xs
    

  4. fromLists :: [[a]] -> Matrix a

    matrix Data.Matrix

    Create a matrix from a non-empty list of non-empty lists. Each list must have at least as many elements as the first list. Examples:

    fromLists [ [1,2,3]      ( 1 2 3 )
    , [4,5,6]      ( 4 5 6 )
    , [7,8,9] ] =  ( 7 8 9 )
    
    fromLists [ [1,2,3  ]     ( 1 2 3 )
    , [4,5,6,7]     ( 4 5 6 )
    , [8,9,0  ] ] = ( 8 9 0 )
    

  5. fromListN :: forall (v :: Type -> Type) (n :: Nat) a . (Vector v a, KnownNat n) => [a] -> Maybe (Vector v n a)

    vector-sized Data.Vector.Generic.Sized

    O(n) Convert the first n elements of a list to a vector. The length of the resultant vector is inferred from the type.

  6. fromListN' :: forall (v :: Type -> Type) (n :: Nat) a p . (Vector v a, KnownNat n) => p n -> [a] -> Maybe (Vector v n a)

    vector-sized Data.Vector.Generic.Sized

    O(n) Convert the first n elements of a list to a vector. The length of the resultant vector is given explicitly as a Proxy argument.

  7. fromListN :: forall (n :: Nat) a . (Prim a, KnownNat n) => [a] -> Maybe (Vector n a)

    vector-sized Data.Vector.Primitive.Sized

    O(n) Convert the first n elements of a list to a vector. The length of the resulting vector is inferred from the type.

  8. fromListN' :: forall (n :: Nat) a p . (Prim a, KnownNat n) => p n -> [a] -> Maybe (Vector n a)

    vector-sized Data.Vector.Primitive.Sized

    O(n) Convert the first n elements of a list to a vector. The length of the resulting vector is given explicitly as a Proxy argument.

  9. fromListN :: forall (n :: Nat) a . KnownNat n => [a] -> Maybe (Vector n a)

    vector-sized Data.Vector.Sized

    O(n) Convert the first n elements of a list to a vector. The length of the resulting vector is inferred from the type.

  10. fromListN' :: forall (n :: Nat) a p . KnownNat n => p n -> [a] -> Maybe (Vector n a)

    vector-sized Data.Vector.Sized

    O(n) Convert the first n elements of a list to a vector. The length of the resulting vector is given explicitly as a Proxy argument.

Page 44 of many | Previous | Next