20 #include <boost/unordered_map.hpp>
22 #include <matrix/vlVector.h>
42 void setCacheLimit(
int);
43 int cacheLimit()
const;
51 virtual void addCachedPointResult(
59 double x,
double y,
double z,
double end_x,
double end_y,
double end_z,
63 virtual void addCachedLineResult(
66 double z,
double end_x,
double end_y,
double end_z,
76 typedef boost::unordered_map<std::size_t, PointInformation>
PointCache;
83 virtual void updateCache(PointCache::iterator&);
86 virtual void removeFromCache();
IntersectProperties
The IntersectProperties enum is a flag set that indicates the.
Definition: DtIntersector.h:135
unsigned int myTotalCacheSize
Definition: DtIntersectorCache.h:93
std::vector< DtIntersectorResult > DtIntersections
A vector of DtIntersectionRecords.
Definition: DtIntersector.h:154
unsigned int myCacheLimit
Definition: DtIntersectorCache.h:92
std::map< int, KeyVector > CacheEntries
Definition: DtIntersectorCache.h:80
the Intersector Cache class.
Definition: DtIntersectorCache.h:31
DynamicOceanProperties
Definition: DtIntersector.h:146
Class that will be used to translate positions into a quick lookup key for cached intersections...
Definition: DtIntersectorCacheKey.h:27
std::vector< std::size_t > KeyVector
Use the ordered map to ensure least used gets taken away first.
Definition: DtIntersectorCache.h:79
boost::unordered_map< std::size_t, PointInformation > PointCache
Definition: DtIntersectorCache.h:76
Contains makVrv:DtIntersector, makVrv:DtIntersectorLineSegment, and makVrv:DtIntersectorResult classe...
PointCache myPointCache
Definition: DtIntersectorCache.h:89
#define DT_DLL_VRVCORE
Definition: vrvCore.h:20
CacheEntries myCacheEntries
Definition: DtIntersectorCache.h:90
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:75