DelIndexLst Class Reference

#include <delindexlst.h>

Collaboration diagram for DelIndexLst:

[legend]

List of all members.

Classes
class	Info
Public Types
typedef unsigned	Index
typedef std::vector< Info > ::const_iterator	Iterator
Public Member Functions
	DelIndexLst ()
void	addIndex (Index i, bool isInnerDelCell=false)
void	addUniqueIndex (Index i)
bool	exist (Index i)
unsigned	getNumInnerGhostCells ()
void	close ()
unsigned	size ()
Index	adjust (Index i, Iterator &it) const
Index	convert (Index i, Iterator &it) const
Index	convertGhost (const Index &i, Iterator &it, const Index &Off) const
Index	index_to_raw_index (Index i) const
Index	adjustI (Index i, Iterator it) const
Iterator	begin () const
Iterator	end () const
Iterator	findLUEntry (const Index i) const
	~DelIndexLst ()
Private Attributes
std::vector< Info >	m_vec
bool	m_bClosed
unsigned	m_nNonGhosts

---

Detailed Description

Implement a list of deleted indices. This is an auxiliary class used in the OrthoMesh classes to implement the concept of holes in the domain. Actually the holes destroy the structure of the orthonormal meshes. The advantage of this structure is that they have almost no memory requirements. To mantain this structure we implement the holes as a list of invalid faces, cells and vertices indexes. When we iterate throw the cells or faces of the mesh, the OrthoMesh compares for each iteration if the face or cell is in the invalid index list. If it is true then the Orthomesh class automatically increments to the next cell until we find a valid cell. For the user program it seems that the cells of invalid indices dont exist since the user never gets an iterator pointing to the invalid cells or faces or vertices. Another problem is that the indices must be reordered to not count the deleted cells or faces. The necessity of continuity of indices is seen mainly in the implicit methods where we build a system matrix. If the indices of the valid mesh's geometries elements (cells, faces, vertices) had some gaps because of the invalid cells, the matrix would have some zero columns and lines. A possible solution is to have a kind of degree of freedom distrubition method along the vertices, faces and cells but that would demand some kind of mapping beetween the mesh dofs and the new dofs, mainly for localization purposes, when we have to map a degree of freedom into a position in the domain.

Definition at line 32 of file delindexlst.h.

---

Member Typedef Documentation

typedef unsigned DelIndexLst::Index

Definition at line 35 of file delindexlst.h.

typedef std::vector<Info>::const_iterator DelIndexLst::Iterator

Definition at line 68 of file delindexlst.h.

---

Constructor & Destructor Documentation

DelIndexLst::DelIndexLst

(

)

Definition at line 10 of file delindexlst.cpp.

{
  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

(

)

Definition at line 18 of file delindexlst.cpp.

{

}

---

Member Function Documentation

void DelIndexLst::addIndex	(	Index	i,
		bool	isInnerDelCell = false
	)

Definition at line 23 of file delindexlst.cpp.

{
  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::addUniqueIndex

(

Index

i

)

Add the index i, only if it are not in the list.

Parameters:

i

Returns:

Definition at line 210 of file delindexlst.cpp.

{
  if (this->exist(i))
    return;
  else
    addIndex(i);
}

DelIndexLst::Index DelIndexLst::adjust	(	Index	i,
		Iterator &	it
	)			const

Definition at line 56 of file delindexlst.cpp.

{
  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();
      
  }
  
}

DelIndexLst::Index DelIndexLst::adjustI	(	Index	i,
		Iterator	it
	)			const

Definition at line 152 of file delindexlst.cpp.

{
  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();
  }
}

Iterator DelIndexLst::begin

(

)

const [inline]

Definition at line 85 of file delindexlst.h.

{return ++(m_vec.begin());}

void DelIndexLst::close

(

)

Definition at line 34 of file delindexlst.cpp.

{
  //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;
  
}

Index DelIndexLst::convert	(	Index	i,
		Iterator &	it
	)			const

Definition at line 82 of file delindexlst.cpp.

{
  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

Definition at line 119 of file delindexlst.cpp.

{
  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();
  }
}

Iterator DelIndexLst::end

(

)

const [inline]

Definition at line 86 of file delindexlst.h.

{return m_vec.end();}

bool DelIndexLst::exist

(

Index

i

)

Definition at line 218 of file delindexlst.cpp.

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

DelIndexLst::Iterator DelIndexLst::findLUEntry

(

const Index

i

)

const

Find the least entry in the list with index greater or equal to i or, in other words, the Least Upper (LU) entry.

Parameters:

i

Returns:

Definition at line 187 of file delindexlst.cpp.

{
  assert(m_bClosed);
  Iterator it = begin();
  while (it->index() < i)
    it++;
  return it;
      
  
}

unsigned DelIndexLst::getNumInnerGhostCells

(

)

Definition at line 254 of file delindexlst.cpp.

{
  assert(m_bClosed);
  return m_nNonGhosts;
}

Index DelIndexLst::index_to_raw_index

(

Index

i

)

const

Definition at line 234 of file delindexlst.cpp.

{
  assert(m_bClosed);
  Iterator it = findLUEntry(i);
  i+=it->off();
  while (i >= it->index())
  {
    i++;
    it++;
  }
  return i;  
  
}

unsigned DelIndexLst::size

(

)

[inline]

Definition at line 78 of file delindexlst.h.

{return m_vec.size()-2;}

---

Member Data Documentation

bool DelIndexLst::m_bClosed [private]

Definition at line 61 of file delindexlst.h.

unsigned DelIndexLst::m_nNonGhosts [private]

Definition at line 62 of file delindexlst.h.

std::vector<Info> DelIndexLst::m_vec [private]

Definition at line 58 of file delindexlst.h.

---

The documentation for this class was generated from the following files:

• delindexlst.h
• delindexlst.cpp