Hoogle Search

Within LTS Haskell 24.26 (ghc-9.10.3)

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

Exact lookup

1. fromList :: Ord k => T [] (k, a) -> T k a

   non-empty	Data.NonEmpty.Map

   Warning: Dangerous because it silently drops colliding key/value pairs. Better use fromListWith.

2. fromListWith :: Ord k => (a -> a -> a) -> T [] (k, a) -> T k a

   non-empty	Data.NonEmpty.Map

   \xs -> Map.fromListWith (++) (NonEmpty.flatten xs) == NonEmptyMap.flatten (NonEmptyMap.fromListWith (++) (xs::NonEmpty.T [] (Int,String)))
   

3. toAscList :: T k a -> T [] (k, a)

   non-empty	Data.NonEmpty.Map

   forAllNonEmptyMap $ \m -> NonEmpty.flatten (NonEmptyMap.toAscList m) == Map.toAscList (NonEmptyMap.flatten m)
   

4. fromAscList :: Ord a => T [] a -> T a

   non-empty	Data.NonEmpty.Set

   No documentation available.

5. fromList :: Ord a => T [] a -> T a

   non-empty	Data.NonEmpty.Set

   No documentation available.

6. toAscList :: T a -> T [] a

   non-empty	Data.NonEmpty.Set

   No documentation available.

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

   hmatrix	Numeric.LinearAlgebra.Data

   No documentation available.

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

   hmatrix	Numeric.LinearAlgebra.Data

   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 ]
   

9. toList :: Storable a => Vector a -> [a]

   hmatrix	Numeric.LinearAlgebra.Data

   No documentation available.

10. toLists :: Element t => Matrix t -> [[t]]

    hmatrix	Numeric.LinearAlgebra.Data

    the inverse of fromLists

Page 74 of many | Previous | Next