7232679749

Committed 16 Dec 2023 03:08PM UTC coverage: 88.897%. First build

Build # 7232679749

Build Type

Pull #37

github

Committed by

gabotechs

Commit Message

refactor: add gonum, improve cycle detection, improve dep_tree construction ergonomy,

Pull Request Pull Request #37: Use Gonum and improve cycle detection

Run Details

397 of 459 new or added lines in 17 files covered. (86.49%)

2514 of 2828 relevant lines covered (88.9%)

18259.81 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

96.67

/internal/graph/testgraph.go

package graph

import (
        "strconv"

        "github.com/gammazero/deque"
)

func MakeTestGraph(spec map[int][]int) *Graph[int] {
        g := NewGraph[int]()

        var queue deque.Deque[*Node[int]]
        node := MakeNode("0", 0)
        g.AddNode(node)
        queue.PushBack(node)
        visited := make(map[string]bool)

        for queue.Len() > 0 {
                node := queue.PopFront()
                if _, ok := visited[node.Id]; ok {
                        continue
                }
                visited[node.Id] = true
                deps := spec[node.Data]

                for _, dep := range deps {
                        depId := strconv.Itoa(dep)
                        depNode := g.Get(depId)
                        if depNode == nil {
                                depNode = MakeNode(strconv.Itoa(dep), dep)
                                g.AddNode(depNode)
                        } else {

                        }
                        err := g.AddFromToEdge(node.Id, depNode.Id)
                        if err != nil {
                                panic(err)
                        }
                        queue.PushBack(depNode)
                }
        }
        return g
}

1	package graph
2
3	import (
4	"strconv"
5
6	"github.com/gammazero/deque"
7	)
8
9	func MakeTestGraph(spec map[int][]int) *Graph[int] {	18✔
10	g := NewGraph[int]()	18✔
11		18✔
12	var queue deque.Deque[*Node[int]]	18✔
13	node := MakeNode("0", 0)	18✔
14	g.AddNode(node)	18✔
15	queue.PushBack(node)	18✔
16	visited := make(map[string]bool)	18✔
17		18✔
18	for queue.Len() > 0 {	124✔
19	node := queue.PopFront()	106✔
20	if _, ok := visited[node.Id]; ok {	140✔
21	continue	34✔
22	}
23	visited[node.Id] = true	72✔
24	deps := spec[node.Data]	72✔
25		72✔
26	for _, dep := range deps {	160✔
27	depId := strconv.Itoa(dep)	88✔
28	depNode := g.Get(depId)	88✔
29	if depNode == nil {	142✔
30	depNode = MakeNode(strconv.Itoa(dep), dep)	54✔
31	g.AddNode(depNode)	54✔
32	} else {	88✔
33		34✔
34	}	34✔
35	err := g.AddFromToEdge(node.Id, depNode.Id)	88✔
36	if err != nil {	88✔
NEW 37	panic(err)	×
38	}
39	queue.PushBack(depNode)	88✔
40	}
41	}
42	return g	18✔
43	}

gabotechs / dep-tree / 7232679749

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous