BoxcarCachingAlgorithm.cpp

 
/* SPDX-License-Identifier: CC0-1.0 */
 
#include "BoxcarCachingAlgorithm.h"
 
#include <algorithm>
#include <iostream>
 
#include <QList>
#include <QQueue>
 
#include "IException.h"
#include "IString.h"
#include "RawCubeChunk.h"
 
namespace Isis {
  BoxcarCachingAlgorithm::BoxcarCachingAlgorithm() {
    m_minLine = 1;
  }
 

  BoxcarCachingAlgorithm::~BoxcarCachingAlgorithm() {
  }
 

  CubeCachingAlgorithm::CacheResult
      BoxcarCachingAlgorithm::recommendChunksToFree(
      QList <RawCubeChunk *> allocated, QList <RawCubeChunk *> justUsed,
          const Buffer &justRequested) {
    (void) justRequested; // unused, for fullfilling virtual function signiture 
    QList<RawCubeChunk *> chunksToToss;
 
    if (justUsed.size() > 0) {
      // TODO bands
      int minLine = justUsed[0]->getStartLine();
 
      QListIterator<RawCubeChunk *> justUsedIterator(justUsed);
      while (justUsedIterator.hasNext()) {
        RawCubeChunk *chunk = justUsedIterator.next();
        int currentStart = chunk->getStartLine();
        if (currentStart < minLine) minLine = currentStart;
      }
 
      if (minLine > m_minLine) {
        m_minLine = minLine;
        QListIterator<RawCubeChunk *> allocatedIterator(allocated);
        while (allocatedIterator.hasNext()) {
          RawCubeChunk *chunk = allocatedIterator.next();
          int currentEnd = chunk->getStartLine() + chunk->lineCount() - 1;
 
          if (currentEnd < minLine) {
            chunksToToss.append(chunk);
          }
        }
      }
    }
 
    return CacheResult(chunksToToss);
  }
}