forked from ava-labs/avalanchego
-
Notifications
You must be signed in to change notification settings - Fork 3
/
set.go
48 lines (38 loc) · 883 Bytes
/
set.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
// Copyright (C) 2019-2024, Ava Labs, Inc. All rights reserved.
// See the file LICENSE for licensing terms.
package heap
// NewSet returns a heap without duplicates ordered by its values
func NewSet[T comparable](less func(a, b T) bool) Set[T] {
return Set[T]{
set: NewMap[T, T](less),
}
}
type Set[T comparable] struct {
set Map[T, T]
}
// Push returns if the entry was added
func (s Set[T]) Push(t T) bool {
_, hadValue := s.set.Push(t, t)
return !hadValue
}
func (s Set[T]) Pop() (T, bool) {
pop, _, ok := s.set.Pop()
return pop, ok
}
func (s Set[T]) Peek() (T, bool) {
peek, _, ok := s.set.Peek()
return peek, ok
}
func (s Set[T]) Len() int {
return s.set.Len()
}
func (s Set[T]) Remove(t T) bool {
_, existed := s.set.Remove(t)
return existed
}
func (s Set[T]) Fix(t T) {
s.set.Fix(t)
}
func (s Set[T]) Contains(t T) bool {
return s.set.Contains(t)
}