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.

  1. unsafeFromList :: forall (f :: Type -> Type) (n :: Nat) a . (CFreeMonoid f, Dom f a) => SNat n -> [a] -> Sized f n a

    sized Data.Sized

    Unsafe version of fromList. If the length of the given list does not equal to n, then something unusual happens. Since 0.7.0.0

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

    sized Data.Sized

    unsafeFromList with the result length inferred. Since 0.7.0.0

  3. fromList :: [a] -> Fix (ListF a)

    srtree Data.SRTree.Recursion

    No documentation available.

  4. stream2list :: StreamF a [a] -> [a]

    srtree Data.SRTree.Recursion

    No documentation available.

  5. toList :: Fix (ListF a) -> [a]

    srtree Data.SRTree.Recursion

    No documentation available.

  6. districtList :: [(Text, StateCode)]

    state-codes Data.StateCodes

    List of districts sorted by alphabetical order, with state code this is ready to be used in a yesod selectField, for example

  7. outlyingAreasList :: [(Text, StateCode)]

    state-codes Data.StateCodes

    List of outlying areas sorted by alphabetical order, with state code this is ready to be used in a yesod selectField, for example

  8. stateList :: [(Text, StateCode)]

    state-codes Data.StateCodes

    List of states sorted by alphabetical order, with state code this is ready to be used in a yesod selectField, for example

  9. fromList :: Ord k => [(Bound k, v)] -> v -> SF k v

    step-function Data.Function.Step

    Create function from list of cases and default value. 

    >>> let f = fromList [(Open 1,2),(Closed 3,4),(Open 4,5)] 6

>>> putSF f
\x -> if
| x <  1    -> 2
| x <= 3    -> 4
| x <  4    -> 5
| otherwise -> 6

    >>> map (f !) [0..10]
[2,4,4,4,6,6,6,6,6,6,6]

  10. fromList :: Ord k => [(k, v)] -> v -> SF k v

    step-function Data.Function.Step.Discrete.Closed

    Create function from list of cases and default value. 

    >>> let f = fromList [(1,2),(3,4)] 5

>>> putSF f
\x -> if
| x <= 1    -> 2
| x <= 3    -> 4
| otherwise -> 5

    >>> map (f !) [0..10]
[2,2,4,4,5,5,5,5,5,5,5]

Page 223 of many | Previous | Next