cats.effect.std.Queue
See theQueue companion object
A purely functional, concurrent data structure which allows insertion and retrieval of
elements of type A
in a first-in-first-out (FIFO) manner.
Depending on the type of queue constructed, the Queue#offer operation can block semantically until sufficient capacity in the queue becomes available.
The Queue#take operation semantically blocks when the queue is empty.
The Queue#tryOffer and Queue#tryTake allow for usecases which want to avoid fiber blocking a fiber.
Attributes
- Companion:
- object
- Source:
- Queue.scala
- Graph
- Supertypes
- Known subtypes
- Self type