Is there a queue implementation?
Can anyone suggest Go container for simple and fast FIF/queue, Go has 3 different containers: heap , list and vector . Which one is more suitable to implement a queue? Either vector or list should work, but vector is probably the way to go. I say this because vector will probably allocate less often than list and garbage collection (in the current Go implementation) is fairly expensive. In a small program it probably won't matter, though. Marwan Burelle In fact, if what you want is a basic and easy to use fifo queue, slice provides all you need. queue := make([]int, 0) // Push to the queue