/**
 * A couple of very simple algorithms useful for counting primitive operations
 * @author gtowell
 * Created: Oct 1, 2020
 */
public class PrimCount {
    /**
     * Compute the average of the data
     * @param data the data to be averaged.
     * @return the average
     */
    public double allAverage(long[] data)
    {
        double res = 0;
        for (int i=0; i<data.length; i++)
        {
            res = res+data[i];
        }
        return res/data.length;
    }
    
    /**
     * Compute the average of the positive numbers in the data
     * @param data the data to be averaged
     * @return the positive average
     */
    public double posAverage(long[] data) {
        double res = 0;
        long pCount = 0;
        for (int i=0; i<data.length; i++) {
            long datum=data[i];
            if (0<datum) {
                res = res+datum;
                pCount=pCount+1;
            }
        }
        return res/pCount;
    }

    public static void main(String[] args) {
        long[] aa = {1,2,3,4,5,4,3,2,1,-1,-2,-3,-4,-5};
        System.out.println(new PrimCount().allAverage(aa));
        System.out.println(new PrimCount().posAverage(aa));

    }
    
}