Struct StorageGeometry 

pub struct StorageGeometry<'a, 'b> {
    pub town: &'a TownView<'b>,
    pub sectors: &'a mut SectorGraph,
    pub ground: &'a dyn Fn(i32) -> [f32; 3],
}

The geometry called by the town’s storage search. Uses the same sector cache as the AI.

Fields

town: &'a TownView<'b>

A view of the town.

sectors: &'a mut SectorGraph

The sector graph.

ground: &'a dyn Fn(i32) -> [f32; 3]

The ground point of a cell.

Trait Implementations

impl StorageSearchMap for StorageGeometry<'_, '_>

fn rank(&mut self, a: i32, b: i32) -> i32

FUN_140008830: path rank, or map width plus truncated Euclidean cell distance.

fn market_position( &mut self, entity: usize, from: i32, rng: &mut Random, ) -> Option<(i32, [f32; 3])>

Port of FUN_14004f710: draw a use point (including Rand(1)), then test reachability.

fn storage_position( &mut self, entity: usize, from: i32, ) -> Option<(i32, [f32; 3])>

Port of FUN_140132aa0: nearest reachable use point, or scan the grown map rectangle. The rectangle branch includes one extra row at its upper end, as the x64 loop does.

fn entrance(&mut self, entity: usize, rng: &mut Random) -> i32

The cell a citizen walks to at an entity.