Package de.lmu.ifi.dbs.elki.utilities.pairs

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

402
403
404
405
406
407
408
409
410
411
412
413
      // (depends on chosen method in switch)
      // store position in pivotRow, pivotCol

      // TODO: Note that we're using "row, col", whereas "col, row" would be
      // more common?
      IntIntPair pivotPos = new IntIntPair(0, 0);
      IntIntPair currPos = new IntIntPair(k, k);

      switch(method){
      case TRIVAL_PIVOT_SEARCH:
        pivotPos = nonZeroPivotSearch(k);
        break;
View Full Code Here
481
482
483
484
485
486
487
          pivotRow = i;
          pivotCol = j;
        }// end if
      }// end for j
    }// end for k
    return new IntIntPair(pivotRow, pivotCol);
  }
View Full Code Here
502
503
504
505
506
507
508
509
510
511
512
        // 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
66
67
68
69
70
71
72
73
    }
    Arrays.sort(ids);

    pos = 0;
    if(ids.length > 0) {
      setCurrent(new IntIntPair(ids[pos], ids[pos]));
    }
  }
View Full Code Here
83
84
85
86
87
88
89
90
    pos++;
    if(pos >= ids.length) {
      return null;
    }
    else {
      return new IntIntPair(ids[pos], ids[pos]);
    }
  }
View Full Code Here
107
108
109
110
111
112
113
114
    // initialize iterator.
    pos1 = 0;
    pos2 = 0;
    if(thisids.length > 0) {
      setCurrent(new IntIntPair(parentids[pos1], thisids[pos2]));
    }
  }
View Full Code Here
128
129
130
131
132
133
134
135
    }
    if(pos1 >= parentids.length) {
      return null;
    }
    else {
      return new IntIntPair(parentids[pos1], thisids[pos2]);
    }
  }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
   *
   * 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
104
105
106
107
108
109
110
111
112
113
114
      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
425
426
427
428
429
430
431
432
433
   */
  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
TOP

Related Classes of de.lmu.ifi.dbs.elki.utilities.pairs.IntIntPair

  • de.lmu.ifi.dbs.elki.algorithm.outlier.AggarwalYuNaive
  • de.lmu.ifi.dbs.elki.evaluation.paircounting.generator.PairGeneratorMerge
  • de.lmu.ifi.dbs.elki.evaluation.paircounting.generator.PairGeneratorNoise
  • de.lmu.ifi.dbs.elki.evaluation.paircounting.generator.PairGeneratorSingleCluster
  • de.lmu.ifi.dbs.elki.math.geometry.SweepHullDelaunay2D
  • de.lmu.ifi.dbs.elki.math.histograms.AggregatingHistogram
  • de.lmu.ifi.dbs.elki.math.histograms.FlexiHistogram
  • de.lmu.ifi.dbs.elki.math.histograms.ReplacingHistogram
  • de.lmu.ifi.dbs.elki.math.linearalgebra.LinearEquationSystem
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.