/usr/share/gocode/src/pault.ag/go/topsort/topsort_test.go is in golang-pault-go-topsort-dev 0.0~git20150602.0.a54e6e0-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 | /* {{{ Copyright (c) Paul R. Tagliamonte <paultag@gmail.com>, 2015
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE. }}} */
package topsort_test
import (
"log"
"testing"
"pault.ag/go/topsort"
)
// Test Helpers {{{
func isok(t *testing.T, err error) {
if err != nil {
log.Printf("Error! Error is not nil! %s\n", err)
t.FailNow()
}
}
func notok(t *testing.T, err error) {
if err == nil {
log.Printf("Error! Error is nil!\n")
t.FailNow()
}
}
func assert(t *testing.T, expr bool) {
if !expr {
log.Printf("Assertion failed!")
t.FailNow()
}
}
// }}}
func TestTopsortEasy(t *testing.T) {
network := topsort.NewNetwork()
network.AddNode("foo", nil)
network.AddNode("bar", nil)
network.AddEdge("foo", "bar")
series, err := network.Sort()
isok(t, err)
assert(t, len(series) == 2)
}
func TestTopsortCycle(t *testing.T) {
network := topsort.NewNetwork()
network.AddNode("foo", nil)
network.AddNode("bar", nil)
network.AddEdge("foo", "bar")
network.AddEdge("bar", "foo")
_, err := network.Sort()
notok(t, err)
}
func TestTopsortLongCycle(t *testing.T) {
network := topsort.NewNetwork()
network.AddNode("A", nil)
network.AddNode("B", nil)
network.AddNode("C", nil)
network.AddNode("D", nil)
network.AddNode("E", nil)
network.AddNode("F", nil)
network.AddNode("G", nil)
network.AddNode("H", nil)
network.AddNode("I", nil)
network.AddEdge("A", "B")
network.AddEdge("B", "C")
network.AddEdge("C", "D")
network.AddEdge("D", "E")
network.AddEdge("E", "F")
network.AddEdge("F", "G")
network.AddEdge("G", "H")
network.AddEdge("H", "I")
network.AddEdge("I", "A")
_, err := network.Sort()
notok(t, err)
}
func TestTopsortLong(t *testing.T) {
/*
A --> B -> C -> D -> E
\ ^
\-> F
*/
network := topsort.NewNetwork()
network.AddNode("A", nil)
network.AddNode("B", nil)
network.AddNode("C", nil)
network.AddNode("D", nil)
network.AddNode("E", nil)
network.AddNode("F", nil)
network.AddEdge("A", "B")
network.AddEdge("A", "F")
network.AddEdge("F", "B")
network.AddEdge("B", "C")
network.AddEdge("C", "D")
network.AddEdge("D", "E")
series, err := network.Sort()
isok(t, err)
assert(t, len(series) == 6)
assert(t, series[0].Name == "A")
assert(t, series[1].Name == "F")
assert(t, series[2].Name == "B")
assert(t, series[3].Name == "C")
}
// vim: foldmethod=marker
|