[−][src]Module libpijul::pristine
Modules
channel_dump | |
sanakirja |
Structs
AdjacentIterator | An iterator for nodes adjacent to |
ChangePosition | The position of a byte within a change. |
ChannelIterator | |
ChannelRef | |
Cursor | A cursor over a table, initialised at a certain value. |
EdgeFlags | Possible flags of edges. |
Inode | A unique identifier for files or directories in the actual file system, to map "files from the graph" to real files. |
PathChangeset | |
Remote | |
RemoteRef | |
RemotesIterator | |
RevCursor | |
RevPathChangeset | |
TxnErr | |
Vertex | A node in the repository graph, made of a change internal identifier, and a line identifier in that change. |
Enums
BlockError | |
ForkError | |
Hash | The external hash of changes. |
HashAlgorithm | Algorithm used to compute change hashes. |
HashPrefixError | |
InconsistentChange |
Traits
Base32 | |
ChannelMutTxnT | |
ChannelTxnT | |
DepsMutTxnT | |
DepsTxnT | |
GraphIter | |
GraphMutTxnT | |
GraphTxnT | |
MutTxnT | The trait of immutable transactions. |
TreeMutTxnT | |
TreeTxnT | |
TxnT | The trait of immutable transactions. |
Functions
changeid_log | |
check_alive | |
check_alive_debug | Check that each alive vertex in the graph is reachable, and vice-versa. |
check_tree_inodes | Check that each inode in the inodes table maps to an alive vertex, and that each inode in the tree table is reachable by only one path. |
debug | Write the graph of a channel to write |
debug_inodes | |
debug_revinodes | |
debug_revtree | |
debug_revtree_print | |
debug_root | |
debug_to_file | Write the graph of a channel to file |
debug_tree | |
debug_tree_print | |
last_common_state | Find the last state of c1 that is also in c0. |
Type Definitions
ApplyTimestamp |