Skip to contents

sized bounded float ordered sum constructor

Source: R/transformations.R
make_sized_bounded_float_ordered_sum.Rd

Make a Transformation that computes the sum of bounded floats with known ordering and dataset size.

Usage

make_sized_bounded_float_ordered_sum(size, bounds, .S = "Pairwise<.T>")

Arguments

size

Number of records in input data.

bounds

Tuple of lower and upper bounds for data in the input domain.

.S

Summation algorithm to use over some data type T (T is shorthand for S::Item)

Value

Transformation

Details

Only useful when make_bounded_float_checked_sum returns an error due to potential for overflow. This uses a restricted-sensitivity proof that takes advantage of known dataset size for better utility. You may need to use make_ordered_random to impose an ordering on the data.

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>.

Required features: contrib

make_sized_bounded_float_ordered_sum in Rust documentation.

Citations:

Supporting Elements:

  • Input Domain: VectorDomain<AtomDomain<S::Item>>

  • Output Domain: InsertDeleteDistance

  • Input Metric: AtomDomain<S::Item>

  • Output Metric: AbsoluteDistance<S::Item>