Reweight the contents in all nested aggregators by a scalar factor, as though they had been filled with a different weight.
Add two containers of the same type.
Cast the container to a given type.
Extract the container at a given index, if it exists.
Find the bin index associated with numerical value
NaN, the bin index if it is between
Long.MIN_VALUE + 1 and
Long.MAX_VALUE, otherwise saturate at the endpoints.
Width of the equally sized bins.
Centers and values of each bin.
List of sub-aggregators, to make it possible to walk the tree.
Name of the intended content; used as a placeholder in cases with zero bins (due to no observed data).
Copy this container, making a clone with no reference to the original.
Weighted number of entries (sum of all observed weights).
Reference to the container's factory for runtime reflection.
Get a sequence of filled indexes.
The last non-empty bin.
The first non-empty bin.
x is in the nanflow region (equal to
Container for data that resulted in
The number of bins between the first non-empty one (inclusive) and the last non-empty one (exclusive).
The number of non-empty bins.
Left edge of the bin whose index is zero.
Optional name given to the quantity function, passed for bookkeeping.
Get the low and high edge of a bin (given by index number).
Convert any Container into a NoAggregation Container.
Convert this container to JSON (dropping its
fill method, making it immutable).
Used internally to convert the container to JSON without its
Create an empty container with the same parameters as this one.