17 #include <boost/unordered_map.hpp>
19 #include <matrix/vlVector.h>
39 void setCacheLimit(
int);
40 int cacheLimit()
const;
48 virtual void addCachedPointResult(
56 double x,
double y,
double z,
double end_x,
double end_y,
double end_z,
60 virtual void addCachedLineResult(
63 double z,
double end_x,
double end_y,
double end_z,
73 typedef boost::unordered_map<std::size_t, PointInformation>
PointCache;
80 virtual void updateCache(PointCache::iterator&);
83 virtual void removeFromCache();
IntersectProperties
The IntersectProperties enum is a flag set that indicates the types of nodes to be considered for int...
Definition: DtIntersector.h:31
unsigned int myTotalCacheSize
Definition: DtIntersectorCache.h:90
std::vector< DtIntersectorResult > DtIntersections
A vector of DtIntersectionRecords.
Definition: DtIntersector.h:50
unsigned int myCacheLimit
Definition: DtIntersectorCache.h:89
std::map< int, KeyVector > CacheEntries
Definition: DtIntersectorCache.h:77
the Intersector Cache class. Use to store intersection and intersection results. Can only be used to ...
Definition: DtIntersectorCache.h:28
DynamicOceanProperties
Definition: DtIntersector.h:42
Class that will be used to translate positions into a quick lookup key for cached intersections...
Definition: DtIntersectorCacheKey.h:24
std::vector< std::size_t > KeyVector
Use the ordered map to ensure least used gets taken away first.
Definition: DtIntersectorCache.h:76
boost::unordered_map< std::size_t, PointInformation > PointCache
Definition: DtIntersectorCache.h:73
Contains makVrv:DtIntersector class.
PointCache myPointCache
Definition: DtIntersectorCache.h:86
#define DT_DLL_VRVCORE
Definition: vrvCore.h:20
CacheEntries myCacheEntries
Definition: DtIntersectorCache.h:87
std::pair< DtIntersector::DtIntersections, int > PointInformation
In a single point cache, there is only one map that contains all possible end points.
Definition: DtIntersectorCache.h:72