#include <MsmMap.h>

Public Member Functions
Ivec	clipIndexToLevel (const Ivec &n, int level) const

BlockIndex	blockOfGridIndex (const Ivec &n, int level) const

BlockIndex	blockOfGridIndexFold (const Ivec &n, int level) const

IndexRange	indexRangeOfBlock (const BlockIndex &nb) const

IndexRange	indexRangeOfBlockFold (const BlockIndex &nb) const

IndexRange	clipBlockToIndexRange (const BlockIndex &nb, const IndexRange &nrange) const

IndexRange	clipBlockToIndexRangeFold (const BlockIndex &nb, const IndexRange &nrange) const

void	wrapBlockSend (BlockSend &bs) const

void	wrapBlockSendFold (BlockSend &bs) const

void	wrapBlockIndex (BlockIndex &bn) const

Public Attributes
Array< IndexRange >	gridrange

Array< Grid< Float > >	gc

Array< Grid< Float > >	gvc

Grid< Float >	grespro

Array< Grid< C1Matrix > >	gc_c1hermite

Array< Grid< C1Matrix > >	gvc_c1hermite

Array< Grid< C1Matrix > >	gres_c1hermite

Array< Grid< C1Matrix > >	gpro_c1hermite

Array< PatchDiagram >	patchList

Array< Grid< BlockDiagram > >	blockLevel

int	ispx

int	ispy

int	ispz

Array< int >	bsx

Array< int >	bsy

Array< int >	bsz

Array< FoldFactor >	foldfactor

Detailed Description

Definition at line 941 of file MsmMap.h.

Member Function Documentation

◆ blockOfGridIndex()

BlockIndex msm::Map::blockOfGridIndex	(	const Ivec &	n,
		int	level
	)		const

inline

Definition at line 991 of file MsmMap.h.

References ASSERT, bsx, bsy, bsz, gridrange, msm::Ivec::i, msm::Ivec::j, and msm::Ivec::k.

Referenced by MsmGridCutoffKernel< Float, Float >::setup().

                                                                 {
       ASSERT(level >= 0 && level < gridrange.len());
       BlockIndex bn;
       // we want floor((i - ia) / bsx), etc.
       // modify case i < ia to avoid integer division of negative numbers
       int d = n.i - gridrange[level].ia();
       bn.n.i = (d >= 0 ? d / bsx[level] : -((-d+bsx[level]-1) / bsx[level]));
       d = n.j - gridrange[level].ja();
       bn.n.j = (d >= 0 ? d / bsy[level] : -((-d+bsy[level]-1) / bsy[level]));
       d = n.k - gridrange[level].ka();
       bn.n.k = (d >= 0 ? d / bsz[level] : -((-d+bsz[level]-1) / bsz[level]));
       bn.level = level;
       return bn;
     }

◆ blockOfGridIndexFold()

BlockIndex msm::Map::blockOfGridIndexFold	(	const Ivec &	n,
		int	level
	)		const

inline

Definition at line 1008 of file MsmMap.h.

References ASSERT, bsx, bsy, bsz, foldfactor, gridrange, msm::Ivec::i, msm::Ivec::j, and msm::Ivec::k.

                                                                     {
       ASSERT(level >= 0 && level < gridrange.len());
       BlockIndex bn;
       int bsi = foldfactor[level].numrep.i * bsx[level];
       int bsj = foldfactor[level].numrep.j * bsy[level];
       int bsk = foldfactor[level].numrep.k * bsz[level];
       // we want floor((i - ia) / bsx), etc.
       // modify case i < ia to avoid integer division of negative numbers
       int d = n.i - gridrange[level].ia();
       bn.n.i = (d >= 0 ? d / bsi : -((-d+bsi-1) / bsi));
       d = n.j - gridrange[level].ja();
       bn.n.j = (d >= 0 ? d / bsj : -((-d+bsj-1) / bsj));
       d = n.k - gridrange[level].ka();
       bn.n.k = (d >= 0 ? d / bsk : -((-d+bsk-1) / bsk));
       bn.level = level;
       return bn;
     }

◆ clipBlockToIndexRange()

IndexRange msm::Map::clipBlockToIndexRange	(	const BlockIndex &	nb,
		const IndexRange &	nrange
	)		const

inline

Definition at line 1053 of file MsmMap.h.

References msm::IndexRange::ia(), msm::IndexRange::ib(), indexRangeOfBlock(), msm::IndexRange::ja(), msm::IndexRange::jb(), msm::IndexRange::ka(), msm::IndexRange::kb(), and msm::IndexRange::setbounds().

                                         {
       IndexRange nr = indexRangeOfBlock(nb);
       int nia = nrange.ia();
       int nib = nrange.ib();
       int nja = nrange.ja();
       int njb = nrange.jb();
       int nka = nrange.ka();
       int nkb = nrange.kb();
       int ia = nr.ia();
       if (ia < nia) ia = nia;
       int ib = nr.ib();
       if (ib > nib) ib = nib;
       int ja = nr.ja();
       if (ja < nja) ja = nja;
       int jb = nr.jb();
       if (jb > njb) jb = njb;
       int ka = nr.ka();
       if (ka < nka) ka = nka;
       int kb = nr.kb();
       if (kb > nkb) kb = nkb;
       nr.setbounds(ia, ib, ja, jb, ka, kb);
       return nr;
     }

◆ clipBlockToIndexRangeFold()

IndexRange msm::Map::clipBlockToIndexRangeFold	(	const BlockIndex &	nb,
		const IndexRange &	nrange
	)		const

inline

Definition at line 1080 of file MsmMap.h.

References msm::IndexRange::ia(), msm::IndexRange::ib(), indexRangeOfBlockFold(), msm::IndexRange::ja(), msm::IndexRange::jb(), msm::IndexRange::ka(), msm::IndexRange::kb(), and msm::IndexRange::setbounds().

                                         {
       IndexRange nr = indexRangeOfBlockFold(nb);
       int nia = nrange.ia();
       int nib = nrange.ib();
       int nja = nrange.ja();
       int njb = nrange.jb();
       int nka = nrange.ka();
       int nkb = nrange.kb();
       int ia = nr.ia();
       if (ia < nia) ia = nia;
       int ib = nr.ib();
       if (ib > nib) ib = nib;
       int ja = nr.ja();
       if (ja < nja) ja = nja;
       int jb = nr.jb();
       if (jb > njb) jb = njb;
       int ka = nr.ka();
       if (ka < nka) ka = nka;
       int kb = nr.kb();
       if (kb > nkb) kb = nkb;
       nr.setbounds(ia, ib, ja, jb, ka, kb);
       return nr;
     }

◆ clipIndexToLevel()

Ivec msm::Map::clipIndexToLevel	(	const Ivec &	n,
		int	level
	)		const

inline

Definition at line 966 of file MsmMap.h.

References ASSERT, gridrange, ispx, ispy, and ispz.

                                                           {
       ASSERT(level >= 0 && level < gridrange.len());
       Ivec pn(n);
       if ( ! ispx) {
         int a = gridrange[level].ia();
         int b = gridrange[level].ib();
         if (pn.i < a) pn.i = a;
         if (pn.i > b) pn.i = b;
       }
       if ( ! ispy) {
         int a = gridrange[level].ja();
         int b = gridrange[level].jb();
         if (pn.j < a) pn.j = a;
         if (pn.j > b) pn.j = b;
       }
       if ( ! ispz) {
         int a = gridrange[level].ka();
         int b = gridrange[level].kb();
         if (pn.k < a) pn.k = a;
         if (pn.k > b) pn.k = b;
       }
       return pn;
     }

◆ indexRangeOfBlock()

IndexRange msm::Map::indexRangeOfBlock ( const BlockIndex & nb ) const

inline

Definition at line 1027 of file MsmMap.h.

References ASSERT, bsx, bsy, bsz, gridrange, msm::Ivec::i, msm::Ivec::j, msm::Ivec::k, msm::BlockIndex::level, and msm::BlockIndex::n.

Referenced by clipBlockToIndexRange().

                                                              {
       ASSERT(nb.level >= 0 && nb.level < gridrange.len());
       IndexRange nr;
       int ia = nb.n.i * bsx[nb.level] + gridrange[nb.level].ia();
       int ja = nb.n.j * bsy[nb.level] + gridrange[nb.level].ja();
       int ka = nb.n.k * bsz[nb.level] + gridrange[nb.level].ka();
       nr.set(ia, bsx[nb.level], ja, bsy[nb.level], ka, bsz[nb.level]);
       return nr;
     }

◆ indexRangeOfBlockFold()

IndexRange msm::Map::indexRangeOfBlockFold ( const BlockIndex & nb ) const

inline

Definition at line 1039 of file MsmMap.h.

References ASSERT, bsx, bsy, bsz, foldfactor, gridrange, msm::Ivec::i, msm::Ivec::j, msm::Ivec::k, msm::BlockIndex::level, msm::BlockIndex::n, and msm::IndexRange::set().

Referenced by clipBlockToIndexRangeFold().

                                                                  {
       ASSERT(nb.level >= 0 && nb.level < gridrange.len());
       int bsi = foldfactor[nb.level].numrep.i * bsx[nb.level];
       int bsj = foldfactor[nb.level].numrep.j * bsy[nb.level];
       int bsk = foldfactor[nb.level].numrep.k * bsz[nb.level];
       IndexRange nr;
       int ia = nb.n.i * bsi + gridrange[nb.level].ia();
       int ja = nb.n.j * bsj + gridrange[nb.level].ja();
       int ka = nb.n.k * bsk + gridrange[nb.level].ka();
       nr.set(ia, bsi, ja, bsj, ka, bsk);
       return nr;
     }

◆ wrapBlockIndex()

void msm::Map::wrapBlockIndex ( BlockIndex & bn ) const

inline

Definition at line 1214 of file MsmMap.h.

References blockLevel, msm::Ivec::i, ispx, ispy, ispz, msm::Ivec::j, msm::Ivec::k, msm::BlockIndex::level, and msm::BlockIndex::n.

Referenced by MsmGridCutoffKernel< Float, Float >::setup().

                                               {
       int level = bn.level;
       int ni = blockLevel[level].ni();
       int nj = blockLevel[level].nj();
       int nk = blockLevel[level].nk();
       if (ispx) {
         while (bn.n.i < 0) {
           bn.n.i += ni;
         }
         while (bn.n.i >= ni) {
           bn.n.i -= ni;
         }
       }
       if (ispy) {
         while (bn.n.j < 0) {
           bn.n.j += nj;
         }
         while (bn.n.j >= nj) {
           bn.n.j -= nj;
         }
       }
       if (ispz) {
         while (bn.n.k < 0) {
           bn.n.k += nk;
         }
         while (bn.n.k >= nk) {
           bn.n.k -= nk;
         }
       }
     }

◆ wrapBlockSend()

void msm::Map::wrapBlockSend ( BlockSend & bs ) const

inline

Definition at line 1106 of file MsmMap.h.

References ASSERT, blockLevel, bsx, bsy, bsz, msm::Ivec::i, msm::IndexRange::ia(), msm::IndexRange::ib(), ispx, ispy, ispz, msm::Ivec::j, msm::IndexRange::ja(), msm::IndexRange::jb(), msm::Ivec::k, msm::IndexRange::ka(), msm::IndexRange::kb(), msm::BlockIndex::level, msm::BlockIndex::n, msm::BlockSend::nblock, msm::BlockSend::nblock_wrap, msm::BlockSend::nrange, msm::BlockSend::nrange_wrap, and msm::IndexRange::setbounds().

                                             {
       BlockIndex nb = bs.nblock;
       IndexRange nr = bs.nrange;
       int level = bs.nblock.level;
       ASSERT(level >= 0 && level < blockLevel.len());
       int ni = blockLevel[level].ni();
       int nj = blockLevel[level].nj();
       int nk = blockLevel[level].nk();
       int di=0, dj=0, dk=0;
       if (ispx) {
         while (nb.n.i < 0) {
           nb.n.i += ni;
           di += ni * bsx[level];
         }
         while (nb.n.i >= ni) {
           nb.n.i -= ni;
           di -= ni * bsx[level];
         }
       }
       if (ispy) {
         while (nb.n.j < 0) {
           nb.n.j += nj;
           dj += nj * bsy[level];
         }
         while (nb.n.j >= nj) {
           nb.n.j -= nj;
           dj -= nj * bsy[level];
         }
       }
       if (ispz) {
         while (nb.n.k < 0) {
           nb.n.k += nk;
           dk += nk * bsz[level];
         }
         while (nb.n.k >= nk) {
           nb.n.k -= nk;
           dk -= nk * bsz[level];
         }
       }
       int ia = nr.ia();
       int ib = nr.ib();
       int ja = nr.ja();
       int jb = nr.jb();
       int ka = nr.ka();
       int kb = nr.kb();
       nr.setbounds(ia + di, ib + di, ja + dj, jb + dj, ka + dk, kb + dk);
       bs.nblock_wrap = nb;
       bs.nrange_wrap = nr;
     }

◆ wrapBlockSendFold()

void msm::Map::wrapBlockSendFold ( BlockSend & bs ) const

inline

Definition at line 1158 of file MsmMap.h.

References ASSERT, blockLevel, bsx, bsy, bsz, foldfactor, msm::Ivec::i, msm::IndexRange::ia(), msm::IndexRange::ib(), ispx, ispy, ispz, msm::Ivec::j, msm::IndexRange::ja(), msm::IndexRange::jb(), msm::Ivec::k, msm::IndexRange::ka(), msm::IndexRange::kb(), msm::BlockIndex::level, msm::BlockIndex::n, msm::BlockSend::nblock, msm::BlockSend::nblock_wrap, msm::BlockSend::nrange, msm::BlockSend::nrange_wrap, and msm::IndexRange::setbounds().

                                                 {
       BlockIndex nb = bs.nblock;
       IndexRange nr = bs.nrange;
       int level = bs.nblock.level;
       ASSERT(level >= 0 && level < blockLevel.len());
       int foldi = foldfactor[level].numrep.i;
       int foldj = foldfactor[level].numrep.j;
       int foldk = foldfactor[level].numrep.k;
       int ni = blockLevel[level].ni();
       int nj = blockLevel[level].nj();
       int nk = blockLevel[level].nk();
       int bsi = foldi * bsx[level];
       int bsj = foldj * bsy[level];
       int bsk = foldk * bsz[level];
       int di=0, dj=0, dk=0;
       if (ispx) {
         while (nb.n.i < 0) {
           nb.n.i += ni;
           di += ni * bsi;
         }
         while (nb.n.i >= ni) {
           nb.n.i -= ni;
           di -= ni * bsi;
         }
       }
       if (ispy) {
         while (nb.n.j < 0) {
           nb.n.j += nj;
           dj += nj * bsj;
         }
         while (nb.n.j >= nj) {
           nb.n.j -= nj;
           dj -= nj * bsj;
         }
       }
       if (ispz) {
         while (nb.n.k < 0) {
           nb.n.k += nk;
           dk += nk * bsk;
         }
         while (nb.n.k >= nk) {
           nb.n.k -= nk;
           dk -= nk * bsk;
         }
       }
       int ia = nr.ia();
       int ib = nr.ib();
       int ja = nr.ja();
       int jb = nr.jb();
       int ka = nr.ka();
       int kb = nr.kb();
       nr.setbounds(ia + di, ib + di, ja + dj, jb + dj, ka + dk, kb + dk);
       bs.nblock_wrap = nb;
       bs.nrange_wrap = nr;
     }