com.totsp.tom.util.Statistics.java Source code

Introduction

Here is the source code for com.totsp.tom.util.Statistics.java

Source

/**
 *    Copyright 2013 Robert Cooper
 *
 *    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.totsp.tom.util;

import com.google.common.collect.Iterables;
import com.google.common.collect.Multiset;
import com.google.common.collect.TreeMultiset;

import java.io.Serializable;
import java.util.Collection;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.Map;

/**
 *
 */
public class Statistics<T extends Comparable<T> & Serializable> implements Collection<T> {

    protected TreeMultiset<T> inner;

    public Statistics() {
        inner = TreeMultiset.create();
    }

    public Statistics(Comparator<T> comparator) {
        inner = TreeMultiset.create(comparator);
    }

    public T mode() {
        Multiset.Entry<T> check = null;
        for (Multiset.Entry<T> entry : inner.entrySet()) {
            if (check == null || entry.getCount() > check.getCount()) {
                check = entry;
            }
        }
        return check == null ? null : check.getElement();
    }

    public T median() {
        int index = (inner.size() - 1) / 2;

        return Iterables.get(inner, index, null);
    }

    public Map<T, Integer> histogram() {
        LinkedHashMap<T, Integer> result = new LinkedHashMap<T, Integer>();
        for (Multiset.Entry<T> entry : inner.entrySet()) {
            result.put(entry.getElement(), entry.getCount());
        }
        return result;
    }

    @Override
    public int size() {
        return inner.size();
    }

    @Override
    public boolean isEmpty() {
        return inner.isEmpty();
    }

    @Override
    public boolean contains(Object o) {
        return inner.contains(o);
    }

    @Override
    public Iterator<T> iterator() {
        return inner.iterator();
    }

    @Override
    public Object[] toArray() {
        return inner.toArray();
    }

    @Override
    public <T1> T1[] toArray(T1[] a) {
        return inner.toArray(a);
    }

    @Override
    public boolean add(T t) {
        return inner.add(t);
    }

    @Override
    public boolean remove(Object o) {
        return inner.remove(o);
    }

    @Override
    public boolean containsAll(Collection<?> c) {
        return inner.containsAll(c);
    }

    @Override
    public boolean addAll(Collection<? extends T> c) {
        return inner.addAll(c);
    }

    @Override
    public boolean removeAll(Collection<?> c) {
        return inner.removeAll(c);
    }

    @Override
    public boolean retainAll(Collection<?> c) {
        return inner.retainAll(c);
    }

    @Override
    public void clear() {
        inner.clear();
    }
}