go-blocking-dequeue
queue
Our great sponsors
| go-blocking-dequeue | queue | |
|---|---|---|
| 1 | 7 | |
| 7 | 239 | |
| - | - | |
| 3.6 | 5.9 | |
| almost 2 years ago | about 2 months ago | |
| Go | Go | |
| MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
go-blocking-dequeue
-
I created a thread-safe, blocking, infinite dequeue go package. Feedback is appreciated
Package link: github.com/AmrSaber/go-blocking-dequeue
queue
- Hello, announcing v1.3.0 of my queue package: A Linked Queue implementation was added, complementing the Circular, Blocking, and Priority queues. All structures align with the standard Queue interface. Looking forward to your feedback!
-
Seeking Insights: Tools Used in GitHub Actions for Security Code Checks and Vulnerability Detection
i’m using these checks for my projects and I feel that this is more than enough: https://github.com/adrianbrad/queue/tree/main/.github/workflows
- Hello, I released v1.2.0 of my queue package. A Circular Queue implementation is now available. Blocking and Priority queues were previously available. All implementations satisfy the Queue interface provided by the package. Any feedback would be greatly appreciated.
-
[Code Review Request] Package providing multiple Queue implementations
I plan to release a package that is supposed to provide multiple generic Queue implementations and it also defines a Queue interface that all implementations must satisfy. Currently, there are 2 implementations, a Blocking queue, and a Priority queue.
-
[Code Review Request] Generic Blocking Queue
Hello again, I came up with this implementation that uses buffered channels: https://github.com/adrianbrad/queue/blob/blocking-channel-implementation/blocking2.go. In order to drain the channel during a Reset, the channel is closed and refilled elements, while Take listens for both new values and the close signal. What do you think? The original Reset implementation is a bit faster, you can check the benchmarks here: https://github.com/adrianbrad/queue/blob/blocking-channel-implementation/blocking_bench_test.go
What are some alternatives?
haxmap - Fastest and most memory efficient golang concurrent hashmap
set - Thread(Safe/Unsafe) Set data structure for Go.
lane - Generic PriorityQueues, Queues, Stacks, and Deque data structures for Go
goqueue - Flexible Queue System for Go
deque - Package deque implements a very fast and efficient general purpose queue/stack/deque data structure that is specifically optimized to perform when used by Microservices and Serverless services running in production environments. https://godoc.org/github.com/ef-ds/deque
GoQ - Lightweight message queue in Golang
golangci-lint - Fast linters Runner for Go
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
ZenQ - A thread-safe queue faster and more resource efficient than golang's native channels