crp/OpenMC
1
0
Fork 0
mirror of https://github.com/openmc-dev/openmc.git synced 2026-07-26 13:15:39 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Merge pull request #1387 from smharper/fiss_bug2

Browse source 
Fix tally mesh bug for very short tracks
This commit is contained in:
Paul Romano 2019-10-30 05:56:10 -05:00 • committed by GitHub
commit b60ee3b67c
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 16 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

16
src/mesh.cpp
View file

@ -524,6 +524,14 @@ void RegularMesh::bins_crossed(const Particle* p, std::vector<int>& bins,
}
r1 = r;
// The TINY_BIT offsets above mean that the preceding logic cannot always find
// the correct ijk0 and ijk1 indices. For tracks shorter than 2*TINY_BIT, just
// assume the track lies in only one mesh bin. These tracks are very short so
// any error caused by this assumption will be small.
if (total_distance < 2*TINY_BIT) {
for (int i = 0; i < n; ++i) ijk0[i] = ijk1[i];
}
// ========================================================================
// Find which mesh cells are traversed and the length of each traversal.
@ -899,6 +907,14 @@ void RectilinearMesh::bins_crossed(const Particle* p, std::vector<int>& bins,
}
r1 = r;
// The TINY_BIT offsets above mean that the preceding logic cannot always find
// the correct ijk0 and ijk1 indices. For tracks shorter than 2*TINY_BIT, just
// assume the track lies in only one mesh bin. These tracks are very short so
// any error caused by this assumption will be small.
if (total_distance < 2*TINY_BIT) {
for (int i = 0; i < 3; ++i) ijk0[i] = ijk1[i];
}
// ========================================================================
// Find which mesh cells are traversed and the length of each traversal.