phf / go-queue Goto Github PK

Hi @phf

This is a nice and nicely-annotated implementation.

In your uni class, how do you explain the practical utility of dequeues? I have searched for a while and found many mentions of just this single, specialized use case pertaining to multi-processor job scheduling: https://en.wikipedia.org/wiki/Double-ended_queue#Applications That's a bit arcane.

I think it's also usable for a ring buffer, which has student-intuitive uses for data buffering.

Elsewhere I saw mention of using dequeues for undo/redo cases, although normal stacks seem ok for that...? Unless something needs to be done with the bottom of the stack... maybe because it's fixed size and the bottom needs to be evicted(?)

So, struggling a bit to come up with a tidy set of student-convincing stuff.

Thanks--

Hello @phf

Thanks for this great library. I can see concurrency is not supported and also I would like to know the status of the project.

Currently I am looping the the slice of items and adding PushBack. Will it be possible to append a slice to q.rep as q.rep = append(q.rep, myslice...). I assume the q.inc() function would have to run beforehand?