Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. PointedList :: [a] -> a -> [a] -> PointedList a

   pointedlist	Data.List.PointedList.Circular

   No documentation available.

2. fromList :: [a] -> Maybe (PointedList a)

   pointedlist	Data.List.PointedList.Circular

   Possibly create a Just PointedList if the provided list has at least one element; otherwise, return Nothing. The provided list's head will be the focus of the list, and the rest of list will follow on the right side.

3. fromListEnd :: [a] -> Maybe (PointedList a)

   pointedlist	Data.List.PointedList.Circular

   Possibly create a Just PointedList if the provided list has at least one element; otherwise, return Nothing. The provided list's last element will be the focus of the list, following the rest of the list in order, to the left.

4. fromList :: (Hashable k, Ord k, Ord p) => [(k, p, v)] -> HashPSQ k p v

   psqueues	Data.HashPSQ

   O(n*min(n,W)) Build a queue from a list of (key, priority, value) tuples. If the list contains more than one priority and value for the same key, the last priority and value for the key is retained.

5. toList :: (Hashable k, Ord k, Ord p) => HashPSQ k p v -> [(k, p, v)]

   psqueues	Data.HashPSQ

   O(n) Convert a queue to a list of (key, priority, value) tuples. The order of the list is not specified.

6. fromList :: Ord p => [(Int, p, v)] -> IntPSQ p v

   psqueues	Data.IntPSQ

   O(n*min(n,W)) Build a queue from a list of (key, priority, value) tuples. If the list contains more than one priority and value for the same key, the last priority and value for the key is retained.

7. toList :: IntPSQ p v -> [(Int, p, v)]

   psqueues	Data.IntPSQ

   O(n) Convert a queue to a list of (key, priority, value) tuples. The order of the list is not specified.

8. fromList :: (Ord k, Ord p) => [(k, p, v)] -> OrdPSQ k p v

   psqueues	Data.OrdPSQ

   O(n*log n) Build a queue from a list of (key, priority, value) tuples. If the list contains more than one priority and value for the same key, the last priority and value for the key is retained.

9. toAscList :: OrdPSQ k p v -> [(k, p, v)]

   psqueues	Data.OrdPSQ

   O(n) Convert to a list in ascending order by key.

10. toList :: OrdPSQ k p v -> [(k, p, v)]

    psqueues	Data.OrdPSQ

    O(n) Convert a queue to a list of (key, priority, value) tuples. The order of the list is not specified.

Page 105 of many | Previous | Next