must_reintroduce: HashSet<(Vertex<ChangeId>, Vertex<ChangeId>)>,

    ws.must_reintroduce.clear();
    for n in newedges.edges.iter() {
        let mut source = crate::apply::edge::find_source_vertex(txn, channel, &n.from, change_id, newedges.inode, n.flag, &mut ws.apply)?;
        let mut target = crate::apply::edge::find_target_vertex(txn, channel, &n.to, change_id, newedges.inode, n.flag, &mut ws.apply)?;
        loop {
            let intro_ext = n.introduced_by.unwrap_or(ext);
            let intro = internal(txn, &n.introduced_by, change_id)?.unwrap();
            if must_reintroduce(txn, channel, changes, source, target, intro_ext, intro, change_id)? {
                ws.must_reintroduce.insert((source, target));
            }
            if target.end >= n.to.end {
                break;
            }
            source = target;
            target = *txn
                .find_block(channel, target.end_pos())
                .map_err(UnrecordError::from)?;
            assert_ne!(source, target);
        }
    }
    let reintro = std::mem::take(&mut ws.must_reintroduce);

            |txn, channel, a, b| {
                must_reintroduce(txn, channel, changes, a, b, ext, intro, change_id)
            },

            |a, b| reintro.contains(&(a, b)),

    ws.must_reintroduce = reintro;
    ws.must_reintroduce.clear();

mod edge;

pub(crate) mod edge;

                                |_, _, _, _| Ok::<bool, LocalApplyError<T::GraphError>>(true),

                                |_, _| true,

                            |_, _, _, _| Ok::<bool, LocalApplyError<T::GraphError>>(true),

                            |_, _| true,

pub fn put_newedge<T, E, F, K>(

pub fn put_newedge<T, F, K>(

) -> Result<(), E>

) -> Result<(), LocalApplyError<T::GraphError>>

    E: From<LocalApplyError<T::GraphError>> + From<TxnErr<T::GraphError>>,
    F: Fn(&mut T, &mut T::Graph, Vertex<ChangeId>, Vertex<ChangeId>) -> Result<bool, E>,

    F: Fn(Vertex<ChangeId>, Vertex<ChangeId>) -> bool,

            collect_nondeleted_zombies::<_, E, _>(

            collect_nondeleted_zombies::<_, _>(

        if apply_check(txn, graph, source, target)? {

        if apply_check(source, target) {

fn collect_nondeleted_zombies<T, E, K>(

fn collect_nondeleted_zombies<T, K>(

) -> Result<(), E>

) -> Result<(), LocalApplyError<T::GraphError>>

    E: From<LocalApplyError<T::GraphError>> + From<TxnErr<T::GraphError>>,

fn find_source_vertex<T: GraphMutTxnT>(

pub(crate) fn find_source_vertex<T: GraphMutTxnT>(

fn find_target_vertex<T: GraphMutTxnT>(

pub(crate) fn find_target_vertex<T: GraphMutTxnT>(

 "path-slash",

[[package]]
name = "path-slash"
version = "0.1.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "3cacbb3c4ff353b534a67fb8d7524d00229da4cb1dc8c79f4db96e375ab5b619"

 "path-slash",