dagger

package module

Go to main page

Versions in this module

v3

v3.1.6

Jul 7, 2023

Changes in this version

type BoundedQueue

+ func (q *BoundedQueue[T]) PopContext(ctx context.Context) (T, bool)

+ func (q *BoundedQueue[T]) PushContext(ctx context.Context, val T) bool

+ func (q *BoundedQueue[T]) RangeContext(ctx context.Context, fn func(element T) bool)

v3.1.5

Jul 5, 2023

Changes in this version

type Borrower

+ func (b *Borrower[T]) Swap(value T) error

+ type Node interface

+ ID func() string

+ Metadata func() map[string]string

+ SetMetadata func(metadata map[string]string)

v3.1.4

Jul 5, 2023

Changes in this version

type Borrower

+ func (b *Borrower[T]) Close() error

+ func (b *Borrower[T]) Value() T

type GraphEdge

+ func (n *GraphEdge[T]) SetMetadata(metadata map[string]string)

v3.1.3

Jul 5, 2023

Changes in this version

+ type Borrower struct

+ func NewBorrower(value T) *Borrower[T]

+ func (b *Borrower[T]) Borrow() *T

+ func (b *Borrower[T]) BorrowContext(ctx context.Context) (*T, error)

+ func (b *Borrower[T]) Do(fn func(*T)) error

+ func (b *Borrower[T]) Return(obj *T) error

+ func (b *Borrower[T]) TryBorrow() (*T, bool)

v3.1.2

Jul 5, 2023

Changes in this version

type HashMap

+ func (n *HashMap[T]) Filter(f func(id string, node T) bool) *HashMap[T]

+ func (n *HashMap[T]) Map() map[string]T

v3.1.1

Jul 4, 2023

v3.1.0

Jul 4, 2023

v3.0.2

Jul 4, 2023

v3.0.1

Jul 4, 2023

Changes in this version

+ func UniqueID(prefix string) string

+ type BoundedQueue struct

+ func NewBoundedQueue(maxSize int) *BoundedQueue[T]

+ func (q *BoundedQueue[T]) Close()

+ func (q *BoundedQueue[T]) Len() int

+ func (q *BoundedQueue[T]) Pop() (T, bool)

+ func (q *BoundedQueue[T]) Push(val T)

+ func (q *BoundedQueue[T]) Range(fn func(element T) bool)

+ func (q *BoundedQueue[T]) RangeUntil(fn func(element T) bool, done chan struct{})

+ type ChannelGroup struct

+ func NewChannelGroup(ctx context.Context) *ChannelGroup[T]

+ func (b *ChannelGroup[T]) Channel(ctx context.Context) <-chan T

+ func (b *ChannelGroup[T]) Close()

+ func (b *ChannelGroup[T]) Send(ctx context.Context, val T)

+ func (c *ChannelGroup[T]) Len() int

+ type DAG struct

+ func NewDAG(opts ...DagOpt) (*DAG[T], error)

+ func (g *DAG[T]) Acyclic() bool

+ func (g *DAG[T]) BFS(ctx context.Context, reverse bool, start *GraphNode[T], ...) error

+ func (g *DAG[T]) DFS(ctx context.Context, reverse bool, start *GraphNode[T], fn GraphSearchFunc[T]) error

+ func (g *DAG[T]) GetEdge(id string) (*GraphEdge[T], bool)

+ func (g *DAG[T]) GetEdges() []*GraphEdge[T]

+ func (g *DAG[T]) GetNode(id string) (*GraphNode[T], bool)

+ func (g *DAG[T]) GetNodes() []*GraphNode[T]

+ func (g *DAG[T]) GraphViz() (image.Image, error)

+ func (g *DAG[T]) HasEdge(id string) bool

+ func (g *DAG[T]) HasNode(id string) bool

+ func (g *DAG[T]) RangeEdges(fn func(e *GraphEdge[T]) bool)

+ func (g *DAG[T]) RangeNodes(fn func(n *GraphNode[T]) bool)

+ func (g *DAG[T]) SetNode(id string, node T, metadata map[string]string) *GraphNode[T]

+ func (g *DAG[T]) Size() (int, int)

+ func (g *DAG[T]) TopologicalSort(reverse bool) ([]*GraphNode[T], error)

+ type DagOpt func(*dagOpts)

+ func WithVizualization() DagOpt

+ type GraphEdge struct

+ From *GraphNode[T]

+ ID string

+ Metadata map[string]string

+ Relationship string

+ To *GraphNode[T]

+ type GraphNode struct

+ func (n *GraphNode[T]) Ancestors(fn func(node *GraphNode[T]) bool)

+ func (n *GraphNode[T]) BFS(ctx context.Context, reverse bool, fn GraphSearchFunc[T]) error

+ func (n *GraphNode[T]) DFS(ctx context.Context, reverse bool, fn GraphSearchFunc[T]) error

+ func (n *GraphNode[T]) Descendants(fn func(node *GraphNode[T]) bool)

+ func (n *GraphNode[T]) EdgesFrom(fn func(e *GraphEdge[T]) bool)

+ func (n *GraphNode[T]) EdgesTo(fn func(e *GraphEdge[T]) bool)

+ func (n *GraphNode[T]) Graph() *DAG[T]

+ func (n *GraphNode[T]) ID() string

+ func (n *GraphNode[T]) IsConnectedTo(node *GraphNode[T]) bool

+ func (n *GraphNode[T]) Metadata() map[string]string

+ func (n *GraphNode[T]) Remove() error

+ func (n *GraphNode[T]) RemoveEdge(edgeID string)

+ func (n *GraphNode[T]) SetEdge(toNode *GraphNode[T], relationship string, metadata map[string]string) (*GraphEdge[T], error)

+ func (n *GraphNode[T]) SetID(id string)

+ func (n *GraphNode[T]) SetMetadata(metadata map[string]string)

+ func (n *GraphNode[T]) SetValue(value T)

+ func (n *GraphNode[T]) String() string

+ func (n *GraphNode[T]) Value() T

+ type GraphSearchFunc func(ctx context.Context, relationship string, node *GraphNode[T]) bool

+ type HashMap struct

+ func NewHashMap() *HashMap[T]

+ func (n *HashMap[T]) Clear()

+ func (n *HashMap[T]) Delete(key string)

+ func (n *HashMap[T]) Exists(key string) bool

+ func (n *HashMap[T]) Get(key string) (T, bool)

+ func (n *HashMap[T]) Keys() []string

+ func (n *HashMap[T]) Len() int

+ func (n *HashMap[T]) Range(f func(id string, node T) bool)

+ func (n *HashMap[T]) Set(key string, value T)

+ func (n *HashMap[T]) Values() []T

+ type MultiContext struct

+ func NewMultiContext(ctx context.Context) *MultiContext

+ func (m *MultiContext) Cancel()

+ func (m *MultiContext) WithContext(ctx context.Context) context.Context

+ type PriorityQueue struct

+ func NewPriorityQueue() *PriorityQueue[T]

+ func (q *PriorityQueue[T]) Len() int

+ func (q *PriorityQueue[T]) Peek() (T, bool)

+ func (q *PriorityQueue[T]) Pop() (T, bool)

+ func (q *PriorityQueue[T]) Push(item T, weight float64)

+ func (q *PriorityQueue[T]) UpdatePriority(value T, priority float64)

+ type Queue struct

+ func NewQueue() *Queue[T]

+ func (q *Queue[T]) Range(fn func(element T) bool)

+ func (q *Queue[T]) RangeUntil(fn func(element T) bool, done chan struct{})

+ func (s *Queue[T]) Len() int

+ func (s *Queue[T]) Peek() (T, bool)

+ func (s *Queue[T]) Pop() (T, bool)

+ func (s *Queue[T]) Push(f T)

+ type Set struct

+ func NewSet() *Set[T]

+ func (s *Set[T]) Add(val T)

+ func (s *Set[T]) Contains(val T) bool

+ func (s *Set[T]) Len() int

+ func (s *Set[T]) Range(fn func(element T) bool)

+ func (s *Set[T]) Remove(val T)

+ func (s *Set[T]) Sort(lessFunc func(i T, j T) bool) []T

+ func (s *Set[T]) Values() []T

+ type Stack struct

+ func NewStack() *Stack[T]

+ func (s *Stack[T]) Clear()

+ func (s *Stack[T]) Len() int

+ func (s *Stack[T]) Peek() (T, bool)

+ func (s *Stack[T]) Pop() (T, bool)

+ func (s *Stack[T]) Push(f T)

+ func (s *Stack[T]) Range(fn func(element T) bool)

+ func (s *Stack[T]) RangeUntil(fn func(element T) bool, done chan struct{})

+ func (s *Stack[T]) Sort(lessFunc func(i T, j T) bool) []T

+ func (s *Stack[T]) Values() []T

Other modules containing this package

github.com/autom8ter/dagger

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