Package gnu.trove.list.array

Examples of gnu.trove.list.array.TIntArrayList.forEach()


  /**
   * @see net.sf.jsi.SpatialIndex#nearest(Point, gnu.trove.TIntProcedure, float)
   */
  public void nearest(Point p, final TIntProcedure v, float furthestDistance) {
    TIntArrayList nearestList = nearest(p, furthestDistance);
    nearestList.forEach(new TIntProcedure() {
      public boolean execute(int id) {
        v.execute(id)
        return true;
     
    });
View Full Code Here


  /**
   * @see net.sf.jsi.SpatialIndex#nearestN(Point, gnu.trove.TIntProcedure, int, float)
   */
  public void nearestN(Point p, final TIntProcedure v, int n, float furthestDistance) {
    TIntArrayList nearestList = nearestN(p, n, furthestDistance);
    nearestList.forEach(new TIntProcedure() {
      public boolean execute(int id) {
        v.execute(id)
        return true;
      }
    });
View Full Code Here

    float furthestDistanceSq = furthestDistance * furthestDistance;
    TIntArrayList nearestIds = new TIntArrayList();
    nearest(p, rootNode, furthestDistanceSq, nearestIds);

    nearestIds.forEach(v);
    nearestIds.reset();
  }

  private void createNearestNDistanceQueue(Point p, int count, PriorityQueue distanceQueue, float furthestDistance) {
    //  return immediately if given an invalid "count" parameter
View Full Code Here

                    indices.add(face[tri + 2]);
                }
            }

            // Check indices in bounds
            indices.forEach(new TIntProcedure() {
                @Override
                public boolean execute(int value) {
                    if (value < 0 || value >= vertices.length) {
                        throw new JsonParseException("Face value out of range: " + value + ", max vertex is " + (vertices.length - 1));
                    }
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. 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.