set

package

v0.1.1 Latest Latest Go to latest Published: Apr 11, 2021 License: Apache-2.0 Imports: 3 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/go-board/x-go

Links

Open Source Insights

Documentation ¶

Index ¶

type AnyHashSet
- func NewAnyHashSet(items ...interface{}) AnyHashSet
type ComparableBtreeSet
type ComparableHashSet
type IntSet
type Set
type StringBtreeSet
- func NewStringBtreeSet(items ...string) *StringBtreeSet
type StringHashSet
- func NewStringHashSet(items ...string) StringHashSet
type StringItem
- func (s StringItem) Less(than btree.Item) bool

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type AnyHashSet ¶

type AnyHashSet map[interface{}]struct{}

func NewAnyHashSet ¶

func NewAnyHashSet(items ...interface{}) AnyHashSet

func (AnyHashSet) Add ¶

func (s AnyHashSet) Add(items ...interface{})

func (AnyHashSet) ContainAll ¶

func (s AnyHashSet) ContainAll(items ...interface{}) bool

func (AnyHashSet) ContainAny ¶

func (s AnyHashSet) ContainAny(items ...string) bool

func (AnyHashSet) Contains ¶

func (s AnyHashSet) Contains(item string) bool

func (AnyHashSet) Difference ¶

func (s AnyHashSet) Difference(o AnyHashSet) AnyHashSet

func (AnyHashSet) InterSection ¶

func (s AnyHashSet) InterSection(o AnyHashSet) AnyHashSet

func (AnyHashSet) IsSubSet ¶

func (s AnyHashSet) IsSubSet(o AnyHashSet) bool

func (AnyHashSet) IsSuperSet ¶

func (s AnyHashSet) IsSuperSet(o AnyHashSet) bool

func (AnyHashSet) Range ¶

func (s AnyHashSet) Range(fn func(item interface{}))

func (AnyHashSet) Remove ¶

func (s AnyHashSet) Remove(items ...interface{})

func (AnyHashSet) Size ¶

func (s AnyHashSet) Size() int

func (AnyHashSet) Union ¶

func (s AnyHashSet) Union(o AnyHashSet) AnyHashSet

func (AnyHashSet) Values ¶

func (s AnyHashSet) Values() []interface{}

type ComparableBtreeSet ¶

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

type ComparableHashSet ¶

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

type IntSet ¶

type IntSet struct {
	*intsets.Sparse
}

type Set ¶

type Set interface {
	Put(items ...interface{})
	Remove(items ...interface{})
	Values() []interface{}

	ContainAll(items ...interface{}) bool
	ContainAny(items ...interface{}) bool
	InterSection(o Set) Set
	Union(o Set) Set
	SubSet(o Set) bool
	SuperSet(o Set) bool
	Difference(o Set) Set
}

type StringBtreeSet ¶

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

func NewStringBtreeSet ¶

func NewStringBtreeSet(items ...string) *StringBtreeSet

func (*StringBtreeSet) Add ¶

func (s *StringBtreeSet) Add(items ...string)

func (*StringBtreeSet) ContainAll ¶

func (s *StringBtreeSet) ContainAll(items ...string) bool

func (*StringBtreeSet) ContainAny ¶

func (s *StringBtreeSet) ContainAny(items ...string) bool

func (*StringBtreeSet) Contains ¶

func (s *StringBtreeSet) Contains(item string) bool

func (*StringBtreeSet) Difference ¶

func (s *StringBtreeSet) Difference(o *StringBtreeSet) *StringBtreeSet

func (*StringBtreeSet) InterSection ¶

func (s *StringBtreeSet) InterSection(o *StringBtreeSet) *StringBtreeSet

func (*StringBtreeSet) IsSubSet ¶

func (s *StringBtreeSet) IsSubSet(o *StringBtreeSet) bool

func (*StringBtreeSet) IsSuperSet ¶

func (s *StringBtreeSet) IsSuperSet(o *StringBtreeSet) bool

func (*StringBtreeSet) Range ¶

func (s *StringBtreeSet) Range(begin, end string, fn func(key string) bool)

func (*StringBtreeSet) RangeAll ¶

func (s *StringBtreeSet) RangeAll(fn func(item string))

func (*StringBtreeSet) Remove ¶

func (s *StringBtreeSet) Remove(items ...string)

func (*StringBtreeSet) Size ¶

func (s *StringBtreeSet) Size() int

func (*StringBtreeSet) Union ¶

func (s *StringBtreeSet) Union(o *StringBtreeSet) *StringBtreeSet

func (*StringBtreeSet) Values ¶

func (s *StringBtreeSet) Values() []string

type StringHashSet ¶

type StringHashSet map[string]struct{}

func NewStringHashSet ¶

func NewStringHashSet(items ...string) StringHashSet

func (StringHashSet) Add ¶

func (s StringHashSet) Add(items ...string)

func (StringHashSet) ContainAll ¶

func (s StringHashSet) ContainAll(items ...string) bool

func (StringHashSet) ContainAny ¶

func (s StringHashSet) ContainAny(items ...string) bool

func (StringHashSet) Contains ¶

func (s StringHashSet) Contains(item string) bool

func (StringHashSet) Difference ¶

func (s StringHashSet) Difference(o StringHashSet) StringHashSet

func (StringHashSet) InterSection ¶

func (s StringHashSet) InterSection(o StringHashSet) StringHashSet

func (StringHashSet) IsSubSet ¶

func (s StringHashSet) IsSubSet(o StringHashSet) bool

func (StringHashSet) IsSuperSet ¶

func (s StringHashSet) IsSuperSet(o StringHashSet) bool

func (StringHashSet) Range ¶

func (s StringHashSet) Range(fn func(item string))

func (StringHashSet) Remove ¶

func (s StringHashSet) Remove(items ...string)

func (StringHashSet) Size ¶

func (s StringHashSet) Size() int

func (StringHashSet) Union ¶

func (s StringHashSet) Union(o StringHashSet) StringHashSet

func (StringHashSet) Values ¶

func (s StringHashSet) Values() []string

type StringItem ¶

type StringItem string

func (StringItem) Less ¶

func (s StringItem) Less(than btree.Item) bool

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL