dag

package

v0.0.0-...-0d27ab4 Latest Latest Go to latest Published: Sep 6, 2023 License: Apache-2.0 Imports: 5 Imported by: 0

Details

This section is empty.

This section is empty.

func Any[T INode](g *Graph, predicates ...Filter[T]) T

func ByID[T INode](g *Graph, id string) T

type CNode struct {
	Node     INode
	Outgoing []INode
	Incoming []INode
}

type Comparable struct {
	Nodes []INode
	Edges [][2]int
}

type Edge struct {
	From INode
	To   INode
}

type Filter[T INode] func(T) bool

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

func New(clone func(INode) INode) *Graph

func (g *Graph) AddEdge(from, to INode)

func (g *Graph) AddNode(id string, n INode) INode

func (g *Graph) ByID(id string) INode

func (g *Graph) Comparable() []CNode

func (g *Graph) String() string

type INode interface {
	// contains filtered or unexported methods
}

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

Node implements INode and should be embedded into structs that will be added to a Graph. Usage:

type Entity struct {
	dag.Node
	Attribute string
}

type Result[T INode] []T

func Incoming[T INode](n INode, predicates ...Filter[T]) Result[T]

func Nodes[T INode](g *Graph, predicates ...Filter[T]) Result[T]

func Outgoing[T INode](n INode, predicates ...Filter[T]) Result[T]

func (q Result[T]) All(predicates ...func(T) bool) []T

func (q Result[T]) Any() T

func (q Result[T]) One() T

func (q Result[T]) Pick(n int) []T

Pick a random selection of exactly n elements. Panics if there are less than n total elements.

func (q Result[T]) PickBetween(min, max int) []T

func (q Result[T]) PickUpTo(n int) []T