Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

sll

package

Go to main page

Versions in this module

v2

v2.4.0

Jul 3, 2023

v2.3.0

Feb 10, 2022

v2.2.0

Mar 4, 2021

Changes in this version

+ type MaxHeap []*Node

+ func (mh *MaxHeap) Peek() interface{}

+ func (mh *MaxHeap) Pop() interface{}

+ func (mh *MaxHeap) Push(x interface{})

+ func (mh MaxHeap) Len() int

+ func (mh MaxHeap) Less(i, j int) bool

+ func (mh MaxHeap) Swap(i, j int)

+ type MinHeap []*Node

+ func (mh *MinHeap) Peek() interface{}

+ func (mh *MinHeap) Pop() interface{}

+ func (mh *MinHeap) Push(x interface{})

+ func (mh MinHeap) Len() int

+ func (mh MinHeap) Less(i, j int) bool

+ func (mh MinHeap) Swap(i, j int)

+ type Node struct

+ Score uint64

+ Value interface{}

+ func (n *Node) Copy() *Node

+ func (n *Node) Next() *Node

+ func (n *Node) Prev() *Node

+ func (n *Node) Read() interface{}

+ type NodeScoreList []*Node

+ func (nsl NodeScoreList) Len() int

+ func (nsl NodeScoreList) Less(i, j int) bool

+ func (nsl NodeScoreList) Swap(i, j int)

+ type Sll struct

+ func New() *Sll

+ func (ll *Sll) Copy() *Sll

+ func (ll *Sll) Head() *Node

+ func (ll *Sll) HighScores(k int) NodeScoreList

+ func (ll *Sll) Len() uint

+ func (ll *Sll) LowScores(k int) NodeScoreList

+ func (ll *Sll) MoveToHead(n *Node)

+ func (ll *Sll) MoveToTail(n *Node)

+ func (ll *Sll) PushHead(v interface{}) *Node

+ func (ll *Sll) PushHeadNode(n *Node)

+ func (ll *Sll) PushTail(v interface{}) *Node

+ func (ll *Sll) PushTailNode(n *Node)

+ func (ll *Sll) Remove(n *Node)

+ func (ll *Sll) RemoveHead()

+ func (ll *Sll) RemoveTail()

+ func (ll *Sll) Tail() *Node

Other modules containing this package

github.com/jamiealquiza/bicache