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.

  1. toList :: PSQ k p -> [Binding k p]

    PSQueue Data.PSQueue

    O(n) Convert a queue to a list.

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

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

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

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

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

    PSQueue Data.PSQueue.Internal

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

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

    PSQueue Data.PSQueue.Internal

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

  6. toAscLists :: PSQ k p -> Sequ (Binding k p)

    PSQueue Data.PSQueue.Internal

    No documentation available.

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

    PSQueue Data.PSQueue.Internal

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

  8. toDescLists :: PSQ k p -> Sequ (Binding k p)

    PSQueue Data.PSQueue.Internal

    No documentation available.

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

    PSQueue Data.PSQueue.Internal

    O(n) Convert a queue to a list.

  10. fromList :: [a] -> Stream a

    Stream Data.Stream

    The fromList converts an infinite list to a stream. Beware: Passing a finite list, will cause an error.

Page 156 of many | Previous | Next