Examples of IntIntPair

com.clearnlp.util.pair.IntIntPair
Integer double pair. @since v0.1 @author Jinho D. Choi ({@code jdchoi77@gmail.com})
com.gs.collections.api.tuple.primitive.IntIntPair
This file was automatically generated from template file primitivePrimitivePair.stg @since 5.0
de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair
Pair storing two integers. Since int is a native type, this can't be done via the {@link CPair} generic. @author Erich Schubert @apiviz.has Comparator

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

          pivotRow = i;
          pivotCol = j;
        }// end if
      }// end for j
    }// end for k
    return new IntIntPair(pivotRow, pivotCol);
  }

View Full Code Here

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

        // current entry in absValue
        absValue = Math.abs(coeff[row[i]][col[j]]);


        // check if absValue is non-zero
        if(absValue > 0) { // found a pivot element
          return new IntIntPair(i, j);
        }// end if
      }// end for j
    }// end for k
    return new IntIntPair(k, k);
  }

View Full Code Here

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

    }
    Arrays.sort(ids);


    pos = 0;
    if(ids.length > 0) {
      setCurrent(new IntIntPair(ids[pos], ids[pos]));
    }
  }

View Full Code Here

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

    pos++;
    if(pos >= ids.length) {
      return null;
    }
    else {
      return new IntIntPair(ids[pos], ids[pos]);
    }
  }

View Full Code Here

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair


    // initialize iterator.
    pos1 = 0;
    pos2 = 0;
    if(thisids.length > 0) {
      setCurrent(new IntIntPair(parentids[pos1], thisids[pos2]));
    }
  }

View Full Code Here

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

    }
    if(pos1 >= parentids.length) {
      return null;
    }
    else {
      return new IntIntPair(parentids[pos1], thisids[pos2]);
    }
  }

View Full Code Here

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

   * 
   * This will return the smallest of all the "merged" generator results. 
   */
  @Override
  protected IntIntPair advance() {
    IntIntPair min = null;
    PairSortedGeneratorInterface best = null;
    for (PairSortedGeneratorInterface gen : this.generators) {
      IntIntPair n = gen.current();
      if (n != null && (min == null || n.compareTo(min) < 0)) {
        min = n;
        best = gen;
      }
    }
    // advance best generator

View Full Code Here

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

      Rk = new ArrayList<Vector<IntIntPair>>();
      // Set of all dim*phi ranges
      ArrayList<IntIntPair> q = new ArrayList<IntIntPair>();
      for(int i = 1; i <= dimensionality; i++) {
        for(int j = 1; j <= phi; j++) {
          IntIntPair s = new IntIntPair(i, j);
          q.add(s);
          // Add to first Rk
          Vector<IntIntPair> v = new Vector<IntIntPair>();
          v.add(s);
          Rk.add(v);

View Full Code Here

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

   */
  public static ReplacingHistogram<IntIntPair> IntIntHistogram(int bins, double min, double max) {
    return new ReplacingHistogram<IntIntPair>(bins, min, max, new Adapter<IntIntPair>() {
      @Override
      public IntIntPair make() {
        return new IntIntPair(0, 0);
      }
    });
  }

View Full Code Here

Examples of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

   */
  public static FlexiHistogram<IntIntPair, IntIntPair> IntSumIntSumHistogram(int bins) {
    return new FlexiHistogram<IntIntPair, IntIntPair>(bins, new Adapter<IntIntPair, IntIntPair>() {
      @Override
      public IntIntPair make() {
        return new IntIntPair(0, 0);
      }


      @Override
      public IntIntPair cloneForCache(IntIntPair data) {
        return new IntIntPair(data.first, data.second);
      }


      @Override
      public IntIntPair downsample(IntIntPair first, IntIntPair second) {
        return new IntIntPair(first.first + second.first, first.second + second.second);
      }


      @Override
      public IntIntPair aggregate(IntIntPair existing, IntIntPair data) {
        existing.first = existing.first + data.first;

View Full Code Here

0 1 2

TOP

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.