Make a Transformation that computes the sum of bounded floats with known ordering.
Details
Only useful when make_bounded_float_checked_sum
returns an error due to potential for overflow.
You may need to use make_ordered_random
to impose an ordering on the data.
The utility loss from overestimating the size_limit
is small.
S (summation algorithm) | input type |
Sequential<S::Item> | Vec<S::Item> |
Pairwise<S::Item> | Vec<S::Item> |
S::Item
is the type of all of the following:
each bound, each element in the input data, the output data, and the output sensitivity.
For example, to construct a transformation that pairwise-sums f32
half-precision floats,
set S
to Pairwise<f32>
.
make_bounded_float_ordered_sum in Rust documentation.
Citations:
Supporting Elements:
Input Domain:
VectorDomain<AtomDomain<S::Item>>
Output Domain:
AtomDomain<S::Item>
Input Metric:
InsertDeleteDistance
Output Metric:
AbsoluteDistance<S::Item>