#include <repo_graph.hpp>
◆ EDesc
◆ Graph
◆ GraphTraits
◆ VDesc
◆ CommitGraph()
CommitGraph::CommitGraph |
( |
git_repository * |
repo | ) |
|
◆ commit_pairs()
generator<Pair<VDesc, Opt<VDesc> > > CommitGraph::commit_pairs |
( |
| ) |
const |
|
inline |
iterate over pairs commit-base (in this order). Merge commits are also included in the iteration results, they can be filtered out using is_base()
predicate.
can return empty 'base' commit for starting commits
◆ commits()
generator<VDesc> CommitGraph::commits |
( |
| ) |
const |
|
inline |
◆ get_base()
◆ get_desc()
◆ in_degree()
int CommitGraph::in_degree |
( |
VDesc |
v | ) |
const |
|
inline |
◆ is_main()
bool CommitGraph::is_main |
( |
VDesc |
v | ) |
const |
|
inline |
◆ is_merge()
bool CommitGraph::is_merge |
( |
VDesc |
v | ) |
const |
|
inline |
◆ next_commits()
generator<EDesc> CommitGraph::next_commits |
( |
VDesc |
v | ) |
const |
|
inline |
◆ operator[]() [1/3]
VDesc CommitGraph::operator[] |
( |
CR< git_oid > |
oid | ) |
|
|
inline |
◆ operator[]() [2/3]
◆ operator[]() [3/3]
◆ out_degree()
int CommitGraph::out_degree |
( |
VDesc |
v | ) |
const |
|
inline |
◆ parent_commits()
generator<EDesc> CommitGraph::parent_commits |
( |
VDesc |
v | ) |
const |
|
inline |
◆ source()
◆ target()
◆ main_path
std::vector<VDesc> CommitGraph::main_path |
◆ main_set
std::unordered_set<VDesc> CommitGraph::main_set |
◆ rev_map
std::unordered_map<git_oid, VDesc> CommitGraph::rev_map |
The documentation for this struct was generated from the following files: