Skip to content

EAMxx: handle potential nan in within-interval checks #7385

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
May 28, 2025
Merged

EAMxx: handle potential nan in within-interval checks #7385

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 12 additions & 12 deletions components/eamxx/src/share/property_checks/field_within_interval_check.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -96,11 +96,11 @@ PropertyCheck::ResultAndMsg FieldWithinIntervalCheck::check_impl () const
{
auto v = f.template get_view<const_ST*>();
Kokkos::parallel_reduce(size, KOKKOS_LAMBDA(int i, minmaxloc_value_t& result) {
if (v(i)<result.min_val) {
if (not (v(i) >= result.min_val)) {
result.min_val = v(i);
result.min_loc = i;
}
if (v(i)>result.max_val) {
if (not (v(i) <= result.max_val)) {
result.max_val = v(i);
result.max_loc = i;
}
Expand All @@ -113,11 +113,11 @@ PropertyCheck::ResultAndMsg FieldWithinIntervalCheck::check_impl () const
Kokkos::parallel_reduce(size, KOKKOS_LAMBDA(int idx, minmaxloc_value_t& result) {
int i,j;
unflatten_idx(idx,extents,i,j);
if (v(i,j)<result.min_val) {
if (not (v(i,j) >= result.min_val)) {
result.min_val = v(i,j);
result.min_loc = idx;
}
if (v(i,j)>result.max_val) {
if (not (v(i,j) <= result.max_val)) {
result.max_val = v(i,j);
result.max_loc = idx;
}
Expand All @@ -130,11 +130,11 @@ PropertyCheck::ResultAndMsg FieldWithinIntervalCheck::check_impl () const
Kokkos::parallel_reduce(size, KOKKOS_LAMBDA(int idx, minmaxloc_value_t& result) {
int i,j,k;
unflatten_idx(idx,extents,i,j,k);
if (v(i,j,k)<result.min_val) {
if (not (v(i,j,k) >= result.min_val)) {
result.min_val = v(i,j,k);
result.min_loc = idx;
}
if (v(i,j,k)>result.max_val) {
if (not (v(i,j,k) <= result.max_val)) {
result.max_val = v(i,j,k);
result.max_loc = idx;
}
Expand All @@ -147,11 +147,11 @@ PropertyCheck::ResultAndMsg FieldWithinIntervalCheck::check_impl () const
Kokkos::parallel_reduce(size, KOKKOS_LAMBDA(int idx, minmaxloc_value_t& result) {
int i,j,k,l;
unflatten_idx(idx,extents,i,j,k,l);
if (v(i,j,k,l)<result.min_val) {
if (not (v(i,j,k,l) >= result.min_val)) {
result.min_val = v(i,j,k,l);
result.min_loc = idx;
}
if (v(i,j,k,l)>result.max_val) {
if (not (v(i,j,k,l) <= result.max_val)) {
result.max_val = v(i,j,k,l);
result.max_loc = idx;
}
Expand All @@ -164,11 +164,11 @@ PropertyCheck::ResultAndMsg FieldWithinIntervalCheck::check_impl () const
Kokkos::parallel_reduce(size, KOKKOS_LAMBDA(int idx, minmaxloc_value_t& result) {
int i,j,k,l,m;
unflatten_idx(idx,extents,i,j,k,l,m);
if (v(i,j,k,l,m)<result.min_val) {
if (not (v(i,j,k,l,m) >= result.min_val)) {
result.min_val = v(i,j,k,l,m);
result.min_loc = idx;
}
if (v(i,j,k,l,m)>result.max_val) {
if (not (v(i,j,k,l,m) <= result.max_val)) {
result.max_val = v(i,j,k,l,m);
result.max_loc = idx;
}
Expand All @@ -181,11 +181,11 @@ PropertyCheck::ResultAndMsg FieldWithinIntervalCheck::check_impl () const
Kokkos::parallel_reduce(size, KOKKOS_LAMBDA(int idx, minmaxloc_value_t& result) {
int i,j,k,l,m,n;
unflatten_idx(idx,extents,i,j,k,l,m,n);
if (v(i,j,k,l,m,n)<result.min_val) {
if (not (v(i,j,k,l,m,n) >= result.min_val)) {
result.min_val = v(i,j,k,l,m,n);
result.min_loc = idx;
}
if (v(i,j,k,l,m,n)>result.max_val) {
if (not (v(i,j,k,l,m,n) <= result.max_val)) {
result.max_val = v(i,j,k,l,m,n);
result.max_loc = idx;
}
Expand Down