[−][src]Trait libpijul::pristine::GraphMutTxnT

pub trait GraphMutTxnT: GraphTxnT {
    pub fn put_internal(
        &mut self, 
        k: Hash, 
        e: ChangeId
    ) -> Result<bool, TxnErr<Self::GraphError>>;

    pub fn del_internal(
        &mut self, 
        k: Hash, 
        e: Option<ChangeId>
    ) -> Result<bool, TxnErr<Self::GraphError>>;

    pub fn put_external(
        &mut self, 
        k: ChangeId, 
        e: Hash
    ) -> Result<bool, TxnErr<Self::GraphError>>;

    pub fn del_external(
        &mut self, 
        k: ChangeId, 
        e: Option<Hash>
    ) -> Result<bool, TxnErr<Self::GraphError>>;

    pub fn put_graph(
        &mut self, 
        channel: &mut Self::Graph, 
        k: Vertex<ChangeId>, 
        v: Edge
    ) -> Result<bool, TxnErr<Self::GraphError>>;

    pub fn del_graph(
        &mut self, 
        channel: &mut Self::Graph, 
        k: Vertex<ChangeId>, 
        v: Option<Edge>
    ) -> Result<bool, TxnErr<Self::GraphError>>;

    pub fn split_block(
        &mut self, 
        graph: &mut Self::Graph, 
        key: Vertex<ChangeId>, 
        pos: ChangePosition, 
        buf: &mut Vec<Edge>
    ) -> Result<(), TxnErr<Self::GraphError>>;
}

Required methods

pub fn put_internal(
    &mut self,
    k: Hash,
    e: ChangeId
) -> Result<bool, TxnErr<Self::GraphError>>[src]

pub fn del_internal(
    &mut self,
    k: Hash,
    e: Option<ChangeId>
) -> Result<bool, TxnErr<Self::GraphError>>[src]

pub fn put_external(
    &mut self,
    k: ChangeId,
    e: Hash
) -> Result<bool, TxnErr<Self::GraphError>>[src]

pub fn del_external(
    &mut self,
    k: ChangeId,
    e: Option<Hash>
) -> Result<bool, TxnErr<Self::GraphError>>[src]

pub fn put_graph(
    &mut self,
    channel: &mut Self::Graph,
    k: Vertex<ChangeId>,
    v: Edge
) -> Result<bool, TxnErr<Self::GraphError>>[src]

Insert a key and a value to a graph. Returns false if and only if (k, v) was already in the graph, in which case no insertion happened.

pub fn del_graph(
    &mut self,
    channel: &mut Self::Graph,
    k: Vertex<ChangeId>,
    v: Option<Edge>
) -> Result<bool, TxnErr<Self::GraphError>>[src]

Delete a key and a value from a graph. Returns true if and only if (k, v) was in the graph.

pub fn split_block(
    &mut self,
    graph: &mut Self::Graph,
    key: Vertex<ChangeId>,
    pos: ChangePosition,
    buf: &mut Vec<Edge>
) -> Result<(), TxnErr<Self::GraphError>>[src]

Split a key [a, b[ at position pos, yielding two keys [a, pos[ and [pos, b[ linked by an edge.

Loading content...

Implementors

impl GraphMutTxnT for MutTxn<()>[src]

Loading content...