8#include "CubeCachingAlgorithm.h" 
   14#include "RawCubeChunk.h" 
   47    m_chunksToFree = NULL;
 
   48    m_chunksToFree = 
new QList<RawCubeChunk *>(free);
 
 
   58    m_chunksToFree = NULL;
 
   60    if(other.m_chunksToFree)
 
   61      m_chunksToFree = 
new QList<RawCubeChunk *>(*other.m_chunksToFree);
 
 
   70      delete m_chunksToFree;
 
   71      m_chunksToFree = NULL;
 
 
   84    return (m_chunksToFree != NULL);
 
 
   94    QList<RawCubeChunk *> recommended;
 
   96    if(m_chunksToFree != NULL)
 
   97      recommended = *m_chunksToFree;
 
 
  112    delete m_chunksToFree;
 
  113    m_chunksToFree = NULL;
 
  115    if(other.m_chunksToFree) {
 
  116      m_chunksToFree = 
new QList<RawCubeChunk *>;
 
 
This stores the results of the caching algorithm.
 
CacheResult & operator=(const CacheResult &other)
Assign one cache result to another.
 
QList< RawCubeChunk * > getChunksToFree() const
 
CacheResult()
Construct a cache algorithm result with the idea that the algorithm did not understand/was unable to ...
 
bool algorithmUnderstoodData() const
If this is true, then the results (be them empty or not) should be considered valid.
 
virtual ~CacheResult()
Free allocated memory.
 
QList< RawCubeChunk * > * m_chunksToFree
If NULL, the algorithm did not succeed.
 
CubeCachingAlgorithm()
Construct a caching algorithm.
 
virtual ~CubeCachingAlgorithm()
Cleans up after a caching algorithm.
 
This is free and unencumbered software released into the public domain.