Inicio Explorar Axuda
Rexistro Iniciar sesión
packages
/
queue
0
0
Fork 0
Ficheiros Incidencias 0 Pull Requests 0 Wiki

Sen descrición

Árbore: e423872a64
Ramas Etiquetas
queue
Evan Huus e423872a64 Merge pull request #1 from aybabtme/get-index %!s(int64=11) %!d(string=hai) anos
.gitignore 3ed486bafe Initial commit %!s(int64=11) %!d(string=hai) anos
.travis.yml 4a824ebe69 Travis config %!s(int64=11) %!d(string=hai) anos
LICENSE 3ed486bafe Initial commit %!s(int64=11) %!d(string=hai) anos
README.md 8c1197c5f4 Update README.md %!s(int64=11) %!d(string=hai) anos
queue.go ad0f934b4e Update docs to mention panics for bad accesses. %!s(int64=11) %!d(string=hai) anos
queue_test.go d8809f0b75 Add bound checks. Add test for bound checks. %!s(int64=11) %!d(string=hai) anos

README.md

Queue

Build Status GoDoc

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.