Versions in this module Expand all Collapse all v4 v4.1.0 May 1, 2019 Changes in this version + const ContainsEdgeKind + const ReferencedByEdgeKind + const UnknownEdgeKind + const UnknownNodeKind + func AddReversedEdge(g Interface, from, to graph.Node, edgeKinds sets.String) bool + func EnsureUnique(g UniqueNodeInitializer, name UniqueName, fn NodeInitializerFunc) graph.Node + func ExistingDirectEdge(g Interface, from, to graph.Node, edgeKinds sets.String) bool + func GetContainingNode(g Graph, containedNode graph.Node) graph.Node + func GetTopLevelContainerNode(g Graph, containedNode graph.Node) graph.Node + func IsFromDifferentNamespace(namespace string, node graph.Node) bool + func NodesByKind(g Interface, nodes []graph.Node, kinds ...string) [][]graph.Node + func ReverseExistingDirectEdge(g Interface, from, to graph.Node, edgeKinds sets.String) bool + func ReverseGraphEdge(g Interface, from, to graph.Node, edgeKinds sets.String) bool + type ByID []graph.Node + func (m ByID) Len() int + func (m ByID) Less(i, j int) bool + func (m ByID) Swap(i, j int) + type ByKey []Marker + func (m ByKey) Len() int + func (m ByKey) Less(i, j int) bool + func (m ByKey) Swap(i, j int) + type ByNodeID []Marker + func (m ByNodeID) Len() int + func (m ByNodeID) Less(i, j int) bool + func (m ByNodeID) Swap(i, j int) + type BySeverity []Marker + func (m BySeverity) Len() int + func (m BySeverity) Less(i, j int) bool + func (m BySeverity) Swap(i, j int) + type Edge struct + func NewEdge(from, to graph.Node, weight float64, kinds ...string) Edge + func (e Edge) DOTAttributes() []dot.Attribute + func (e Edge) IsKind(kind string) bool + func (e Edge) Kinds() sets.String + type EdgeFunc func(g Interface, from, to graph.Node, edgeKinds sets.String) bool + func EdgesOfKind(kinds ...string) EdgeFunc + func RemoveInboundEdges(nodes []graph.Node) EdgeFunc + func RemoveOutboundEdges(nodes []graph.Node) EdgeFunc + type ExistenceChecker interface + Found func() bool + type Graph struct + func New() Graph + func (g Graph) AddEdge(from, to graph.Node, edgeKind string) + func (g Graph) AddNode(n graph.Node) + func (g Graph) EdgeSubgraph(edgeFn EdgeFunc) Graph + func (g Graph) Edges() []graph.Edge + func (g Graph) Find(name UniqueName) graph.Node + func (g Graph) FindOrCreate(name UniqueName, fn NodeInitializerFunc) (graph.Node, bool) + func (g Graph) InboundEdges(node graph.Node, edgeKinds ...string) []graph.Edge + func (g Graph) NodesByKind(nodeKinds ...string) []graph.Node + func (g Graph) OutboundEdges(node graph.Node, edgeKinds ...string) []graph.Edge + func (g Graph) PredecessorEdges(node graph.Node, fn EdgeFunc, edgeKinds ...string) + func (g Graph) PredecessorNodesByEdgeKind(node graph.Node, edgeKinds ...string) []graph.Node + func (g Graph) RemoveEdge(e graph.Edge) + func (g Graph) RemoveNode(node graph.Node) + func (g Graph) String() string + func (g Graph) Subgraph(nodeFn NodeFunc, edgeFn EdgeFunc) Graph + func (g Graph) SubgraphWithNodes(nodes []graph.Node, fn EdgeFunc) Graph + func (g Graph) SuccessorEdges(node graph.Node, fn EdgeFunc, edgeKinds ...string) + func (g Graph) SuccessorNodesByEdgeKind(node graph.Node, edgeKinds ...string) []graph.Node + func (g Graph) SuccessorNodesByNodeAndEdgeKind(node graph.Node, nodeKind, edgeKind string) []graph.Node + type GraphDescriber interface + EdgeKinds func(edge graph.Edge) sets.String + Kind func(node graph.Node) string + Name func(node graph.Node) string + Object func(node graph.Node) interface{} + type Interface interface + type Marker struct + Key string + Message string + Node graph.Node + RelatedNodes []graph.Node + Severity Severity + Suggestion Suggestion + type MarkerScanner func(g Graph, f Namer) []Marker + type Markers []Marker + func (m Markers) BySeverity(severity Severity) []Marker + func (m Markers) FilterByNamespace(namespace string) Markers + type MutableDirectedEdge interface + AddEdge func(from, to graph.Node, edgeKind string) + type MutableUniqueGraph interface + type Namer interface + ResourceName func(obj interface{}) string + var DefaultNamer Namer = namer{} + type Node struct + func (n Node) DOTAttributes() []dot.Attribute + type NodeFinder interface + Find func(name UniqueName) graph.Node + type NodeFunc func(g Interface, n graph.Node) bool + func NodesOfKind(kinds ...string) NodeFunc + type NodeInitializerFunc func(Node) graph.Node + type Severity string + const ErrorSeverity + const InfoSeverity + const WarningSeverity + type Suggestion string + func (s Suggestion) String() string + type UniqueName string + func GetUniqueRuntimeObjectNodeName(nodeKind string, obj runtime.Object) UniqueName + func (n UniqueName) String() string + func (n UniqueName) UniqueName() string + type UniqueNameFunc func(obj interface{}) UniqueName + type UniqueNodeInitializer interface + FindOrCreate func(name UniqueName, fn NodeInitializerFunc) (graph.Node, bool) v4.0.0-alpha.0 Sep 13, 2018 Other modules containing this package gopkg.in/openshift/origin.v3
Go to main page