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.
fromList :: (Hashable k, Ord k, Ord p) => [(k, p, v)] -> HashPSQ k p vpsqueues 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.
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.
fromList :: Ord p => [(Int, p, v)] -> IntPSQ p vpsqueues 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.
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.
fromList :: (Ord k, Ord p) => [(k, p, v)] -> OrdPSQ k p vpsqueues 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.
toAscList :: OrdPSQ k p v -> [(k, p, v)]psqueues Data.OrdPSQ O(n) Convert to a list in ascending order by key.
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.
toList :: FastMutableIntMap a -> IO [(Int, a)]reflex Data.FastMutableIntMap No documentation available.
-
swagger2 Data.Swagger No documentation available.
MimeList :: [MediaType] -> MimeListswagger2 Data.Swagger No documentation available.