Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  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

node

package

Go to main page

Versions in this module

v1

v1.2.4

Nov 22, 2024

v1.2.3

Sep 30, 2024

v1.2.2

Aug 14, 2024

v1.2.1

Apr 15, 2024

v1.2.0

Mar 12, 2024

Changes in this version

type B

+ func (n *B[K, V]) HasExpired() bool

type BC

+ func (n *BC[K, V]) HasExpired() bool

type BE

+ func (n *BE[K, V]) HasExpired() bool

type BEC

+ func (n *BEC[K, V]) HasExpired() bool

type Node

+ HasExpired func() bool

v1.1.1

Mar 5, 2024

v1.1.0

Mar 4, 2024

Changes in this version

+ func Equals[K comparable, V any](a, b Node[K, V]) bool

+ type B struct

+ func (n *B[K, V]) AsPointer() unsafe.Pointer

+ func (n *B[K, V]) Cost() uint32

+ func (n *B[K, V]) DecrementFrequency()

+ func (n *B[K, V]) Die()

+ func (n *B[K, V]) Expiration() uint32

+ func (n *B[K, V]) Frequency() uint8

+ func (n *B[K, V]) IncrementFrequency()

+ func (n *B[K, V]) IsAlive() bool

+ func (n *B[K, V]) IsExpired() bool

+ func (n *B[K, V]) IsMain() bool

+ func (n *B[K, V]) IsSmall() bool

+ func (n *B[K, V]) Key() K

+ func (n *B[K, V]) MarkMain()

+ func (n *B[K, V]) MarkSmall()

+ func (n *B[K, V]) Next() Node[K, V]

+ func (n *B[K, V]) NextExp() Node[K, V]

+ func (n *B[K, V]) Prev() Node[K, V]

+ func (n *B[K, V]) PrevExp() Node[K, V]

+ func (n *B[K, V]) ResetFrequency()

+ func (n *B[K, V]) SetNext(v Node[K, V])

+ func (n *B[K, V]) SetNextExp(v Node[K, V])

+ func (n *B[K, V]) SetPrev(v Node[K, V])

+ func (n *B[K, V]) SetPrevExp(v Node[K, V])

+ func (n *B[K, V]) Unmark()

+ func (n *B[K, V]) Value() V

+ type BC struct

+ func (n *BC[K, V]) AsPointer() unsafe.Pointer

+ func (n *BC[K, V]) Cost() uint32

+ func (n *BC[K, V]) DecrementFrequency()

+ func (n *BC[K, V]) Die()

+ func (n *BC[K, V]) Expiration() uint32

+ func (n *BC[K, V]) Frequency() uint8

+ func (n *BC[K, V]) IncrementFrequency()

+ func (n *BC[K, V]) IsAlive() bool

+ func (n *BC[K, V]) IsExpired() bool

+ func (n *BC[K, V]) IsMain() bool

+ func (n *BC[K, V]) IsSmall() bool

+ func (n *BC[K, V]) Key() K

+ func (n *BC[K, V]) MarkMain()

+ func (n *BC[K, V]) MarkSmall()

+ func (n *BC[K, V]) Next() Node[K, V]

+ func (n *BC[K, V]) NextExp() Node[K, V]

+ func (n *BC[K, V]) Prev() Node[K, V]

+ func (n *BC[K, V]) PrevExp() Node[K, V]

+ func (n *BC[K, V]) ResetFrequency()

+ func (n *BC[K, V]) SetNext(v Node[K, V])

+ func (n *BC[K, V]) SetNextExp(v Node[K, V])

+ func (n *BC[K, V]) SetPrev(v Node[K, V])

+ func (n *BC[K, V]) SetPrevExp(v Node[K, V])

+ func (n *BC[K, V]) Unmark()

+ func (n *BC[K, V]) Value() V

+ type BE struct

+ func (n *BE[K, V]) AsPointer() unsafe.Pointer

+ func (n *BE[K, V]) Cost() uint32

+ func (n *BE[K, V]) DecrementFrequency()

+ func (n *BE[K, V]) Die()

+ func (n *BE[K, V]) Expiration() uint32

+ func (n *BE[K, V]) Frequency() uint8

+ func (n *BE[K, V]) IncrementFrequency()

+ func (n *BE[K, V]) IsAlive() bool

+ func (n *BE[K, V]) IsExpired() bool

+ func (n *BE[K, V]) IsMain() bool

+ func (n *BE[K, V]) IsSmall() bool

+ func (n *BE[K, V]) Key() K

+ func (n *BE[K, V]) MarkMain()

+ func (n *BE[K, V]) MarkSmall()

+ func (n *BE[K, V]) Next() Node[K, V]

+ func (n *BE[K, V]) NextExp() Node[K, V]

+ func (n *BE[K, V]) Prev() Node[K, V]

+ func (n *BE[K, V]) PrevExp() Node[K, V]

+ func (n *BE[K, V]) ResetFrequency()

+ func (n *BE[K, V]) SetNext(v Node[K, V])

+ func (n *BE[K, V]) SetNextExp(v Node[K, V])

+ func (n *BE[K, V]) SetPrev(v Node[K, V])

+ func (n *BE[K, V]) SetPrevExp(v Node[K, V])

+ func (n *BE[K, V]) Unmark()

+ func (n *BE[K, V]) Value() V

+ type BEC struct

+ func (n *BEC[K, V]) AsPointer() unsafe.Pointer

+ func (n *BEC[K, V]) Cost() uint32

+ func (n *BEC[K, V]) DecrementFrequency()

+ func (n *BEC[K, V]) Die()

+ func (n *BEC[K, V]) Expiration() uint32

+ func (n *BEC[K, V]) Frequency() uint8

+ func (n *BEC[K, V]) IncrementFrequency()

+ func (n *BEC[K, V]) IsAlive() bool

+ func (n *BEC[K, V]) IsExpired() bool

+ func (n *BEC[K, V]) IsMain() bool

+ func (n *BEC[K, V]) IsSmall() bool

+ func (n *BEC[K, V]) Key() K

+ func (n *BEC[K, V]) MarkMain()

+ func (n *BEC[K, V]) MarkSmall()

+ func (n *BEC[K, V]) Next() Node[K, V]

+ func (n *BEC[K, V]) NextExp() Node[K, V]

+ func (n *BEC[K, V]) Prev() Node[K, V]

+ func (n *BEC[K, V]) PrevExp() Node[K, V]

+ func (n *BEC[K, V]) ResetFrequency()

+ func (n *BEC[K, V]) SetNext(v Node[K, V])

+ func (n *BEC[K, V]) SetNextExp(v Node[K, V])

+ func (n *BEC[K, V]) SetPrev(v Node[K, V])

+ func (n *BEC[K, V]) SetPrevExp(v Node[K, V])

+ func (n *BEC[K, V]) Unmark()

+ func (n *BEC[K, V]) Value() V

+ type Config struct

+ WithCost bool

+ WithExpiration bool

+ type Manager struct

+ func NewManager[K comparable, V any](c Config) *Manager[K, V]

+ func (m *Manager[K, V]) Create(key K, value V, expiration, cost uint32) Node[K, V]

+ func (m *Manager[K, V]) FromPointer(ptr unsafe.Pointer) Node[K, V]

+ type Node interface

+ AsPointer func() unsafe.Pointer

+ Cost func() uint32

+ DecrementFrequency func()

+ Die func()

+ Expiration func() uint32

+ Frequency func() uint8

+ IncrementFrequency func()

+ IsAlive func() bool

+ IsExpired func() bool

+ IsMain func() bool

+ IsSmall func() bool

+ Key func() K

+ MarkMain func()

+ MarkSmall func()

+ Next func() Node[K, V]

+ NextExp func() Node[K, V]

+ Prev func() Node[K, V]

+ PrevExp func() Node[K, V]

+ ResetFrequency func()

+ SetNext func(v Node[K, V])

+ SetNextExp func(v Node[K, V])

+ SetPrev func(v Node[K, V])

+ SetPrevExp func(v Node[K, V])

+ Unmark func()

+ Value func() V

+ func CastPointerToBC[K comparable, V any](ptr unsafe.Pointer) Node[K, V]

+ func CastPointerToBEC[K comparable, V any](ptr unsafe.Pointer) Node[K, V]

+ func CastPointerToBE[K comparable, V any](ptr unsafe.Pointer) Node[K, V]

+ func CastPointerToB[K comparable, V any](ptr unsafe.Pointer) Node[K, V]

+ func NewBC[K comparable, V any](key K, value V, expiration, cost uint32) Node[K, V]

+ func NewBEC[K comparable, V any](key K, value V, expiration, cost uint32) Node[K, V]

+ func NewBE[K comparable, V any](key K, value V, expiration, cost uint32) Node[K, V]

+ func NewB[K comparable, V any](key K, value V, expiration, cost uint32) Node[K, V]

Other modules containing this package

github.com/maypok86/otter/v2