component

Mar 11, 2025

Changes in this version

type Connection

+ Type string

+ func GetConnectionsFromSnippetImports(snippetsByType file.SnippetGroup, snippetsByComponent file.SnippetGroup) []*Connection

+ func (c *Connection) String() string

type Graph

+ Name string

+ func (g *Graph) NoConnections() bool

+ type Results struct

+ Connections []*Connection

Oct 21, 2023

Changes in this version

+ type Cycle []string

type Graph

+ Components []string

+ Connections []*Connection

+ ConnectionsFrom map[string][]*Connection

+ ConnectionsTo map[string][]*Connection

+ func (g *Graph) AllPredecessorsOf(component string) []string

+ func (g *Graph) AllSuccessorsOf(component string) []string

+ func (g *Graph) DirectPredecessorsOf(component string) []string

+ func (g *Graph) DirectSuccessorOf(component string) []string

+ func (g *Graph) ShortestCycles() map[string]Cycle

+ func (g *Graph) StronglyConnectedComponents() [][]string

Oct 16, 2023

Changes in this version

+ type Connection struct

+ Begin *file.Position

+ End *file.Position

+ File string

+ From string

+ To string

+ func GetConnections(snippetsByType file.SnippetGroup, snippetsByComponent file.SnippetGroup) []*Connection

+ type Graph struct

+ func CreateGraph(connections []*Connection) *Graph

+ func (c *Graph) ComponentToId(name string) int64

+ func (c *Graph) ComponentToNode(name string) graph.Node

+ func (c *Graph) Edge(xid, yid int64) graph.Edge

+ func (c *Graph) From(id int64) graph.Nodes

+ func (c *Graph) HasEdgeBetween(xid, yid int64) bool

+ func (c *Graph) HasEdgeFromTo(xid, yid int64) bool

+ func (c *Graph) IdToComponent(id int64) string

+ func (c *Graph) Node(id int64) graph.Node

+ func (c *Graph) Nodes() graph.Nodes

+ func (c *Graph) To(id int64) graph.Nodes