node

package

v0.4.0 Latest Latest Go to latest Published: Nov 2, 2026 License: Apache-2.0 Imports: 2 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/anchore/stereoscope

Links

Open Source Insights

Documentation ¶

Index ¶

type ID
type IDSet
- func NewIDSet(is ...ID) IDSet
type Node
type Nodes
type Queue
type Stack

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type ID ¶

type ID string

type IDSet ¶

type IDSet map[ID]struct{}

func NewIDSet ¶

func NewIDSet(is ...ID) IDSet

func (IDSet) Add ¶

func (s IDSet) Add(ids ...ID)

func (IDSet) Clear ¶

func (s IDSet) Clear()

func (IDSet) Contains ¶

func (s IDSet) Contains(i ID) bool

func (IDSet) ContainsAny ¶

func (s IDSet) ContainsAny(ids ...ID) bool

func (IDSet) List ¶

func (s IDSet) List() []ID

func (IDSet) Merge ¶

func (s IDSet) Merge(other IDSet)

func (IDSet) Remove ¶

func (s IDSet) Remove(ids ...ID)

func (IDSet) Size ¶

func (s IDSet) Size() int

func (IDSet) Sorted ¶

func (s IDSet) Sorted() []ID

type Node ¶

type Node interface {
	ID() ID
	Copy() Node
}

Node is a single element within a tree.Tree. A node in a Tree is shared with every copy of that Tree, so it must never be modified once added. To change one, swap in a new node with tree.Tree.Replace.

type Nodes ¶

type Nodes []Node

func (Nodes) Equal ¶

func (n Nodes) Equal(other Nodes) bool

func (Nodes) Len ¶

func (n Nodes) Len() int

func (Nodes) Less ¶

func (n Nodes) Less(idx1, idx2 int) bool

func (Nodes) Swap ¶

func (n Nodes) Swap(idx1, idx2 int)

type Queue ¶

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

func (*Queue) Dequeue ¶

func (q *Queue) Dequeue() Node

func (*Queue) Enqueue ¶

func (q *Queue) Enqueue(n Node)

func (*Queue) Reset ¶

func (q *Queue) Reset()

func (*Queue) Size ¶

func (q *Queue) Size() int

type Stack ¶

type Stack []Node

func (*Stack) Pop ¶

func (s *Stack) Pop() Node

func (*Stack) Push ¶

func (s *Stack) Push(n Node)

func (*Stack) Size ¶

func (s *Stack) Size() int

Source Files ¶

View all Source files

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