Complete Guide to the container/list, container/heap, container/ring Packages

Stdlib
2026-04-17T12:05:42+00:00
The container/list, container/heap, and container/ring packages provide standard Go implementations for linked lists, priority queues, and circular buffers.

The container/list, container/heap, and container/ring packages provide standard implementations for linked lists, priority queues, and circular buffers, respectively. Use container/list for ordered insertion/deletion, container/heap for priority-based access, and container/ring for fixed-size circular data structures.

import (
	"container/list"
	"container/heap"
	"container/ring"
)

// Linked List
l := list.New()
l.PushBack("item")

// Priority Queue (requires implementing heap.Interface)
// h := &MyHeap{}
// heap.Init(h)

// Circular Buffer
r := ring.New(10)
for i := 0; i < 10; i++ {
	r.Value = i
	r = r.Next()
}