Examples of propel.core.counters.ModuloCounter

propel.core.counters.ModuloCounter
Class providing modulo counter functionality. In other words, this counter wraps around when maximum is reached.

  private static <T> void clearBufferInternal(CircularBuffer<T> cb)
  {
    cb.size = 0;
    cb.buffer = (T[]) Array.newInstance(cb.genericTypeParameter, cb.maxSize);


    cb.inPos = new ModuloCounter(cb.maxSize - 1);
    cb.outPos = new ModuloCounter(cb.maxSize - 1);
  }

View Full Code Here

      return null;


    val lookup = new TreeMap<T, ModuloCounter>(comparator);
    for (T item : items)
      if (!lookup.containsKey(item))
        lookup.put(item, new ModuloCounter(Long.MAX_VALUE - 1));
      else


        lookup.get(item).next();


    long max = -1;

View Full Code Here

  public static <T> T maxOccurring(@NotNull final Iterable<T> items, final Comparator<? super T> comparator)
  {
    val lookup = new TreeMap<T, ModuloCounter>(comparator);
    for (T item : items)
      if (!lookup.containsKey(item))
        lookup.put(item, new ModuloCounter(Long.MAX_VALUE - 1));
      else
        lookup.get(item).next();


    if (lookup.size() <= 0)
      return null;

View Full Code Here

      return null;


    val lookup = new TreeMap<T, ModuloCounter>(comparator);
    for (T item : items)
      if (!lookup.containsKey(item))
        lookup.put(item, new ModuloCounter(Long.MAX_VALUE - 1));
      else
        lookup.get(item).next();


    long min = Long.MAX_VALUE;
    T result = null;

View Full Code Here

  {
    val lookup = new TreeMap<T, ModuloCounter>(comparator);


    for (T item : items)
      if (!lookup.containsKey(item))
        lookup.put(item, new ModuloCounter(Long.MAX_VALUE - 1));
      else
        lookup.get(item).next();


    if (lookup.size() <= 0)
      return null;

View Full Code Here

  private static <T> void clearBufferInternal(CircularBuffer<T> cb)
  {
    cb.size = 0;
    cb.buffer = (T[]) Array.newInstance(cb.genericTypeParameter, cb.maxSize);


    cb.inPos = new ModuloCounter(cb.maxSize - 1);
    cb.outPos = new ModuloCounter(cb.maxSize - 1);
  }

View Full Code Here

      return null;


    val lookup = new TreeMap<T, ModuloCounter>(comparator);
    for (T item : items)
      if (!lookup.containsKey(item))
        lookup.put(item, new ModuloCounter(Long.MAX_VALUE - 1));
      else


        lookup.get(item).next();


    long max = -1;

View Full Code Here

  public static <T> T maxOccurring(@NotNull final Iterable<T> items, final Comparator<? super T> comparator)
  {
    val lookup = new TreeMap<T, ModuloCounter>(comparator);
    for (T item : items)
      if (!lookup.containsKey(item))
        lookup.put(item, new ModuloCounter(Long.MAX_VALUE - 1));
      else
        lookup.get(item).next();


    if (lookup.size() <= 0)
      return null;

View Full Code Here

      return null;


    val lookup = new TreeMap<T, ModuloCounter>(comparator);
    for (T item : items)
      if (!lookup.containsKey(item))
        lookup.put(item, new ModuloCounter(Long.MAX_VALUE - 1));
      else
        lookup.get(item).next();


    long min = Long.MAX_VALUE;
    T result = null;

View Full Code Here

  {
    val lookup = new TreeMap<T, ModuloCounter>(comparator);


    for (T item : items)
      if (!lookup.containsKey(item))
        lookup.put(item, new ModuloCounter(Long.MAX_VALUE - 1));
      else
        lookup.get(item).next();


    if (lookup.size() <= 0)
      return null;

View Full Code Here

TOP

Related Classes of propel.core.counters.ModuloCounter

propel.core.collections.buffers.CircularBuffer

propel.core.utils.Linq

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.