sets

package
v1.5.2 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jan 12, 2017 License: Apache-2.0 Imports: 2 Imported by: 0

Documentation

Overview

Package sets has auto-generated set types.

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type Byte added in v1.2.0

type Byte map[byte]Empty

sets.Byte is a set of bytes, implemented via map[byte]struct{} for minimal memory consumption.

func ByteKeySet added in v1.2.0

func ByteKeySet(theMap interface{}) Byte

ByteKeySet creates a Byte from a keys of a map[byte](? extends interface{}). If the value passed in is not actually a map, this will panic.

func NewByte added in v1.2.0

func NewByte(items ...byte) Byte

New creates a Byte from a list of values.

func (Byte) Delete added in v1.2.0

func (s Byte) Delete(items ...byte)

Delete removes all items from the set.

func (Byte) Difference added in v1.2.0

func (s Byte) Difference(s2 Byte) Byte

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Byte) Equal added in v1.2.0

func (s1 Byte) Equal(s2 Byte) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Byte) Has added in v1.2.0

func (s Byte) Has(item byte) bool

Has returns true if and only if item is contained in the set.

func (Byte) HasAll added in v1.2.0

func (s Byte) HasAll(items ...byte) bool

HasAll returns true if and only if all items are contained in the set.

func (Byte) HasAny added in v1.2.0

func (s Byte) HasAny(items ...byte) bool

HasAny returns true if any items are contained in the set.

func (Byte) Insert added in v1.2.0

func (s Byte) Insert(items ...byte)

Insert adds items to the set.

func (Byte) Intersection added in v1.2.0

func (s1 Byte) Intersection(s2 Byte) Byte

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Byte) IsSuperset added in v1.2.0

func (s1 Byte) IsSuperset(s2 Byte) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Byte) Len added in v1.2.0

func (s Byte) Len() int

Len returns the size of the set.

func (Byte) List added in v1.2.0

func (s Byte) List() []byte

List returns the contents as a sorted byte slice.

func (Byte) PopAny added in v1.2.0

func (s Byte) PopAny() (byte, bool)

Returns a single element from the set.

func (Byte) Union added in v1.2.0

func (s1 Byte) Union(s2 Byte) Byte

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Byte) UnsortedList added in v1.4.0

func (s Byte) UnsortedList() []byte

UnsortedList returns the slice with contents in random order.

type Empty

type Empty struct{}

Empty is public since it is used by some internal API objects for conversions between external string arrays and internal sets, and conversion logic requires public types today.

type Int added in v1.2.0

type Int map[int]Empty

sets.Int is a set of ints, implemented via map[int]struct{} for minimal memory consumption.

func IntKeySet added in v1.2.0

func IntKeySet(theMap interface{}) Int

IntKeySet creates a Int from a keys of a map[int](? extends interface{}). If the value passed in is not actually a map, this will panic.

func NewInt added in v1.2.0

func NewInt(items ...int) Int

New creates a Int from a list of values.

func (Int) Delete added in v1.2.0

func (s Int) Delete(items ...int)

Delete removes all items from the set.

func (Int) Difference added in v1.2.0

func (s Int) Difference(s2 Int) Int

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Int) Equal added in v1.2.0

func (s1 Int) Equal(s2 Int) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Int) Has added in v1.2.0

func (s Int) Has(item int) bool

Has returns true if and only if item is contained in the set.

func (Int) HasAll added in v1.2.0

func (s Int) HasAll(items ...int) bool

HasAll returns true if and only if all items are contained in the set.

func (Int) HasAny added in v1.2.0

func (s Int) HasAny(items ...int) bool

HasAny returns true if any items are contained in the set.

func (Int) Insert added in v1.2.0

func (s Int) Insert(items ...int)

Insert adds items to the set.

func (Int) Intersection added in v1.2.0

func (s1 Int) Intersection(s2 Int) Int

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Int) IsSuperset added in v1.2.0

func (s1 Int) IsSuperset(s2 Int) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Int) Len added in v1.2.0

func (s Int) Len() int

Len returns the size of the set.

func (Int) List added in v1.2.0

func (s Int) List() []int

List returns the contents as a sorted int slice.

func (Int) PopAny added in v1.2.0

func (s Int) PopAny() (int, bool)

Returns a single element from the set.

func (Int) Union added in v1.2.0

func (s1 Int) Union(s2 Int) Int

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Int) UnsortedList added in v1.4.0

func (s Int) UnsortedList() []int

UnsortedList returns the slice with contents in random order.

type Int64 added in v1.2.0

type Int64 map[int64]Empty

sets.Int64 is a set of int64s, implemented via map[int64]struct{} for minimal memory consumption.

func Int64KeySet added in v1.2.0

func Int64KeySet(theMap interface{}) Int64

Int64KeySet creates a Int64 from a keys of a map[int64](? extends interface{}). If the value passed in is not actually a map, this will panic.

func NewInt64 added in v1.2.0

func NewInt64(items ...int64) Int64

New creates a Int64 from a list of values.

func (Int64) Delete added in v1.2.0

func (s Int64) Delete(items ...int64)

Delete removes all items from the set.

func (Int64) Difference added in v1.2.0

func (s Int64) Difference(s2 Int64) Int64

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (Int64) Equal added in v1.2.0

func (s1 Int64) Equal(s2 Int64) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (Int64) Has added in v1.2.0

func (s Int64) Has(item int64) bool

Has returns true if and only if item is contained in the set.

func (Int64) HasAll added in v1.2.0

func (s Int64) HasAll(items ...int64) bool

HasAll returns true if and only if all items are contained in the set.

func (Int64) HasAny added in v1.2.0

func (s Int64) HasAny(items ...int64) bool

HasAny returns true if any items are contained in the set.

func (Int64) Insert added in v1.2.0

func (s Int64) Insert(items ...int64)

Insert adds items to the set.

func (Int64) Intersection added in v1.2.0

func (s1 Int64) Intersection(s2 Int64) Int64

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (Int64) IsSuperset added in v1.2.0

func (s1 Int64) IsSuperset(s2 Int64) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (Int64) Len added in v1.2.0

func (s Int64) Len() int

Len returns the size of the set.

func (Int64) List added in v1.2.0

func (s Int64) List() []int64

List returns the contents as a sorted int64 slice.

func (Int64) PopAny added in v1.2.0

func (s Int64) PopAny() (int64, bool)

Returns a single element from the set.

func (Int64) Union added in v1.2.0

func (s1 Int64) Union(s2 Int64) Int64

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (Int64) UnsortedList added in v1.4.0

func (s Int64) UnsortedList() []int64

UnsortedList returns the slice with contents in random order.

type String

type String map[string]Empty

sets.String is a set of strings, implemented via map[string]struct{} for minimal memory consumption.

func NewString

func NewString(items ...string) String

New creates a String from a list of values.

func StringKeySet added in v1.2.0

func StringKeySet(theMap interface{}) String

StringKeySet creates a String from a keys of a map[string](? extends interface{}). If the value passed in is not actually a map, this will panic.

func (String) Delete

func (s String) Delete(items ...string)

Delete removes all items from the set.

func (String) Difference

func (s String) Difference(s2 String) String

Difference returns a set of objects that are not in s2 For example: s1 = {a1, a2, a3} s2 = {a1, a2, a4, a5} s1.Difference(s2) = {a3} s2.Difference(s1) = {a4, a5}

func (String) Equal

func (s1 String) Equal(s2 String) bool

Equal returns true if and only if s1 is equal (as a set) to s2. Two sets are equal if their membership is identical. (In practice, this means same elements, order doesn't matter)

func (String) Has

func (s String) Has(item string) bool

Has returns true if and only if item is contained in the set.

func (String) HasAll

func (s String) HasAll(items ...string) bool

HasAll returns true if and only if all items are contained in the set.

func (String) HasAny

func (s String) HasAny(items ...string) bool

HasAny returns true if any items are contained in the set.

func (String) Insert

func (s String) Insert(items ...string)

Insert adds items to the set.

func (String) Intersection

func (s1 String) Intersection(s2 String) String

Intersection returns a new set which includes the item in BOTH s1 and s2 For example: s1 = {a1, a2} s2 = {a2, a3} s1.Intersection(s2) = {a2}

func (String) IsSuperset

func (s1 String) IsSuperset(s2 String) bool

IsSuperset returns true if and only if s1 is a superset of s2.

func (String) Len

func (s String) Len() int

Len returns the size of the set.

func (String) List

func (s String) List() []string

List returns the contents as a sorted string slice.

func (String) PopAny

func (s String) PopAny() (string, bool)

Returns a single element from the set.

func (String) Union

func (s1 String) Union(s2 String) String

Union returns a new set which includes items in either s1 or s2. For example: s1 = {a1, a2} s2 = {a3, a4} s1.Union(s2) = {a1, a2, a3, a4} s2.Union(s1) = {a1, a2, a3, a4}

func (String) UnsortedList added in v1.4.0

func (s String) UnsortedList() []string

UnsortedList returns the slice with contents in random order.

Directories

Path Synopsis
Package types just provides input types to the set generator.
Package types just provides input types to the set generator.

Jump to

Keyboard shortcuts

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