Show / Hide Table of Contents

Class RouteCache

Data class that contains cached positions for routes (with generic wrapper).

Inheritance
System.Object
RouteCache<RouteCacheData>
RouteCache
Implements
System.Collections.Generic.IEnumerable<System.Collections.Generic.KeyValuePair<WorldPosition3i, RouteCacheData>>
System.Collections.IEnumerable
ISnapshotable<System.Collections.Generic.KeyValuePair<WorldPosition3i, RouteCacheData>>
Inherited Members
RouteCache<RouteCacheData>.grid
RouteCache<RouteCacheData>.GetClosestWalkable(WrappedPosition3i, Single)
RouteCache<RouteCacheData>.GetEnumerator()
RouteCache<RouteCacheData>.Add(WorldPosition3i, RouteCacheData)
RouteCache<RouteCacheData>.Remove(WorldPosition3i)
RouteCache<RouteCacheData>.Item[WorldPosition3i]
RouteCache<RouteCacheData>.Count
RouteCache<RouteCacheData>.Keys
RouteCache<RouteCacheData>.Snapshot
Namespace: Eco.Simulation.RouteProbing
Assembly: Eco.Simulation.dll
Syntax
public class RouteCache : RouteCache<RouteCacheData>, IEnumerable<KeyValuePair<WorldPosition3i, RouteCacheData>>, IEnumerable, ISnapshotable<KeyValuePair<WorldPosition3i, RouteCacheData>>

Constructors

RouteCache()

Declaration
public RouteCache()

Methods

GetAllWalkablesInColumn(WrappedPosition3i, Single, Boolean)

Same as GetClosestWalkable but can be used for bigger search ranges and it returns values for caching.

Declaration
public List<KeyValuePair<WorldPosition3i, RouteCacheData>> GetAllWalkablesInColumn(WrappedPosition3i pos, float searchRange = 2F, bool requireFlat = false)
Parameters
Type Name Description
WrappedPosition3i pos
System.Single searchRange

Number of blocks up and down from postion that will be searched in the column.

System.Boolean requireFlat

When true only flat ground will be considered walkable.

Returns
Type Description
System.Collections.Generic.List<System.Collections.Generic.KeyValuePair<WorldPosition3i, RouteCacheData>>

Implements

System.Collections.Generic.IEnumerable<>
System.Collections.IEnumerable
ISnapshotable<T>
☀
☾
In This Article
Back to top
Copyright (c) Strange Loop Games 2021
☀
☾