List of seekPosition() Examples

Examples of seekPosition()

mikera.indexz.Index.seekPosition()
Finds the position a value would take assuming a sorted index. Uses a binary search. @param i The position of the value - will point to either the value or the next higher value present @return

Examples of mikera.indexz.Index.seekPosition()

  @Override
  public boolean isRangeZero(int start, int length) {
    int end=start+length;
    Index index=internalIndex();
    double[] data=internalData();
    int si=index.seekPosition(start);
    int di=index.seekPosition(end);
    for (int i=si; i<di; i++) {
      if (data[i]!=0.0) return false;
    }
    return true;

View Full Code Here

Examples of mikera.indexz.Index.seekPosition()

  public boolean isRangeZero(int start, int length) {
    int end=start+length;
    Index index=internalIndex();
    double[] data=internalData();
    int si=index.seekPosition(start);
    int di=index.seekPosition(end);
    for (int i=si; i<di; i++) {
      if (data[i]!=0.0) return false;
    }
    return true;
  }

View Full Code Here

Examples of mikera.indexz.Index.seekPosition()

  public void addToArray(int offset, double[] array, int arrayOffset, int length) {
    assert((offset>=0)&&(offset+length<=this.length));
    double[] data=internalData();
    Index index=internalIndex();
    
    int start=index.seekPosition(offset);
    int[] ixs=index.data;
    int dataLength=data.length;
    for (int j=start; j<dataLength; j++) {
      int di=ixs[j]-offset; // index relative to offset
      if (di>=length) return;

View Full Code Here

Examples of mikera.indexz.Index.seekPosition()

    int aOffset=arrayOffset-offset;
    
    double[] data=internalData();
    Index index=internalIndex();
    int[] ixs=index.data;
    int start=index.seekPosition(offset);
    for (int i=start; i<data.length; i++) {
      int di=ixs[i];
      // if (di<offset) continue; not needed because of seekPosition!
      if (di>=(offset+length)) return;
      array[di+aOffset]+=factor*data[i];

View Full Code Here

Examples of mikera.indexz.Index.seekPosition()

    
    double[] data=internalData();
    Index index=internalIndex();
    int[] ixs=index.data;
    int dataLength=data.length;
    for (int j=index.seekPosition(offset); j<dataLength; j++) {
      int i =ixs[j]-offset; // index relative to offset
      if (i>=length) return;
      array[i+arrayOffset]+=factor*data[j]*other.get(i+otherOffset);
    }    
  }

View Full Code Here

Examples of mikera.indexz.Index.seekPosition()

    
    double[] data=internalData();
    Index index=internalIndex();
    int[] ixs=index.data;
    int dataLength=data.length;
    for (int j=index.seekPosition(offset); j<dataLength; j++) {
      int i =ixs[j]-offset; // index relative to offset
      if (i>=length) return;
      array[i+arrayOffset]+=factor*data[j]*otherArray[i+otherOffset];
    }    
  }

View Full Code Here

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.