/usr/lib/python3/dist-packages/funcparserlib/tests/test_dot.py is in python3-funcparserlib 0.3.6-4.
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 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 | # -*- coding: utf-8 -*-
import unittest
from funcparserlib.parser import NoParseError
from funcparserlib.lexer import LexerError
from .dot import parse, tokenize, Graph, Edge, SubGraph, DefAttrs, Attr, Node
class DotTest(unittest.TestCase):
def t(self, data, expected=None):
self.assertEqual(parse(tokenize(data)), expected)
def test_comments(self):
self.t('''
/* комм 1 */
graph /* комм 4 */ g1 {
// комм 2 /* комм 3 */
}
// комм 5
''',
Graph(strict=None, type='graph', id='g1', stmts=[]))
def test_connected_subgraph(self):
self.t('''
digraph g1 {
n1 -> n2 ->
subgraph n3 {
nn1 -> nn2 -> nn3;
nn3 -> nn1;
};
subgraph n3 {} -> n1;
}
''',
Graph(strict=None, type='digraph', id='g1', stmts=[
Edge(
nodes=[
'n1',
'n2',
SubGraph(id='n3', stmts=[
Edge(
nodes=['nn1', 'nn2', 'nn3'],
attrs=[]),
Edge(
nodes=['nn3', 'nn1'],
attrs=[])])],
attrs=[]),
Edge(
nodes=[
SubGraph(id='n3', stmts=[]),
'n1'],
attrs=[])]))
def test_default_attrs(self):
self.t('''
digraph g1 {
page="3,3";
graph [rotate=90];
node [shape=box, color="#0000ff"];
edge [style=dashed];
n1 -> n2 -> n3;
n3 -> n1;
}
''',
Graph(strict=None, type='digraph', id='g1', stmts=[
DefAttrs(object='graph', attrs=[
Attr(name='page', value='"3,3"')]),
DefAttrs(object='graph', attrs=[
Attr(name='rotate', value='90')]),
DefAttrs(object='node', attrs=[
Attr(name='shape', value='box'),
Attr(name='color', value='"#0000ff"')]),
DefAttrs(object='edge', attrs=[
Attr(name='style', value='dashed')]),
Edge(nodes=['n1', 'n2', 'n3'], attrs=[]),
Edge(nodes=['n3', 'n1'], attrs=[])]))
def test_empty_graph(self):
self.t('''
graph g1 {}
''',
Graph(strict=None, type='graph', id='g1', stmts=[]))
def test_few_attrs(self):
self.t('''
digraph g1 {
n1 [attr1, attr2 = value2];
}
''',
Graph(strict=None, type='digraph', id='g1', stmts=[
Node(id='n1', attrs=[
Attr(name='attr1', value=None),
Attr(name='attr2', value='value2')])]))
def test_few_nodes(self):
self.t('''
graph g1 {
n1;
n2;
n3
}
''',
Graph(strict=None, type='graph', id='g1', stmts=[
Node(id='n1', attrs=[]),
Node(id='n2', attrs=[]),
Node(id='n3', attrs=[])]))
def test_illegal_comma(self):
try:
self.t('''
graph g1 {
n1;
n2;
n3,
}
''')
except NoParseError:
pass
else:
self.fail('must raise NoParseError')
def test_null(self):
try:
self.t('')
except NoParseError:
pass
else:
self.fail('must raise NoParseError')
def test_simple_cycle(self):
self.t('''
digraph g1 {
n1 -> n2 [w=5];
n2 -> n3 [w=10];
n3 -> n1 [w=7];
}
''',
Graph(strict=None, type='digraph', id='g1', stmts=[
Edge(nodes=['n1', 'n2'], attrs=[
Attr(name='w', value='5')]),
Edge(nodes=['n2', 'n3'], attrs=[
Attr(name='w', value='10')]),
Edge(nodes=['n3', 'n1'], attrs=[
Attr(name='w', value='7')])]))
def test_single_unicode_char(self):
try:
self.t('ф')
except LexerError:
pass
else:
self.fail('must raise LexerError')
def test_unicode_names(self):
self.t('''
digraph g1 {
n1 -> "Медведь" [label="Поехали!"];
"Медведь" -> n3 [label="Добро пожаловать!"];
n3 -> n1 ["Водка"="Селёдка"];
}
''',
Graph(strict=None, type='digraph', id='g1', stmts=[
Edge(nodes=['n1', '"Медведь"'], attrs=[
Attr(name='label', value='"Поехали!"')]),
Edge(nodes=['"Медведь"', 'n3'], attrs=[
Attr(name='label', value='"Добро пожаловать!"')]),
Edge(nodes=['n3', 'n1'], attrs=[
Attr(name='"Водка"', value='"Селёдка"')])]))
|