pub fn size(&self) -> (usize, usize, Reverse<usize>) {
        let mut num_links = 0;
        let mut num_required_nodes = 0;
        for chunk in self.chunks.values() {
            num_links += chunk.successors.len();
            if chunk.required {
                num_required_nodes += 1;
            }
        }
        (self.chunks.len(), num_links, Reverse(num_required_nodes))
    }
/// Return a value representing the 'size' of this graph.  Optimisation passes are
/// **required** to never increase this quantity.  Graph size is compared on the following
/// factors (in order of precedence, most important first):
/// 1. Number of nodes (smaller is better)
/// 2. Number of links (smaller is better)
/// 3. Number of required nodes (more is better)
Return a value representing the 'size' of this graph.  Optimisation passes are
required** to never increase this quantity.  Graph size is compared on the following
factors (in order of precedence, most important first):
1. Number of nodes (smaller is better)
2. Number of links (smaller is better)
3. Number of required nodes (more is better)
Return a value representing the ' size ' of this graph . Optimisation passes are required ** to never increase this quantity . Graph size is compared on the following factors ( in order of precedence most important first ) : 1 . Number of nodes ( smaller is better ) 2 . Number of links ( smaller is better ) 3 . Number of required nodes ( more is better )
pub fn size(&self) -> (usize, usize, Reverse<usize>) {
        let mut num_links = 0;
        let mut num_required_nodes = 0;
        for chunk in self.chunks.values() {
            num_links += chunk.successors.len();
            if chunk.required {
                num_required_nodes += 1;
            }
        }
        (self.chunks.len(), num_links, Reverse(num_required_nodes))
    }
pub fn size ( & self ) -> ( usize , usize , Reverse < usize > ) { let mut num_links = 0 ; let mut num_required_nodes = 0 ; for chunk in self . chunks . values ( ) { num_links += chunk . successors . len ( ) ; if chunk . required { num_required_nodes += 1 ; } } ( self . chunks . len ( ) , num_links , Reverse ( num_required_nodes ) ) }
Return a value representing the 'size' of this graph.
Return a value representing the ' size ' of this graph .
&self
&self