Skip to main content

StorageSearchMap

Trait StorageSearchMap 

Source
pub trait StorageSearchMap {
    // Required methods
    fn entrance(&mut self, entity: usize, rng: &mut Random) -> i32;
    fn rank(&mut self, a: i32, b: i32) -> i32;
    fn market_position(
        &mut self,
        entity: usize,
        from: i32,
        rng: &mut Random,
    ) -> Option<(i32, [f32; 3])>;
    fn storage_position(
        &mut self,
        entity: usize,
        from: i32,
    ) -> Option<(i32, [f32; 3])>;
}
Expand description

What the storage search needs from the map: distances, reach and the markets’ areas.

Original: the map queries of FUN_140093200.

Required Methods§

Source

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

The cell a citizen walks to at an entity.

Source

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

The path-rank distance between two cells.

Source

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

A market’s position, if it can be reached.

Source

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

A storage’s drop point, if it can be reached from from.

Dyn Compatibility§

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors§