util

Documentation

Index

• type Item
• type MinHeap
  • func (m MinHeap) Len() int
  • func (m MinHeap) Less(i int, j int) bool
  • func (m *MinHeap) Pop() any
  • func (m *MinHeap) Push(x any)
  • func (m MinHeap) Swap(i int, j int)
• type SyncSet
  • func NewSet() *SyncSet
  • func (s *SyncSet) Add(key string)
  • func (s *SyncSet) Contains(key string) bool
  • func (s *SyncSet) Equal(other *SyncSet) bool
  • func (s *SyncSet) GetKeys() []string
  • func (s *SyncSet) Len() uint32
  • func (s *SyncSet) Remove(key string)

Types

type Item

type Item struct {
	Priority InfoHash
	NodeAddr string
}

type MinHeap

type MinHeap []Item

func (MinHeap) Len

func (m MinHeap) Len() int

func (MinHeap) Less

func (m MinHeap) Less(i int, j int) bool

func (*MinHeap) Pop

func (m *MinHeap) Pop() any

func (*MinHeap) Push

func (m *MinHeap) Push(x any)

func (MinHeap) Swap

func (m MinHeap) Swap(i int, j int)

edits in memory, should use sync mechanism to avoid race conditions

type SyncSet

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

func NewSet

func NewSet() *SyncSet

func (*SyncSet) Add

func (s *SyncSet) Add(key string)

func (*SyncSet) Contains

func (s *SyncSet) Contains(key string) bool

func (*SyncSet) Equal

func (s *SyncSet) Equal(other *SyncSet) bool

func (*SyncSet) GetKeys

func (s *SyncSet) GetKeys() []string

func (*SyncSet) Len

func (s *SyncSet) Len() uint32

func (*SyncSet) Remove

func (s *SyncSet) Remove(key string)