설명 없음

Andrew Gillis 27a9c48a5b Bitwise math for speed 9 년 전
.gitignore 3ed486bafe Initial commit 12 년 전
.travis.yml c97964547f Run CI on containers 11 년 전
LICENSE 3ed486bafe Initial commit 12 년 전
README.md d1df561eb6 Undo accidental badge reordering. 11 년 전
queue.go 27a9c48a5b Bitwise math for speed 9 년 전
queue_test.go 98ef0e8da9 Get() accepts negative index. 9 년 전

README.md

Queue

Build Status GoDoc Code of Conduct

A fast Golang queue using a ring-buffer, based on the version suggested by Dariusz Górecki. Using this instead of other, simpler, queue implementations (slice+append or linked list) provides substantial memory and time benefits, and fewer GC pauses.

The queue implemented here is as fast as it is in part because it is not thread-safe.

Follows semantic versioning using https://gopkg.in/ - import from gopkg.in/eapache/queue.v1 for guaranteed API stability.