Example usage for org.apache.commons.lang.mutable MutableInt increment

Introduction

In this page you can find the example usage for org.apache.commons.lang.mutable MutableInt increment.

Prototype

public void increment()

Source Link

Document

Increments the value.

Usage

From source file:com.aionlightning.commons.services.CronServiceTest.java

private static Runnable newIncrementingRunnable(final MutableInt ref) {
    return new Runnable() {
        @Override// w w  w .  j a  va 2 s  .c om
        public void run() {
            if (ref != null) {
                ref.increment();
            }
        }
    };
}

From source file:de.tudarmstadt.ukp.csniper.webapp.search.tgrep.PennTreeUtils.java

private static PennTreeNode dfs(int aTarget, MutableInt aIndex, PennTreeNode aNode) {
    if (aTarget == aIndex.intValue()) {
        return aNode;
    }/*from  w  w w  .j a v  a2  s . c  o  m*/

    for (PennTreeNode n : aNode.getChildren()) {
        aIndex.increment();
        PennTreeNode r = dfs(aTarget, aIndex, n);
        if (r != null) {
            return r;
        }
    }

    return null;
}

From source file:com.linkedin.pinot.common.utils.request.RequestUtils.java

private static FilterQuery traverseFilterQueryAndPopulateMap(FilterQueryTree tree,
        Map<Integer, FilterQuery> filterQueryMap, MutableInt currentId) {
    int currentNodeId = currentId.intValue();
    currentId.increment();

    final List<Integer> f = new ArrayList<>();
    if (null != tree.getChildren()) {
        for (final FilterQueryTree c : tree.getChildren()) {
            int childNodeId = currentId.intValue();
            currentId.increment();/*from ww  w  . ja  v a  2s .  c om*/

            f.add(childNodeId);
            final FilterQuery q = traverseFilterQueryAndPopulateMap(c, filterQueryMap, currentId);
            filterQueryMap.put(childNodeId, q);
        }
    }

    FilterQuery query = new FilterQuery();
    query.setColumn(tree.getColumn());
    query.setId(currentNodeId);
    query.setNestedFilterQueryIds(f);
    query.setOperator(tree.getOperator());
    query.setValue(tree.getValue());
    return query;
}

From source file:com.linkedin.pinot.common.utils.request.RequestUtils.java

private static HavingFilterQuery traverseHavingFilterQueryAndPopulateMap(HavingQueryTree tree,
        Map<Integer, HavingFilterQuery> filterQueryMap, MutableInt currentId) {
    int currentNodeId = currentId.intValue();
    currentId.increment();

    final List<Integer> filterIds = new ArrayList<>();
    if (null != tree.getChildren()) {
        for (final HavingQueryTree child : tree.getChildren()) {
            int childNodeId = currentId.intValue();
            currentId.increment();//from  w w w.  j  a  v a2  s .  co m
            filterIds.add(childNodeId);
            final HavingFilterQuery filterQuery = traverseHavingFilterQueryAndPopulateMap(child, filterQueryMap,
                    currentId);
            filterQueryMap.put(childNodeId, filterQuery);
        }
    }

    HavingFilterQuery havingFilterQuery = new HavingFilterQuery();
    havingFilterQuery.setAggregationInfo(tree.getAggregationInfo());
    havingFilterQuery.setId(currentNodeId);
    havingFilterQuery.setNestedFilterQueryIds(filterIds);
    havingFilterQuery.setOperator(tree.getOperator());
    havingFilterQuery.setValue(tree.getValue());
    return havingFilterQuery;
}

From source file:eu.project.ttc.utils.TermSuiteUtils.java

public static <T> LinkedHashMap<T, Integer> getCounters(Iterable<T> list) {
    Comparator<Entry<T, MutableInt>> comparator = new Comparator<Entry<T, MutableInt>>() {
        public int compare(Entry<T, MutableInt> o1, Entry<T, MutableInt> o2) {
            return ComparisonChain.start().compare(o2.getValue(), o1.getValue()).result();
        };//from   w ww .  j  av  a2  s  .  c  o m
    };

    Map<T, MutableInt> map = Maps.newHashMap();
    for (T e : list) {
        MutableInt counter = map.get(e);
        if (counter == null) {
            counter = new MutableInt(0);
            map.put(e, counter);
        }
        counter.increment();
    }
    List<Entry<T, MutableInt>> entries = Lists.newArrayList(map.entrySet());
    Collections.sort(entries, comparator);
    LinkedHashMap<T, Integer> counters = Maps.newLinkedHashMap();
    for (Entry<T, MutableInt> e : entries)
        counters.put(e.getKey(), e.getValue().intValue());
    return counters;
}

From source file:com.datatorrent.lib.util.BaseUniqueKeyCounter.java

/**
 * Reference counts each tuple/*from  www.j  av  a2 s. c  om*/
 *
 * @param tuple
 */
public void processTuple(K tuple) {
    MutableInt i = map.get(tuple);
    if (i == null) {
        i = new MutableInt(0);
        map.put(cloneKey(tuple), i);
    }
    i.increment();
}

From source file:com.datatorrent.lib.util.BaseUniqueKeyValueCounter.java

/**
 * Reference counts each tuple/*from w  w  w .ja v a2s  .co  m*/
 * @param key tuple key
 * @param val tuple value
 */
public void processTuple(K key, V val) {
    HashMap<K, V> tuple = new HashMap<K, V>(1);
    tuple.put(key, val);
    MutableInt i = map.get(tuple);
    if (i == null) {
        i = new MutableInt(0);
        map.put(cloneTuple(tuple), i);
    }
    i.increment();
}

From source file:com.datatorrent.lib.testbench.HashTestSink.java

@Override
public void put(T tuple) {
    this.count++;
    MutableInt val = map.get(tuple);
    if (val == null) {
        val = new MutableInt(0);
        map.put(tuple, val);
    }// w  w w. j  a v a  2 s  .  c o  m
    val.increment();
}

From source file:com.datatorrent.lib.testbench.ArrayListTestSink.java

@Override
public void put(T tuple) {
    this.count++;
    @SuppressWarnings("unchecked")
    ArrayList<Object> list = (ArrayList<Object>) tuple;
    for (Object o : list) {
        MutableInt val = map.get(o);
        if (val == null) {
            val = new MutableInt(0);
            map.put(o, val);
        }// w  ww .j a  v a  2  s. c om
        val.increment();
    }
}

From source file:com.datatorrent.lib.util.AbstractBaseFrequentKey.java

/**
 * Counts frequency of a key//from w  ww  .j a v a2s  .  c o  m
 * @param tuple
 */
public void processTuple(K tuple) {
    MutableInt count = keycount.get(tuple);
    if (count == null) {
        count = new MutableInt(0);
        keycount.put(cloneKey(tuple), count);
    }
    count.increment();
}