- linked: add linked queue implementation with tests
- linked: make linked queue implementation thread-safe
- fix a bug caused by not calling the (*sync.Cond).Wait() method in a loop
- implement
Circular Queueand add tests
- change the queue type parameter from
anytocomparable - add
Contains,Peek,Size,IsEmpty,IteratorandClearmethods to the Queue interface and implementations. In order to implement theContainsmethod the type parameter used by the queues was changed tocomparablefromany
- priority: removed lesser interface. added fuzz and benchmarks
- priority: remove lesser interface and use a less func
- Implement reset for all queue. Add missing source code from previous commit. Update readme
- add missing source code. update readme
- improve the
Queueinterface, implementPriorityqueue, fixBlockingtests, provide example tests
- blocking: implement the
Offermethod which returns an error in case the queue is full
- options: added
capacityoption - blocking: implement
Getmethod, it returns an error if there are no available elements in the queue
- blocking: remove internal channel and implement peek
- blocking: remove unnecessary ctx.Done case from Blocking.Refill()
- blocking: use buffered channel as the queue storage, as u/Cidan suggested
- blocking: change the index type from
atomic.Uint32toatomic.Uintptr
- blocking: add
Peekmethod, which returns but does not remove an element
- blocking: store index and sync as values instead of pointers
- blocking: as per u/skeeto comment, remove the useless error returns
- deadlock: fix the deadlock caused by unsynchronized index and broadcast channel
- blocking_queue: rename
GetintoTake
- blocking_queue: add first
blocking queueimplementation