Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. readListFormulas :: Formula -> Maybe ListOrRangeExpression

   xlsx	Codec.Xlsx.Types.DataValidation

   No documentation available.

2. fromList :: List l => [a] -> l a

   List	Data.List.Class

   Convert a list to a MonadPlus

   > fromList [] :: Maybe Int
   Nothing
   > fromList [5] :: Maybe Int
   Just 5
   

3. runList :: List l => l a -> ItemM l (ListItem l a)

   List	Data.List.Class

   No documentation available.

4. toList :: List l => l a -> ItemM l [a]

   List	Data.List.Class

   An action to transform a List to a list

   > runIdentity $ toList "hello!"
   "hello!"
   

5. transformListMonad :: (List l, List k) => (ItemM l (k a) -> ItemM k (k a)) -> l a -> k a

   List	Data.List.Class

   Transform the underlying monad of a list given a way to transform the monad

   > import Data.List.Tree (bfs)
   > bfs (transformListMonad (\(Identity x) -> [x, x]) "hey" :: ListT [] Char)
   "hheeeeyyyyyyyy"
   

6. fromAscList :: (Eq k, Ord p) => [Binding k p] -> PSQ k p

   PSQueue	Data.PSQueue

   O(n) Build a queue from a list of bindings in order of ascending keys. The precondition that the keys are ascending is not checked.

7. fromDistinctAscList :: Ord p => [Binding k p] -> PSQ k p

   PSQueue	Data.PSQueue

   O(n) Build a queue from a list of distinct bindings in order of ascending keys. The precondition that keys are distinct and ascending is not checked.

8. fromList :: (Ord k, Ord p) => [Binding k p] -> PSQ k p

   PSQueue	Data.PSQueue

   O(n log n) Build a queue from a list of bindings.

9. toAscList :: PSQ k p -> [Binding k p]

   PSQueue	Data.PSQueue

   O(n) Convert a queue to a list in ascending order of keys.

10. toDescList :: PSQ k p -> [Binding k p]

    PSQueue	Data.PSQueue

    O(n) Convert a queue to a list in descending order of keys.

Page 155 of many | Previous | Next