vil_block_cache.cxx

Go to the documentation of this file.

#include <algorithm>
#include "vil_block_cache.h"
//:
// \file
#ifdef _MSC_VER
#  include <vcl_msvc_warnings.h>
#endif
#include <cassert>

unsigned long bcell::time_ = 0;

vil_block_cache::~vil_block_cache()
{
  for(auto & block : blocks_){
    delete block;
    block = nullptr;
  }
  blocks_.clear();//empty the index
}

//:add a block to the buffer.
bool vil_block_cache::add_block(const unsigned& block_index_i,
                                const unsigned& block_index_j,
                                vil_image_view_base_sptr const& blk)
{
  //create a cell

  auto* cell = new bcell(block_index_i, block_index_j, blk);
  if (blocks_.size()>=nblocks_)
    if (!this->remove_block())
      return false;
  blocks_.push_back(cell);
  std::sort(blocks_.begin(), blocks_.end(), bcell_less());
  return true;
}

bool vil_block_cache::get_block(const unsigned& block_index_i,
                                const unsigned& block_index_j,
                                vil_image_view_base_sptr& blk) const
{
  bool found = false;
  for (auto bit=blocks_.begin(); bit!= blocks_.end()&&!found; ++bit)
  {
    if ((*bit)->bindex_i_!=block_index_i||(*bit)->bindex_j_!=block_index_j)
      continue;
    else
    {
      found = true;
      blk = (*bit)->blk_;
      (*bit)->touch();//block is in demand so update the age to zero
    }
  }
  return found;
}

//:remove the oldest priority block
bool vil_block_cache::remove_block()
{
  if(!blocks_.size()){
    std::cerr << "warning: attempt to remove block from empty cache\n";
    return false;
  }
  // queue should already be sorted
  // remove oldest
  auto bit = blocks_.begin();
  blocks_.erase(bit);
  return true;
}