Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. module Data.FixedLengthList

   Word with fixed length lists constructed from NonEmpty and Empty types.

2. toList :: forall (f :: Type -> Type) a . Foldable f => T f a -> [a]

   non-empty	Data.NonEmpty

   No documentation available.

3. fromAscList :: Ord k => T [] (k, a) -> T k a

   non-empty	Data.NonEmpty.Map

   forAllNonEmptyMap $ \m -> NonEmptyMap.fromAscList (NonEmptyMap.toAscList m) == m
   

4. 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.

5. 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)))
   

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

   non-empty	Data.NonEmpty.Map

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

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

   non-empty	Data.NonEmpty.Set

   No documentation available.

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

   non-empty	Data.NonEmpty.Set

   No documentation available.

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

   non-empty	Data.NonEmpty.Set

   No documentation available.

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

    hmatrix	Numeric.LinearAlgebra.Data

    No documentation available.

Page 74 of many | Previous | Next