def test_node_repr(self):
a = sllist([None]).first
self.assertEqual(repr(a), '<sllistnode(None)>')
b = sllist([1, None]).first
self.assertEqual(repr(b), '<sllistnode(1)>')
c = sllist(['abc', None]).first
self.assertEqual(repr(c), '<sllistnode(\'abc\')>')
def test_node_str(self):
a = sllist([None, None]).first
self.assertEqual(str(a), 'sllistnode(None)')
b = sllist([1, None]).first
self.assertEqual(str(b), 'sllistnode(1)')
c = sllist(['abc', None]).first
self.assertEqual(str(c), 'sllistnode(abc)')
def test_guards_after_concat(self):
a = sllist([1, 2])
b = sllist([3, 4])
c = a + b
self.assertIsNot(c.first, None)
self.assertEqual(c.first.value, 1)
self.assertIsNot(c.last, None)
self.assertEqual(c.last.value, 4)
def test_guards_after_concat_inplace(self):
a = sllist([1, 2])
b = sllist([3, 4])
orig_a_first = a.first
a += b
self.assertIs(a.first, orig_a_first)
self.assertEqual(a.first.value, 1)
self.assertIsNot(a.last, None)
self.assertEqual(a.last.value, 4)
def test_insert_value_before_first(self):
ll = sllist(xrange(4))
ref = sllist([10, 0, 1, 2, 3])
next = ll.nodeat(0)
arg_node = sllistnode(10)
new_node = ll.insert(arg_node, ll.nodeat(0))
self.assertNotEqual(new_node, arg_node)
self.assertEqual(new_node.value, 10)
self.assertEqual(new_node.next, next)
self.assertEqual(new_node, ll.first)
self.assertEqual(ll, ref)
def test_appendleft(self):
ll = sllist(xrange(4))
ref = sllist([10, 0, 1, 2, 3])
next = ll.nodeat(0)
arg_node = sllistnode(10)
new_node = ll.appendleft(arg_node)
self.assertNotEqual(new_node, arg_node)
self.assertEqual(new_node.value, 10)
self.assertEqual(new_node.next, next)
self.assertEqual(ll.first, new_node)
self.assertEqual(ll, ref)
def test_cmp(self):
a = sllist(xrange(0, 1100))
b = sllist(xrange(0, 1101))
c = range(0, 1100)
self.assertEqual(cmp(a, a), 0)
self.assertEqual(cmp(a, b), -1)
self.assertEqual(cmp(b, a), 1)
self.assertEqual(cmp(a, c), 0)
self.assertEqual(cmp(c, a), 0)
self.assertEqual(cmp([], []), 0)
self.assertEqual(cmp([], a), -1)
self.assertEqual(cmp(a, []), 1)
def test_concat(self):
a_ref = range(0, 1024, 4)
a = sllist(a_ref)
b_ref = range(8092, 8092 + 1024, 4)
b = sllist(b_ref)
ab_ref = sllist(a_ref + b_ref)
c = a + b
self.assertEqual(c, ab_ref)
self.assertEqual(len(c), len(ab_ref))
c = a + b_ref
self.assertEqual(c, ab_ref)
self.assertEqual(len(c), len(ab_ref))
def test_insert_value_before(self):
ll = sllist(xrange(4))
ref = sllist([0, 1, 10, 2, 3])
prev = ll.nodeat(1)
next = ll.nodeat(2)
arg_node = sllistnode(10)
new_node = ll.insert(arg_node, ll.nodeat(2))
self.assertNotEqual(new_node, arg_node)
self.assertEqual(new_node.value, 10)
self.assertEqual(new_node.next, next)
self.assertEqual(prev.next, new_node)
self.assertEqual(ll, ref)
def test_append(self):
ll = sllist(xrange(4))
ref = sllist([0, 1, 2, 3, 10])
prev = ll.nodeat(-1)
arg_node = sllistnode(10)
new_node = ll.append(arg_node)
self.assertNotEqual(new_node, arg_node)
self.assertEqual(new_node.value, 10)
self.assertEqual(new_node.next, None)
self.assertEqual(prev.next, new_node)
self.assertEqual(ll.last, new_node)
self.assertEqual(ll, ref)
def test_concat_empty(self):
empty = sllist()
filled_ref = range(0, 1024, 4)
filled = sllist(filled_ref)
res = empty + empty
self.assertEqual(res, sllist([] + []))
self.assertEqual(len(res), 0)
res = empty + filled
self.assertEqual(res, sllist([] + filled_ref))
self.assertEqual(len(res), len(filled_ref))
res = filled + empty
self.assertEqual(res, sllist(filled_ref + []))
self.assertEqual(len(res), len(filled_ref))
def test_init_empty(self):
ll = sllist()
self.assertEqual(len(ll), 0)
self.assertEqual(ll.size, 0)
self.assertEqual(list(ll), [])
self.assertIs(ll.first, None)
self.assertIs(ll.last, None)
def test_guards_after_remove(self):
ll = sllist([1, 2])
ll.remove(ll.last)
self.assertIs(ll.first, ll.last)
ll.remove(ll.first)
self.assertIs(ll.first, None)
self.assertIs(ll.last, None)
def test_guards_after_repeat_inplace(self):
ll = sllist([1, 2])
orig_first = ll.first
orig_last = ll.last
ll *= 4
self.assertIs(ll.first, orig_first)
self.assertIsNot(ll.last, None)
self.assertIsNot(ll.last, orig_last)
def test_guards_after_insert(self):
ll = sllist()
node1 = ll.insert(sllistnode(1))
self.assertIs(ll.first, node1)
self.assertIs(ll.last, node1)
node2 = ll.insert(sllistnode(2))
self.assertIs(ll.first, node1)
self.assertIs(ll.last, node2)
def test_guards_after_popright(self):
ll = sllist([1, 2])
ll.pop()
self.assertIs(ll.first, ll.last)
self.assertEqual(ll.first.value, 1)
ll.pop()
self.assertIs(ll.first, None)
self.assertIs(ll.last, None)
def test_guards_after_appendleft(self):
ll = sllist()
node1 = ll.appendleft(1)
self.assertIs(ll.first, node1)
self.assertIs(ll.last, node1)
node2 = ll.appendleft(2)
self.assertIs(ll.first, node2)
self.assertIs(ll.last, node1)
def test_iter(self):
ref = range(0, 1024, 4)
ll = sllist(ref)
idx = 0
for val in ll:
self.assertFalse(isinstance(val, sllistnode))
self.assertEqual(val, ref[idx])
idx += 1
self.assertEqual(idx, len(ref))
def test_iternodes(self):
ref = range(0, 1024, 4)
ll = sllist(ref)
idx = 0
for node in ll.iternodes():
self.assertTrue(isinstance(node, sllistnode))
self.assertEqual(node.value, ref[idx])
idx += 1
self.assertEqual(idx, len(ref))
def test_guards_after_del(self):
ll = sllist([1, 2])
orig_last = ll.last
del ll[0]
self.assertIs(ll.first, orig_last)
self.assertIs(ll.last, orig_last)
del ll[0]
self.assertIs(ll.first, None)
self.assertIs(ll.last, None)
def test_popright(self):
ref = range(0, 1024, 4)
ll = sllist(ref)
result = ll.popright()
self.assertEqual(result, ref[-1])
self.assertEqual(len(ll), len(ref) - 1)
self.assertEqual(ll.size, len(ref) - 1)
self.assertEqual(ll.last.value, ref[-2])
self.assertEqual(list(ll), ref[:-1])
def test_popleft(self):
ref = range(0, 1024, 4)
ll = sllist(ref)
result = ll.popleft()
self.assertEqual(result, ref[0])
self.assertEqual(len(ll), len(ref) - 1)
self.assertEqual(ll.size, len(ref) - 1)
self.assertEqual(ll.first.value, ref[1])
self.assertEqual(list(ll), ref[1:])
def test_reversed(self):
ref = range(0, 1024, 4)
ll = sllist(ref)
idx = len(ref) - 1
for val in reversed(ll):
self.assertFalse(isinstance(val, sllistnode))
self.assertEqual(val, ref[idx])
idx -= 1
self.assertEqual(idx, -1)
def test_init_with_sequence(self):
ref = range(0, 1024, 4)
ll = sllist(ref)
self.assertEqual(len(ll), len(ref))
self.assertEqual(ll.size, len(ref))
self.assertEqual(list(ll), ref)
self.assertIsNot(ll.first, None)
self.assertEqual(ll.first.value, 0)
self.assertIsNot(ll.last, None)
self.assertEqual(ll.last.value, 1020)
def test_guards_after_concat_inplace_of_self(self):
ll = sllist([1, 2])
orig_first = ll.first
orig_last = ll.last
ll += ll
self.assertIs(ll.first, orig_first)
self.assertEqual(ll.first.value, 1)
self.assertIsNot(ll.last, None)
self.assertIsNot(ll.last, orig_last)
self.assertEqual(ll.last.value, 2)
def test_getitem(self):
ref = range(0, 1024, 4)
ll = sllist(ref)
for idx in xrange(len(ll)):
self.assertFalse(isinstance(ll[idx], sllistnode))
self.assertEqual(ll[idx], ref[idx])
for idx in xrange(len(ll)):
self.assertFalse(isinstance(ll[idx], sllistnode))
self.assertEqual(ll[-idx - 1], ref[-idx - 1])
self.assertRaises(TypeError, ll.__getitem__, None)
self.assertRaises(TypeError, ll.__getitem__, 'abc')
self.assertRaises(IndexError, ll.__getitem__, len(ref))
self.assertRaises(IndexError, ll.__getitem__, -len(ref) - 1)
def test_nodeat(self):
ref = range(0, 1024, 4)
ll = sllist(ref)
for idx in xrange(len(ll)):
self.assertTrue(isinstance(ll.nodeat(idx), sllistnode))
self.assertEqual(ll.nodeat(idx).value, ref[idx])
for idx in xrange(len(ll)):
self.assertTrue(isinstance(ll.nodeat(idx), sllistnode))
self.assertEqual(ll.nodeat(-idx - 1).value, ref[-idx - 1])
self.assertRaises(TypeError, ll.nodeat, None)
self.assertRaises(TypeError, ll.nodeat, 'abc')
self.assertRaises(IndexError, ll.nodeat, len(ref))
self.assertRaises(IndexError, ll.nodeat, -len(ref) - 1)
def test_concat_inplace_empty(self):
filled_ref = range(0, 1024, 4)
filled = sllist(filled_ref)
empty = sllist()
empty += empty
self.assertEqual(empty, sllist([] + []))
self.assertEqual(len(empty), 0)
empty = sllist()
empty += filled
self.assertEqual(empty, sllist([] + filled_ref))
self.assertEqual(len(empty), len(filled_ref))
empty = sllist()
filled += empty
self.assertEqual(filled, sllist(filled_ref + []))
self.assertEqual(len(filled), len(filled_ref))
def _test_iternext(self, ref, start_idx, target_idx, expected_last_value):
ll = sllist(ref)
idx = start_idx
target = ll.nodeat(target_idx) if target_idx is not None else None
last_node = None
for node in ll.nodeat(start_idx).iternext(to=target):
self.assertTrue(isinstance(node, sllistnode))
self.assertEqual(node.value, ref[idx])
idx += 1
last_node = node
if expected_last_value is not None:
self.assertEqual(last_node.value, expected_last_value)
else:
self.assertIsNone(last_node)
def test_del(self):
ref = range(0, 1024, 4)
ll = sllist(ref)
del ll[0]
del ref[0]
self.assertEqual(list(ll), ref)
del ll[len(ll) - 1]
del ref[len(ref) - 1]
self.assertEqual(list(ll), ref)
del ll[(len(ll) - 1) // 2]
del ref[(len(ref) - 1) // 2]
self.assertEqual(list(ll), ref)
def del_item(idx):
del ll[idx]
self.assertRaises(IndexError, del_item, len(ll))
for i in xrange(len(ll)):
del ll[0]
self.assertEqual(len(ll), 0)
