kubernetes

package module
v0.2.1 Latest Latest
Warning

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

 Go to latest Published: Oct 20, 2021 License: Apache-2.0 Imports: 6 Imported by: 2

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type GroupKind 

type GroupKind map[schema.GroupKind]sets.Empty

sets.GroupKind is a set of schema.GroupKinds, implemented via map[schema.GroupKind]struct{} for minimal memory consumption.

func GroupKindKeySet 

func GroupKindKeySet(theMap interface{}) GroupKind

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

func NewGroupKind 

func NewGroupKind(items ...schema.GroupKind) GroupKind

NewGroupKind creates a GroupKind from a list of values.

func (GroupKind) Delete 

func (s GroupKind) Delete(items ...schema.GroupKind) GroupKind

Delete removes all items from the set.

func (GroupKind) Difference 

func (s GroupKind) Difference(s2 GroupKind) GroupKind

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 (GroupKind) Equal 

func (s1 GroupKind) Equal(s2 GroupKind) 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 (GroupKind) Has 

func (s GroupKind) Has(item schema.GroupKind) bool

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

func (GroupKind) HasAll 

func (s GroupKind) HasAll(items ...schema.GroupKind) bool

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

func (GroupKind) HasAny 

func (s GroupKind) HasAny(items ...schema.GroupKind) bool

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

func (GroupKind) Insert 

func (s GroupKind) Insert(items ...schema.GroupKind) GroupKind

Insert adds items to the set.

func (GroupKind) Intersection 

func (s1 GroupKind) Intersection(s2 GroupKind) GroupKind

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 (GroupKind) IsSuperset 

func (s1 GroupKind) IsSuperset(s2 GroupKind) bool

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

func (GroupKind) Len 

func (s GroupKind) Len() int

Len returns the size of the set.

func (GroupKind) List 

func (s GroupKind) List() []schema.GroupKind

List returns the contents as a sorted schema.GroupKind slice.

func (GroupKind) PopAny 

func (s GroupKind) PopAny() (schema.GroupKind, bool)

Returns a single element from the set.

func (GroupKind) Union 

func (s1 GroupKind) Union(s2 GroupKind) GroupKind

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 (GroupKind) UnsortedList 

func (s GroupKind) UnsortedList() []schema.GroupKind

UnsortedList returns the slice with contents in random order.

type MetaGroupKind added in v0.2.1 

type MetaGroupKind map[metav1.GroupKind]sets.Empty

sets.MetaGroupKind is a set of metav1.GroupKinds, implemented via map[metav1.GroupKind]struct{} for minimal memory consumption.

func MetaGroupKindKeySet added in v0.2.1 

func MetaGroupKindKeySet(theMap interface{}) MetaGroupKind

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

func NewMetaGroupKind added in v0.2.1 

func NewMetaGroupKind(items ...metav1.GroupKind) MetaGroupKind

NewMetaGroupKind creates a MetaGroupKind from a list of values.

func (MetaGroupKind) Delete added in v0.2.1 

func (s MetaGroupKind) Delete(items ...metav1.GroupKind) MetaGroupKind

Delete removes all items from the set.

func (MetaGroupKind) Difference added in v0.2.1 

func (s MetaGroupKind) Difference(s2 MetaGroupKind) MetaGroupKind

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 (MetaGroupKind) Equal added in v0.2.1 

func (s1 MetaGroupKind) Equal(s2 MetaGroupKind) 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 (MetaGroupKind) Has added in v0.2.1 

func (s MetaGroupKind) Has(item metav1.GroupKind) bool

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

func (MetaGroupKind) HasAll added in v0.2.1 

func (s MetaGroupKind) HasAll(items ...metav1.GroupKind) bool

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

func (MetaGroupKind) HasAny added in v0.2.1 

func (s MetaGroupKind) HasAny(items ...metav1.GroupKind) bool

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

func (MetaGroupKind) Insert added in v0.2.1 

func (s MetaGroupKind) Insert(items ...metav1.GroupKind) MetaGroupKind

Insert adds items to the set.

func (MetaGroupKind) Intersection added in v0.2.1 

func (s1 MetaGroupKind) Intersection(s2 MetaGroupKind) MetaGroupKind

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 (MetaGroupKind) IsSuperset added in v0.2.1 

func (s1 MetaGroupKind) IsSuperset(s2 MetaGroupKind) bool

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

func (MetaGroupKind) Len added in v0.2.1 

func (s MetaGroupKind) Len() int

Len returns the size of the set.

func (MetaGroupKind) List added in v0.2.1 

func (s MetaGroupKind) List() []metav1.GroupKind

List returns the contents as a sorted metav1.GroupKind slice.

func (MetaGroupKind) PopAny added in v0.2.1 

func (s MetaGroupKind) PopAny() (metav1.GroupKind, bool)

Returns a single element from the set.

func (MetaGroupKind) Union added in v0.2.1 

func (s1 MetaGroupKind) Union(s2 MetaGroupKind) MetaGroupKind

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 (MetaGroupKind) UnsortedList added in v0.2.1 

func (s MetaGroupKind) UnsortedList() []metav1.GroupKind

UnsortedList returns the slice with contents in random order.

type NamespacedName 

type NamespacedName map[types.NamespacedName]sets.Empty

sets.NamespacedName is a set of types.NamespacedNames, implemented via map[types.NamespacedName]struct{} for minimal memory consumption.

func NamespacedNameKeySet 

func NamespacedNameKeySet(theMap interface{}) NamespacedName

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

func NewNamespacedName 

func NewNamespacedName(items ...types.NamespacedName) NamespacedName

NewNamespacedName creates a NamespacedName from a list of values.

func (NamespacedName) Delete 

func (s NamespacedName) Delete(items ...types.NamespacedName) NamespacedName

Delete removes all items from the set.

func (NamespacedName) Difference 

func (s NamespacedName) Difference(s2 NamespacedName) NamespacedName

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 (NamespacedName) Equal 

func (s1 NamespacedName) Equal(s2 NamespacedName) 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 (NamespacedName) Has 

func (s NamespacedName) Has(item types.NamespacedName) bool

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

func (NamespacedName) HasAll 

func (s NamespacedName) HasAll(items ...types.NamespacedName) bool

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

func (NamespacedName) HasAny 

func (s NamespacedName) HasAny(items ...types.NamespacedName) bool

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

func (NamespacedName) Insert 

func (s NamespacedName) Insert(items ...types.NamespacedName) NamespacedName

Insert adds items to the set.

func (NamespacedName) Intersection 

func (s1 NamespacedName) Intersection(s2 NamespacedName) NamespacedName

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 (NamespacedName) IsSuperset 

func (s1 NamespacedName) IsSuperset(s2 NamespacedName) bool

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

func (NamespacedName) Len 

func (s NamespacedName) Len() int

Len returns the size of the set.

func (NamespacedName) List 

func (s NamespacedName) List() []types.NamespacedName

List returns the contents as a sorted types.NamespacedName slice.

func (NamespacedName) PopAny 

func (s NamespacedName) PopAny() (types.NamespacedName, bool)

Returns a single element from the set.

func (NamespacedName) Union 

func (s1 NamespacedName) Union(s2 NamespacedName) NamespacedName

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 (NamespacedName) UnsortedList 

func (s NamespacedName) UnsortedList() []types.NamespacedName

UnsortedList returns the slice with contents in random order.

Source Files

View all Source files

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.