Examples of de.torstennahm.math.SparseIntVector

de.torstennahm.math.SparseIntVector
Models a vector of integer values. Mathematically speaking, the sparse int vector represents an element of N-fold direct sum of Z, where N is the naturals including 0, and Z is the integers. The entries of the vector are stored with a sparse coding, so that only entries with a value not equal to 0 take up space.
The vector is said to consist of pairs of numbers and values, with an integer value assigned to each number >= 0. These pairs of number and value are called entries.
This class is NOT thread-safe. @author Torsten Nahm

    
    this.start = start;
    this.end = end;
    this.bins = bins;
    binSize = (end - start) / (bins - 2);
    binVector = new SparseIntVector();
  }

View Full Code Here

   * Creates a fast index from an array.
   * 
   * @param array array to initialize from
   */
  public FastIndex(int[] array) {
    this(new SparseIntVector(array));
  }

View Full Code Here

    return o instanceof Index && ((Index) o).nonZeroEntries() == 0;
  }


  @Override
  protected SparseIntVector toSparseIntVector() {
    return new SparseIntVector();
  }

View Full Code Here

  public int nonZeroEntries() {
    return toSparseIntVector().nonZeroEntries();
  }
  
  public int lastEntry() {
    SparseIntVector vector = toSparseIntVector();
    return vector.size() - 1;
  }

View Full Code Here

    if (o instanceof StackedIndex) {
      StackedIndex comp = (StackedIndex) o;
      return toSparseIntVector().equals(comp.toSparseIntVector());
    } else if (o instanceof Index) {
      Index comp = (Index) o;
      return toSparseIntVector().equals(new SparseIntVector(comp.iterator()));
    }
    
    return false;
  }

View Full Code Here

    }
  }
  
  @Override
  protected SparseIntVector toSparseIntVector() {
    SparseIntVector vector = base.toSparseIntVector();
    vector.add(entryNum, entryValIncrement);
    return vector;
  }

View Full Code Here

  
  public void start() {
    if (destroyed) { return; }
    
    synchronized (lock) {
      extent = new SparseIntVector();
      maxSum = 0;
      dimension = 0;
    }
    
    frame.repaint();

View Full Code Here

      int height = getHeight();
      
      g.setColor(Color.BLACK);
      int x, lastx = 0, y, lasty = 0;
      
      SparseIntVector extentCopy;
      int maxDimension;
      synchronized (lock) {
        if (extent == null) {
          return;
        }
        extentCopy = extent.duplicate();
        maxDimension = dimension != 0 ? dimension : extentCopy.size();
      }
      
      if (maxDimension <= 32) {
        lastx = 0;
        for (int i = 0; i < maxDimension; i++) {
          x = ((i + 1) * width) / maxDimension;
          for (int j = 0; j < extentCopy.get(i); j++) {
            g.fillRect(lastx, height - (j + 1) * LEVELHEIGHT, x - lastx - 1, LEVELHEIGHT - 1);
          }
          lastx = x;
        }
      } else {
        for (int i = 0; i < maxDimension; i++) {
          x = (int)(((i + 0.5) * width) / maxDimension);
          y = height - extentCopy.get(i) * LEVELHEIGHT;
          if (i > 0) {
            g.drawLine(lastx, lasty, x, y);
          }
          lastx = x;
          lasty = y;

View Full Code Here

TOP

Related Classes of de.torstennahm.math.SparseIntVector

de.torstennahm.integrate.sparse.index.FastIndex

de.torstennahm.integrate.sparse.index.ModifiedIndex

de.torstennahm.integrate.sparse.index.StackedIndex

de.torstennahm.integrate.sparse.visualize.ExtentVisualizer

de.torstennahm.integrate.sparse.visualize.ExtentVisualizer$ExtentPanel

de.torstennahm.statistics.Histogramm

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.