Struct ltn::Partitioning

pub struct Partitioning {
    pub map: MapName,
    neighborhoods: BTreeMap<NeighborhoodID, (Block, Color)>,
    single_blocks: Vec<Block>,
    neighborhood_id_counter: usize,
    block_to_neighborhood: BTreeMap<BlockID, NeighborhoodID>,
    use_expensive_blockfinding: bool,
}

Fields

map: MapName

neighborhoods: BTreeMap<NeighborhoodID, (Block, Color)>

single_blocks: Vec<Block>

neighborhood_id_counter: usize

block_to_neighborhood: BTreeMap<BlockID, NeighborhoodID>

use_expensive_blockfinding: bool

Implementations

impl Partitioning

pub fn empty() -> Partitioning

Only valid before the LTN tool has been activated this session

pub fn is_empty(&self) -> bool

pub fn seed_using_heuristics(
    app: &SimpleApp<Session>,
    timer: &mut Timer<'_>
) -> Partitioning

pub fn recalculate_coloring(&mut self) -> bool

True if the coloring changed

pub fn transfer_block(
    &mut self,
    map: &Map,
    id: BlockID,
    old_owner: NeighborhoodID,
    new_owner: NeighborhoodID
) -> Result<Option<NeighborhoodID>>

pub fn remove_block_from_neighborhood(
    &mut self,
    map: &Map,
    id: BlockID,
    old_owner: NeighborhoodID
) -> Result<Option<NeighborhoodID>>

Needs to find an existing neighborhood to take the block, or make a new one

impl Partitioning

pub fn neighborhood_block(&self, id: NeighborhoodID) -> &Block

pub fn neighborhood_area_km2(&self, id: NeighborhoodID) -> String

pub fn neighborhood_color(&self, id: NeighborhoodID) -> Color

pub fn all_neighborhoods(&self) -> &BTreeMap<NeighborhoodID, (Block, Color)>

fn neighborhood_containing(&self, find_block: BlockID) -> Option<NeighborhoodID>

pub fn all_single_blocks(&self) -> Vec<(BlockID, &Block)>

pub fn all_block_ids(&self) -> Vec<BlockID>

pub fn get_block(&self, id: BlockID) -> &Block

pub fn block_to_neighborhood(&self, id: BlockID) -> NeighborhoodID

pub fn all_blocks_in_neighborhood(&self, id: NeighborhoodID) -> Vec<BlockID>

pub fn some_block_in_neighborhood(&self, id: NeighborhoodID) -> BlockID

pub fn calculate_frontier(&self, perim: &Perimeter) -> BTreeSet<BlockID>

Blocks on the “frontier” are adjacent to the perimeter, either just inside or outside.

fn make_merged_blocks(
    &self,
    map: &Map,
    input: Vec<BlockID>
) -> Result<Vec<Block>>

Trait Implementations

impl Clone for Partitioning

fn clone(&self) -> Partitioning

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'de> Deserialize<'de> for Partitioning

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

Deserialize this value from the given Serde deserializer.

impl Serialize for Partitioning

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

Serialize this value into the given Serde serializer.