Struct sim::scheduler::Scheduler

pub(crate) struct Scheduler {
    items: BinaryHeap<Item>,
    queued_commands: HashMap<CommandType, (Command, Time)>,
    latest_time: Time,
    last_time: Time,
    delta_times: Histogram<Duration>,
    cmd_type_counts: Counter<SimpleCommandType>,
}

The priority queue driving the discrete event simulation. Different pieces of the simulation schedule Commands to happen at a specific time, and the Scheduler hands out the commands in order.

Fields

items: BinaryHeap<Item>

queued_commands: HashMap<CommandType, (Command, Time)>

latest_time: Time

last_time: Time

delta_times: Histogram<Duration>

cmd_type_counts: Counter<SimpleCommandType>

Implementations

impl Scheduler

pub fn new() -> Scheduler

pub fn push(&mut self, time: Time, cmd: Command)

pub fn update(&mut self, new_time: Time, cmd: Command)

pub fn cancel(&mut self, cmd: Command)

pub fn peek_next_time(&self) -> Option<Time>

This next command might've actually been rescheduled to a later time; the caller won't know that here.

pub fn get_last_time(&self) -> Time

pub fn get_next(&mut self) -> Option<Command>

This API is safer than handing out a batch of items at a time, because while processing one item, we might change the priority of other items or add new items. Don't make the caller reconcile those changes -- just keep pulling items from here, one at a time.

pub fn describe_stats(&self) -> Vec<String>

Trait Implementations

impl Clone for Scheduler

fn clone(&self) -> Scheduler

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'de> Deserialize<'de> for Scheduler

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl Serialize for Scheduler

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.