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.

  1. data KafkaConsumer

    hw-kafka-client Kafka.Consumer.Types

    The main type for Kafka consumption, used e.g. to poll and commit messages. Its constructor is intentionally not exposed, instead, one should use newConsumer to acquire such a value.

  2. KafkaConsumer :: Kafka -> KafkaConf -> KafkaConsumer

    hw-kafka-client Kafka.Consumer.Types

    No documentation available.

  3. unConsumerGroupId :: ConsumerGroupId -> Text

    hw-kafka-client Kafka.Consumer.Types

    No documentation available.

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

    hw-kafka-client Kafka.Metadata

    List and describe all consumer groups in cluster.

  5. consumerGroupInfo :: (MonadIO m, HasKafka k) => k -> Timeout -> ConsumerGroupId -> m (Either KafkaError [GroupInfo])

    hw-kafka-client Kafka.Metadata

    Describe a given consumer group.

  6. type family BytesConsumed a :: Nat

    identicon Graphics.Identicon

    The BytesConsumed type function calculates how many bytes are consumed in a given identicon.

  7. data Consumer (n :: Nat)

    identicon Graphics.Identicon

    Consumer is a type that represents an entity that consumes bytes that are available for identicon generation. It's parametrized over a phantom type n which is a natural number on the type level that represents the number of bytes that this entity consumes. At this moment, a Consumer always adds one Layer to an Identicon when attached to it. The number of bytes, specified as type parameter of Identicon type must be completely consumed by a collection of consumers attached to it. To attach a consumer to Identicon, you use the (:+) type operator, see below.

  8. msumFirst :: (MonoidalAlt f, Traversable t) => t (f a) -> f a

    invertible Control.Invertible.Monoidal

    Fold a structure with >| (|<), thus always applying the input to the first (last) item for generation.

  9. msumIndex :: MonoidalAlt f => [f ()] -> f Int

    invertible Control.Invertible.Monoidal

    Try a list of monoidal actions in sequence, producing the index of the first successful action, and evaluating the action with the given index.

  10. msumLast :: (MonoidalAlt f, Traversable t) => t (f a) -> f a

    invertible Control.Invertible.Monoidal

    Fold a structure with >| (|<), thus always applying the input to the first (last) item for generation.

Page 217 of many | Previous | Next