Struct caminos_lib::topology::multistage::ExplicitStage

pub struct ExplicitStage { /* fields omitted */ }

A Stage with a explicitly given list of neighbours for each router. Ignores grouping. Apt to build random stages.

Implementations

impl ExplicitStage

pub fn new(arg: StageBuilderArgument<'_>) -> ExplicitStage

pub fn add_reverse_indices(
    to_above: &Vec<Vec<usize>>,
    to_below: &Vec<Vec<usize>>
) -> (Vec<Vec<(usize, usize)>>, Vec<Vec<(usize, usize)>>)

Convert a pair of list of adjacencies into a pair of lists including the index to return. This is, return (f,g) with g[f[x][i].0][f[x][i].1]=x and f[g[x][i].0][g[x][i].1]=x for any x in range.

pub fn random_adjacencies(
    bottom_size: usize,
    bottom_degree: usize,
    top_size: usize,
    top_degree: usize,
    rng: &RefCell<StdRng>
) -> (Vec<Vec<usize>>, Vec<Vec<usize>>)

Build random regular adjacencies.

Trait Implementations

impl Debug for ExplicitStage

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

Formats the value using the given formatter.

impl Quantifiable for ExplicitStage

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.

impl Stage for ExplicitStage

fn compose_requirements_upward(
    &self,
    requirements: LevelRequirements,
    _bottom_level: usize,
    _height: usize
) -> LevelRequirements

Compose the requirements of lower stages with this one. bottom_level is the level corresponding to the bottom of this Stage. height is the total number of stages in the network.

fn downward_size(
    &self,
    top_size: usize,
    _bottom_group_size: usize,
    _bottom_level: usize,
    _height: usize
) -> Result<usize, ()>

Compute the size of the bottom level given the top one. Return error if there is not a legal one.

fn amount_to_above(
    &self,
    below_router: usize,
    _group_size: usize,
    _bottom_size: usize
) -> usize

Number of top routers that are neighbour to a given bottom.

fn amount_to_below(
    &self,
    above_router: usize,
    _group_size: usize,
    _bottom_size: usize
) -> usize

Number of bottom routers that are neighbour to a given top.

fn to_above(
    &self,
    below_router: usize,
    index: usize,
    _group_size: usize,
    _bottom_size: usize
) -> (usize, usize)

Get the (top neighbour, reverse index) of a bottom router associated to the given index. 0<=index<amount_to_above(). group_size is the size of each subnetwork.

fn to_below(
    &self,
    above_router: usize,
    index: usize,
    _group_size: usize,
    _bottom_size: usize
) -> (usize, usize)

Get the (bottom neighbour, reverse index) of a top router associated to the given index. 0<=index<amount_to_below(). group_size is the size of each subnetwork.