Golang container库heap/list/ring使用详解

package main

import (
    "container/list"
    "fmt"
)

func main() {
    l := list.New()
    l.PushBack(1)
    l.PushBack(2)
    l.PushFront(0)

    for e := l.Front(); e != nil; e = e.Next() {
        fmt.Print(e.Value, " ") // 输出: 0 1 2
    }
}

package main

import (
    "container/heap"
    "fmt"
)

type IntHeap []int

func (h IntHeap) Len() int           { return len(h) }
func (h IntHeap) Less(i, j int) bool { return h[i] < h[j] } // 最小堆
func (h IntHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *IntHeap) Push(x interface{}) {
    *h = append(*h, x.(int))
}

func (h *IntHeap) Pop() interface{} {
    old := *h
    n := len(old)
    x := old[n-1]
    *h = old[0 : n-1]
    return x
}

func main() {
    h := &IntHeap{3, 1, 4}
    heap.Init(h)
    heap.Push(h, 2)

    for h.Len() > 0 {
        fmt.Print(heap.Pop(h), " ") // 输出: 1 2 3 4
    }
}

package main

import (
    "container/ring"
    "fmt"
)

func main() {
    r := ring.New(3)
    for i := 1; i <= 3; i++ {
        r.Value = i
        r = r.Next()
    }

    // 遍历
    r.Do(func(p interface{}) {
        fmt.Print(p, " ") // 输出: 1 2 3
    })
}