fn build_specialization_forest(&self) -> Result<Graph<ItemId, ()>> {
        // The forest is returned as a graph but built as a GraphMap; this is
        // so that we never add multiple nodes with the same ItemId.
        let mut forest = DiGraphMap::new();

        // Find all specializations (implemented in coherence/solve)
        // Record them in the forest by adding an edge from the less special
        // to the more special.
        self.visit_specializations(|less_special, more_special| {
            forest.add_edge(less_special, more_special, ());
        })?;

        Ok(forest.into_graph())
    }
// Build the forest of specialization relationships.
Build the forest of specialization relationships.
Build the forest of specialization relationships .
fn build_specialization_forest(&self) -> Result<Graph<ItemId, ()>> {
        // The forest is returned as a graph but built as a GraphMap; this is
        // so that we never add multiple nodes with the same ItemId.
        let mut forest = DiGraphMap::new();
        // Find all specializations (implemented in coherence/solve)
        // Record them in the forest by adding an edge from the less special
        // to the more special.
        self.visit_specializations(|less_special, more_special| {
            forest.add_edge(less_special, more_special, ());
        })?;
        Ok(forest.into_graph())
    }
fn build_specialization_forest ( & self ) -> Result < Graph < ItemId , ( ) > > { // The forest is returned as a graph but built as a GraphMap; this is // so that we never add multiple nodes with the same ItemId. let mut forest = DiGraphMap :: new ( ) ; // Find all specializations (implemented in coherence/solve) // Record them in the forest by adding an edge from the less special // to the more special. self . visit_specializations ( | less_special , more_special | { forest . add_edge ( less_special , more_special , ( ) ) ; } ) ? ; Ok ( forest . into_graph ( ) ) }
Build the forest of specialization relationships.
Build the forest of specialization relationships .
&self