Hoogle Search

Within LTS Haskell 24.42 (ghc-9.10.3)

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

Exact lookup

1. all0s :: BitWise a => a

   hw-bits	HaskellWorks.Data.Bits.BitWise

   Bit-wise value of the given type with all bits set to zero

2. all1s :: BitWise a => a

   hw-bits	HaskellWorks.Data.Bits.BitWise

   Bit-wise value of the given type with all bits set to one

3. allConsumerGroupsInfo :: (MonadIO m, HasKafka k) => k -> Timeout -> m (Either KafkaError [GroupInfo])

   hw-kafka-client	Kafka.Metadata

   List and describe all consumer groups in cluster.

4. allTopicsMetadata :: (MonadIO m, HasKafka k) => k -> Timeout -> m (Either KafkaError KafkaMetadata)

   hw-kafka-client	Kafka.Metadata

   Returns metadata for all topics in the cluster

5. alloc :: Region -> IO a -> (a -> IO ()) -> IO (a, Key)

   io-region	Control.IO.Region

   Allocate resource inside the region

6. alloc_ :: Region -> IO a -> (a -> IO ()) -> IO a

   io-region	Control.IO.Region

   The same as alloc, but doesn't return the key

7. allocationLimit :: ThreadOptions -> Maybe ByteCount

   ki-unlifted	Ki.Unlifted

   No documentation available.

8. allowAnti :: AlexPredicate

   language-c-quote	Language.C.Parser.Monad

   No documentation available.

9. allAdjUnique :: Eq a => [a] -> Bool

   list-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
   

10. allAdjUniqueBy :: (a -> a -> Bool) -> [a] -> Bool

    list-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
    

Page 137 of many | Previous | Next