All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.github.dm.jrt.operator.AverageInvocation Maven / Gradle / Ivy

/*
 * Copyright 2016 Davide Maestroni
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.github.dm.jrt.operator;

import com.github.dm.jrt.core.channel.Channel;
import com.github.dm.jrt.core.invocation.Invocation;
import com.github.dm.jrt.core.invocation.InvocationFactory;
import com.github.dm.jrt.core.invocation.TemplateInvocation;

import org.jetbrains.annotations.NotNull;

import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.RoundingMode;

import static com.github.dm.jrt.operator.math.Numbers.addOptimistic;

/**
 * Invocation computing the average of the input numbers.
 * 
* The result will have the type matching the input with the highest precision. *

* Created by davide-maestroni on 05/02/2016. */ class AverageInvocation extends TemplateInvocation { private static final InvocationFactory sFactory = new InvocationFactory(null) { @NotNull @Override public Invocation newInvocation() { return new AverageInvocation(); } }; private int mCount; private Number mSum; /** * Constructor. */ private AverageInvocation() { } /** * Returns a factory of invocations computing the average of the input numbers. * * @return the factory instance. */ @NotNull static InvocationFactory factoryOf() { return sFactory; } @Override public void onComplete(@NotNull final Channel result) { if (mCount == 0) { result.pass(0); } else { final Number mean; final Number sum = mSum; if (sum instanceof BigDecimal) { mean = ((BigDecimal) sum).divide(new BigDecimal(mCount), 15, RoundingMode.HALF_UP); } else if (sum instanceof BigInteger) { mean = ((BigInteger) sum).divide(BigInteger.valueOf(mCount)); } else if (sum instanceof Double) { mean = sum.doubleValue() / mCount; } else if (sum instanceof Float) { mean = sum.floatValue() / mCount; } else if (sum instanceof Long) { mean = sum.longValue() / mCount; } else if (sum instanceof Integer) { mean = sum.intValue() / mCount; } else if (sum instanceof Short) { mean = (short) (sum.shortValue() / mCount); } else if (sum instanceof Byte) { mean = (byte) (sum.byteValue() / mCount); } else { mean = sum.doubleValue() / mCount; } result.pass(mean); } } @Override public void onInput(final Number input, @NotNull final Channel result) { mSum = addOptimistic(mSum, input); ++mCount; } @Override public void onRestart() { mSum = (byte) 0; mCount = 0; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy