Examples of cern.colt.list.IntArrayList.elements()

cern.colt.list.IntArrayList.elements()
Returns the elements currently stored, including invalid elements between size and capacity, if any. WARNING: For efficiency reasons and to keep memory usage low, the array is not copied. So if subsequently you modify the returned array directly via the [] operator, be sure you know what you're doing. @return the elements currently stored.

    if (value==0) {
      DoubleArrayList valueList = values[i];
      indexList.remove(k);
      valueList.remove(k);
      int s = indexList.size();
      if (s>2 && s*3 < indexList.elements().length) {
        indexList.setSize(s*3/2);
        indexList.trimToSize();
        indexList.setSize(s);
        
        valueList.setSize(s*3/2);

View Full Code Here

  for (int i=0; i < rows; i++) {
    if (condition.apply(viewRow(i))) matches.add(i);
  }
  
  matches.trimToSize();
  return viewSelection(matches.elements(), null); // take all columns
}
/**
 * Construct and returns a new selection view.
 *
 * @param rowOffsets the offsets of the visible elements.

View Full Code Here

  for (int i=0; i < rows; i++) {
    if (condition.apply(viewRow(i))) matches.add(i);
  }
  
  matches.trimToSize();
  return viewSelection(matches.elements(), null); // take all columns
}
/**
 * Construct and returns a new selection view.
 *
 * @param rowOffsets the offsets of the visible elements.

View Full Code Here

  IntArrayList matches = new IntArrayList();
  for (int i=0; i < size; i++) {
    if (condition.apply(getQuick(i))) matches.add(i);
  }
  matches.trimToSize();
  return viewSelection(matches.elements());
}
/**
 * Construct and returns a new selection view.
 *
 * @param offsets the offsets of the visible elements.

View Full Code Here

  for (int i=0; i < slices; i++) {
    if (condition.apply(viewSlice(i))) matches.add(i);
  }
  
  matches.trimToSize();
  return viewSelection(matches.elements(), null, null); // take all rows and columns
}
/**
 * Construct and returns a new selection view.
 *
 * @param sliceOffsets the offsets of the visible elements.

View Full Code Here

  IntArrayList matches = new IntArrayList();
  for (int i=0; i < size; i++) {
    if (condition.apply(getQuick(i))) matches.add(i);
  }
  matches.trimToSize();
  return viewSelection(matches.elements());
}
/**
 * Construct and returns a new selection view.
 *
 * @param offsets the offsets of the visible elements.

View Full Code Here

  for (int i=0; i < slices; i++) {
    if (condition.apply(viewSlice(i))) matches.add(i);
  }
  
  matches.trimToSize();
  return viewSelection(matches.elements(), null, null); // take all rows and columns
}
/**
 * Construct and returns a new selection view.
 *
 * @param sliceOffsets the offsets of the visible elements.

View Full Code Here

  for (int i=0; i < slices; i++) {
    if (condition.apply(viewSlice(i))) matches.add(i);
  }
  
  matches.trimToSize();
  return viewSelection(matches.elements(), null, null); // take all rows and columns
}
/**
 * Construct and returns a new selection view.
 *
 * @param sliceOffsets the offsets of the visible elements.

View Full Code Here

  for (int i=0; i < rows; i++) {
    if (condition.apply(viewRow(i))) matches.add(i);
  }
  
  matches.trimToSize();
  return viewSelection(matches.elements(), null); // take all columns
}
/**
 * Construct and returns a new selection view.
 *
 * @param rowOffsets the offsets of the visible elements.

View Full Code Here

  IntArrayList matches = new IntArrayList();
  for (int i=0; i < size; i++) {
    if (condition.apply(getQuick(i))) matches.add(i);
  }
  matches.trimToSize();
  return viewSelection(matches.elements());
}
/**
 * Construct and returns a new selection view.
 *
 * @param offsets the offsets of the visible elements.

View Full Code Here

0 1

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.