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. fromListWithKey :: (Ord k, Eq v) => v -> (k -> u -> v -> v) -> [(k, u)] -> MapWithDefault k v

   mappings	Data.Mapping.MapWithDefault

   No documentation available.

2. fromListUnsafe :: forall (m :: Nat) (n :: Nat) a . (KnownNat m, KnownNat n) => [a] -> Matrix m n a

   matrix-static	Data.Matrix.Static

   Create a matrix from a non-empty list given the desired size. The list must have at least rows*cols elements. An example:

   fromListUnsafe [1..9] :: Matrix 3 3 Int
   ( 1 2 3 )
   ( 4 5 6 )
   ( 7 8 9 )
   

3. fromLists :: forall (m :: Nat) (n :: Nat) a . (KnownNat m, KnownNat n) => [[a]] -> Maybe (Matrix m n a)

   matrix-static	Data.Matrix.Static

   Create a matrix from a list of rows. The list must have exactly m lists of length n. Nothing is returned otherwise Example:

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

4. fromListsUnsafe :: forall a (m :: Nat) (n :: Nat) . [[a]] -> Matrix m n a

   matrix-static	Data.Matrix.Static

   Create a matrix from a list of rows. The list must have exactly m lists of length n. If this does not hold, the resulting Matrix will have different static dimensions that the runtime dimension and will result in hard to debug errors. Use fromLists whenever you're unsure. Example:

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

5. fromListWith :: Ord k => ([v] -> c v) -> [(k, v)] -> Multimap c k v

   more-containers	Data.Multimap

   O(n * log n) Transforms a list of entries into a multimap, combining the values for each key into the chosen collection. The values are in the same order as in the original list.

6. fromLists :: Element t => [[t]] -> Matrix t

   qchas	QC

   Creates a Matrix from a list of lists (considered as rows).

   >>> fromLists [[1,2],[3,4],[5,6]]
   (3><2)
   [ 1.0, 2.0
   , 3.0, 4.0
   , 5.0, 6.0 ]
   

7. fromListDv :: Unbox a => [a] -> DVector a

   rp-tree	Data.RPTree

   No documentation available.

8. fromListSv :: Unbox a => Int -> [(Int, a)] -> SVector a

   rp-tree	Data.RPTree

   (Unsafe) Pack a SVector from its vector dimension and components Note : the relevant invariants are not checked :

   • vector components are _assumed_ to be in increasing order
   • vector dimension is larger than any component index

9. fromListUnbalanced :: [a] -> Vector a

   rrb-vector	Data.RRBVector.Internal.Debug

   Create a new unbalanced vector from a list. Note that it is not possbible to create an invalid Vector with this function.

10. fromList' :: forall (f :: Type -> Type) (n :: Nat) a . (Dom f a, CFreeMonoid f, KnownNat n) => [a] -> Maybe (Sized f n a)

    sized	Data.Sized

    fromList with the result length inferred. Since 0.7.0.0

Page 60 of many | Previous | Next