def test_colored_linear(): dag = [('node3', ['node2']), ('node2', ['node1']), ('node1', [])] expected_result = [ ((0, 1), [(0, 0, 1)]), ((0, 1), [(0, 0, 1)]), ((0, 1), []), ] assert list(graphmod._colored(dag)) == expected_result
def test_colored_diverging_branch(): dag = [('node3', ['node1']), ('node2', ['node1']), ('node1', [])] expected_result = [ ((0, 1), [(0, 0, 1)]), ((1, 2), [(0, 0, 1), (1, 0, 2)]), ((0, 1), []), ] assert list(graphmod._colored(dag)) == expected_result
def _graph(self, repo, commits): """ Generates a DAG graph for repo :param repo: repo instance :param commits: list of commits """ if not commits: c.jsdata = json.dumps([]) return dag = _dagwalker(repo, commits) data = [['', vtx, edges] for vtx, edges in _colored(dag)] c.jsdata = json.dumps(data)
def _graph(self, repo, collection, repo_size, size, p): """ Generates a DAG graph for mercurial :param repo: repo instance :param size: number of commits to show :param p: page number """ if not collection: c.jsdata = json.dumps([]) return data = [] revs = [x.revision for x in collection] dag = _dagwalker(repo, revs, repo.alias) dag = _colored(dag) for (id, type, ctx, vtx, edges) in dag: data.append(['', vtx, edges]) c.jsdata = json.dumps(data)
def _graph(self, repo, revs_int, repo_size, size, p): """ Generates a DAG graph for repo :param repo: :param revs_int: :param repo_size: :param size: :param p: """ if not revs_int: c.jsdata = json.dumps([]) return data = [] revs = revs_int dag = _dagwalker(repo, revs, repo.alias) dag = _colored(dag) for (_id, _type, ctx, vtx, edges) in dag: data.append(['', vtx, edges]) c.jsdata = json.dumps(data)