pub struct Commute {
pub timer: i64,
pub pairs: Vec<(i32, i32)>,
pub index: i32,
pub ranks: BTreeMap<(i32, i32), i32>,
}Expand description
The optimisation’s state: StockManager (the time since the last run) and the job object (its pairs, the next pair’s index and the region-pair ranks).
Fields§
§timer: i64The time since the last run.
pairs: Vec<(i32, i32)>The pairs of cells to rank: a workplace entrance and a home.
index: i32The next pair to rank (−1 when done).
ranks: BTreeMap<(i32, i32), i32>The rank of each pair of regions.
Trait Implementations§
impl Eq for Commute
impl StructuralPartialEq for Commute
Auto Trait Implementations§
impl Freeze for Commute
impl RefUnwindSafe for Commute
impl Send for Commute
impl Sync for Commute
impl Unpin for Commute
impl UnsafeUnpin for Commute
impl UnwindSafe for Commute
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more