type golang.org/x/exp/collection/hashed.Set
53 uses
golang.org/x/exp/collection/hashed (current package)
set.go#L44: type Set[E any] struct {
set.go#L52: func NewSet[E any](hasher maphash.Hasher[E]) *Set[E] {
set.go#L53: var s Set[E]
set.go#L59: func (s *Set[E]) Len() int {
set.go#L69: func (s *Set[E]) All() iter.Seq[E] {
set.go#L75: func (s *Set[E]) insertAll(seq iter.Seq[E]) bool {
set.go#L85: func (s *Set[E]) DeleteFunc(del func(E) bool) bool {
set.go#L96: func (s *Set[E]) Clone() *Set[E] {
set.go#L97: var copy Set[E]
set.go#L104: func (s *Set[E]) Delete(e E) bool {
set.go#L110: func (s *Set[E]) Contains(e E) bool {
set.go#L117: func (s *Set[E]) Insert(e E) bool {
set.go#L124: func (s *Set[E]) Clear() {
set.go#L129: func (s *Set[E]) containsAll(seq iter.Seq[E]) bool {
set.go#L135: func (s *Set[E]) Equal(other *Set[E]) bool {
set.go#L143: func (s *Set[E]) Union(other *Set[E]) *Set[E] {
set.go#L152: func (s *Set[E]) UnionWith(other *Set[E]) {
set.go#L160: func (s *Set[E]) Intersection(other *Set[E]) *Set[E] {
set.go#L178: func (s *Set[E]) IntersectionWith(other *Set[E]) {
set.go#L190: func (s *Set[E]) Difference(other *Set[E]) *Set[E] {
set.go#L200: func (s *Set[E]) DifferenceWith(other *Set[E]) {
set.go#L213: func (s *Set[E]) SymmetricDifference(other *Set[E]) *Set[E] {
set.go#L224: func (s *Set[E]) SymmetricDifferenceWith(other *Set[E]) {
set.go#L241: func (s *Set[E]) diff(from, exclude *Set[E]) {
set.go#L250: func (s *Set[E]) Intersects(other *Set[E]) bool {
set.go#L267: func (s *Set[E]) String() string {
go.pact.im/x/plumb/internal/gotypes
walk.go#L113: func typeContains(t types.Type, seen *hashed.Set[types.Type], pred func(types.Type) bool) bool {
walk.go#L178: func tupleContains(tup *types.Tuple, seen *hashed.Set[types.Type], pred func(types.Type) bool) bool {
go.pact.im/x/plumb/internal/solve
solve.go#L168: demand *hashed.Set[types.Type] // demanded types, by type identity
solve.go#L169: done map[*discover.Provider]*hashed.Set[types.Type] // provider → set of instantiated type-arg lists (keyed by ListKey)
solve.go#L170: jointDone map[*discover.Provider]*hashed.Set[types.Type] // provider → set of joint-cluster pinnings (keyed by jointBindKey)
solve.go#L171: nearMissDone map[*discover.Provider]*hashed.Set[types.Type] // provider → set of bindings that failed to instantiate (constraint near-miss)
solve.go#L187: refusedUnions map[*discover.Provider]*hashed.Set[types.Type]
solve.go#L217: refused := map[*discover.Provider]*hashed.Set[types.Type]{}
solve.go#L228: done: map[*discover.Provider]*hashed.Set[types.Type]{},
solve.go#L229: jointDone: map[*discover.Provider]*hashed.Set[types.Type]{},
solve.go#L230: nearMissDone: map[*discover.Provider]*hashed.Set[types.Type]{},