def testLen(self):
n0 = moosetree.Node(None, 'root')
n1 = moosetree.Node(n0, 'n1')
n2 = moosetree.Node(n0, 'n2')
self.assertEqual(len(n0), 2)
self.assertEqual(len(n1), 0)
self.assertEqual(len(n2), 0)
def testInsert(self):
n0 = moosetree.Node(None, 'root')
n1 = moosetree.Node(n0, 'n1')
n2 = moosetree.Node(None, 'n2')
self.assertEqual(n0.children, [n1])
n0.insert(0, n2)
self.assertEqual(n0.children, [n2, n1])
self.assertIs(n2.parent, n0)
def testPath(self):
n0 = moosetree.Node(None, '0')
n1 = moosetree.Node(n0, '1')
n2 = moosetree.Node(n1, '2')
n3 = moosetree.Node(n1, '3')
self.assertEqual(n3.path, [n0, n1, n3])
self.assertEqual(n2.path, [n0, n1, n2])
self.assertEqual(n1.path, [n0, n1])
self.assertEqual(n0.path, [n0])
def testNext(self):
n0 = moosetree.Node(None, 'root')
n1 = moosetree.Node(n0, 'n1')
n2 = moosetree.Node(n0, 'n2')
n3 = moosetree.Node(n0, 'n3')
self.assertIs(n0.next, None)
self.assertIs(n1.next, n2)
self.assertIs(n2.next, n3)
self.assertIs(n3.next, None)
def testPrevious(self):
n0 = moosetree.Node(None, 'root')
n1 = moosetree.Node(n0, 'n1')
n2 = moosetree.Node(n0, 'n2')
n3 = moosetree.Node(n0, 'n3')
self.assertIs(n0.previous, None)
self.assertIs(n1.previous, None)
self.assertIs(n2.previous, n1)
self.assertIs(n3.previous, n2)
def testRoot(self):
n0 = moosetree.Node(None, 'root')
n1 = moosetree.Node(n0, 'n1')
n2 = moosetree.Node(n1, 'n2')
self.assertIs(n0.root, n0)
self.assertIs(n1.root, n0)
self.assertIs(n2.root, n0)
self.assertTrue(n0.is_root)
self.assertFalse(n1.is_root)
self.assertFalse(n2.is_root)
def parseOutput(content):
"""Convert the nested parenthesis output from pdflatex to a tree structure."""
root = moosetree.Node(None, 'root', content='', filename='', warnings=[])
node = root
for char in content:
if char == '(':
node = moosetree.Node(node, 'paren', content='', filename='', warnings=[])
elif char == ')':
node = node.parent
else:
node['content'] += str(char)
return root
def testChildren(self):
n0 = moosetree.Node(None, 'root')
n1 = moosetree.Node(n0, 'n1')
n2 = moosetree.Node(n0, 'n2')
self.assertIs(n0.children[0], n1)
self.assertIs(n0.children[1], n2)
children = [c for c in n0]
self.assertEqual(children, n0.children)
with self.assertRaises(AttributeError):
n0.children = [n0]
def testParent(self):
n0 = moosetree.Node(None, 'root')
n1 = moosetree.Node(n0, 'n1')
n2 = moosetree.Node(n0, 'n2')
self.assertIs(n1.parent, n0)
self.assertIs(n2.parent, n0)
self.assertEqual(n0.children, [n1, n2])
self.assertEqual(n1.children, [])
self.assertEqual(n2.children, [])
n2.parent = n1
self.assertIs(n1.parent, n0)
self.assertIs(n2.parent, n1)
self.assertEqual(n0.children, [n1])
self.assertEqual(n1.children, [n2])
self.assertEqual(n2.children, [])
def testInit(self):
n0 = moosetree.Node(None, 'root')
self.assertIs(n0.parent, None)
self.assertEqual(n0.name, 'root')
self.assertEqual(n0.children, [])
self.assertEqual(n0.attributes, dict())
n1 = moosetree.Node(n0, 'one')
self.assertEqual(n1.name, 'one')
self.assertIs(n1.parent, n0)
self.assertEqual(n1.children, [])
self.assertEqual(n1.attributes, dict())
self.assertIs(n0(0), n1)
self.assertEqual(n0.children, [n1])
with self.assertRaises(AttributeError):
n0.name = 'foo'
def testCount(self):
n0 = moosetree.Node(None, '0')
n1 = moosetree.Node(n0, '1')
n2 = moosetree.Node(n1, '2')
n3 = moosetree.Node(n1, '3')
n4 = moosetree.Node(n0, '4')
n5 = moosetree.Node(n4, '5')
n6 = moosetree.Node(n4, '6')
self.assertEqual(n0.count, 6)
def testSiblings(self):
n0 = moosetree.Node(None, 'root')
n1 = moosetree.Node(n0, 'n1')
n2 = moosetree.Node(n1, 'n2')
n3 = moosetree.Node(n1, 'n3')
n4 = moosetree.Node(n0, 'n4')
n5 = moosetree.Node(n0, 'n5')
self.assertEqual(n0.siblings, [])
self.assertEqual(n1.siblings, [n4, n5])
self.assertEqual(n2.siblings, [n3])
self.assertEqual(n3.siblings, [n2])
self.assertEqual(n4.siblings, [n1, n5])
self.assertEqual(n5.siblings, [n1, n4])
def testCall(self):
n0 = moosetree.Node(None, '0')
n1 = moosetree.Node(n0, '1')
n2 = moosetree.Node(n1, '2')
n3 = moosetree.Node(n1, '3')
n4 = moosetree.Node(n0, '4')
n5 = moosetree.Node(n4, '5')
n6 = moosetree.Node(n4, '6')
self.assertIs(n0(0), n1)
self.assertIs(n0(1), n4)
self.assertIs(n0(0, 0), n2)
self.assertIs(n0(0, 1), n3)
self.assertIs(n0(0)(0), n2)
self.assertIs(n0(0)(1), n3)
self.assertIs(n0(1, 0), n5)
self.assertIs(n0(1, 1), n6)
self.assertIs(n0(1)(0), n5)
self.assertIs(n0(1)(1), n6)
def testAttributes(self):
n = moosetree.Node(None, 'root', year=1980)
self.assertEqual(n.attributes, dict(year=1980))
self.assertEqual(n['year'], 1980)
self.assertEqual(n.get('year'), 1980)
self.assertEqual(n.get('month', 'Aug'), 'Aug')
self.assertNotIn('month', n)
n['year'] = 1949
n['month'] = 8
self.assertEqual(n['year'], 1949)
self.assertEqual(n['month'], 8)
self.assertIn('month', n)
keys = []
values = []
for k, v in n.items():
keys.append(k)
values.append(v)
self.assertEqual(keys, ['year', 'month'])
self.assertEqual(values, [1949, 8])
def testBool(self):
n0 = moosetree.Node(None, 'root')
self.assertTrue(n0)
def build_tree():
root = moosetree.Node(None, 'root')
A = moosetree.Node(root, 'A')
B = moosetree.Node(root, 'B')
C = moosetree.Node(root, 'C', year=2011)
D = moosetree.Node(root, 'D')
AA = moosetree.Node(A, 'AA')
AB = moosetree.Node(A, 'AB')
AC = moosetree.Node(A, 'AC')
BA = moosetree.Node(B, 'BA')
BB = moosetree.Node(B, 'BB', year=1949)
BC = moosetree.Node(B, 'BC')
BD = moosetree.Node(B, 'BD')
CA = moosetree.Node(C, 'CA')
CB = moosetree.Node(C, 'CB', year=1980)
CC = moosetree.Node(C, 'CC')
DA = moosetree.Node(D, 'DA')
DB = moosetree.Node(D, 'DB')
ABA = moosetree.Node(AB, 'ABA')
ABB = moosetree.Node(AB, 'ABB')
ABC = moosetree.Node(AB, 'ABC', year=1980)
ABD = moosetree.Node(AB, 'ABD')
BAA = moosetree.Node(BA, 'BAA')
BAB = moosetree.Node(BA, 'BAB', year=1954)
CCA = moosetree.Node(CC, 'CCA')
CCB = moosetree.Node(CC, 'CCB')
CCC = moosetree.Node(CC, 'CCC')
ABCA = moosetree.Node(ABC, 'ABCA')
ABCB = moosetree.Node(ABC, 'ABCB')
ABCAA = moosetree.Node(ABCA, 'ABCAA')
ABCAB = moosetree.Node(ABCA, 'ABCAB', year=2013)
return root