sortedmap

Documentation

Index

• type Item
• type ItemIterator
• type SortedMap
  • func New() *SortedMap
  • func (m *SortedMap) Ascend(fn ItemIterator)
  • func (m *SortedMap) Clear()
  • func (m *SortedMap) Delete(key string)
  • func (m *SortedMap) Insert(task Item)
  • func (m *SortedMap) Len() int
  • func (m *SortedMap) Min() Item

Types

type Item

type Item interface {
	// Less tests whether the current item is less than the given argument.
	//
	// This must provide a strict weak ordering.
	// If !a.Less(b) && !b.Less(a), we treat this to mean a == b (i.e. we can only
	// hold one of either a or b in the tree).
	Less(than Item) bool

	// Key returns the key of the item.
	Key() string
}

type ItemIterator

type ItemIterator func(i Item) bool

type SortedMap

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

func New

func New() *SortedMap

func (*SortedMap) Ascend

func (m *SortedMap) Ascend(fn ItemIterator)

func (*SortedMap) Clear

func (m *SortedMap) Clear()

func (*SortedMap) Delete

func (m *SortedMap) Delete(key string)

func (*SortedMap) Insert

func (m *SortedMap) Insert(task Item)

func (*SortedMap) Len

func (m *SortedMap) Len() int

func (*SortedMap) Min

func (m *SortedMap) Min() Item