Extremes

The reductions of field-presentation §FVK-6: functions over a whole field. Each is an interface with the proven method as its default (§FVA-1 rule 5), so another method can take its place.

In the namespace field::reduce. Declared in src/libs/libfield/field/reduce/Reductions.hpp.

Detailed description

A reduction reads a scalar field: a vector or a tensor first goes through a kernel (`magnitude`, `von_mises`). The geometry is the mesh the field is on; its corner nodes give each element's centroid, volume and boundary faces, so a Tet10 counts as its Tet4.

NaN and ±infinity are skipped and counted (§FVK-6, NaN and infinity). A parallel pass uses fixed blocks merged in block order, and a tie picks the lower index, so the answer is the same bit for bit for every thread count.