|
| bool | toolbox::particles::assignmentchecks::tests::internal::liftParticle (const tarch::la::Vector< Dimensions, double > particleX, const tarch::la::Vector< Dimensions, double > vertexX, const tarch::la::Vector< Dimensions, double > vertexH, const int depth) |
| | Does this particle need to be lifted? Yes if particleX is not located in the square with size 2 vertexH around the closest vertex with size vertexH, and if we're not at shallowest point in tree (= depth == 0)
|
| |
| bool | toolbox::particles::assignmentchecks::tests::internal::dropParticle (const tarch::la::Vector< Dimensions, double > particleX, const tarch::la::Vector< Dimensions, double > vertexH, const int depth, const int maxVertexDepth) |
| | Does this particle need to be dropped? Yes if particleX is located in the square with size 2 vertexH around the closest vertex with size vertexH and while depth doesn't exceed maxVertexDepth.
|
| |
| int | toolbox::particles::assignmentchecks::tests::internal::findVertexInd (double x, double vertexH) |
| | Find "index" of vertex with size vertexH covering position x assuming all vertices start at (0, 0, 0).
|
| |
| tarch::la::Vector< Dimensions, double > | toolbox::particles::assignmentchecks::tests::internal::findVertexX (const tarch::la::Vector< Dimensions, double > x, const tarch::la::Vector< Dimensions, double > vertexH) |
| | Find position of vertex with size vertexH covering position x assuming all vertices start at (0, 0, 0).
|
| |
| TestParticle * | toolbox::particles::assignmentchecks::tests::internal::mirrorParticleAlongPeriodicBoundary (TestParticle *original, bool bx, bool by, bool bz, tarch::la::Vector< Dimensions, double > boundary) |
| | Create a particle mirrored along periodic boundaries.
|
| |