#include <cartesiangridproxy.h>

Collaboration diagram for maia::grid::tree::TreeProxy< nDim >:

Public Types
using	Tree = maia::grid::tree::Tree< nDim >

using	Cell = maia::grid::tree::Cell

Public Member Functions
	TreeProxy (const MInt solverId_, Tree &tree_)
	Constructor does nothing but pass arguments to members. More...

MInt	solver2grid (const MInt id) const
	Convert solver cell id to grid cell id. More...

MInt	grid2solver (const MInt id) const
	Convert grid cell id to solver cell id (+1 in size is to map "-1" to "-1") More...

void	setSolver2grid (const MInt solverId, const MInt treeId)

void	setGrid2solver (const MInt treeId, const MInt solverId)

void	swapSolverIds (const MInt id0, const MInt id1)

void	swapGridIds (const MInt id0, const MInt id1)

MInt	size () const
	Return tree size (= number of cells) More...

MInt	parent (const MInt id) const
	Accessor for parent node. More...

MBool	hasParent (const MInt id) const
	Return whether node has parent. More...

MInt	child (const MInt id, const MInt pos) const
	Accessor for child node. More...

MBool	hasChild (const MInt id, const MInt pos) const
	Return whether node has child at given position. More...

MBool	hasChildren (const MInt id) const
	Return whether node has any children. More...

MInt	noChildren (const MInt id) const
	Return number of children of given node. More...

MBool	isLeafCell (const MInt id) const
	Accessor for isLeafCell. More...

MInt	neighbor (const MInt id, const MInt dir) const
	Accessor for neighbor node. More...

MBool	hasNeighbor (const MInt id, const MInt dir) const
	Return whether node has same-level neighbor in given direction. More...

MBool	hasAnyNeighbor (const MInt id, const MInt dir) const
	Return whether node or its parent has neighbor in given direction. More...

MLong	globalId (const MInt id) const
	Accessor for global id. More...

MInt	localId (const MLong id) const
	Accesor for local id. More...

MInt	cutOff (const MInt id) const
	Accessor for cutOff dir. More...

MInt	level (const MInt id) const
	Accessor for level. More...

const MFloat &	coordinate (const MInt id, const MInt dir) const
	Accessor for coordinates. More...

MFloat	weight (const MInt id) const
	Accessor for weight (const version). More...

MBool	hasProperty (const MInt id, const Cell p) const
	Accessor for properties. More...

Static Public Member Functions
static constexpr MInt	noChildrenPerNode ()
	Return maximum number of children per node. More...

static constexpr MInt	noNeighborsPerNode ()
	Return maximum number of same-level neighbors per node. More...

static constexpr MInt	oppositeNeighborDir (const MInt dir)
	Return opposite direction for given neighbor direction. More...

static constexpr MInt	noProperties ()
	Return number of properties defined for each node. More...

Private Member Functions
MInt	solverId () const
	Return solver id. More...

void	update (const Proxy< nDim > &NotUsed(gridProxy_))
	Default implementation does nothing as everything relevant is set by grid proxy class. More...

void	createGlobalToLocalIdMapping ()
	Create global to local id mapping. More...

Private Attributes
Tree &	m_tree
	Reference to actual grid tree. More...

const MInt	m_solverId = -1
	Solver id. More...

std::vector< MInt >	m_solver2grid

std::vector< MInt >	m_grid2solver

std::vector< MLong >	m_globalIds

std::map< MLong, MInt >	m_globalToLocalId {}

std::vector< MInt >	m_isCutOffCell

Friends
template<MInt nDim_>
class	maia::grid::Proxy

Detailed Description

template<MInt nDim>
class maia::grid::tree::TreeProxy< nDim >

Class that acts like the original grid tree but only for a single solver

Author: Michael Schlottke-Lakemper (mic) mic@a.nosp@m.ia.r.nosp@m.wth-a.nosp@m.ache.nosp@m.n.de

Date: 2018-03-16

Definition at line 396 of file cartesiangridproxy.h.

Member Typedef Documentation

◆ Cell

template<MInt nDim>

using maia::grid::tree::TreeProxy< nDim >::Cell = maia::grid::tree::Cell

Definition at line 406 of file cartesiangridproxy.h.

◆ Tree

template<MInt nDim>

using maia::grid::tree::TreeProxy< nDim >::Tree = maia::grid::tree::Tree<nDim>

Definition at line 405 of file cartesiangridproxy.h.

Constructor & Destructor Documentation

◆ TreeProxy()

template<MInt nDim>

maia::grid::tree::TreeProxy< nDim >::TreeProxy	(	const MInt	solverId_,
		Tree &	tree_
	)

inline

Definition at line 409 of file cartesiangridproxy.h.

                                               : m_tree(tree_), m_solverId(solverId_) {
    m_solver2grid.reserve(m_tree.capacity());
    m_grid2solver.reserve(m_tree.capacity());
    m_globalIds.reserve(m_tree.capacity());
    m_isCutOffCell.reserve(m_tree.capacity());
  }

Member Function Documentation

◆ child()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::child	(	const MInt	id,
		const MInt	pos
	)		const

Definition at line 555 of file cartesiangridproxy.h.

                                                               {
  return grid2solver(m_tree.child(solver2grid(id), pos));
}

◆ coordinate()

template<MInt nDim>

const MFloat & maia::grid::tree::TreeProxy< nDim >::coordinate	(	const MInt	id,
		const MInt	dir
	)		const

Definition at line 631 of file cartesiangridproxy.h.

                                                                             {
  return m_tree.coordinate(solver2grid(id), dir);
}

◆ createGlobalToLocalIdMapping()

template<MInt nDim>

void maia::grid::tree::TreeProxy< nDim >::createGlobalToLocalIdMapping

private

Create the mapping from global to local cell ids.

Definition at line 687 of file cartesiangridproxy.h.

                                                   {
  TRACE();
 
  std::map<MLong, MInt>().swap(m_globalToLocalId);
  std::set<MInt> periodicCells;
  for(MInt cellId = 0; cellId < size(); cellId++) {
    if(hasProperty(cellId, Cell::IsPeriodic)) {
      periodicCells.insert(cellId);
      continue;
    }
    ASSERT(m_globalToLocalId.count(globalId(cellId)) == 0, "Global id already in map");
    m_globalToLocalId[globalId(cellId)] = cellId;
  }
 
  for(auto it = periodicCells.begin(); it != periodicCells.end(); it++) {
    if(m_globalToLocalId.count(globalId(*it)) == 0) {
      m_globalToLocalId[globalId(*it)] = *it;
    }
  }
}

◆ cutOff()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::cutOff ( const MInt id ) const

Definition at line 618 of file cartesiangridproxy.h.

                                                {
  return m_isCutOffCell[id];
}

◆ globalId()

template<MInt nDim>

MLong maia::grid::tree::TreeProxy< nDim >::globalId ( const MInt id ) const

Definition at line 612 of file cartesiangridproxy.h.

                                                   {
  return m_globalIds[id];
}

◆ grid2solver()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::grid2solver ( const MInt id ) const

inline

Definition at line 425 of file cartesiangridproxy.h.

                                        {
    // TODO labels:GRID c++14
    //#ifndef NDEBUG
    //    ASSERT(id+1 >= 0 && id+1 < m_grid2solver.size(), "id in grid2solver is out of bounds");
    //#endif
    return m_grid2solver[id + 1];
  }

◆ hasAnyNeighbor()

template<MInt nDim>

MBool maia::grid::tree::TreeProxy< nDim >::hasAnyNeighbor	(	const MInt	id,
		const MInt	dir
	)		const

Definition at line 605 of file cartesiangridproxy.h.

                                                                         {
  return hasNeighbor(id, dir) || (hasParent(id) && hasNeighbor(parent(id), dir));
}

◆ hasChild()

template<MInt nDim>

MBool maia::grid::tree::TreeProxy< nDim >::hasChild	(	const MInt	id,
		const MInt	pos
	)		const

Definition at line 562 of file cartesiangridproxy.h.

                                                                   {
  return child(id, pos) > -1;
}

◆ hasChildren()

template<MInt nDim>

MBool maia::grid::tree::TreeProxy< nDim >::hasChildren ( const MInt id ) const

Definition at line 569 of file cartesiangridproxy.h.

                                                      {
  return noChildren(id) > 0;
}

◆ hasNeighbor()

template<MInt nDim>

MBool maia::grid::tree::TreeProxy< nDim >::hasNeighbor	(	const MInt	id,
		const MInt	dir
	)		const

Definition at line 600 of file cartesiangridproxy.h.

                                                                      {
  return neighbor(id, dir) > -1;
}

◆ hasParent()

template<MInt nDim>

MBool maia::grid::tree::TreeProxy< nDim >::hasParent ( const MInt id ) const

Definition at line 548 of file cartesiangridproxy.h.

                                                    {
  return parent(id) > -1;
}

◆ hasProperty()

template<MInt nDim>

MBool maia::grid::tree::TreeProxy< nDim >::hasProperty	(	const MInt	id,
		const Cell	p
	)		const

Definition at line 669 of file cartesiangridproxy.h.

                                                                    {
  ASSERT(p != Cell::IsWindow, "Query for IsWindow won't give solver-specific information!");
  return m_tree.hasProperty(solver2grid(id), p);
}

◆ isLeafCell()

template<MInt nDim>

MBool maia::grid::tree::TreeProxy< nDim >::isLeafCell ( const MInt id ) const

Definition at line 586 of file cartesiangridproxy.h.

                                                     {
  return m_tree.isLeafCell(solver2grid(id), solverId());
}

◆ level()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::level ( const MInt id ) const

Definition at line 624 of file cartesiangridproxy.h.

                                               {
  return m_tree.level(solver2grid(id));
}

◆ localId()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::localId ( const MLong id ) const

Definition at line 710 of file cartesiangridproxy.h.

                                                  {
  TRACE();
 
  if(m_globalToLocalId.count(id) > 0) {
    return m_globalToLocalId.at(id);
  } else {
    return -1;
  }
}

◆ neighbor()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::neighbor	(	const MInt	id,
		const MInt	dir
	)		const

Definition at line 593 of file cartesiangridproxy.h.

                                                                  {
  return grid2solver(m_tree.neighbor(solver2grid(id), dir));
}

◆ noChildren()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::noChildren ( const MInt id ) const

Definition at line 576 of file cartesiangridproxy.h.

                                                    {
  MInt count = 0;
  for(MInt pos = 0; pos < noChildrenPerNode(); pos++) {
    count += hasChild(id, pos);
  }
  return count;
}

◆ noChildrenPerNode()

template<MInt nDim>

static constexpr MInt maia::grid::tree::TreeProxy< nDim >::noChildrenPerNode ( )

inlinestaticconstexpr

Definition at line 503 of file cartesiangridproxy.h.

503{ return 4 * nDim - 4; }

◆ noNeighborsPerNode()

template<MInt nDim>

static constexpr MInt maia::grid::tree::TreeProxy< nDim >::noNeighborsPerNode ( )

inlinestaticconstexpr

Definition at line 505 of file cartesiangridproxy.h.

505{ return 2 * nDim; }

◆ noProperties()

template<MInt nDim>

static constexpr MInt maia::grid::tree::TreeProxy< nDim >::noProperties ( )

inlinestaticconstexpr

Definition at line 511 of file cartesiangridproxy.h.

511{ return maia::grid::cell::p(Cell::NumProperties); }

maia::grid::cell::p

constexpr std::underlying_type< GridCell >::type p(const GridCell property)

Converts property name to underlying integer value.

Definition: cartesiangridcellproperties.h:36

◆ oppositeNeighborDir()

template<MInt nDim>

static constexpr MInt maia::grid::tree::TreeProxy< nDim >::oppositeNeighborDir ( const MInt dir )

inlinestaticconstexpr

Definition at line 508 of file cartesiangridproxy.h.

508{ return dir + 1 - 2 * (dir % 2); }

◆ parent()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::parent ( const MInt id ) const

Definition at line 541 of file cartesiangridproxy.h.

                                                {
  return grid2solver(m_tree.parent(solver2grid(id)));
}

◆ setGrid2solver()

template<MInt nDim>

void maia::grid::tree::TreeProxy< nDim >::setGrid2solver	(	const MInt	treeId,
		const MInt	solverId
	)

inline

Definition at line 438 of file cartesiangridproxy.h.

                                                              {
    ASSERT((treeId + 1) > -1 && (treeId + 1) < (signed)m_grid2solver.size(),
           "id size: " << treeId + 1 << " " << m_grid2solver.size());
    m_grid2solver[treeId + 1] = solverId;
  }

◆ setSolver2grid()

template<MInt nDim>

void maia::grid::tree::TreeProxy< nDim >::setSolver2grid	(	const MInt	solverId,
		const MInt	treeId
	)

inline

Definition at line 433 of file cartesiangridproxy.h.

                                                              {
    ASSERT(solverId > -1 && solverId < (signed)m_solver2grid.size(),
           "id, size: " << solverId << " " << m_solver2grid.size());
    m_solver2grid[solverId] = treeId;
  }

◆ size()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::size ( ) const

inline

Definition at line 466 of file cartesiangridproxy.h.

466{ return m_solver2grid.size(); }

◆ solver2grid()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::solver2grid ( const MInt id ) const

inline

Definition at line 417 of file cartesiangridproxy.h.

                                        {
    // TODO labels:GRID c++14
    //#ifndef NDEBUG
    //      ASSERT(id >= 0 && id < m_solver2grid.size(), "id in solver2grid is out of bounds");
    //#endif
    return m_solver2grid[id];
  }

◆ solverId()

template<MInt nDim>

MInt maia::grid::tree::TreeProxy< nDim >::solverId ( ) const

inlineprivate

Definition at line 515 of file cartesiangridproxy.h.

515{ return m_solverId; }

◆ swapGridIds()

template<MInt nDim>

void maia::grid::tree::TreeProxy< nDim >::swapGridIds	(	const MInt	id0,
		const MInt	id1
	)

inline

Definition at line 454 of file cartesiangridproxy.h.

                                                   {
    ASSERT(id0 > -1 && id1 > -1 && id0 < m_tree.size() && id1 < m_tree.size()
               && (id0 + 1) < (signed)m_grid2solver.size() && (id1 + 1) < (signed)m_grid2solver.size(),
           "");
    const MInt b0 = m_grid2solver[id0 + 1];
    const MInt b1 = m_grid2solver[id1 + 1];
    if(b0 > -1) m_solver2grid[b0] = id1;
    if(b1 > -1) m_solver2grid[b1] = id0;
    std::swap(m_grid2solver[id0 + 1], m_grid2solver[id1 + 1]);
  }

◆ swapSolverIds()

template<MInt nDim>

void maia::grid::tree::TreeProxy< nDim >::swapSolverIds	(	const MInt	id0,
		const MInt	id1
	)

inline

Definition at line 444 of file cartesiangridproxy.h.

                                                     {
    ASSERT(id0 > -1 && id1 > -1 && id0 < size() && id1 < size(),
           "id0, id1, size: " << id0 << " , " << id1 << " , " << size());
    const MInt g0 = m_solver2grid[id0];
    const MInt g1 = m_solver2grid[id1];
    if(g0 > -1) m_grid2solver[g0 + 1] = id1;
    if(g1 > -1) m_grid2solver[g1 + 1] = id0;
    std::swap(m_solver2grid[id0], m_solver2grid[id1]);
  }

◆ update()

template<MInt nDim>

void maia::grid::tree::TreeProxy< nDim >::update ( const Proxy< nDim > & NotUsedgridProxy_ )

inlineprivate

Definition at line 518 of file cartesiangridproxy.h.

518{}

◆ weight()

template<MInt nDim>

MFloat maia::grid::tree::TreeProxy< nDim >::weight ( const MInt id ) const

Definition at line 642 of file cartesiangridproxy.h.

                                                  {
  return m_tree.weight(solver2grid(id));
}

Friends And Related Function Documentation

◆ maia::grid::Proxy

template<MInt nDim>

template<MInt nDim_>

template<MInt nDim>

Tree& maia::grid::tree::TreeProxy< nDim >::m_tree

private

Definition at line 525 of file cartesiangridproxy.h.

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

/home/gitlab-runner/scratch/builds/oxpnswJ6/1/aia/m-AIA/m-AIA/src/GRID/cartesiangridproxy.h

Public Types

Public Member Functions

Static Public Member Functions

Private Member Functions

Private Attributes

Friends

Detailed Description

Member Typedef Documentation

◆ Cell

◆ Tree

Constructor & Destructor Documentation

◆ TreeProxy()

Member Function Documentation

◆ child()

◆ coordinate()

◆ createGlobalToLocalIdMapping()

◆ cutOff()

◆ globalId()

◆ grid2solver()

◆ hasAnyNeighbor()

◆ hasChild()

◆ hasChildren()

◆ hasNeighbor()

◆ hasParent()

◆ hasProperty()

◆ isLeafCell()

◆ level()

◆ localId()

◆ neighbor()

◆ noChildren()

◆ noChildrenPerNode()

◆ noNeighborsPerNode()

◆ noProperties()

◆ oppositeNeighborDir()

◆ parent()

◆ setGrid2solver()

◆ setSolver2grid()

◆ size()

◆ solver2grid()

◆ solverId()

◆ swapGridIds()

◆ swapSolverIds()

◆ update()

◆ weight()

Friends And Related Function Documentation

◆ maia::grid::Proxy

Member Data Documentation

◆ m_globalIds

◆ m_globalToLocalId

◆ m_grid2solver

◆ m_isCutOffCell

◆ m_solver2grid

◆ m_solverId

◆ m_tree