|  | VTK
    9.0.1
    | 
 
 
 
Go to the documentation of this file.    1 #ifndef vtkExodusIICache_h 
    2 #define vtkExodusIICache_h 
   26 #include "vtkIOExodusModule.h"  
   70     if (pattern.
Time && this->Time != other.
Time)
 
   82     if (this->Time < other.
Time)
 
   84     else if (this->Time > other.
Time)
 
   92     else if (this->ObjectId > other.
ObjectId)
 
   94     if (this->ArrayId < other.
ArrayId)
 
  139   void SetCacheCapacity(
double sizeInMiB);
 
  150   int ReduceToSize(
double newSize);
 
  185   void RecomputeSize();
 
  209 #endif // vtkExodusIICache_h 
 
bool operator<(const vtkExodusIICacheKey &other) const
vtkExodusIICacheLRURef LRUEntry
static vtkObject * New()
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
bool match(const vtkExodusIICacheKey &other, const vtkExodusIICacheKey &pattern) const
abstract base class for most VTK objects
abstract superclass for arrays of numeric data
std::map< vtkExodusIICacheKey, vtkExodusIICacheEntry * >::iterator vtkExodusIICacheRef
vtkExodusIICacheKey(const vtkExodusIICacheKey &src)
std::list< vtkExodusIICacheRef > vtkExodusIICacheLRU
std::list< vtkExodusIICacheRef >::iterator vtkExodusIICacheLRURef
a simple class to control print indentation
std::map< vtkExodusIICacheKey, vtkExodusIICacheEntry * > vtkExodusIICacheSet
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
vtkExodusIICacheKey(int time, int objType, int objId, int arrId)
vtkDataArray * GetValue()
double GetSpaceLeft()
See how much cache space is left.
double Capacity
The capacity of the cache (i.e., the maximum size of all arrays it contains) in MiB.
vtkExodusIICacheSet Cache
A least-recently-used (LRU) cache to hold arrays.
double Size
The current size of the cache (i.e., the size of the all the arrays it currently contains) in MiB.
vtkExodusIICacheKey & operator=(const vtkExodusIICacheKey &src)
vtkExodusIICacheLRU LRU
The actual LRU list (indices into the cache ordered least to most recently used).