Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. lgeneratorsList' :: LActGen x s => [x]

   lr-acts	Data.Act.Cyclic

   The set of origins of the action LAct x s seen as a list. You can let this function undefined if the set of origins cannot be represented as a list.

   >>> lgeneratorsList' @Int @(Sum Int)
   [0]
   

   To avoid having to use the redundant first type aplication, use lgeneratorsList.

2. rgeneratorsList :: forall s x . RActGen x s => [x]

   lr-acts	Data.Act.Cyclic

   A version of rgeneratorsList' such that the first type application is s.

   >>> rgeneratorsList @(Sum Int) :: [Int]
   [0]
   

3. rgeneratorsList' :: RActGen x s => [x]

   lr-acts	Data.Act.Cyclic

   The set of origins of the action RAct x s seen as a list. You can let this function undefined if the set of origins cannot be represented as a list.

   >>> rgeneratorsList' @(Sum Int) :: [Int]
   [0]
   

4. fromList :: (Ord k, Eq v) => v -> [(k, v)] -> MapWithDefault k v

   mappings	Data.Mapping.MapWithDefault

   No documentation available.

5. fromListWithKey :: (Ord k, Eq v) => v -> (k -> u -> v -> v) -> [(k, u)] -> MapWithDefault k v

   mappings	Data.Mapping.MapWithDefault

   No documentation available.

6. fromAscList :: Eq v => v -> [(k, v)] -> Piecewise k v

   mappings	Data.Mapping.Piecewise

   Assumes the keys are distinct and increasing (but consecutive values may be the same, in which case the intervening keys are removed)

7. fromAscListUnsafe :: v -> [(k, v)] -> Piecewise k v

   mappings	Data.Mapping.Piecewise

   Assumes that the keys are distinct and increasing, and also that consecutive values are distinct

8. fromList :: 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 elements. The list must have exactly length n*m or this returns Nothing. An example:

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

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

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

Page 204 of many | Previous | Next