[−][src]Trait libpijul::pristine::GraphTxnT
Associated Types
Loading content...Required methods
pub fn get_graph<'txn>(
&'txn self,
db: &Self::Graph,
key: Vertex<ChangeId>,
value: Option<Edge>
) -> Result<Option<Edge>, TxnErr<Self::GraphError>>
[src]
&'txn self,
db: &Self::Graph,
key: Vertex<ChangeId>,
value: Option<Edge>
) -> Result<Option<Edge>, TxnErr<Self::GraphError>>
pub fn get_external(
&self,
p: ChangeId
) -> Result<Option<Hash>, TxnErr<Self::GraphError>>
[src]
&self,
p: ChangeId
) -> Result<Option<Hash>, TxnErr<Self::GraphError>>
Returns the external hash of an internal change identifier, if the change is known.
pub fn get_internal(
&self,
p: Hash
) -> Result<Option<ChangeId>, TxnErr<Self::GraphError>>
[src]
&self,
p: Hash
) -> Result<Option<ChangeId>, TxnErr<Self::GraphError>>
Returns the internal change identifier of change with external
hash hash
, if the change is known.
pub fn init_adj(
&self,
g: &Self::Graph,
v: Vertex<ChangeId>,
dest: Position<ChangeId>,
min: EdgeFlags,
max: EdgeFlags
) -> Result<Self::Adj, TxnErr<Self::GraphError>>
[src]
&self,
g: &Self::Graph,
v: Vertex<ChangeId>,
dest: Position<ChangeId>,
min: EdgeFlags,
max: EdgeFlags
) -> Result<Self::Adj, TxnErr<Self::GraphError>>
pub fn next_adj(
&self,
g: &Self::Graph,
a: &mut Self::Adj
) -> Option<Result<Edge, TxnErr<Self::GraphError>>>
[src]
&self,
g: &Self::Graph,
a: &mut Self::Adj
) -> Option<Result<Edge, TxnErr<Self::GraphError>>>
pub fn find_block(
&self,
graph: &Self::Graph,
p: Position<ChangeId>
) -> Result<Vertex<ChangeId>, BlockError<Self::GraphError>>
[src]
&self,
graph: &Self::Graph,
p: Position<ChangeId>
) -> Result<Vertex<ChangeId>, BlockError<Self::GraphError>>
pub fn find_block_end(
&self,
graph: &Self::Graph,
p: Position<ChangeId>
) -> Result<Vertex<ChangeId>, BlockError<Self::GraphError>>
[src]
&self,
graph: &Self::Graph,
p: Position<ChangeId>
) -> Result<Vertex<ChangeId>, BlockError<Self::GraphError>>
Implementors
impl<T: Transaction> GraphTxnT for GenericTxn<T>
[src]
type Graph = Db<Vertex<ChangeId>, Edge>
type GraphError = SanakirjaError
pub fn get_graph(
&self,
db: &Self::Graph,
key: Vertex<ChangeId>,
value: Option<Edge>
) -> Result<Option<Edge>, TxnErr<Self::GraphError>>
[src]
&self,
db: &Self::Graph,
key: Vertex<ChangeId>,
value: Option<Edge>
) -> Result<Option<Edge>, TxnErr<Self::GraphError>>
pub fn get_external(
&self,
p: ChangeId
) -> Result<Option<Hash>, TxnErr<Self::GraphError>>
[src]
&self,
p: ChangeId
) -> Result<Option<Hash>, TxnErr<Self::GraphError>>
pub fn get_internal(
&self,
p: Hash
) -> Result<Option<ChangeId>, TxnErr<Self::GraphError>>
[src]
&self,
p: Hash
) -> Result<Option<ChangeId>, TxnErr<Self::GraphError>>
type Adj = Adj
pub fn init_adj(
&self,
g: &Self::Graph,
key: Vertex<ChangeId>,
dest: Position<ChangeId>,
min_flag: EdgeFlags,
max_flag: EdgeFlags
) -> Result<Self::Adj, TxnErr<Self::GraphError>>
[src]
&self,
g: &Self::Graph,
key: Vertex<ChangeId>,
dest: Position<ChangeId>,
min_flag: EdgeFlags,
max_flag: EdgeFlags
) -> Result<Self::Adj, TxnErr<Self::GraphError>>
pub fn next_adj(
&self,
_: &Self::Graph,
a: &mut Self::Adj
) -> Option<Result<Edge, TxnErr<Self::GraphError>>>
[src]
&self,
_: &Self::Graph,
a: &mut Self::Adj
) -> Option<Result<Edge, TxnErr<Self::GraphError>>>
pub fn find_block(
&self,
graph: &Self::Graph,
p: Position<ChangeId>
) -> Result<Vertex<ChangeId>, BlockError<Self::GraphError>>
[src]
&self,
graph: &Self::Graph,
p: Position<ChangeId>
) -> Result<Vertex<ChangeId>, BlockError<Self::GraphError>>
pub fn find_block_end(
&self,
graph: &Self::Graph,
p: Position<ChangeId>
) -> Result<Vertex<ChangeId>, BlockError<Self::GraphError>>
[src]
&self,
graph: &Self::Graph,
p: Position<ChangeId>
) -> Result<Vertex<ChangeId>, BlockError<Self::GraphError>>