Struct RandomInvolution

pub struct RandomInvolution { /* private fields */ }

Build a random involution on initialization, which is then kept constant. An involution is a permutation that is a pairing/matching; if a is the destination of b then b is the destination of a. It will panic if given an odd size. See RandomPermutation.

Trait Implementations

impl Debug for RandomInvolution

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Pattern for RandomInvolution

fn initialize( &mut self, source_size: usize, target_size: usize, _topology: &dyn Topology, rng: &mut StdRng, )

Fix the input and output size, providing the topology and random number generator. Careful with using topology in sub-patterns. For example, it may be misleading to use the dragonfly topology when building a pattern among groups or a pattern among the routers of a single group. Even just a pattern of routers instead of a pattern of servers can lead to mistakes. Read the documentation of the traffic or meta-pattern using the pattern to know what its their input and output.

fn get_destination( &self, origin: usize, _topology: &dyn Topology, _rng: &mut StdRng, ) -> usize

Obtain a destination of a source. This will be called repeatedly as the traffic requires destination for its messages.

impl Quantifiable for RandomInvolution

fn total_memory(&self) -> usize

Get the total memory currently being employed by the implementing type. Both stack and heap.

fn print_memory_breakdown(&self)

Prints by stdout how much memory is used per component.

fn forecast_total_memory(&self) -> usize

Get an estimation on how much memory the type could reach during the simulation.