delindexlst.cpp

Go to the documentation of this file.

#include "delindexlst.h"
#include "vecdouble.h"
#include "exception.h"
#include <algorithm>
#include <limits.h>
#include <assert.h>
#include "orthomesh.h"


 DelIndexLst::DelIndexLst() 
{
  m_bClosed = false;
  //insert the first and last sentinel nodes
  m_vec.push_back(Info(0,0));
  m_vec.push_back(Info(UINT_MAX,0));
}

DelIndexLst::~DelIndexLst() 
{

}

void DelIndexLst::addIndex(Index i,bool isInnerCell) 
{
  if (m_bClosed)
    throw new Exception("DelIndexLst:: List already closed\nCant insert another index.");
  struct Info info(i,isInnerCell);
  m_vec.push_back(info);
}




void DelIndexLst::close()
{
  //Sort the info entries.
  std::sort(m_vec.begin(),m_vec.end());
  //Numerate the offsets of the indices in the list.
  std::vector<Info>::iterator it = m_vec.begin();
  it++;
  unsigned off=0;
  m_nNonGhosts=0;
  for(;it!=m_vec.end();it++)
  {
    if (it->m_off)
      m_nNonGhosts++;
    it->m_off = off++;
    it->m_ghostOff=it->m_off-m_nNonGhosts;
  }
  assert(m_vec.back().m_off == --off);
  m_bClosed=true;
  
}


DelIndexLst::Index DelIndexLst::adjust(Index i,Iterator &it) const
{
  if (it->index() > i)
  {
    do
    {
      it--;
    } while (it->index() > i);
    /*Assert the index is valid and is
      not included in the deletion list. */
    assert(it->index() != i || it == m_vec.begin()); 
    return i-(++it)->off();
  }
  else
  {
    while (it->index() <= i)
    {
      it++;
    }
    assert((it-1)->index() != i || (it-1) == m_vec.begin()); 
    return i-it->off();
      
  }
  
}

Index DelIndexLst::convert(Index i,Iterator &it) const 
{
  if (it->index() > i)
  {
    do
    {
      it--;
    } while (it->index() > i);
    /*Assert the index is valid and is
      not included in the deletion list. */
    if (it->index() == i && it != m_vec.begin())
    {
      it++;
      return OrthoMesh::invalidIndex();
    }
    else
      return i-(++it)->off();
  }
  else
  {
    while (it->index() < i)
    {
      it++;
    }
    if (it->index() == i && it != m_vec.begin())
    {
      it++;
      return OrthoMesh::invalidIndex();
    }
    else
      return i-it->off();
  }
}




Index DelIndexLst::convertGhost(const Index &i,Iterator &it,const Index &Off) const 
{
  if (it->index() > i)
  {
    do
    {
      it--;
    } while (it->index() > i);
    /*Assert the index is valid and is
      not included in the deletion list. */
    if (it->index() == i && it != m_vec.begin())
    {
      return Off+(it++)->off();
    }
    else
      return i-(++it)->ghostOff();
  }
  else
  {
    while (it->index() < i)
    {
      it++;
    }
    if (it->index() == i && it != m_vec.begin())
    {
      return Off + (it++)->ghostOff();
    }
    else
      return i-it->off();
  }
}


DelIndexLst::Index DelIndexLst::adjustI(Index i,Iterator it) const 
{
  if (it->index() > i)
  {
    do
    {
      it--;
    } while (it->index() > i);
    /*Assert the index is valid and is
      not included in the deletion list. */
    if (it->index() == i && it != m_vec.begin())
      return OrthoMesh::invalidIndex();
    else
      return i-(++it)->off();
  }
  else
  {
    while (it->index() < i)
    {
      it++;
    }
    if (it->index() == i && it != m_vec.begin())
      return OrthoMesh::invalidIndex();
    else
      return i-it->off();
  }
}


DelIndexLst::Iterator DelIndexLst::findLUEntry(const Index i) const
{
  assert(m_bClosed);
  Iterator it = begin();
  while (it->index() < i)
    it++;
  return it;
      
  
}









void DelIndexLst::addUniqueIndex(Index i) 
{
  if (this->exist(i))
    return;
  else
    addIndex(i);
}

bool DelIndexLst::exist(Index i) 
{
  assert(i!=OrthoMesh::invalidIndex());
  for (Iterator it=begin();it != end();it++)
  {
    if (it->index() == i)
      return true;
  }
  return false;
}






Index DelIndexLst::index_to_raw_index(Index i) const 
{
  assert(m_bClosed);
  Iterator it = findLUEntry(i);
  i+=it->off();
  while (i >= it->index())
  {
    i++;
    it++;
  }
  return i;  
  
}

/*
Inner ghost cells are cells that are completely
sunrounded by non active cells.
This function return the number of such cells

 */
unsigned DelIndexLst::getNumInnerGhostCells() 
{
  assert(m_bClosed);
  return m_nNonGhosts;
}

---