guppy/petgraph_support/
mod.rs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
// Copyright (c) The cargo-guppy Contributors
// SPDX-License-Identifier: MIT OR Apache-2.0

//! Support for petgraph.
//!
//! The code in here is generic over petgraph's traits, and could be upstreamed into petgraph if
//! desirable.

use fixedbitset::FixedBitSet;
use petgraph::{graph::IndexType, prelude::*};
use std::iter::FromIterator;

pub mod dfs;
pub mod dot;
pub mod edge_ref;
pub mod scc;
pub mod topo;
pub mod walk;

pub fn edge_triple<ER: EdgeRef>(edge_ref: ER) -> (ER::NodeId, ER::NodeId, ER::EdgeId) {
    (edge_ref.source(), edge_ref.target(), edge_ref.id())
}

#[derive(Clone, Debug, Default)]
pub struct IxBitSet(pub FixedBitSet);

impl IxBitSet {
    #[inline]
    pub(crate) fn with_capacity(bits: usize) -> Self {
        Self(FixedBitSet::with_capacity(bits))
    }

    #[inline]
    pub(crate) fn insert_node_ix<Ix: IndexType>(&mut self, bit: NodeIndex<Ix>) {
        self.0.insert(bit.index());
    }
}

impl From<IxBitSet> for FixedBitSet {
    fn from(ix_set: IxBitSet) -> Self {
        ix_set.0
    }
}

impl<Ix: IndexType> FromIterator<NodeIndex<Ix>> for IxBitSet {
    fn from_iter<T: IntoIterator<Item = NodeIndex<Ix>>>(iter: T) -> Self {
        IxBitSet(iter.into_iter().map(|node_ix| node_ix.index()).collect())
    }
}

impl<Ix: IndexType> FromIterator<EdgeIndex<Ix>> for IxBitSet {
    fn from_iter<T: IntoIterator<Item = EdgeIndex<Ix>>>(iter: T) -> Self {
        IxBitSet(iter.into_iter().map(|edge_ix| edge_ix.index()).collect())
    }
}

impl<Ix: IndexType> Extend<NodeIndex<Ix>> for IxBitSet {
    fn extend<T: IntoIterator<Item = NodeIndex<Ix>>>(&mut self, iter: T) {
        self.0
            .extend(iter.into_iter().map(|node_ix| node_ix.index()));
    }
}