84 lines
1.6 KiB
Go
84 lines
1.6 KiB
Go
package d2oracle
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"oss.terrastruct.com/d2/d2graph"
|
|
"oss.terrastruct.com/d2/d2parser"
|
|
)
|
|
|
|
func GetChildrenIDs(g *d2graph.Graph, absID string) (ids []string, _ error) {
|
|
mk, err := d2parser.ParseMapKey(absID)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
obj, ok := g.Root.HasChild(d2graph.Key(mk.Key))
|
|
if !ok {
|
|
return nil, fmt.Errorf("%v not found", absID)
|
|
}
|
|
|
|
for _, ch := range obj.ChildrenArray {
|
|
ids = append(ids, ch.AbsID())
|
|
}
|
|
|
|
return ids, nil
|
|
}
|
|
|
|
func GetParentID(g *d2graph.Graph, absID string) (string, error) {
|
|
mk, err := d2parser.ParseMapKey(absID)
|
|
if err != nil {
|
|
return "", err
|
|
}
|
|
obj, ok := g.Root.HasChild(d2graph.Key(mk.Key))
|
|
if !ok {
|
|
return "", fmt.Errorf("%v not found", absID)
|
|
}
|
|
|
|
return obj.Parent.AbsID(), nil
|
|
}
|
|
|
|
func GetObj(g *d2graph.Graph, absID string) *d2graph.Object {
|
|
mk, _ := d2parser.ParseMapKey(absID)
|
|
obj, _ := g.Root.HasChild(d2graph.Key(mk.Key))
|
|
return obj
|
|
}
|
|
|
|
func GetEdge(g *d2graph.Graph, absID string) *d2graph.Edge {
|
|
for _, e := range g.Edges {
|
|
if e.AbsID() == absID {
|
|
return e
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func GetObjOrder(g *d2graph.Graph) []string {
|
|
var order []string
|
|
|
|
queue := []*d2graph.Object{g.Root}
|
|
for len(queue) > 0 {
|
|
curr := queue[0]
|
|
queue = queue[1:]
|
|
order = append(order, curr.AbsID())
|
|
for _, ch := range curr.ChildrenArray {
|
|
queue = append(queue, ch)
|
|
}
|
|
}
|
|
|
|
return order
|
|
}
|
|
|
|
func IsLabelKeyID(key, label string) bool {
|
|
mk, err := d2parser.ParseMapKey(key)
|
|
if err != nil {
|
|
return false
|
|
}
|
|
if len(mk.Edges) > 0 {
|
|
return false
|
|
}
|
|
if mk.Key == nil {
|
|
return false
|
|
}
|
|
|
|
return mk.Key.Path[len(mk.Key.Path)-1].Unbox().ScalarString() == label
|
|
}
|