set

type Comparer ¶ added in v0.8.0

type Comparer[E any] interface {
	comparable // cmp.Ordered
	tree.Comparer[E]
}

type HashSet ¶ added in v0.8.0

type HashSet[E comparable] map[E]struct{}

func (s HashSet[E]) Add(v E)

func (s HashSet[E]) All() iter.Seq[E]

func (s HashSet[E]) Delete(v E)

func (s HashSet[E]) Has(v E) bool

type OrderedSet ¶ added in v0.8.0

type OrderedSet[E Comparer[E]] struct {
	// contains filtered or unexported fields
}

OrderedSet

type Player struct {
    Name   string
    Rating int
}
func (p Player) Compare(q Player) int {
    return cmp.Compare(p.Rating, q.Rating)
}

players := []Player{
    {"Garry Kasparov", 2851},
    {"Magnus Carlsen", 2882},
    {"Bobby Fischer", 2785},
    {"Anatoly Karpov", 2780},
    {"Mikhail Tal", 2705},
}

var s OrderedSet[Player]
for _, p := range players {
     s.Add(p)
}
for p := range s.All() {
    fmt.Println(p)
}

func (s *OrderedSet[E]) Add(e E)

func (s *OrderedSet[E]) All() iter.Seq[E]

func (s *OrderedSet[E]) Has(e E) bool

type Set ¶ added in v0.8.0

type Set[E any] interface {
	Add(E)
	Has(E) bool
	All() iter.Seq[E]
}

type TreeSet ¶ added in v0.8.0

type TreeSet[E cmp.Ordered] struct {
	// contains filtered or unexported fields
}

s := []int{3, 1, 2, 0, 1, 3, 1, 4, 1, 3}
ts := new(TreeSet[int])
Add(ts, slices.Values(s))
for v := range ts.All() {
	fmt.Println(v)
}

Output:

0
1
2
3
4

func (s *TreeSet[E]) Add(element E)

func (s *TreeSet[E]) All() iter.Seq[E]

func (s *TreeSet[E]) Has(e E) bool