deque VS gocommons

There’s no active proposal to add linked lists to the standard library, no. Linked lists have poor performance for most use cases, so I don’t think it’s on anyone’s radar to rush it in. That said, it will probably happen someday. Here’s a generic deque implementation you can use until then: https://github.com/carlmjohnson/deque

If you can use Go tip, there’s https://github.com/carlmjohnson/deque

I needed a memory efficient, performant and go-routine-safe queue ie FIFO data structure. To try not to reinvent the wheel I went on google in search of one. After a minute or two I found a slice based one and it served me well until I ran into one issue. When the queue was filled with millions of items and then emptied, I noticed that the memory allocation didn't decrease. So I tried to force GC but that didn't work. After more research and testing I could not reduce existing slice memory allocation without allocating new slice and copy any data remaining in the old one. That was not acceptable for a heavy trafficked queue. It cannot pause all reads and writes to wait for memory shuffling. So I went back on google and found this peace of code. Then I was like "Oh yea I know this from my CS class - a simple Singly Linked List. Haven't had a need to implement one since then."