pub fn trace<N: Network>(self, mut network: N) -> TraceResult<()> {
        let mut state = TracerState::new(self.first_ttl, self.initial_sequence);
        while !state.finished(self.max_rounds) {
            self.send_request(&mut network, &mut state)?;
            self.recv_response(&mut network, &mut state)?;
            self.update_round(&mut state);
        }
        Ok(())
    }
/// Run a continuous trace and publish results.
///
/// TODO describe algorithm
Run a continuous trace and publish results.
TODO describe algorithm
Run a continuous trace and publish results . TODO describe algorithm
pub fn trace<N: Network>(self, mut network: N) -> TraceResult<()> {
        let mut state = TracerState::new(self.first_ttl, self.initial_sequence);
        while !state.finished(self.max_rounds) {
            self.send_request(&mut network, &mut state)?;
            self.recv_response(&mut network, &mut state)?;
            self.update_round(&mut state);
        }
        Ok(())
    }
pub fn trace < N : Network > ( self , mut network : N ) -> TraceResult < ( ) > { let mut state = TracerState :: new ( self . first_ttl , self . initial_sequence ) ; while ! state . finished ( self . max_rounds ) { self . send_request ( & mut network , & mut state ) ? ; self . recv_response ( & mut network , & mut state ) ? ; self . update_round ( & mut state ) ; } Ok ( ( ) ) }
Run a continuous trace and publish results.
Run a continuous trace and publish results .
self
network
N