Hoogle Search
Within LTS Haskell 24.67 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
allTopicsMetadata :: (MonadIO m, HasKafka k) => k -> Timeout -> m (Either KafkaError KafkaMetadata)hw-kafka-client Kafka.Metadata Returns metadata for all topics in the cluster
alloc :: Region -> IO a -> (a -> IO ()) -> IO (a, Key)io-region Control.IO.Region Allocate resource inside the region
alloc_ :: Region -> IO a -> (a -> IO ()) -> IO aio-region Control.IO.Region The same as alloc, but doesn't return the key
allocationLimit :: ThreadOptions -> Maybe ByteCountki-unlifted Ki.Unlifted No documentation available.
-
language-c-quote Language.C.Parser.Monad No documentation available.
allAdjUnique :: Eq a => [a] -> Boollist-predicate Data.List.Predicate O(n). Whether all adjacent pairs of elements are different. Useful for determining whether a sorted list is all unique.
>>> allAdjUnique [1, 2, 3, 2] True >>> allAdjUnique [1, 2, 2, 3] False >>> allAdjUnique [] True >>> allAdjUnique [1] True
allAdjUniqueBy :: (a -> a -> Bool) -> [a] -> Boollist-predicate Data.List.Predicate O(n). Like allAdjUnique, with a custom equality test.
>>> allAdjUniqueBy ((==) `on` head) ["apple", "bow", "cat", "ant"] True >>> allAdjUniqueBy ((==) `on` head) ["apple", "ant", "bow", "cat"] False
allEqual :: Eq a => [a] -> Boollist-predicate Data.List.Predicate O(n). Whether the elements are all equal.
>>> allEqual [1..] False >>> allEqual [3, 3, 3, 3] True >>> allEqual [] True >>> allEqual [1] True
allEqualBy :: (a -> a -> Bool) -> [a] -> Boollist-predicate Data.List.Predicate O(n). Like allEqual, with a custom equality test.
>>> allEqualBy ((==) `on` (`mod` 10)) [3, 13, 23] True >>> allEqualBy ((==) `on` (`mod` 10)) [3, 13, 24] False
allUnique :: Ord a => [a] -> Boollist-predicate Data.List.Predicate O(n log(n)). Whether the elements are all unique.
>>> allUnique [1, 2, 5, 7] True >>> allUnique [1, 2, 5, 2] False >>> allUnique [] True >>> allUnique [1] True