Codebase list golang-github-awalterschulze-gographviz / fresh-releases/upstream escape_test.go
fresh-releases/upstream

Tree @fresh-releases/upstream (Download .tar.gz)

escape_test.go @fresh-releases/upstream — raw · history · blame 

  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
//Copyright 2013 GoGraphviz Authors
//
//Licensed under the Apache License, Version 2.0 (the "License");
//you may not use this file except in compliance with the License.
//You may obtain a copy of the License at
//
//    http://www.apache.org/licenses/LICENSE-2.0
//
//Unless required by applicable law or agreed to in writing, software
//distributed under the License is distributed on an "AS IS" BASIS,
//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
//See the License for the specific language governing permissions and
//limitations under the License.

package gographviz

import (
	"strings"
	"testing"
)

func TestEscape(t *testing.T) {
	g := NewEscape()
	if err := g.SetName("asdf adsf"); err != nil {
		t.Fatal(err)
	}
	if err := g.SetDir(true); err != nil {
		t.Fatal(err)
	}
	if err := g.AddNode("asdf asdf", "kasdf99 99", map[string]string{
		"URL": "<a",
	}); err != nil {
		t.Fatal(err)
	}
	if err := g.AddNode("asdf asdf", "7", map[string]string{
		"URL": "<a",
	}); err != nil {
		t.Fatal(err)
	}
	if err := g.AddNode("asdf asdf", "a << b", nil); err != nil {
		t.Fatal(err)
	}
	if err := g.AddEdge("kasdf99 99", "7", true, nil); err != nil {
		t.Fatal(err)
	}
	if err := g.AddNode("asdf asdf", "a/b", nil); err != nil {
		t.Fatal(err)
	}
	if err := g.AddNode("asdf asdf", "c.d", nil); err != nil {
		t.Fatal(err)
	}
	if err := g.AddNode("asdf asdf", "e-f", nil); err != nil {
		t.Fatal(err)
	}
	if err := g.AddNode("asdf asdf", "12_34", nil); err != nil {
		t.Fatal(err)
	}
	s := g.String()
	if !strings.HasPrefix(s, `digraph "asdf adsf" {
	"kasdf99 99"->7;
	"12_34";
	"a &lt;&lt; b";
	"a/b";
	"c.d";
	"e-f";
	"kasdf99 99" [ URL="<a" ];
	7 [ URL="<a" ];

}`) {
		t.Fatalf("%s", s)
	}
	if !g.IsNode("a << b") {
		t.Fatalf("should be a node")
	}
}

func TestClusterSubgraphs(t *testing.T) {
	g := NewEscape()
	if err := g.SetName("G"); err != nil {
		t.Fatal(err)
	}
	if err := g.SetDir(false); err != nil {
		t.Fatal(err)
	}
	if err := g.AddSubGraph("G", "cluster0", nil); err != nil {
		t.Fatal(err)
	}
	if err := g.AddSubGraph("cluster0", "cluster_1", nil); err != nil {
		t.Fatal(err)
	}
	if err := g.AddSubGraph("cluster0", "cluster_2", nil); err != nil {
		t.Fatal(err)
	}
	if err := g.AddNode("G", "Code deployment", nil); err != nil {
		t.Fatal(err)
	}
	if err := g.AddPortEdge("cluster_2", "", "cluster_1", "", false, nil); err != nil {
		t.Fatal(err)
	}
	s := g.String()
	graphStr := `graph G {
	cluster_2--cluster_1;
	subgraph cluster0 {
	subgraph cluster_1 {

}
;
	subgraph cluster_2 {

}
;

}
;
	"Code deployment";

}`
	if !strings.HasPrefix(s, graphStr) {
		t.Fatalf("%s", s)
	}
	g2, err := Parse([]byte(s))
	if err != nil {
		t.Fatal(err)
	}
	s2 := g2.String()
	if !strings.HasPrefix(s2, graphStr) {
		t.Fatalf("%s", s2)
	}
}