def test_linear(self):
c1, c2, c3 = self.make_linear_commits(3)
self.assertEqual((set([c3.id]), set([])),
_find_shallow(self._store, [c3.id], 1))
self.assertEqual((set([c2.id]), set([c3.id])),
_find_shallow(self._store, [c3.id], 2))
self.assertEqual((set([c1.id]), set([c2.id, c3.id])),
_find_shallow(self._store, [c3.id], 3))
self.assertEqual((set([]), set([c1.id, c2.id, c3.id])),
_find_shallow(self._store, [c3.id], 4))
def test_tag(self):
c1, c2 = self.make_linear_commits(2)
tag = make_tag(c2, name=b'tag')
self._store.add_object(tag)
self.assertEqual((set([c1.id]), set([c2.id])),
_find_shallow(self._store, [tag.id], 2))
def test_merge(self):
c1 = self.make_commit()
c2 = self.make_commit()
c3 = self.make_commit(parents=[c1.id, c2.id])
self.assertEqual((set([c1.id, c2.id]), set([c3.id])),
_find_shallow(self._store, [c3.id], 2))
def test_multiple_independent(self):
a = self.make_linear_commits(2, message=b'a')
b = self.make_linear_commits(2, message=b'b')
c = self.make_linear_commits(2, message=b'c')
heads = [a[1].id, b[1].id, c[1].id]
self.assertEqual((set([a[0].id, b[0].id, c[0].id]), set(heads)),
_find_shallow(self._store, heads, 2))
def test_multiple_overlapping(self):
# Create the following commit tree:
# 1--2
# \
# 3--4
c1, c2 = self.make_linear_commits(2)
c3 = self.make_commit(parents=[c1.id])
c4 = self.make_commit(parents=[c3.id])
# 1 is shallow along the path from 4, but not along the path from 2.
self.assertEqual((set([c1.id]), set([c1.id, c2.id, c3.id, c4.id])),
_find_shallow(self._store, [c2.id, c4.id], 3))