Trait GraphAssert 

pub trait GraphAssert<'g>: Copy + Debug {
    type Id: Copy + Eq + Hash + Debug;
    type Metadata: GraphMetadata<'g, Id = Self::Id>;
    type Query: GraphQuery<'g, Id = Self::Id, Set = Self::Set>;
    type Set: GraphSet<'g, Id = Self::Id, Metadata = Self::Metadata>;

    const NAME: &'static str;

    // Required methods
    fn depends_on(&self, a_id: Self::Id, b_id: Self::Id) -> Result<bool, Error>;
    fn directly_depends_on(
        &self,
        a_id: Self::Id,
        b_id: Self::Id,
    ) -> Result<bool, Error>;
    fn has_self_edge(&self, id: Self::Id) -> bool;
    fn is_cyclic(&self, a_id: Self::Id, b_id: Self::Id) -> Result<bool, Error>;
    fn all_cycles(&self) -> Vec<Vec<Self::Id>>;
    fn query(
        &self,
        initials: impl IntoIterator<Item = Self::Id>,
        direction: DependencyDirection,
    ) -> Self::Query;

    // Provided methods
    fn resolve(
        &self,
        initials: &[Self::Id],
        direction: DependencyDirection,
    ) -> Self::Set { ... }
    fn ids(
        &self,
        initials: &[Self::Id],
        query_direction: DependencyDirection,
        iter_direction: DependencyDirection,
    ) -> Vec<Self::Id> { ... }
    fn root_ids(
        &self,
        initials: &[Self::Id],
        query_direction: DependencyDirection,
        iter_direction: DependencyDirection,
    ) -> Vec<Self::Id> { ... }
    fn root_metadatas(
        &self,
        initials: &[Self::Id],
        query_direction: DependencyDirection,
        iter_direction: DependencyDirection,
    ) -> Vec<Self::Metadata> { ... }
    fn assert_topo_order(
        &self,
        topo_ids: impl IntoIterator<Item = Self::Id>,
        direction: DependencyDirection,
        msg: &str,
    ) { ... }
    fn assert_depends_on_any(
        &self,
        source_ids: &[Self::Id],
        query_id: Self::Id,
        direction: DependencyDirection,
        msg: &str,
    ) { ... }
    fn assert_depends_on(
        &self,
        a_id: Self::Id,
        b_id: Self::Id,
        direction: DependencyDirection,
        msg: &str,
    ) { ... }
    fn assert_not_depends_on(
        &self,
        a_id: Self::Id,
        b_id: Self::Id,
        direction: DependencyDirection,
        msg: &str,
    ) { ... }
    fn assert_directly_depends_on(
        &self,
        a_id: Self::Id,
        b_id: Self::Id,
        direction: DependencyDirection,
        msg: &str,
    ) { ... }
}

Required Associated Constants

const NAME: &'static str

Required Associated Types

type Id: Copy + Eq + Hash + Debug

type Metadata: GraphMetadata<'g, Id = Self::Id>

type Query: GraphQuery<'g, Id = Self::Id, Set = Self::Set>

type Set: GraphSet<'g, Id = Self::Id, Metadata = Self::Metadata>

Required Methods

fn depends_on(&self, a_id: Self::Id, b_id: Self::Id) -> Result<bool, Error>

fn directly_depends_on( &self, a_id: Self::Id, b_id: Self::Id, ) -> Result<bool, Error>

fn has_self_edge(&self, id: Self::Id) -> bool

Returns true if there is a self-loop edge on id in the graph, computed via a different code path than directly_depends_on so it can be used as an independent oracle.

fn is_cyclic(&self, a_id: Self::Id, b_id: Self::Id) -> Result<bool, Error>

fn all_cycles(&self) -> Vec<Vec<Self::Id>>

Returns every cycle in the graph as a list of node IDs. Used by cycle-consistency proptests to cross-check against is_cyclic.

fn query( &self, initials: impl IntoIterator<Item = Self::Id>, direction: DependencyDirection, ) -> Self::Query

Provided Methods

fn resolve( &self, initials: &[Self::Id], direction: DependencyDirection, ) -> Self::Set

fn ids( &self, initials: &[Self::Id], query_direction: DependencyDirection, iter_direction: DependencyDirection, ) -> Vec<Self::Id>

fn root_ids( &self, initials: &[Self::Id], query_direction: DependencyDirection, iter_direction: DependencyDirection, ) -> Vec<Self::Id>

fn root_metadatas( &self, initials: &[Self::Id], query_direction: DependencyDirection, iter_direction: DependencyDirection, ) -> Vec<Self::Metadata>

fn assert_topo_order( &self, topo_ids: impl IntoIterator<Item = Self::Id>, direction: DependencyDirection, msg: &str, )

fn assert_depends_on_any( &self, source_ids: &[Self::Id], query_id: Self::Id, direction: DependencyDirection, msg: &str, )

fn assert_depends_on( &self, a_id: Self::Id, b_id: Self::Id, direction: DependencyDirection, msg: &str, )

fn assert_not_depends_on( &self, a_id: Self::Id, b_id: Self::Id, direction: DependencyDirection, msg: &str, )

fn assert_directly_depends_on( &self, a_id: Self::Id, b_id: Self::Id, direction: DependencyDirection, msg: &str, )

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<'g> GraphAssert<'g> for &'g PackageGraph

const NAME: &'static str = "package"

type Id = &'g PackageId

type Metadata = PackageMetadata<'g>

type Query = PackageQuery<'g>

type Set = PackageSet<'g>

fn depends_on(&self, a_id: Self::Id, b_id: Self::Id) -> Result<bool, Error>

fn directly_depends_on( &self, a_id: Self::Id, b_id: Self::Id, ) -> Result<bool, Error>

fn has_self_edge(&self, id: Self::Id) -> bool

fn is_cyclic(&self, a_id: Self::Id, b_id: Self::Id) -> Result<bool, Error>

fn all_cycles(&self) -> Vec<Vec<Self::Id>>

fn query( &self, initials: impl IntoIterator<Item = Self::Id>, direction: DependencyDirection, ) -> Self::Query

impl<'g> GraphAssert<'g> for FeatureGraph<'g>

const NAME: &'static str = "feature"

type Id = FeatureId<'g>

type Metadata = FeatureMetadata<'g>

type Query = FeatureQuery<'g>

type Set = FeatureSet<'g>

fn depends_on(&self, a_id: Self::Id, b_id: Self::Id) -> Result<bool, Error>

fn directly_depends_on( &self, a_id: Self::Id, b_id: Self::Id, ) -> Result<bool, Error>

fn has_self_edge(&self, id: Self::Id) -> bool

fn is_cyclic(&self, a_id: Self::Id, b_id: Self::Id) -> Result<bool, Error>

fn all_cycles(&self) -> Vec<Vec<Self::Id>>

fn query( &self, initials: impl IntoIterator<Item = Self::Id>, direction: DependencyDirection, ) -> Self::Query

Implementors