lrulist

Documentation

Index

• type InsertStrategy
• type LruList
  • func New(updateInterval time.Duration, insertStrategy InsertStrategy) *LruList
  • func NewWithList(updateInterval time.Duration, insertStrategy InsertStrategy, ...) *LruList
  • func (l *LruList) Close() (err error)
  • func (l *LruList) GetListCopy() []*Node
  • func (l *LruList) GiveBackListCopy(list []*Node)
  • func (l *LruList) Insert(val interface{}) *Node
  • func (l *LruList) Promote(node *Node)
  • func (l *LruList) Remove(node *Node)
• type Node

Types

type InsertStrategy

type InsertStrategy int

const (
	InsertFront InsertStrategy = iota
	InsertAverage
)

type LruList

type LruList struct {
	// contains filtered or unexported fields
}

func New

func New(updateInterval time.Duration, insertStrategy InsertStrategy) *LruList

func NewWithList

func NewWithList(updateInterval time.Duration, insertStrategy InsertStrategy, list []interface{}) *LruList

func (*LruList) Close

func (l *LruList) Close() (err error)

func (*LruList) GetListCopy

func (l *LruList) GetListCopy() []*Node

GetListCopy should be called when you want to traverse the list

func (*LruList) GiveBackListCopy

func (l *LruList) GiveBackListCopy(list []*Node)

GiveBackListCopy should be called when the list copy is no longer used

func (*LruList) Insert

func (l *LruList) Insert(val interface{}) *Node

spend O(n) time to insert

func (*LruList) Promote

func (l *LruList) Promote(node *Node)

promote but lazy sort. O(1)

func (*LruList) Remove

func (l *LruList) Remove(node *Node)

O(n) scan to remove a node

type Node

type Node struct {
	Val interface{}
	// contains filtered or unexported fields
}