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.
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!"
transformListMonad :: (List l, List k) => (ItemM l (k a) -> ItemM k (k a)) -> l a -> k aList 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"
fromAscList :: (Eq k, Ord p) => [Binding k p] -> PSQ k pPSQueue 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.
fromDistinctAscList :: Ord p => [Binding k p] -> PSQ k pPSQueue 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.
fromList :: (Ord k, Ord p) => [Binding k p] -> PSQ k pPSQueue Data.PSQueue O(n log n) Build a queue from a list of bindings.
toAscList :: PSQ k p -> [Binding k p]PSQueue Data.PSQueue O(n) Convert a queue to a list in ascending order of keys.
toDescList :: PSQ k p -> [Binding k p]PSQueue Data.PSQueue O(n) Convert a queue to a list in descending order of keys.
toList :: PSQ k p -> [Binding k p]PSQueue Data.PSQueue O(n) Convert a queue to a list.
fromAscList :: (Eq k, Ord p) => [Binding k p] -> PSQ k pPSQueue Data.PSQueue.Internal 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.
fromDistinctAscList :: Ord p => [Binding k p] -> PSQ k pPSQueue Data.PSQueue.Internal 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.