clusters = createClusters();\r\n\r\n //compute MAX_WIDTH and MAX_HEIGHT\r\n computeCloudDimensions(clusters);\r\n\r\n double scale = 1.05;\r\n //try to layout words\r\n while (!doPacking(clusters))\r\n {\r\n //increase cloud dimensions\r\n MAX_WIDTH *= scale;\r\n MAX_HEIGHT *= scale;\r\n }\r\n\r\n doPacking(clusters);\r\n }","@Test\n public void testBoundsAsCompositesWithOneInRestrictionsAndOneClusteringColumn()\n {\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\n\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC);\n\n Restriction in = newSingleIN(cfMetaData, 0, value1, value2, value3);\n\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(in);\n\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(3, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.START);\n assertComposite(bounds.get(1), value2, EOC.START);\n assertComposite(bounds.get(2), value3, EOC.START);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(3, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n assertComposite(bounds.get(1), value2, EOC.END);\n assertComposite(bounds.get(2), value3, EOC.END);\n }","private static native long createEdgeBoxes_0(float alpha, float beta, float eta, float minScore, int maxBoxes, float edgeMinMag, float edgeMergeThr, float clusterMinMag, float maxAspectRatio, float minBoxArea, float gamma, float kappa);","@Test\n public void testBoundsAsCompositesWithMultiSliceRestrictionsWithOneDescendingClusteringColumn()\n {\n CFMetaData cfMetaData = newCFMetaData(Sort.DESC);\n\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\n\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1);\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.START);\n\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.NONE);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1);\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value2, EOC.END);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.START);\n\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1);\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value2);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value2, EOC.NONE);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n }","public void reinitiallizeDistanceFunctionInside() {\n\t\tint i, j;\r\n\t\tfor (i = 0; i < _levelSet.length; i++) {\r\n\t\t\tfor (j = 0; j < _levelSet[i].length; j++) {\r\n\t\t\t\tint iPlus = imposeBorder(i + 1, _iSize);\r\n\t\t\t\tint iMinus = imposeBorder(i - 1, _iSize);\r\n\t\t\t\tint jPlus = imposeBorder(j + 1, _iSize);\r\n\t\t\t\tint jMinus = imposeBorder(j - 1, _iSize);\r\n\t\t\t\tif (_levelSet[i][j] <= 0) // // the check for points in region\r\n\t\t\t\t\t// // the check for points in border\r\n\t\t\t\t\tif (MatrixMath.anyNeighborIsOutside(_levelSet, i, j, iPlus,\r\n\t\t\t\t\t\t\tiMinus, jPlus, jMinus)) {\r\n\t\t\t\t\t\t// points in border are placed in narrowband\r\n\t\t\t\t\t\t// _narrowBandInside.add(new Location(i, j));\r\n\t\t\t\t\t\t_narrowBandInside.add(new Location(i, j));\r\n\t\t\t\t\t} else {\r\n\t\t\t\t\t\t// and location in distance matrix is set to infinite\r\n\t\t\t\t\t\t_levelSet[i][j] = Double.NEGATIVE_INFINITY;\r\n\t\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t// iterate until narrow band is empty\r\n\t\t// OrderByLevelSetValue comparator = new OrderByLevelSetValue();\r\n\t\t// while (_narrowBandInside.size() > 0) {\r\n\t\twhile (_narrowBandInside.size() > 0) {\r\n\t\t\t// get the maximum value\r\n\t\t\t// Location maxVal = _narrowBandInside.last();\r\n\t\t\tLocation maxVal = _narrowBandInside.last();\r\n\t\t\t// System.out.println(\"maxVal \" + maxVal);\r\n\t\t\t// System.out.println(\"_narrowBandInside.contains(maxVal) \"\r\n\t\t\t// + _narrowBandInside.contains(maxVal));\r\n\t\t\t// System.out.println(\"maxVal.compareTo(maxVal) \"\r\n\t\t\t// + maxVal.compareTo(maxVal));\r\n\r\n\t\t\t// get the neighbors that are still in _faraway\r\n\t\t\tint iPlus = imposeBorder(maxVal.i + 1, _iSize);\r\n\t\t\tint iMinus = imposeBorder(maxVal.i - 1, _iSize);\r\n\t\t\tint jPlus = imposeBorder(maxVal.j + 1, _iSize);\r\n\t\t\tint jMinus = imposeBorder(maxVal.j - 1, _iSize);\r\n\t\t\ttransferNeighborInside(iPlus, maxVal.j);\r\n\t\t\ttransferNeighborInside(iMinus, maxVal.j);\r\n\t\t\ttransferNeighborInside(maxVal.i, jPlus);\r\n\t\t\ttransferNeighborInside(maxVal.i, jMinus);\r\n\t\t\t// remove the value from the narrowband\r\n\t\t\t// _narrowBandInside.remove(maxVal);\r\n\t\t\t_narrowBandInside.remove(maxVal);\r\n\t\t}\r\n\t\t// done\r\n\t}","public GJBox2D boundingBox() {\n\t\tdouble xmin = Double.MAX_VALUE;\n\t\tdouble ymin = Double.MAX_VALUE;\n\t\tdouble xmax = Double.MIN_VALUE;\n\t\tdouble ymax = Double.MIN_VALUE;\n\n\t\t// coordinates of current point\n\t\tdouble x, y;\n\t\t\n\t\t// Iterate on each control point of each segment\n\t\tfor (Segment seg : this.segments) {\n\t\t\tfor (GJPoint2D p : seg.controlPoints()) {\n\t\t\t\t// get current coordinates\n\t\t\t\tx = p.x();\n\t\t\t\ty = p.y();\n\t\t\t\t\n\t\t\t\t// update bounds\n\t\t\t\txmin = Math.min(xmin, x);\n\t\t\t\tymin = Math.min(ymin, y);\n\t\t\t\txmax = Math.max(xmax, x);\n\t\t\t\tymax = Math.max(ymax, y);\n\t\t\t}\n\t\t}\n\t\t\n\t\t// createFromCollection a new GJBox2D with the bounds\n\t\treturn new GJBox2D(xmin, xmax, ymin, ymax);\n\t}","private void buildMapArea(MapBuilderBase mapBuilder) {\n\t\tmap = new Tile[width][height];\n\n\t\tthis.name = mapBuilder.buildMap(map);\n\t\tupdateValues();\n\n\t\t// TODO: pathfinding precalculations?\n\n\t\t// Log.debug(\"Calculating path maps...\");\n\t\t// pointGraph = new PointGraph();\n\t\t// for (int x = 0; x < width; x++) {\n\t\t// for (int y = 0; y < height; y++) {\n\t\t// if (getTileAt(x, y).isPassable)\n\t\t// pointGraph.addVertex(new Vertex(new Point(x, y)));\n\t\t// }\n\t\t// }\n\t\t// pointGraph.calculateEdges();\n\t\t// Log.debug(\"done\");\n\t}","public static BsonDocument createPartitionBounds(final BsonValue lower, final BsonValue upper) {\n BsonDocument partitionBoundary = new BsonDocument();\n if (lower.getBsonType() != BsonType.MIN_KEY) {\n partitionBoundary.append(\"$gte\", lower);\n }\n if (upper.getBsonType() != BsonType.MAX_KEY) {\n partitionBoundary.append(\"$lt\", upper);\n }\n return partitionBoundary;\n }","@Test\n public void testBoundsAsCompositesWithSliceRestrictionsAndOneClusteringColumn()\n {\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC);\n\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\n\n Restriction slice = newSingleSlice(cfMetaData, 0, Bound.START, false, value1);\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n slice = newSingleSlice(cfMetaData, 0, Bound.START, true, value1);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.NONE);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n slice = newSingleSlice(cfMetaData, 0, Bound.END, true, value1);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n\n slice = newSingleSlice(cfMetaData, 0, Bound.END, false, value1);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.START);\n\n slice = newSingleSlice(cfMetaData, 0, Bound.START, false, value1);\n Restriction slice2 = newSingleSlice(cfMetaData, 0, Bound.END, false, value2);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value2, EOC.START);\n\n slice = newSingleSlice(cfMetaData, 0, Bound.START, true, value1);\n slice2 = newSingleSlice(cfMetaData, 0, Bound.END, true, value2);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.NONE);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value2, EOC.END);\n }","@Test\n public void testBoundsAsCompositesWithOneEqRestrictionsAndOneClusteringColumn()\n {\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC);\n\n ByteBuffer clustering_0 = ByteBufferUtil.bytes(1);\n Restriction eq = newSingleEq(cfMetaData, 0, clustering_0);\n\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(eq);\n\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), clustering_0, EOC.START);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), clustering_0, EOC.END);\n }","Long getResultMaskBoundary();","public Bounds(int minX, int minZ, int maxX, int maxZ) {\n this.minX = minX;\n this.minZ = minZ;\n this.maxX = maxX;\n this.maxZ = maxZ;\n }","private Graph initializeBounds(Graph graphIn)\n {\n Random rand = new Random();\n \n DEdge[] allEdges = graphIn.listAllEdges();\n for(DEdge de : allEdges)\n {\n de.setLowerb(0);\n de.setUpperb(rand.nextInt(100));\n // Use bad networks for performance testing ??\n }\n return graphIn;\n }","protected double[] calculateDataBoundingBox() {\n \t\tdouble min_x = Double.MAX_VALUE;\n \t\tdouble min_y = Double.MAX_VALUE;\n \t\tdouble max_x = 0.0D;\n \t\tdouble max_y = 0.0D;\n \t\t// check the points\n \t\tfor (int i=0; i max_x) max_x = p[0][i];\n \t\t\tif (p[1][i] > max_y) max_y = p[1][i];\n \t\t}\n \t\treturn new double[]{min_x, min_y, max_x, max_y};\n \t}","@Test\n public void testBoundsAsCompositesWithSingleEqAndSliceRestrictions()\n {\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC, Sort.ASC);\n\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\n ByteBuffer value4 = ByteBufferUtil.bytes(4);\n ByteBuffer value5 = ByteBufferUtil.bytes(5);\n\n // clustering_0 = 1 AND (clustering_1, clustering_2) > (2, 3)\n Restriction singleEq = newSingleEq(cfMetaData, 0, value1);\n Restriction multiSlice = newMultiSlice(cfMetaData, 1, Bound.START, false, value2, value3);\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiSlice);\n\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n\n // clustering_0 = 1 AND (clustering_1, clustering_2) > (2, 3) AND (clustering_1) < (4)\n singleEq = newSingleEq(cfMetaData, 0, value1);\n multiSlice = newMultiSlice(cfMetaData, 1, Bound.START, false, value2, value3);\n Restriction multiSlice2 = newMultiSlice(cfMetaData, 1, Bound.END, false, value4);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(multiSlice2).mergeWith(singleEq).mergeWith(multiSlice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value4, EOC.START);\n\n // clustering_0 = 1 AND (clustering_1, clustering_2) => (2, 3) AND (clustering_1, clustering_2) <= (4, 5)\n singleEq = newSingleEq(cfMetaData, 0, value1);\n multiSlice = newMultiSlice(cfMetaData, 1, Bound.START, true, value2, value3);\n multiSlice2 = newMultiSlice(cfMetaData, 1, Bound.END, true, value4, value5);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(multiSlice2).mergeWith(singleEq).mergeWith(multiSlice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.NONE);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value4, value5, EOC.END);\n }","private Node createVirtualWorldBoundsShape() {\n \t\tPoint3d lower = new Point3d();\n \t\tPoint3d upper = new Point3d();\n \t\tmyVirtualWorldBounds.getLower(lower);\n \t\tmyVirtualWorldBounds.getUpper(upper);\n \t\t\n \t\tdouble[] coordinates = { lower.x, lower.y, lower.z, upper.x, lower.y,\n \t\t\t\tlower.z, upper.x, lower.y, upper.z, lower.x, lower.y, upper.z,\n \t\t\t\tlower.x, upper.y, lower.z, upper.x, upper.y, lower.z, upper.x,\n \t\t\t\tupper.y, upper.z, lower.x, upper.y, upper.z };\n \t\t\n \t\tint[] coordinateIndices = { 0, 1, 1, 2, 2, 3, 3, 0, 4, 5, 5, 6, 6, 7,\n \t\t\t\t7, 4, 0, 4, 1, 5, 2, 6, 3, 7 };\n \t\t\n \t\tIndexedLineArray geometry = new IndexedLineArray(\n \t\t\t\tcoordinates.length / 3, IndexedLineArray.COORDINATES,\n \t\t\t\tcoordinateIndices.length);\n \t\t\n \t\tgeometry.setCoordinates(0, coordinates);\n \t\tgeometry.setCoordinateIndices(0, coordinateIndices);\n \t\t\n \t\treturn new Shape3D(geometry);\n \t}","public List getBoundingsOfCell() {\n\n\t\tfloat minXPoint = Float.POSITIVE_INFINITY;\n\t\tfloat maxXPoint = Float.NEGATIVE_INFINITY;\n\t\tfloat minYPoint = Float.POSITIVE_INFINITY;\n\t\tfloat maxYPoint = Float.NEGATIVE_INFINITY;\n\n\t\tfor (int i = 0; i < face.edges().size(); i++) {\n\n\t\t\tDCEL_Edge e = (DCEL_Edge) face.edges().get(i);\n\n\t\t\tArc2_Sweep arc = (Arc2_Sweep) e.reference;\n\n\t\t\t// Looking for most left located point of cell\n\t\t\tif (minXPoint > arc.minX().x) {\n\t\t\t\tminXPoint = arc.minX().x;\n\t\t\t}\n\t\t\t// Looking for most right located point of cell\n\t\t\tif (maxXPoint < arc.maxX().x) {\n\t\t\t\tmaxXPoint = arc.maxX().x;\n\t\t\t}\n\t\t\t// Looking for highest located point of cell\n\t\t\tif (minYPoint > arc.minY().y) {\n\t\t\t\tminYPoint = arc.minY().y;\n\t\t\t}\n\t\t\t// Looking for lowest located point of cell\n\t\t\tif (maxYPoint < arc.maxY().y) {\n\t\t\t\tmaxYPoint = arc.maxY().y;\n\t\t\t}\n\n\t\t}\n\n\t\tList boundings = new ArrayList();\n\t\tboundings.add(minXPoint);\n\t\tboundings.add(maxXPoint);\n\t\tboundings.add(minYPoint);\n\t\tboundings.add(maxYPoint);\n\t\treturn boundings;\n\n\t}","@Test\n public void testBoundsAsCompositesWithSingleEqAndMultiEqRestrictions()\n {\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC, Sort.ASC, Sort.ASC);\n\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\n ByteBuffer value4 = ByteBufferUtil.bytes(4);\n\n // clustering_0 = 1 AND (clustering_1, clustering_2) = (2, 3)\n Restriction singleEq = newSingleEq(cfMetaData, 0, value1);\n Restriction multiEq = newMultiEq(cfMetaData, 1, value2, value3);\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiEq);\n\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.START);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\n\n // clustering_0 = 1 AND clustering_1 = 2 AND (clustering_2, clustering_3) = (3, 4)\n singleEq = newSingleEq(cfMetaData, 0, value1);\n Restriction singleEq2 = newSingleEq(cfMetaData, 1, value2);\n multiEq = newMultiEq(cfMetaData, 2, value3, value4);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(singleEq).mergeWith(singleEq2).mergeWith(multiEq);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.START);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.END);\n\n // (clustering_0, clustering_1) = (1, 2) AND clustering_2 = 3\n singleEq = newSingleEq(cfMetaData, 2, value3);\n multiEq = newMultiEq(cfMetaData, 0, value1, value2);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiEq);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.START);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\n\n // clustering_0 = 1 AND (clustering_1, clustering_2) = (2, 3) AND clustering_3 = 4\n singleEq = newSingleEq(cfMetaData, 0, value1);\n singleEq2 = newSingleEq(cfMetaData, 3, value4);\n multiEq = newMultiEq(cfMetaData, 1, value2, value3);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiEq).mergeWith(singleEq2);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.START);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.END);\n }","private void updateBoundingBox() {\n // TODO(sonpham): Optimize this. There is an amazing amount of repetition in this code.\n double downUnitX = MathUtils.quickCos((float) (anchorAngle + Math.PI));\n double downUnitY = MathUtils.quickSin((float) (anchorAngle + Math.PI));\n double sideUnitX = MathUtils.quickCos((float) (anchorAngle + Math.PI / 2));\n double sideUnitY = MathUtils.quickSin((float) (anchorAngle + Math.PI / 2));\n\n double aliveHeight = aliveTroopsMap.size() * 1.0 / width * unitStats.spacing;\n double fullToAliveRatio = 1.0 * troops.size() / aliveTroopsMap.size() ;\n\n double topLeftX = averageX - downUnitX * aliveHeight / 2 - sideUnitX * unitStats.spacing * width / 2;\n double topLeftY = averageY - downUnitY * aliveHeight / 2 - sideUnitY * unitStats.spacing * width / 2;\n\n double topRightX = averageX - downUnitX * aliveHeight / 2 + sideUnitX * unitStats.spacing * width / 2;\n double topRightY = averageY - downUnitY * aliveHeight / 2 + sideUnitY * unitStats.spacing * width / 2;\n\n double healthBotLeftX = averageX + downUnitX * aliveHeight / 2 - sideUnitX * unitStats.spacing * width / 2;\n double healthBotLeftY = averageY + downUnitY * aliveHeight / 2 - sideUnitY * unitStats.spacing * width / 2;\n\n double healthBotRightX = averageX + downUnitX * aliveHeight / 2 + sideUnitX * unitStats.spacing * width / 2;\n double healthBotRightY = averageY + downUnitY * aliveHeight / 2 + sideUnitY * unitStats.spacing * width / 2;\n\n double botLeftX = (healthBotLeftX - topLeftX) * fullToAliveRatio + topLeftX;\n double botLeftY = (healthBotLeftY - topLeftY) * fullToAliveRatio + topLeftY;\n\n double botRightX = (healthBotRightX - topRightX) * fullToAliveRatio + topRightX;\n double botRightY = (healthBotRightY - topRightY) * fullToAliveRatio + topRightY;\n\n aliveBoundingBox[0][0] = topLeftX; aliveBoundingBox[0][1] = topLeftY;\n aliveBoundingBox[1][0] = topRightX; aliveBoundingBox[1][1] = topRightY;\n aliveBoundingBox[2][0] = healthBotRightX; aliveBoundingBox[2][1] = healthBotRightY;\n aliveBoundingBox[3][0] = healthBotLeftX; aliveBoundingBox[3][1] = healthBotLeftY;\n\n boundingBox[0][0] = topLeftX; boundingBox[0][1] = topLeftY;\n boundingBox[1][0] = topRightX; boundingBox[1][1] = topRightY;\n boundingBox[2][0] = botRightX; boundingBox[2][1] = botRightY;\n boundingBox[3][0] = botLeftX; boundingBox[3][1] = botLeftY;\n }","@Test\n public void testBoundsAsCompositesWithMultiSliceRestrictionsWithOneClusteringColumn()\n {\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC);\n\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\n\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1);\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.NONE);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertEmptyComposite(bounds.get(0));\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.START);\n\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1);\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.END);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value2, EOC.START);\n\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1);\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value2);\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, EOC.NONE);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value2, EOC.END);\n }","public List build() {\n\t\treturn this.mapBuilder.build();\n\t}","public static void main(String[] args)\r\n\t{\n\t\tList locations = new ArrayList();\r\n\t\tlocations.add(new Location(150, 981));\r\n\t\tlocations.add(new Location(136, 0));\r\n\t\tlocations.add(new Location(158, 88));\r\n\t\tlocations.add(new Location(330, 60));\r\n\t\tlocations.add(new Location(0, 1001));\r\n\t\tlocations.add(new Location(150, 0));\r\n\t\tlocations.add(new Location(0, 0));\r\n\t\tlocations.add(new Location(0, 0));\r\n\t\tlocations.add(new Location(0, 0));\r\n\t\tlocations.add(new Location(446, 88));\r\n\t\tlocations.add(new Location(562, 88));\r\n\t\tlocations.add(new Location(256, 88));\r\n\t\tlocations.add(new Location(678, 88));\r\n\t\tlocations.add(new Location(794, 88));\r\n\t\tlocations.add(new Location(0, 1028));\r\n\t\tlocations.add(new Location(136, 0));\r\n\t\tlocations.add(new Location(150, 0));\r\n\t\tlocations.add(new Location(150, 88));\r\n\t\tlocations.add(new Location(150, 1028));\r\n\t\tlocations.add(new Location(150, 88));\r\n\t\tlocations.add(new Location(150, 88));\r\n\t\tlocations.add(new Location(150, 88));\r\n\t\tlocations.add(new Location(150, 88));\r\n\t\tlocations.add(new Location(150, 88));\r\n\t\tlocations.add(new Location(150, 88));\r\n\t\tlocations.add(new Location(136, 103));\r\n\t\tlocations.add(new Location(150, 0));\r\n\t\tList clusterInput = new ArrayList(locations.size());\r\n\t\tfor (Location location : locations)\r\n\t\t\tclusterInput.add(new LocationWrapper(location));\r\n\r\n\t\t// initialize a new clustering algorithm.\r\n\t\t// we use KMeans++ with 10 clusters and 10000 iterations maximum.\r\n\t\t// we did not specify a distance measure; the default (euclidean\r\n\t\t// distance) is used.\r\n\t\t// org.apache.commons.math3.ml.clustering.FuzzyKMeansClusterer\r\n\t\t// clusterer = new\r\n\t\t// org.apache.commons.math3.ml.clustering.FuzzyKMeansClusterer(2,\r\n\t\t// 2);\r\n\t\t// KMeansPlusPlusClusterer clusterer = new\r\n\t\t// KMeansPlusPlusClusterer(2, 10);\r\n\r\n\t\tDBSCANClusterer clusterer = new DBSCANClusterer(1200.0, 5);\r\n\t\tList> clusterResults = clusterer.cluster(clusterInput);\r\n\t\t// List> clusterResults =\r\n\t\t// clusterer.cluster(clusterInput);\r\n\r\n\t\t// output the clusters\r\n\t\tSystem.out.println(\"clusterResults.size() = \" + clusterResults.size());\r\n\t\tfor (int i = 0; i < clusterResults.size(); i++)\r\n\t\t{\r\n\t\t\tSystem.out.println(\"Cluster \" + i);\r\n\t\t\tfor (LocationWrapper locationWrapper : clusterResults.get(i).getPoints())\r\n\t\t\t\tSystem.out.println(locationWrapper.getLocation());\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}","public GeometryBoundingBox(double west, double south, double east, double north, Double minAltitude,\n Double maxAltitude) {\n this.west = west;\n this.south = south;\n this.east = east;\n this.north = north;\n this.minAltitude = minAltitude;\n this.maxAltitude = maxAltitude;\n }","protected void buildRadius()\r\n\t{\n\t\tif (m_Qmax == null || m_Qmin == null)\r\n\t\t{\r\n\t\t\tupdateQMinQMax();\r\n\t\t}\r\n\t\t\r\n\t\tm_Radius = getMaxDistanceOrigin();\r\n\t}","protected void computeGridParameters() {\n float padding = 0.02f * overlay.getScalingValue();\n boolean flipX = x2 < x1;\n float xx1 = flipX ? (x1 + padding) : (x1 - padding);\n float xx2 = flipX ? (x2 - padding) : (x2 + padding);\n boolean flipY = y2 < y1;\n float yy1 = flipY ? (y1 + padding) : (y1 - padding);\n float yy2 = flipY ? (y2 - padding) : (y2 + padding);\n \n xGrid1 = xx1; yGrid1 = yy1;\n xGrid2 = xx2; yGrid2 = yy1;\n xGrid3 = xx1; yGrid3 = yy2;\n xGrid4 = xx2; yGrid4 = yy2;\n horizGridCount = 3; vertGridCount = 3;\n }","private Coordinate[] generateBoundingBox(final Geometry geometry) {\n if (geometry == null || geometry.getCoordinates() == null || geometry.getCoordinates().length == 0) {\n return new Coordinate[]{new Coordinate(0,0),new Coordinate(0,0)};\n }\n final Coordinate firstPoint = geometry.getCoordinates()[0];\n double minLat = firstPoint.y;\n double minLon = firstPoint.x;\n double maxLat = firstPoint.y;\n double maxLon = firstPoint.x;\n for (final Coordinate coordinate : geometry.getCoordinates()) {\n if (coordinate.x < minLon) {\n minLon = coordinate.x;\n }\n if (coordinate.y < minLat) {\n minLat = coordinate.y;\n }\n if (coordinate.x > maxLon) {\n maxLon = coordinate.x;\n }\n if (coordinate.y > maxLat) {\n maxLat = coordinate.y;\n }\n }\n return new Coordinate[]{\n new Coordinate(minLon, minLat),\n new Coordinate(maxLon, maxLat)\n };\n }","public void buildBridges() {\n\t\tList firstTier = getValidLinks(0);\r\n\t\t\r\n\t\tbuildNextBridge(firstTier, 0);\r\n\t}","Collection getIsBoundaryNodeOf();","private void setBoundaryColors() {\n determineBoundaryColors(entities[0].boundaries);\n determineBoundaryColors(entities[1].boundaries);\n }","public BoundsUserSpace() {\n super();\n }","public StructureVillagePieces.Village buildComponent(StructureVillagePieces.PieceWeight parPieceWeight, StructureVillagePieces.Start parStart, List parPiecesList, Random parRand, int parMinX, int parMinY, int parMinZ, EnumFacing parFacing, int parType) {\n/* 50 */ System.out.println(\"TekHouse6 buildComponent() at \" + parMinX + \", \" + parMinY + \", \" + parMinZ);\n/* */ \n/* 52 */ StructureBoundingBox structureboundingbox = StructureBoundingBox.getComponentToAddBoundingBox(parMinX, parMinY, parMinZ, 0, 0, 0, 9, 7, 12, parFacing);\n/* 53 */ return (canVillageGoDeeper(structureboundingbox) && StructureComponent.findIntersecting(parPiecesList, structureboundingbox) == null) ? (StructureVillagePieces.Village)new TekHouse6(parStart, parType, parRand, structureboundingbox, parFacing) : null;\n/* */ }","public void buildWorld() {\n buildBoundaryWall();\n buildDiscreteWorld();\n removeBoundaryWall();\n reorganizeNote();\n connectWorld();\n buildWall();\n }","void makeNborLists(){\n\t\t\tfor (int i = 0; i < N; i++){\n\t\t\t\tint ct = 0;\n\t\t\t\tint boundsCt = 0;\n\t\t\t\tfor (int j = 0; j < maxNbors; j++){\n\t\t\t\t\tint nborSite = nborList[i][j];\n\t\t\t\t\tif(nborSite>=1){\n\t\t\t\t\t\tif (aliveLattice[nborSite]){\n\t\t\t\t\t\t\tct += 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}else{\n\t\t\t\t\t\tboundsCt += 1;\n\t\t\t\t\t}\n\t\t\t\t\tint noDead = maxNbors - ct;\n\t\t\t\t\tfracDeadNbors[i] = (double)noDead/maxNbors;\n\t\t\t\t\tif(deadDissipation==true) noNborsForSite[i] = noNbors; \n\t\t\t\t\telse if (deadDissipation==false){\n\t\t\t\t\t\tif(boundaryConditions==\"Open\")\n\t\t\t\t\t\t\tnoNborsForSite[i]=ct+boundsCt;\n\t\t\t\t\t\telse if(boundaryConditions == \"Periodic\")\n\t\t\t\t\t\t\tnoNborsForSite[i]=ct;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(deadDissipation==true){\n\t\t\t\tfor (int i = 0; i < N; i++)\tnoNborsForSite[i] = noNbors; \n\t\t\t\tfor (int i = 0; i < N; i++){\n\t\t\t\t\tint ct = 0;\n\t\t\t\t\tfor (int j = 0; j < maxNbors; j++){\n\t\t\t\t\t\tif (aliveLattice[nborList[i][j]]){\n\t\t\t\t\t\t\tct += 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint noDead = maxNbors - ct;\n\t\t\t\t\t\tfracDeadNbors[i] = (double)noDead/maxNbors;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}else if (deadDissipation==false){\n\t\t\t\tfor (int i = 0; i < N; i++){\n\t\t\t\t\tint ct = 0;\n\t\t\t\t\tfor (int j = 0; j < maxNbors; j++){\n\t\t\t\t\t\tif (aliveLattice[nborList[i][j]]){\n\t\t\t\t\t\t\tct += 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tint noDead = maxNbors - ct;\n\t\t\t\t\t\tfracDeadNbors[i] = (double)noDead/maxNbors;\n\t\t\t\t\t\tnoNborsForSite[i]=ct;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t}","@Override\n public List getBounds() {\n return Collections.unmodifiableList(bounds);\n }","public void setNeighbors(){\t\t\t\t\n\t\tint row = position[0];\n\t\tint column = position[1];\t\t\n\t\tif(column+1 < RatMap.SIDELENGTH){\n\t\t\teastCell = RatMap.getMapCell(row,column+1);\t\t\t\n\t\t}else{\n\t\t\teastCell = null;\n\t\t}\t\n\t\tif(row+1 < RatMap.SIDELENGTH){\n\t\t\tnorthCell = RatMap.getMapCell(row+1,column);\n\t\t}else{\n\t\t\tnorthCell = null;\n\t\t}\t\n\t\tif(column-1 > -1){\n\t\t\twestCell = RatMap.getMapCell(row, column-1);\t\t\t\n\t\t}else{\n\t\t\twestCell = null;\n\t\t}\n\t\tif(row-1 > -1){\n\t\t\tsouthCell = RatMap.getMapCell(row-1, column);\n\t\t}else{\n\t\t\tsouthCell = null;\n\t\t}\n\t}","@Test\r\n\tpublic void censusBoundaryTest() throws FileNotFoundException\r\n\t{\r\n\t\tint [] p=new int[5];\r\n\t\tString fileName=\"BadgerTestC.txt\";\r\n\t\tWorld w=new World(fileName);\r\n\t\t\r\n\t\tw.grid[0][1].census(p);\r\n\t\tassertEquals(2,p[0]);\r\n\t\tassertEquals(0, p[1]);\r\n\t\tassertEquals(2,p[2]);\r\n\t\tassertEquals(0,p[3]);\r\n\t\tassertEquals(2,p[4]);\r\n\t}","public void createMinimap() {\n if (gameField.getFields().size() == 1024) {\n rootSize = 32;\n blockSize = 8;\n } else { //if size == 64^2 == 4096\n rootSize = 64;\n blockSize = 4;\n }\n int magnification = gameFieldController.getMagnification();\n if (AdvancedWarsApplication.getInstance().getGameScreenCon().base.getScene() != null) {\n positionBoxSizeX = blockSize *\n (AdvancedWarsApplication.getInstance().getGameScreenCon().base.getScene().getWidth() / (rootSize * magnification));\n\n positionBoxSizeY = blockSize *\n (AdvancedWarsApplication.getInstance().getGameScreenCon().base.getScene().getHeight() / (rootSize * magnification));\n } else {\n //for offline test\n positionBoxSizeX = (blockSize * 1920) / (rootSize * magnification);\n positionBoxSizeY = (blockSize * 1080) / (rootSize * magnification);\n }\n\n for (int i = 0; i < rootSize; ++i) {\n for (int j = 0; j < rootSize; ++j) {\n Field currentField = gameField.getFields().get(i * rootSize + j);\n Rectangle rectangle = new Rectangle(blockSize, blockSize);\n if (!currentField.getType().equals(\"Grass\")) {\n if (currentField.getType().equals(\"Water\")) {\n rectangle.setFill(Color.rgb(11, 89, 139));\n } else if (currentField.getType().equals(\"Forest\")) {\n rectangle.setFill(Color.rgb(38, 106, 0));\n } else { //if currentField equals Mountain\n rectangle.setFill(Color.rgb(95, 111, 54));\n }\n rectangle.relocate((i * blockSize) + 1, (j * blockSize) + 1);\n drawPane.getChildren().add(rectangle);\n }\n }\n }\n Rectangle rect = new Rectangle(positionBoxSizeX, positionBoxSizeY);\n Rectangle clip = new Rectangle(1, 1, positionBoxSizeX - 2, positionBoxSizeY - 2);\n positionBox = Shape.subtract(rect, clip);\n positionBox.setFill(Color.WHITE);\n drawPane.getChildren().add(positionBox);\n isCreated = true;\n }","private void setNeighbors()\r\n {\r\n for (int x = 0; x < length+2; ++x)\r\n {\r\n for (int y = 0; y < width+2; ++y)\r\n {\r\n // North\r\n if (!this.board[x][y].northwall)\r\n {\r\n this.board[x][y].neighbors.add(this.board[x][y-1]);\r\n }\r\n // South\r\n if (!this.board[x][y].southwall)\r\n {\r\n this.board[x][y].neighbors.add(this.board[x][y+1]);\r\n }\r\n // East\r\n if (!this.board[x][y].eastwall)\r\n {\r\n this.board[x][y].neighbors.add(this.board[x+1][y]);\r\n }\r\n // West\r\n if (!this.board[x][y].westwall)\r\n {\r\n this.board[x][y].neighbors.add(this.board[x-1][y]);\r\n }\r\n }\r\n }\r\n }","private void setParentBounds() {\n GraphRepresentation baseGraph = graphRepresentationFactory.getBaseGraph();\n\n Iterator iterator = tasks.iterator();\n while (iterator.hasNext()) {\n Task nextTask = iterator.next();\n List nextTaskParents = baseGraph.getParents(nextTask.getIdentifier());\n nextTask.setParentBound(nextTaskParents.size());\n }\n }","private boolean doPacking(List clusters)\r\n {\n RectanglePacker packer = new RectanglePacker((int)MAX_WIDTH, (int)MAX_HEIGHT, 0);\r\n\r\n for (Cluster cluster : clusters)\r\n {\r\n SWCRectangle bbox = cluster.getBoundingBox();\r\n RectanglePacker.Rectangle res = packer.insert((int)bbox.getWidth(), (int)bbox.getHeight(), cluster);\r\n\r\n //unable to pack rectangles\r\n if (res == null)\r\n return false;\r\n }\r\n\r\n //fill out wordPositions\r\n for (Cluster cluster : clusters)\r\n {\r\n SWCRectangle bbox = cluster.getBoundingBox();\r\n Rectangle rect = packer.findRectangle(cluster);\r\n\r\n for (Word w : cluster.wordPositions.keySet())\r\n {\r\n SWCRectangle r = cluster.wordPositions.get(w);\r\n wordPositions.put(w, new SWCRectangle(r.getX() + rect.x - bbox.getX(), r.getY() + rect.y - bbox.getY(), r.getWidth(), r.getHeight()));\r\n }\r\n }\r\n\r\n return true;\r\n }","public void calculateBounds(boolean force) {\n\t\tdouble left=java.lang.Double.MAX_VALUE, right=java.lang.Double.MIN_VALUE, \n\t\ttop=java.lang.Double.MAX_VALUE, bottom=java.lang.Double.MIN_VALUE;\n\t\t\n\t\tdouble theta;\n\t\tfor (int i=_segments-1; i>=0; i--) {\n\t\t\t/* Save calculation: if rotation hasn't changed and it is not forced,\n\t\t\t * don't calculate points again.\n\t\t\t */\n\t\t\tif (_lastTheta != _theta || force) {\n\t\t\t\ttheta=_theta+FastMath.atan2(_startPointY[i] ,_startPointX[i]);\n\t\t\t\tx1[i]=(int)(_m1[i]*FastMath.cos(theta));\n\t\t\t\ty1[i]=(int)(_m1[i]*FastMath.sin(theta));\n\t\t\t\ttheta=_theta+ FastMath.atan2(_endPointY[i], _endPointX[i]);\n\t\t\t\tx2[i]=(int)(_m2[i]*FastMath.cos(theta));\n\t\t\t\ty2[i]=(int)(_m2[i]*FastMath.sin(theta));\n\t\t\t}\n\t\t\t// Finds the rectangle that comprises the organism\n\t\t\tleft = Utils.min(left, x1[i]+ _dCenterX, x2[i]+ _dCenterX);\n\t\t\tright = Utils.max(right, x1[i]+ _dCenterX, x2[i]+ _dCenterX);\n\t\t\ttop = Utils.min(top, y1[i]+ _dCenterY, y2[i]+ _dCenterY);\n\t\t\tbottom = Utils.max(bottom, y1[i]+ _dCenterY, y2[i]+ _dCenterY);\n\t\t}\n\t\tsetBounds((int)left, (int)top, (int)(right-left+1)+1, (int)(bottom-top+1)+1);\n\t\t_lastTheta = _theta;\n\t}","public Gridder()\n\t{\n grid = new Cell[MapConstant.MAP_X][MapConstant.MAP_Y];\n for (int row = 0; row < grid.length; row++) {\n for (int col = 0; col < grid[0].length; col++) {\n grid[row][col] = new Cell(row, col);\n\n // Set the virtual walls of the arena\n if (row == 0 || col == 0 || row == MapConstant.MAP_X - 1 || col == MapConstant.MAP_Y - 1) {\n grid[row][col].setVirtualWall(true);\n }\n }\n }\n\t}","private BioMightBoundBox setupDefaultBoundBox(String parentID) \r\n\t{\r\n\t\t// Initialize the position of the bounding box vars\r\n\t\tBigDecimal xPos = new BigDecimal(0.0);\r\n\t\tBigDecimal yPos = new BigDecimal(0.0);\r\n\t\tBigDecimal zPos= new BigDecimal(0.0);\r\n\t\t\r\n\t\t// Set to base 1x1x1 cube\r\n\t\tBigDecimal xVector= new BigDecimal(1.0);\r\n\t\tBigDecimal yVector= new BigDecimal(1.0); \r\n\t\tBigDecimal zVector= new BigDecimal(1.0);\r\n\t\r\n\t\t// Initialize the BoundBox\r\n\t\tBioMightBoundBox bioBoundBox = null;\r\n\t\r\n\t\t// Initialize the Connectors \r\n\t\tBioMightConnectors bioMightConnectors = null; \r\n\r\n\t\t// Initialize the Connector \r\n\t\tBioMightConnector bioMightConnector= null;\r\n\t\r\n\t\tdouble circumference = 0.0;\r\n\t\tdouble[] startPos = {0.0, 0.0, 0.0};\r\n\t\tdouble[][] startPoints = BioGraphics.octogonYPlane(startPos, circumference);\r\n\t\t\r\n\t\t\r\n\t\t//**********************************************************************\r\n\t\t// ARMS BOUND BOX\t\t\r\n\t\t//\r\n\t\t// Set up the Bounding Box for the Arms\r\n\t\t// For default model, length of arms is 4.5\r\n\t\t//**********************************************************************\r\n\t\txPos = new BigDecimal(0.0);\r\n\t\tyPos = new BigDecimal(-15.0);\r\n\t\tzPos= new BigDecimal(-5.0);\r\n\t\r\n\t\txVector= new BigDecimal(11.5);\r\n\t\tyVector= new BigDecimal(6.0); \r\n\t\tzVector= new BigDecimal(5.0);\r\n\t\t\r\n\t\t// Setup the boundbox\r\n\t\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\r\n\t\t// Set up its connectors\r\n\t\tbioMightConnectors = new BioMightConnectors();\r\n\t\t\r\n\t\t//********************************************\r\n\t\t// ARM - ORGAN CONNECTORS\r\n\t\t//********************************************\r\n\t\r\n\t\t// EpitheliumTissue Connector\r\n\t\tcircumference = 0.3;\r\n\t\tstartPos = getStartPoints(0.0, -5.0, -1.0);\r\n\t\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\r\n\t\tbioMightConnector = new BioMightConnector(startPoints, Constants.ArmEpitheliumRef,\"connType\");\r\n\t\tbioMightConnectors.setBioMightConnector(Constants.ArmEpitheliumRef, bioMightConnector);\r\n\t\r\n\t\t//********************************************\t\r\n\t\t// ARMS - VASCULAR CONNECTORS \r\n\t\t//********************************************\r\n\t\r\n\t\t// InternalCarotidArteryEpithelium\r\n\t\tcircumference = 0.3;\r\n\t\tstartPos = getStartPoints(0.0, -5.0, -1.0);\r\n\t\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\r\n\t\tbioMightConnector = new BioMightConnector(startPoints, \"InternalCarotidArteryEpithelium\",\"connType\");\r\n\t\tbioMightConnectors.setBioMightConnector(\"InternalCarotidArteryEpithelium\", bioMightConnector);\r\n\t\r\n\t\t// ExternalCarotidArteryEpithelium \r\n\t\tcircumference = 0.3;\r\n\t\tstartPos = getStartPoints(0.0, -5.0, -1.0);\r\n\t\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\r\n\t\tbioMightConnector = new BioMightConnector(startPoints, \"ExternalCarotidArteryEpithelium\",\"connType\");\r\n\t\tbioMightConnectors.setBioMightConnector(\"ExternalCarotidArteryEpithelium\", bioMightConnector);\r\n\t\r\n\t\t//********************************************\r\n\t\t// ARMS - MUSCULAR CONNECTORS\r\n\t\t//********************************************\r\n\r\n\t\r\n\t\t//********************************************\r\n\t\t// ARMS - SKELETAL CONNECTORS\r\n\t\t//********************************************\r\n\r\n\t\t// ThoracicVertebrae T6 \r\n\t\tcircumference = 0.3;\r\n\t\tstartPos = getStartPoints(0.0, -5.0, -1.0);\r\n\t\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\r\n\t\tbioMightConnector = new BioMightConnector(startPoints, \"CervicalVertebrae\",\"connType\");\r\n\t\tbioMightConnectors.setBioMightConnector(\"CervicalVertebrae\", bioMightConnector);\r\n\t\t\r\n\t\t\r\n\t\t// Stuff the Connectors into the Bounding Box \r\n\t\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\r\n\t\t\r\n\t\treturn (bioBoundBox);\t\r\n\t}","public void initializeNeighbors() {\n\t\tfor (int r = 0; r < getRows(); r++) {\n\t\t\tfor (int c = 0; c < getCols(); c++) {\n\t\t\t\tList nbs = new ArrayList<>();\n\t\t\t\tinitializeNF(shapeType, r, c);\n\t\t\t\tmyNF.findNeighbors();\n\t\t\t\tfor (int[] arr : myNF.getNeighborLocations()){\n\t\t\t\t\tif (contains(arr[0], arr[1])){\n\t\t\t\t\t\tnbs.add(get(arr[0], arr[1]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tget(r, c).setNeighbors(nbs);\n\t\t\t}\n\t\t}\n\t}","public void initClusters(){\n\t\tUnitRow unitRow = data.getUnitRow();\n\t\tUnit currentUnit = null;\n\t\tLeaf leaf = null;\n\n\t\tfor (int i = 0; i < unitRow.getLength(); i++){\n\t\t\tcurrentUnit = unitRow.getUnit(i);\n\t\t\tleaf = new Leaf(currentUnit);\n\t\t\tclusters.add(leaf);\n\t\t}\n\t\tSystem.out.println(\"Clusters initialized.\");\n\t}","private void calcBoxVerts() {\n\t\tif (verts != null) {\n\t\t\tdouble minX = verts[0].getElement(0);\n\t\t\tdouble maxX = minX;\n\t\t\tdouble minY = verts[0].getElement(1);\n\t\t\tdouble maxY = minY;\n\t\t\tdouble minZ = verts[0].getElement(2);\n\t\t\tdouble maxZ = minZ;\n\t\t\tfor (int i = 1; i < verts.length; i++) {\n\t\t\t\tif (verts[i].getElement(0) < minX) {\n\t\t\t\t\tminX = verts[i].getElement(0);\n\t\t\t\t} else if (verts[i].getElement(0) > maxX) {\n\t\t\t\t\tmaxX = verts[i].getElement(0);\n\t\t\t\t}\n\t\t\t\tif (verts[i].getElement(1) < minY) {\n\t\t\t\t\tminY = verts[i].getElement(1);\n\t\t\t\t} else if (verts[i].getElement(1) > maxY) {\n\t\t\t\t\tmaxY = verts[i].getElement(1);\n\t\t\t\t}\n\t\t\t\tif (verts[i].getElement(2) < minZ) {\n\t\t\t\t\tminZ = verts[i].getElement(2);\n\t\t\t\t} else if (verts[i].getElement(2) > maxZ) {\n\t\t\t\t\tmaxZ = verts[i].getElement(2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tVector[] boxVerts = new Vector[8];\n\t\t\tboxVerts[0] = new Vector(3);\n\t\t\tboxVerts[0].setElements(new double[] {minX, minY, minZ});\n\t\t\tboxVerts[1] = new Vector(3);\n\t\t\tboxVerts[1].setElements(new double[] {maxX, minY, minZ});\n\t\t\tboxVerts[2] = new Vector(3);\n\t\t\tboxVerts[2].setElements(new double[] {minX, minY, maxZ});\n\t\t\tboxVerts[3] = new Vector(3);\n\t\t\tboxVerts[3].setElements(new double[] {maxX, minY, maxZ});\n\t\t\tboxVerts[4] = new Vector(3);\n\t\t\tboxVerts[4].setElements(new double[] {minX, maxY, minZ});\n\t\t\tboxVerts[5] = new Vector(3);\n\t\t\tboxVerts[5].setElements(new double[] {maxX, maxY, minZ});\n\t\t\tboxVerts[6] = new Vector(3);\n\t\t\tboxVerts[6].setElements(new double[] {minX, maxY, maxZ});\n\t\t\tboxVerts[7] = new Vector(3);\n\t\t\tboxVerts[7].setElements(new double[] {maxX, maxY, maxZ});\n\t\t\tthis.boxVerts = boxVerts;\n\t\t} else {\n\t\t\tthis.boxVerts = null;\n\t\t}\n\t}","private void updateBoundingBox()\n\t{\n\t\tif (this.facingDirection != null)\n\t\t{\n\t\t\tdouble d0 = (double) this.hangingPosition.getX() + 0.5D;\n\t\t\tdouble d1 = (double) this.hangingPosition.getY() + 0.5D;\n\t\t\tdouble d2 = (double) this.hangingPosition.getZ() + 0.5D;\n\t\t\tdouble d3 = 0.46875D;\n\t\t\tdouble d4 = this.someFunc(this.getWidthPixels());\n\t\t\tdouble d5 = this.someFunc(this.getHeightPixels());\n\t\t\td0 = d0 - (double) this.facingDirection.getFrontOffsetX() * 0.46875D;\n\t\t\td2 = d2 - (double) this.facingDirection.getFrontOffsetZ() * 0.46875D;\n\t\t\td1 = d1 + d5;\n\t\t\tEnumFacing enumfacing = this.facingDirection.rotateYCCW();\n\t\t\td0 = d0 + d4 * (double) enumfacing.getFrontOffsetX();\n\t\t\td2 = d2 + d4 * (double) enumfacing.getFrontOffsetZ();\n\t\t\tthis.posX = d0;\n\t\t\tthis.posY = d1;\n\t\t\tthis.posZ = d2;\n\t\t\tdouble d6 = (double) this.getWidthPixels();\n\t\t\tdouble d7 = (double) this.getHeightPixels();\n\t\t\tdouble d8 = (double) this.getWidthPixels();\n\n\t\t\tif (this.facingDirection.getAxis() == EnumFacing.Axis.Z)\n\t\t\t{\n\t\t\t\td8 = 1.0D;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\td6 = 1.0D;\n\t\t\t}\n\n\t\t\t// ???\n\n\t\t\td6 = d6 / (this.getWidthPixels() / this.blocksToTakeUp() * 2D);\n\t\t\td7 = d7 / (this.getHeightPixels() / this.blocksToTakeUp() * 2D);\n\t\t\td8 = d8 / (this.getWidthPixels() / this.blocksToTakeUp() * 2D);\n\t\t\tthis.setEntityBoundingBox(new AxisAlignedBB(d0 - d6, d1 - d7, d2 - d8, d0 + d6, d1 + d7, d2 + d8));\n\t\t}\n\t}","@Test\n public void testBoundsAsCompositesWithSingleEqAndMultiINRestrictions()\n {\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC, Sort.ASC, Sort.ASC);\n\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\n ByteBuffer value4 = ByteBufferUtil.bytes(4);\n ByteBuffer value5 = ByteBufferUtil.bytes(5);\n\n // clustering_0 = 1 AND (clustering_1, clustering_2) IN ((2, 3), (4, 5))\n Restriction singleEq = newSingleEq(cfMetaData, 0, value1);\n Restriction multiIN = newMultiIN(cfMetaData, 1, asList(value2, value3), asList(value4, value5));\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiIN);\n\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(2, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.START);\n assertComposite(bounds.get(1), value1, value4, value5, EOC.START);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(2, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\n assertComposite(bounds.get(1), value1, value4, value5, EOC.END);\n\n // clustering_0 = 1 AND (clustering_1, clustering_2) IN ((2, 3))\n singleEq = newSingleEq(cfMetaData, 0, value1);\n multiIN = newMultiIN(cfMetaData, 1, asList(value2, value3));\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(multiIN).mergeWith(singleEq);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.START);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(1, bounds.size());\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\n\n // clustering_0 = 1 AND clustering_1 = 5 AND (clustering_2, clustering_3) IN ((2, 3), (4, 5))\n singleEq = newSingleEq(cfMetaData, 0, value1);\n Restriction singleEq2 = newSingleEq(cfMetaData, 1, value5);\n multiIN = newMultiIN(cfMetaData, 2, asList(value2, value3), asList(value4, value5));\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiIN).mergeWith(singleEq2);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\n assertEquals(2, bounds.size());\n assertComposite(bounds.get(0), value1, value5, value2, value3, EOC.START);\n assertComposite(bounds.get(1), value1, value5, value4, value5, EOC.START);\n\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\n assertEquals(2, bounds.size());\n assertComposite(bounds.get(0), value1, value5, value2, value3, EOC.END);\n assertComposite(bounds.get(1), value1, value5, value4, value5, EOC.END);\n }","public float[] getBounds() {\r\n\t\tfloat[] bounds = {x_ - width_/ 2, x_ + width_ / 2, y_ - height_ / 2, y_ + height_ / 2};\r\n\t\treturn bounds;\r\n\t}","public Bounds bounds(String ipAddrsFile, String subnetsFile) throws IOException {\n\t\tfinal Map nodes = parseAddresses(ipAddrsFile);\n\t\tfinal Map subnets = parseSubnets(subnetsFile, nodes);\n\n\t\tfinal Universe universe = universe(nodes.keySet());\n\t\tfinal Bounds bounds = new Bounds(universe);\n\t\tfinal TupleFactory factory = universe.factory();\n\n\t\t// bind the integers\n\t\tfor (int i = 0; i < 32; i++) {\n\t\t\tbounds.boundExactly(1 << i, factory.setOf(Integer.valueOf(1 << i)));\n\t\t}\n\n\t\t// bind the port relation exactly to the port names\n\t\tbounds.boundExactly(port, factory.range(factory.tuple(universe.atom(0)),\n\t\t\t\tfactory.tuple(universe.atom(nodes.keySet().size() - 1))));\n\n\t\t// bind the unknown relation exactly to the port names of ports with\n\t\t// unknown addresses or masks\n\t\tfinal TupleSet unknownBound = factory.noneOf(1);\n\t\tfor (NetNode n : nodes.values()) {\n\t\t\tif (!n.known()) {\n\t\t\t\tunknownBound.add(factory.tuple(n.port));\n\t\t\t}\n\t\t}\n\t\tbounds.boundExactly(unknown, unknownBound);\n\n\t\t// bind the subnet relation exactly, choosing the first element of each\n\t\t// subnet as the representative\n\t\tfinal TupleSet subnetBound = factory.noneOf(2);\n\t\tfor (Map.Entry entry : subnets.entrySet()) {\n\t\t\tfinal NetNode rep = entry.getKey();\n\t\t\tfor (NetNode member : entry.getValue().members) {\n\t\t\t\tsubnetBound.add(factory.tuple(rep.port, member.port));\n\t\t\t}\n\t\t}\n\t\tbounds.boundExactly(subnet, subnetBound);\n\n\t\t// bind the addr relation so that each address is guaranteed to be\n\t\t// between minAddr (121.96.0.0) and maxAddr (121.96.255.255), inclusive\n\t\tfinal TupleSet lAddr = factory.noneOf(2), uAddr = factory.noneOf(2);\n\t\tfor (NetNode node : nodes.values()) {\n\t\t\tif (node.varAddress) { // unknown address\n\t\t\t\tlAddr.addAll(portToBits(factory, node.port, minAddr));\n\t\t\t\tuAddr.addAll(portToBits(factory, node.port, maxAddr));\n\t\t\t} else { // known address\n\t\t\t\tfinal TupleSet portToAddrBits = portToBits(factory, node.port, node.address);\n\t\t\t\tlAddr.addAll(portToAddrBits);\n\t\t\t\tuAddr.addAll(portToAddrBits);\n\t\t\t}\n\t\t}\n\t\tbounds.bound(addr, lAddr, uAddr);\n\n\t\t// bind the group and groupMask relations so that all ports with the\n\t\t// same interface on the same subnet are guaranteed to have the same\n\t\t// mask\n\t\tfinal TupleSet lMask = factory.noneOf(2), uMask = factory.noneOf(2), groupBound = factory.noneOf(2);\n\t\tfor (Subnet sub : subnets.values()) {\n\t\t\tfor (Map.Entry> entry : sub.groups.entrySet()) {\n\t\t\t\tfinal NetNode rep = entry.getKey();\n\t\t\t\tfor (NetNode member : entry.getValue()) {\n\t\t\t\t\tgroupBound.add(factory.tuple(member.port, rep.port));\n\t\t\t\t\tnodes.remove(member.port); // remove a grouped member out of\n\t\t\t\t\t\t\t\t\t\t\t\t// the addresses set\n\t\t\t\t}\n\t\t\t\tif (rep.varMask) { // unknown mask for the representative\n\t\t\t\t\tuMask.addAll(portToBits(factory, rep.port, 31));\n\t\t\t\t} else { // known mask for the representative\n\t\t\t\t\tfinal TupleSet portToMaskBits = portToBits(factory, rep.port, rep.mask);\n\t\t\t\t\tlMask.addAll(portToMaskBits);\n\t\t\t\t\tuMask.addAll(portToMaskBits);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// bind the group and groupMask relations for ports that are not a part\n\t\t// of any subnet\n\t\tfor (NetNode ungrouped : nodes.values()) {\n\t\t\tgroupBound.add(factory.tuple(ungrouped.port, ungrouped.port));\n\t\t\tif (ungrouped.varMask) { // unknown mask for the representative\n\t\t\t\tuMask.addAll(portToBits(factory, ungrouped.port, 31));\n\t\t\t} else { // known mask for the representative\n\t\t\t\tfinal TupleSet portToMaskBits = portToBits(factory, ungrouped.port, ungrouped.mask);\n\t\t\t\tlMask.addAll(portToMaskBits);\n\t\t\t\tuMask.addAll(portToMaskBits);\n\t\t\t}\n\t\t}\n\n\t\tbounds.bound(groupMask, lMask, uMask);\n\t\tbounds.boundExactly(group, groupBound);\n\n\t\t// System.out.println(\"groupMask.size: \" + uMask.size() + \", group.size:\n\t\t// \" + groupBound.size());\n\t\t// System.out.println(\"ports.size: \" + bounds.upperBound(port).size() +\n\t\t// \", unknown.size: \" + unknownBound.size());\n\t\treturn bounds;\n\n\t}","public double[] setMapBounds(double ulLon, double ulLat, double lrLon, double lrLat)\n/* 154: */ {\n/* 117:182 */ int x_min = 2147483647;\n/* 118:183 */ int y_min = 2147483647;\n/* 119:184 */ int x_max = -2147483648;\n/* 120:185 */ int y_max = -2147483648;\n/* 121:186 */ int mapZoomMax = 20;\n/* 122: */\n/* 123:188 */ x_max = Math.max(x_max, MercatorProj.LonToX(lrLon, mapZoomMax));\n/* 124:189 */ x_max = Math.max(x_max, MercatorProj.LonToX(ulLon, mapZoomMax));\n/* 125:190 */ y_max = Math.max(y_max, MercatorProj.LatToY(ulLat, mapZoomMax));\n/* 126:191 */ y_max = Math.max(y_max, MercatorProj.LatToY(lrLat, mapZoomMax));\n/* 127:192 */ x_min = Math.min(x_min, MercatorProj.LonToX(ulLon, mapZoomMax));\n/* 128:193 */ x_min = Math.min(x_min, MercatorProj.LonToX(lrLon, mapZoomMax));\n/* 129:194 */ y_min = Math.min(y_min, MercatorProj.LatToY(ulLat, mapZoomMax));\n/* 130:195 */ y_min = Math.min(y_min, MercatorProj.LatToY(lrLat, mapZoomMax));\n /* x_max= (int)(Math.max(ulLon,lrLon)*1000000);\n x_min= (int)(Math.min(ulLon,lrLon)*1000000);\n y_max= (int)(Math.max(ulLat,lrLat)*1000000);\n y_min= (int)(Math.min(ulLat,lrLat)*1000000);*/\n/* 134:199 */ int height = Math.max(0, this.mapPanel.getHeight());\n/* 135:200 */ int width = Math.max(0, this.mapPanel.getWidth());\n/* 136:201 */ int newZoom = mapZoomMax;\n/* 137:202 */ int x = x_max - x_min;\n/* 138:203 */ int y = y_max - y_min;\n/* 139:204 */ while ((x > width) || (y > height))\n/* 140: */ {\n/* 141:205 */ newZoom--;\n/* 142:206 */ x >>= 1;\n/* 143:207 */ y >>= 1;\n/* 144: */ }\n/* 145:209 */ x = x_min + (x_max - x_min)/2;\n/* 146:210 */ y = y_min + (y_max - y_min)/2;\n/* 147:211 */ int z = 1 << mapZoomMax - newZoom;\n/* 148:212 */ x /= z;\n/* 149:213 */ y /= z;\n /* int Cx=256;\n int Cy=256;\n //Cx>>=(newZoom);\n //Cy>>=(newZoom);\n double x1=((x*(width/2))/Cx);\n double y1=((y*(height/2))/Cy);\n x=(int) x1;\n y=(int) y1;\n x >>=(newZoom-this.mapPanel.zoom);\n y >>=(newZoom-this.mapPanel.zoom);\n //x = x+156;\n //y = y-137;*/\n x=x/10000;\n y=y/10000;\n /* 150:214 */ this.mapPanel.setZoom(new Point((int)x, (int)y), newZoom);\n double[] res = { this.mapPanel.zoom, this.mapPanel.centerX, this.mapPanel.centerY,x,y, newZoom, z };\n traceln(Arrays.toString(res));\n traceln( x_max+\",\"+x_min+\",\"+y_max+\",\"+y_min+\",x:\"+x+\",y:\"+y+\",z:\"+z+\",nZomm:\"+newZoom);\n // this.mapPanel.getBounds().getX()setBounds( (int)ulLon,(int)ulLat, (int)width,(int)height);\n return res;\n\n/* 167: */ }","public void testGetBoundingBox(){\r\n\t\tdouble xc = 0;\r\n\t\tdouble yc = 0;\r\n\t\tdouble r = 10;\r\n\t\tdouble r2 = r*Math.sqrt(2)/2;\r\n\t\tdouble t0 = PI/4;\r\n\t\tdouble t1 = 3*PI/4;\r\n\t\tdouble t2 = 5*PI/4;\r\n\t\tdouble t3 = 7*PI/4;\r\n\t\tdouble dt = PI/2;\r\n\t\t\r\n\t\t// declare variables\r\n\t\tCircleArc2D arc0, arc1, arc2, arc3;\r\n\t\tBox2D box0, box1, box2, box3;\r\n\t\tBox2D bounds0, bounds1, bounds2, bounds3;\r\n\t\t\r\n\t\t// top\r\n\t\tarc0 \t= new CircleArc2D(xc, yc, r, t0, dt);\r\n\t\tbox0 \t= new Box2D(xc-r2, xc+r2, r2, r);\r\n\t\tbounds0 = arc0.boundingBox();\r\n\t\tassertTrue(box0.almostEquals(bounds0, Shape2D.ACCURACY));\r\n\r\n\t\t// left\r\n\t\tarc1 \t= new CircleArc2D(xc, yc, r, t1, dt);\r\n\t\tbox1 \t= new Box2D(xc-r, xc-r2, -r2, r2);\r\n\t\tbounds1 = arc1.boundingBox();\r\n\t\tassertTrue(box1.almostEquals(bounds1, Shape2D.ACCURACY));\r\n\r\n\t\t// bottom\r\n\t\tarc2 \t= new CircleArc2D(xc, yc, r, t2, dt);\r\n\t\tbox2 \t= new Box2D(xc-r2, xc+r2, -r, -r2);\r\n\t\tbounds2 = arc2.boundingBox();\r\n\t\tassertTrue(box2.almostEquals(bounds2, Shape2D.ACCURACY));\r\n\r\n\t\t// right\r\n\t\tarc3 \t= new CircleArc2D(xc, yc, r, t3, dt);\r\n\t\tbox3 \t= new Box2D(r2, r, -r2, r2);\r\n\t\tbounds3 = arc3.boundingBox();\r\n\t\tassertTrue(box3.almostEquals(bounds3, Shape2D.ACCURACY));\r\n\r\n\t\t/// circle arcs with extent 3*pi/2\r\n\t\tdt = 3*PI/2;\r\n\t\t\r\n\t\t// top\r\n\t\tarc0 \t= new CircleArc2D(xc, yc, r, t3, dt);\r\n\t\tbox0 \t= new Box2D(xc-r, xc+r, -r2, r);\r\n\t\tbounds0 = arc0.boundingBox();\r\n\t\tassertTrue(box0.almostEquals(bounds0, Shape2D.ACCURACY));\r\n\r\n\t\t// left\r\n\t\tarc1 \t= new CircleArc2D(xc, yc, r, t0, dt);\r\n\t\tbox1 \t= new Box2D(xc-r, xc+r2, -r, r);\r\n\t\tbounds1 = arc1.boundingBox();\r\n\t\tassertTrue(box1.almostEquals(bounds1, Shape2D.ACCURACY));\r\n\r\n\t\t// bottom\r\n\t\tarc2 \t= new CircleArc2D(xc, yc, r, t1, dt);\r\n\t\tbox2 \t= new Box2D(xc-r, xc+r, -r, r2);\r\n\t\tbounds2 = arc2.boundingBox();\r\n\t\tassertTrue(box2.almostEquals(bounds2, Shape2D.ACCURACY));\r\n\r\n\t\t// right\r\n\t\tarc3 \t= new CircleArc2D(xc, yc, r, t2, dt);\r\n\t\tbox3 \t= new Box2D(-r2, r, -r, r);\r\n\t\tbounds3 = arc3.boundingBox();\r\n\t\tassertTrue(box3.almostEquals(bounds3, Shape2D.ACCURACY));\r\n\t\r\n\t}","private void generateMap(){\n int[] blockStepX = {X_STEP, 0, -X_STEP, -X_STEP, 0, X_STEP};\n int[] blockStepY = {Y_STEP_ONE, Y_STEP_TWO, Y_STEP_ONE, -Y_STEP_ONE, -Y_STEP_TWO, -Y_STEP_ONE};\n int blockSpecialValue = 0;\n int cellSpecial = 0;\n\n mapCells[origin.x/10][origin.y/10] = new EschatonCell(new CellPosition(0, 0, 0),\n new Point(origin.x, origin.y), blockSpecialValue);\n\n cellGrid[0][0][0] = new EschatonCell(new CellPosition(0, 0, 0),\n new Point(origin.x, origin.y), blockSpecialValue);\n\n for (int distanceFromOrigin = 0; distanceFromOrigin < config.getSizeOfMap();\n distanceFromOrigin++){\n\n int[] blockXVals = {origin.x,\n origin.x + X_STEP * distanceFromOrigin,\n origin.x + X_STEP * distanceFromOrigin,\n origin.x,\n origin.x - X_STEP * distanceFromOrigin,\n origin.x - X_STEP * distanceFromOrigin};\n\n int[] blockYVals = {origin.y - Y_STEP_TWO * distanceFromOrigin,\n origin.y - Y_STEP_ONE * distanceFromOrigin,\n origin.y + Y_STEP_ONE * distanceFromOrigin,\n origin.y + Y_STEP_TWO * distanceFromOrigin,\n origin.y + Y_STEP_ONE * distanceFromOrigin,\n origin.y - Y_STEP_ONE * distanceFromOrigin};\n\n blockSpecialValue = getRandomNumber(distanceFromOrigin, 0, 0);\n\n for (int block = 0; block < NUMBER_OF_BLOCKS; block ++){\n\n int blockXOrdinal = blockXVals[block];\n int blockYOrdinal = blockYVals[block];\n\n for (int blockSize = 0; blockSize < distanceFromOrigin; blockSize++){\n if(blockSpecialValue == blockSize){\n cellSpecial = getRandomNumber(2, 1, 1);\n }else {\n cellSpecial = 0;\n }\n cellGrid [distanceFromOrigin][block+1][blockSize+1] = makeNewCell(\n new CellPosition(distanceFromOrigin,block+1, blockSize+1),\n new Point(blockXOrdinal + blockStepX[block] * (blockSize + 1),\n blockYOrdinal + blockStepY[block] * (blockSize + 1)), cellSpecial);\n }\n }\n }\n }","public void createClusters() {\n\t\t/*\n\t\t * double simAvg = documentDao.getSimilarity(avg); double simMax =\n\t\t * documentDao.getSimilarity(max); double simMin =\n\t\t * documentDao.getSimilarity(min);\n\t\t */\n\n\t\t// initClusters();\n\n\t\tList docList = documentDao.getDocumentListOrderBySimilarity();\n\t\tList clusterList = clusterDao.getClusterList();\n\n\t\tint i = 0;\n\t\tCluster cluster = clusterList.get(i);\n\t\tfor (Document document : docList) {\n\t\t\twhile (document.getSimilarity() < cluster.getLow()) {\n\t\t\t\tcluster = clusterList.get(++i);\n\t\t\t}\n\t\t\tif (document.getSimilarity() < cluster.getHigh() && document.getSimilarity() >= cluster.getLow()) {\n\t\t\t\tdocument.setClusterId(cluster.getId());\n\t\t\t\tdocumentDao.insertDocument(document);\n\t\t\t}\n\t\t}\n\n\t}","private void getNeighbouringCells(Index3D current, Index3D center, int clusterLabel) {\n\n int integerIndexForm = current.i1() + current.i2() * x + current.i3() * x * y;\n\n /**Check if the voxel is part of the cluster */\n if ((getLabel(current) == clusterLabel) &&\n !cellCluster.contains(integerIndexForm)) {\n\n if (!current.equals(center)) {\n voxelStack.push(current);\n }\n\n /**Spread recursively from the voxel if it exists within the\n * boundary of the center voxel */\n if (checkSubBoundary(current, center)) {\n cellCluster.add(integerIndexForm);\n\n /**Check for all 26-neighbour voxels reachable from the\n * current voxel */\n for (int i = current.i1() - 1; i < x\n && i >= 0 && i <= current.i1() + 1; i++) {\n for (int j = current.i2() - 1; j < y\n && j >= 0 && j <= current.i2() + 1; j++) {\n for (int k = current.i3() - 1; k < z\n && k >= 0 && k <= current.i3() + 1; k++) {\n getNeighbouringCells(new Index3D(i, j, k), center, clusterLabel);\n }\n }\n }\n }\n }\n }","private void initExplorationBounds() {\n switch (configuration.getCoverageCriteria()) {\n case GOAL_COVERAGE:\n case BRANCH_COVERAGE:\n configuration.setObjectScope(configuration.isIncrementalLoopUnroll() ?\n FajitaConfiguration.INITIAL_INCREMENTAL_OBJECT_SCOPE :\n configuration.getMaximumObjectScope()\n );\n configuration.setLoopUnroll(configuration.isIncrementalLoopUnroll() ?\n FajitaConfiguration.INITIAL_INCREMENAL_LOOP_UNROLL :\n configuration.getMaximumLoopUnroll()\n );\n break;\n case CLASS_COVERAGE:\n case DUAL_CLASS_BRANCH_COVERAGE:\n configuration.setObjectScope(configuration.getMaximumObjectScope());\n configuration.setLoopUnroll(configuration.getMaximumLoopUnroll());\n break;\n }\n }","public Cluster(Point minPoint, Point maxPoint) {\n\t\tthis.minPoint = minPoint;\n\t\tthis.maxPoint = maxPoint;\n\t}","@NonNull JavaBoundingBox[] collision();","private void setBounds(RectProto.Builder builderForValue) {\n this.bounds_ = (RectProto) builderForValue.build();\n this.bitField0_ |= 8;\n }","@Override\n\tprotected void buildCircuit() {\n\t\tthis.circuit.add(new Point2f(97, -98));\n\t\tthis.circuit.add(new Point2f(-3, -98));\n\t\tthis.circuit.add(new Point2f(-3, -2));\n\t\t\n\t\t// U-turn (step 2)\n\t\tthis.circuit.add(new Point2f(-111, -2));\n\t\tthis.circuit.add(new Point2f(-111, 2));\n\t\t\n\t\t// Semi-Loop, bottom-left block (step 3)\n\t\tthis.circuit.add(new Point2f(-3, 2));\n\t\tthis.circuit.add(new Point2f(-3, 106));\n\t\tthis.circuit.add(new Point2f(97, 106));\n\t}","public void ComputeBounds( Vec3 min, Vec3 max )\r\n\t{\r\n\t\tfor ( int iTempCount = 1; iTempCount <= 3; iTempCount++ )\r\n\t\t{\r\n\t\t\tVec3 tempPoint = m_vertices[iTempCount];\r\n\t\t\t\r\n\t\t\tif ( tempPoint.xCoord < min.xCoord )\r\n\t\t\t{\r\n\t\t\t\tmin.xCoord = tempPoint.xCoord;\r\n\t\t\t}\r\n\t\t\telse if ( tempPoint.xCoord > max.xCoord )\r\n\t\t\t{\r\n\t\t\t\tmax.xCoord = tempPoint.xCoord;\r\n\t\t\t}\t\t\t\r\n\t\t\t\r\n\t\t\tif ( tempPoint.yCoord < min.yCoord )\r\n\t\t\t{\r\n\t\t\t\tmin.yCoord = tempPoint.yCoord;\r\n\t\t\t}\r\n\t\t\telse if ( tempPoint.yCoord > max.yCoord )\r\n\t\t\t{\r\n\t\t\t\tmax.yCoord = tempPoint.yCoord;\r\n\t\t\t}\t\t\t\r\n\t\t\t\r\n\t\t\tif ( tempPoint.zCoord < min.zCoord )\r\n\t\t\t{\r\n\t\t\t\tmin.zCoord = tempPoint.zCoord;\r\n\t\t\t}\r\n\t\t\telse if ( tempPoint.zCoord > max.zCoord )\r\n\t\t\t{\r\n\t\t\t\tmax.zCoord = tempPoint.zCoord;\r\n\t\t\t}\t\t\t\r\n\t\t}\t\t\r\n\t}"],"string":"[\n \"public void buildInitialBand()\\r\\n\\t{\\n\\t\\r\\n\\tint bl = boundary.size();\\r\\n\\tfor(int i=0; i maxBound.x)\\n \\t\\tmaxBound.x = v[i].x;\\n \\tif (v[i].y < minBound.y)\\n \\t\\tminBound.y = v[i].y;\\n \\tif (v[i].y > maxBound.y)\\n \\t\\tmaxBound.y = v[i].y;\\n \\tif (v[i].z < minBound.z)\\n \\t\\tminBound.z = v[i].z;\\n \\tif (v[i].z > maxBound.z)\\n \\t\\tmaxBound.z = v[i].z;\\n }\\n \\n }\",\n \"public void calculateBoundsAABB() {\\n\\t\\tsuper.minY = 0;\\n\\t\\tradius = 0;\\n\\t\\tmaxY = 0;\\n\\t\\tminX = 999999;\\n\\t\\tmaxX = -999999;\\n\\t\\tmaxZ = -99999;\\n\\t\\tminZ = 99999;\\n\\t\\tfor (int j = 0; j < vertexCount; j++) {\\n\\t\\t\\tint x = vertexX[j];\\n\\t\\t\\tint y = vertexY[j];\\n\\t\\t\\tint z = vertexZ[j];\\n\\t\\t\\tif (x < minX) {\\n\\t\\t\\t\\tminX = x;\\n\\t\\t\\t}\\n\\t\\t\\tif (x > maxX) {\\n\\t\\t\\t\\tmaxX = x;\\n\\t\\t\\t}\\n\\t\\t\\tif (z < minZ) {\\n\\t\\t\\t\\tminZ = z;\\n\\t\\t\\t}\\n\\t\\t\\tif (z > maxZ) {\\n\\t\\t\\t\\tmaxZ = z;\\n\\t\\t\\t}\\n\\t\\t\\tif (-y > super.minY) {\\n\\t\\t\\t\\tsuper.minY = -y;\\n\\t\\t\\t}\\n\\t\\t\\tif (y > maxY) {\\n\\t\\t\\t\\tmaxY = y;\\n\\t\\t\\t}\\n\\t\\t\\tint radiusSqr = (x * x) + (z * z);\\n\\t\\t\\tif (radiusSqr > radius) {\\n\\t\\t\\t\\tradius = radiusSqr;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tradius = (int) Math.sqrt(radius);\\n\\t\\tminDepth = (int) Math.sqrt((radius * radius) + (super.minY * super.minY));\\n\\t\\tmaxDepth = minDepth + (int) Math.sqrt((radius * radius) + (maxY * maxY));\\n\\t}\",\n \"public void constructBoundingBox()\\r\\n\\t{\\n\\t\\tdouble a = m_Qmin.x;\\r\\n\\t\\tdouble b = m_Qmin.y;\\r\\n\\t\\tdouble c = m_Qmin.z;\\r\\n\\r\\n\\t\\tdouble d = m_Qmax.x;\\r\\n\\t\\tdouble e = m_Qmax.y;\\r\\n\\t\\tdouble f = m_Qmax.z;\\r\\n\\r\\n\\t\\t//constructing the vertexes of the bounding box\\r\\n\\t\\tSceneVertex A = new SceneVertex( new Vector3d(a, b, c));\\r\\n\\t\\tSceneVertex B = new SceneVertex( new Vector3d(d, b, c));\\r\\n\\t\\tSceneVertex C = new SceneVertex( new Vector3d(d, b, f));\\r\\n\\t\\tSceneVertex D = new SceneVertex( new Vector3d(d, e, f));\\r\\n\\t\\tSceneVertex E = new SceneVertex( new Vector3d(a, e, f));\\r\\n\\t\\tSceneVertex F = new SceneVertex( new Vector3d(a, e, c));\\r\\n\\t\\tSceneVertex G = new SceneVertex( new Vector3d(d, e, c));\\r\\n\\t\\tSceneVertex H = new SceneVertex( new Vector3d(a, b, f));\\r\\n\\r\\n\\r\\n\\t\\t// building the vertices arrays for the faces\\r\\n\\t\\tArrayList verArrP0front = new ArrayList(4);\\r\\n\\t\\tverArrP0front.add(A);\\r\\n\\t\\tverArrP0front.add(B);\\r\\n\\t\\tverArrP0front.add(G);\\r\\n\\t\\tverArrP0front.add(F);\\r\\n\\t\\t\\r\\n\\t\\tArrayList verArrP1left = new ArrayList(4);\\r\\n\\t\\tverArrP1left.add(A);\\r\\n\\t\\tverArrP1left.add(F);\\r\\n\\t\\tverArrP1left.add(E);\\r\\n\\t\\tverArrP1left.add(H);\\r\\n\\t\\t\\r\\n\\t\\tArrayList verArrP2back = new ArrayList(4);\\r\\n\\t\\tverArrP2back.add(H);\\r\\n\\t\\tverArrP2back.add(C);\\r\\n\\t\\tverArrP2back.add(D);\\r\\n\\t\\tverArrP2back.add(E);\\r\\n\\t\\t\\r\\n\\t\\tArrayList verArrP3right = new ArrayList(4);\\r\\n\\t\\tverArrP3right.add(G);\\r\\n\\t\\tverArrP3right.add(D);\\r\\n\\t\\tverArrP3right.add(C);\\r\\n\\t\\tverArrP3right.add(B);\\r\\n\\t\\t\\r\\n\\t\\tArrayList verArrP4bottom = new ArrayList(4);\\r\\n\\t\\tverArrP4bottom.add(A);\\r\\n\\t\\tverArrP4bottom.add(H);\\r\\n\\t\\tverArrP4bottom.add(C);\\r\\n\\t\\tverArrP4bottom.add(B);\\r\\n\\r\\n\\t\\tArrayList verArrP5top = new ArrayList(4);\\r\\n\\t\\tverArrP5top.add(F);\\r\\n\\t\\tverArrP5top.add(G);\\r\\n\\t\\tverArrP5top.add(D);\\r\\n\\t\\tverArrP5top.add(E);\\r\\n\\t\\t\\r\\n\\t\\t// creating BoundingBox\\r\\n\\t\\tm_BoundingBox = new SceneNode(DrawingMode.GL_LINE, \\\"BoundingBox\\\", null);\\r\\n\\t\\tm_BoundingBox.addChild( new ScenePolygon(verArrP0front, \\\"FRONT\\\"));\\r\\n\\t\\tm_BoundingBox.addChild( new ScenePolygon(verArrP1left, \\\"LEFT\\\"));\\r\\n\\t\\tm_BoundingBox.addChild( new ScenePolygon(verArrP2back, \\\"BACK\\\"));\\r\\n\\t\\tm_BoundingBox.addChild( new ScenePolygon(verArrP3right, \\\"RIGHT\\\"));\\r\\n\\t\\tm_BoundingBox.addChild( new ScenePolygon(verArrP4bottom, \\\"BOTTOM\\\"));\\r\\n\\t\\tm_BoundingBox.addChild( new ScenePolygon(verArrP5top, \\\"TOP\\\"));\\r\\n\\r\\n\\t\\t\\r\\n\\t}\",\n \"private HashMap setupBoundBoxes(BioMightBoundBoxes bioMightBoundBoxesIn) \\r\\n\\t{\\r\\n\\t\\t// Set up the bounding boxes for the various components\\r\\n\\t\\t// The various components locations will be driven by the\\r\\n\\t\\t// bounding boxes\\r\\n\\t\\tHashMap boundingBoxesMap = new HashMap();\\r\\n\\t\\r\\n\\t\\t// Initialize the position of the bounding box vars\\r\\n\\t\\tBigDecimal xPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal yPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal zPos= new BigDecimal(0.0);\\r\\n\\t\\t\\r\\n\\t\\t// Set to base 1x1x1 cube\\r\\n\\t\\tBigDecimal xVector= new BigDecimal(1.0);\\r\\n\\t\\tBigDecimal yVector= new BigDecimal(1.0); \\r\\n\\t\\tBigDecimal zVector= new BigDecimal(1.0);\\r\\n\\t\\r\\n\\t\\t// Initialize the BoundBoxes. These will have a bound\\r\\n\\t\\t// box for each foot by default\\r\\n\\t\\tBioMightBoundBoxes bioBoundBoxes = null;\\r\\n\\t\\r\\n\\t\\t// Initialize the BoundBox\\r\\n\\t\\tBioMightBoundBox bioBoundBox = null;\\r\\n\\t\\r\\n\\t\\t// Initialize the Connectors \\r\\n\\t\\tBioMightConnectors bioMightConnectors = null; \\r\\n\\r\\n\\t\\t// Initialize the Connector \\r\\n\\t\\tBioMightConnector bioMightConnector= null;\\r\\n\\t\\r\\n\\t\\tdouble circumference = 0.0;\\r\\n\\t\\tdouble[] startPos = {0.0, 0.0, 0.0};\\r\\n\\t\\tdouble[][] startPoints = null;\\r\\n\\t\\tdouble[] endPos = {0.0, 0.0, 0.0};\\r\\n\\t\\tdouble[][] endPoints = null;\\r\\n\\t\\r\\n\\t\\t// Use the information in the incoming Bound Box\\r\\n\\t\\t// to orientate the inner bound boxes\\r\\n\\t\\tif (bioMightBoundBoxesIn != null)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// In the default instance,there will be two bound boxes\\r\\n\\t\\t\\tBioMightBoundBox bioMightBoundBoxTemp = bioMightBoundBoxesIn.getBoundingBox(Constants.LeftFootRef);\\r\\n\\t\\t\\tSystem.out.println(\\\"LeftFoot - SetupBoundBoxes - Incoming BoundBox: \\\" + \\r\\n\\t\\t\\t\\t\\tbioMightBoundBoxTemp.getXPos() + \\\" \\\" +\\r\\n\\t\\t\\t\\t\\tbioMightBoundBoxTemp.getYPos() + \\\" \\\" +\\r\\n\\t\\t\\t\\t\\tbioMightBoundBoxTemp.getZPos());\\r\\n\\r\\n\\t\\t\\t// In the default instance,there will be two bound boxes\\r\\n\\t\\t\\tbioMightBoundBoxTemp = bioMightBoundBoxesIn.getBoundingBox(Constants.RightFootRef);\\r\\n\\t\\t\\tSystem.out.println(\\\"RightFoot - SetupBoundBoxes - Incoming BoundBox: \\\" + \\r\\n\\t\\t\\t\\t\\tbioMightBoundBoxTemp.getXPos() + \\\" \\\" +\\r\\n\\t\\t\\t\\t\\tbioMightBoundBoxTemp.getYPos() + \\\" \\\" +\\r\\n\\t\\t\\t\\t\\tbioMightBoundBoxTemp.getZPos());\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.println(\\\"Feet SetupBoundBoxes - Incoming BoundBoxes are Null\\\");\\r\\n\\t\\t}\\r\\n\\t\\r\\n\\t\\r\\n\\t\\tbioBoundBoxes = new BioMightBoundBoxes();\\r\\n\\t\\t\\t\\r\\n\\t\\t//********************************************************************* \\r\\n\\t\\t// LEFT FOOT EPITHELIUM BOUNDBOX\\r\\n\\t\\t// Set up the Bounding Box for the Feet\\r\\n\\t\\t// The connector for this will come from the incoming Bound Box\\r\\n\\t\\t// Both are defined like and bolt and they lock into position at the\\r\\n\\t\\t// interestion of both connectors\\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(1.0);\\r\\n\\t\\tyPos = new BigDecimal(-48.0);\\r\\n\\t\\tzPos= new BigDecimal(0.0);\\r\\n\\t\\r\\n\\t\\txVector= new BigDecimal(1.0);\\r\\n\\t\\tyVector= new BigDecimal(4.0); \\r\\n\\t\\tzVector= new BigDecimal(1.0);\\r\\n\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\r\\n\\t\\t// Feet Epithelium Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(1.0, -65.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tendPos = getEndPoints(1.0, -67.50, -1.0);\\r\\n\\t\\tendPoints = BioGraphics.octogonYPlane(endPos, circumference);\\r\\n\\t\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, endPoints, Constants.FootEpitheliumRef,\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(Constants.FootEpitheliumRef, bioMightConnector);\\r\\n\\t\\t\\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\r\\n\\t\\t\\r\\n\\t\\t// Put the Bounding Box into the Collection of Bounding Boxes \\r\\n\\t\\tSystem.out.println(\\\"Adding - LeftBoundBox to bioBoundBoxes\\\"); \\r\\n\\t\\tbioBoundBoxes.setBoundingBox(Constants.FootEpitheliumRef, bioBoundBox);\\r\\n\\t\\t\\r\\n\\t\\t// Put the BioMight BoundBoxes for the Left Foot into the BoundingBoxMap \\r\\n\\t\\tboundingBoxesMap.put(Constants.LeftFootRef, bioBoundBoxes);\\r\\n\\t\\tSystem.out.println(\\\"Adding - Left Foot bioBoundBoxes into BoxesMap\\\"); \\r\\n\\r\\n\\t\\r\\n\\t\\tbioBoundBoxes = new BioMightBoundBoxes();\\r\\n\\t\\t\\t\\r\\n\\t\\t//********************************************************************* \\r\\n\\t\\t// RIGHT FOOT EPITHELIUM BOUNDBOX\\r\\n\\t\\t// Set up the Bounding Box for the Feet\\r\\n\\t\\t// The connector for this will come from the incoming Bound Box\\r\\n\\t\\t// Both are defined like and bolt and they lock into position at the\\r\\n\\t\\t// interestion of both connectors\\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(-8.0);\\r\\n\\t\\tyPos = new BigDecimal(-65.0);\\r\\n\\t\\tzPos= new BigDecimal(-1.0);\\r\\n\\t\\r\\n\\t\\txVector= new BigDecimal(1.0);\\r\\n\\t\\tyVector= new BigDecimal(4.0); \\r\\n\\t\\tzVector= new BigDecimal(1.0);\\r\\n\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\r\\n\\t\\t// Feet Epithelium Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(-1.0, -65.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tendPos = getEndPoints(-1.0, -67.50, -1.0);\\r\\n\\t\\tendPoints = BioGraphics.octogonYPlane(endPos, circumference);\\r\\n\\t\\t\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, endPoints, Constants.FootEpitheliumRef,\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(Constants.FootEpitheliumRef, bioMightConnector);\\r\\n\\t\\t\\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t// Put the Bounding Box into the Collection of Bounding Boxes \\r\\n\\t\\tSystem.out.println(\\\"Adding - RightBoundBox to bioBoundBoxes\\\"); \\r\\n\\t\\tbioBoundBoxes.setBoundingBox(Constants.FootEpitheliumRef, bioBoundBox);\\t\\t\\r\\n\\r\\n\\t\\t// Put the BioMight BoundBoxes for the Left Shoulder into the BoundingBoxMap \\r\\n\\t\\tboundingBoxesMap.put(Constants.RightFootRef, bioBoundBoxes);\\r\\n\\t\\tSystem.out.println(\\\"Adding - Right Foot bioBoundBoxes into BoxesMap\\\"); \\r\\n\\r\\n\\t\\treturn (boundingBoxesMap);\\r\\n\\t}\",\n \"public void initializeBoundary() {\\n\\n\\t\\tthis.subNetGenes = getSubNetGenes(species, xmlFile);\\n\\t\\tthis.subNetwork = getSubNetwork(subNetGenes, oriGraphFile);\\n\\t\\t\\n\\t\\tSet comSubNetGenes = Sets.newHashSet();\\n\\t\\tcomSubNetGenes.addAll(this.subNetwork.keySet());\\n\\t\\tcomSubNetGenes.addAll(this.subNetwork.values());\\n\\t\\t\\n\\t\\ttotalSubGeneCount = comSubNetGenes.size();\\n\\t\\t\\n\\t\\tcountBoundaryEdges(comSubNetGenes, oriGraphFile);\\n\\t\\t\\n\\t\\t\\n\\n\\t}\",\n \"public ClusterConfig build() {\\n return new ClusterConfig(_id, _resourceMap, _participantMap, _constraintMap, _stateModelMap,\\n _stats, _alerts, _userConfig, _isPaused, _autoJoin);\\n }\",\n \"public void buildBoundaryWall() {\\n for (int i = 0; i < worldWidth; i += 1) {\\n for (int j = 0; j < worldHeight; j += 1) {\\n if (i == 0 || i == worldWidth - 1\\n || j == 0 || j == worldHeight - 1) {\\n world[i][j] = Tileset.WALL;\\n }\\n }\\n }\\n }\",\n \"private HashMap setupBoundBoxes(BioMightBoundBox bioMightBoundBoxIn) \\r\\n\\t{\\r\\n\\t\\t// Set up the bounding boxes for the various components\\r\\n\\t\\t// The various components locations will be driven by the\\r\\n\\t\\t// bounding boxes\\r\\n\\t\\tHashMap boundingBoxMap = new HashMap();\\r\\n\\t\\t\\r\\n\\t\\t// Initialize the position of the bounding box vars\\r\\n\\t\\tBigDecimal xPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal yPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal zPos= new BigDecimal(0.0);\\r\\n\\t\\t\\t\\r\\n\\t\\t// Set to base 1x1x1 cube\\r\\n\\t\\tBigDecimal xVector= new BigDecimal(1.0);\\r\\n\\t\\tBigDecimal yVector= new BigDecimal(1.0); \\r\\n\\t\\tBigDecimal zVector= new BigDecimal(1.0);\\r\\n\\r\\n\\t\\t// Initialize the BoundBoxes. This is used for\\r\\n\\t\\t// collections such as arms, legs,lungs,etc\\r\\n\\t\\tBioMightBoundBoxes bioBoundBoxes = null;\\r\\n\\t\\r\\n\\t\\t// Initialize the BoundBox\\r\\n\\t\\tBioMightBoundBox bioBoundBox = null;\\r\\n\\r\\n\\t\\t// Initialize the Connectors \\r\\n\\t\\tBioMightConnectors bioMightConnectors = null; \\r\\n\\r\\n\\t\\t// Initialize the Connector \\r\\n\\t\\tBioMightConnector bioMightConnector= null;\\r\\n\\t\\t\\r\\n\\t\\tdouble circumference = 0.0;\\r\\n\\t\\tdouble[] startPos = {0.0, 0.0, 0.0};\\r\\n\\t\\tdouble[][] startPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\t\\r\\n\\t\\t// Use the information in the incomiing Bound Box\\r\\n\\t\\t// to orientate the inner bound boxes\\r\\n\\t\\tif (bioMightBoundBoxIn != null)\\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.println(\\\"Arm - SetupBoundBoxes - Incoming BoundBox: \\\" + \\r\\n\\t\\t\\t\\t\\tbioMightBoundBoxIn.getXPos() + \\\" \\\" +\\r\\n\\t\\t\\t\\t\\tbioMightBoundBoxIn.getYPos() + \\\" \\\" +\\r\\n\\t\\t\\t\\t\\tbioMightBoundBoxIn.getZPos());\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t//********************************************************************* \\r\\n\\t\\t// EPITHELIUM BOUNDBOX\\r\\n\\t\\t// Set up the Bounding Box for the Arm\\r\\n\\t\\t// The connector for this will come from the incoming Bound Box\\r\\n\\t\\t// Both are defined like and bolt and they lock into position at the\\r\\n\\t\\t// interestion of both connectors\\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(0.0);\\r\\n\\t\\tyPos = new BigDecimal(-12.0);\\r\\n\\t\\tzPos= new BigDecimal(-1.0);\\r\\n\\t\\t\\r\\n\\t\\txVector= new BigDecimal(9.0);\\r\\n\\t\\tyVector= new BigDecimal(8.0); \\r\\n\\t\\tzVector= new BigDecimal(4.0);\\r\\n\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\t\\r\\n\\t\\t// Arm Epithelium Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(0.0, -9.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, \\\"ArmEpithelialCell\\\",\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(\\\"ArmEpithelialCell\\\", bioMightConnector);\\r\\n\\t\\t\\t\\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\r\\n\\t\\t\\r\\n\\t\\tboundingBoxMap.put(Constants.ArmEpitheliumRef, bioBoundBox);\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\r\\n\\t\\t//********************************************************************* \\r\\n\\t\\t// ARMS BOUND BOXES\\r\\n\\t\\t// Set up the Bounding Box for the Bronchi\\r\\n\\t\\t// On a porportioned human, the Bronchi are located in the --- \\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\t\\r\\n\\t\\t//********************************************************************* \\r\\n\\t\\t// LEFT ARMS BOUNDBOX\\r\\n\\t\\t// Set up the Bounding Box for the Left Arm\\r\\n\\t\\t// On a porportioned human, the Bronchi are located in the --- \\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(1.0);\\r\\n\\t\\tyPos = new BigDecimal(-11.0);\\r\\n\\t\\tzPos= new BigDecimal(-3.5);\\r\\n\\t\\t\\r\\n\\t\\txVector= new BigDecimal(2.0);\\r\\n\\t\\tyVector= new BigDecimal(2.0); \\r\\n\\t\\tzVector= new BigDecimal(2.0);\\r\\n\\r\\n\\t\\tbioBoundBoxes = new BioMightBoundBoxes();\\r\\n\\t\\t\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\t\\t\\r\\n\\t\\t// ArmEpithelium Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(0.0, -8.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, Constants.ArmEpitheliumRef,\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(Constants.ArmEpitheliumRef, bioMightConnector);\\r\\n\\t\\t\\t\\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\r\\n\\t\\t\\t\\r\\n\\t\\t// Put the Bounding Box into the Collection of Bounding Boxes \\r\\n\\t\\tbioBoundBoxes.setBoundingBox(Constants.LeftArmRef, bioBoundBox);\\t\\r\\n\\r\\n\\t\\t//********************************************************************* \\r\\n\\t\\t// RIGHT ARMS BOUNDBOX\\r\\n\\t\\t// Set up the Bounding Box for the Bronchi\\r\\n\\t\\t// On a porportioned human, the Bronchi are located in the --- \\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(-1.0);\\r\\n\\t\\tyPos = new BigDecimal(-11.0);\\r\\n\\t\\tzPos= new BigDecimal(-3.5);\\r\\n\\t\\t\\r\\n\\t\\txVector= new BigDecimal(2.0);\\r\\n\\t\\tyVector= new BigDecimal(2.0); \\r\\n\\t\\tzVector= new BigDecimal(2.0);\\r\\n\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\t\\t\\r\\n\\t\\t// ArmEpithelium Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(0.0, -8.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, Constants.ArmEpitheliumRef,\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(Constants.ArmEpitheliumRef, bioMightConnector);\\r\\n\\t\\t\\t\\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\r\\n\\t\\t\\r\\n\\t\\t// Put the Bounding Box into the Collection of Bounding Boxes \\r\\n\\t\\tbioBoundBoxes.setBoundingBox(Constants.RightArmRef, bioBoundBox);\\t\\t\\r\\n\\r\\n\\t\\t// Put the BioMight BoundBoxes for the Bronchi \\r\\n\\t\\t// into the BoundingBoxMap \\r\\n\\t\\tboundingBoxMap.put(Constants.BronchiRef, bioBoundBoxes);\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\treturn (boundingBoxMap);\\r\\n\\t}\",\n \"public void computeStoredBounds()\\n {\\n computeSRectangleBound();\\n computeCircleBound();\\n }\",\n \"@Test\\n public void testBoundsAsCompositesWithMultiSliceRestrictionsWithOneAscendingAndOneDescendingClusteringColumns()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.DESC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n\\n // (clustering_0, clustering1) > (1, 2)\\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertEmptyComposite(bounds.get(1));\\n\\n // (clustering_0, clustering1) >= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n assertEmptyComposite(bounds.get(1));\\n\\n // (clustering_0, clustering1) <= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n assertComposite(bounds.get(1), value1, value2, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n // (clustering_0, clustering1) < (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n // (clustering_0, clustering1) > (1, 2) AND (clustering_0) < (2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2);\\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value2, EOC.START);\\n\\n // (clustering_0, clustering1) >= (1, 2) AND (clustering_0, clustering1) <= (2, 1)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value2, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n assertComposite(bounds.get(2), value2, value1, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n assertComposite(bounds.get(1), value2, EOC.START);\\n assertComposite(bounds.get(2), value2, EOC.END);\\n }\",\n \"@Test\\n public void testBoundsAsCompositesWithMultiSliceRestrictionsWithOneDescendingAndOneAscendingClusteringColumns()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.DESC, Sort.ASC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n\\n // (clustering_0, clustering1) > (1, 2)\\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n // (clustering_0, clustering1) >= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n assertComposite(bounds.get(1), value1, value2, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n // (clustering_0, clustering1) <= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n assertEmptyComposite(bounds.get(1));\\n\\n // (clustering_0, clustering1) < (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertEmptyComposite(bounds.get(1));\\n\\n // (clustering_0, clustering1) > (1, 2) AND (clustering_0) < (2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2);\\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.END);\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n // (clustering_0) > (1) AND (clustering_0, clustering1) < (2, 1)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1);\\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.START);\\n assertComposite(bounds.get(1), value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value2, value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.START);\\n\\n // (clustering_0, clustering1) >= (1, 2) AND (clustering_0, clustering1) <= (2, 1)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value2, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.START);\\n assertComposite(bounds.get(1), value2, EOC.END);\\n assertComposite(bounds.get(2), value1, value2, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value2, value1, EOC.END);\\n assertComposite(bounds.get(1), value1, EOC.START);\\n assertComposite(bounds.get(2), value1, EOC.END);\\n }\",\n \"private BioMightBoundBoxes setupDefaultBoundBoxes() \\r\\n\\t{\\r\\n\\t\\t// Set up the collection to hold the Bounding Boxes\\r\\n\\t\\tBioMightBoundBoxes bioBoundBoxes = null;\\r\\n\\t\\r\\n\\t\\t// Initialize the position of the bounding box vars\\r\\n\\t\\tBigDecimal xPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal yPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal zPos= new BigDecimal(0.0);\\r\\n\\t\\t\\r\\n\\t\\t// Set to base 1x1x1 cube\\r\\n\\t\\tBigDecimal xVector= new BigDecimal(1.0);\\r\\n\\t\\tBigDecimal yVector= new BigDecimal(1.0); \\r\\n\\t\\tBigDecimal zVector= new BigDecimal(1.0);\\r\\n\\t\\r\\n\\t\\t// Initialize a BoundBox\\r\\n\\t\\tBioMightBoundBox bioBoundBox = null;\\r\\n\\t\\r\\n\\t\\t// Initialize Connectors \\r\\n\\t\\tBioMightConnectors bioMightConnectors = null; \\r\\n\\r\\n\\t\\t// Initialize a Connector \\r\\n\\t\\tBioMightConnector bioMightConnector= null;\\r\\n\\t\\r\\n\\t\\tdouble circumference = 0.0;\\r\\n\\t\\tdouble[] startPos = {0.0, 0.0, 0.0};\\r\\n\\t\\tdouble[][] startPoints = null;\\r\\n\\t\\r\\n\\t\\t//********************************************************************* \\r\\n\\t\\t// LEFT FOOT BOUNDBOX\\r\\n\\t\\t// Set up the Bounding Box for the Feet\\r\\n\\t\\t// The connector for this will come from the incoming Bound Box\\r\\n\\t\\t// Both are defined like and bolt and they lock into position at the\\r\\n\\t\\t// interestion of both connectors\\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(0.0);\\r\\n\\t\\tyPos = new BigDecimal(-65.0);\\r\\n\\t\\tzPos= new BigDecimal(3.0);\\r\\n\\t\\r\\n\\t\\txVector= new BigDecimal(1.0);\\r\\n\\t\\tyVector= new BigDecimal(4.0); \\r\\n\\t\\tzVector= new BigDecimal(1.0);\\r\\n\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\r\\n\\t\\t// Feet Epithelium Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(-2.0, -65.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, Constants.FootEpitheliumRef,\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(Constants.FootEpitheliumRef, bioMightConnector);\\r\\n\\t\\t\\r\\n\\t\\t// Associate the connector on the Box\\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\r\\n\\t\\t\\r\\n\\t\\t// Put the Bounding Box in the collection\\r\\n\\t\\tbioBoundBoxes.setBoundingBox(Constants.LeftFootRef, bioBoundBox);\\r\\n\\t\\r\\n\\t\\r\\n\\t\\t//********************************************************************* er\\r\\n\\t\\t// RIGHT CNEMES BOUNDBOX\\r\\n\\t\\t// Set up the Bounding Box for the Foot\\r\\n\\t\\t// On a porportioned human, the \\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(0.0);\\r\\n\\t\\tyPos = new BigDecimal(-14.0);\\r\\n\\t\\tzPos= new BigDecimal(-3.0);\\r\\n\\t\\r\\n\\t\\txVector= new BigDecimal(1.0);\\r\\n\\t\\tyVector= new BigDecimal(4.0); \\r\\n\\t\\tzVector= new BigDecimal(1.0);\\r\\n\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\t\\r\\n\\t\\t// Foot Epithelium Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(2.0, -65.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, Constants.FootEpitheliumRef,\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(Constants.FootEpitheliumRef, bioMightConnector);\\r\\n\\t\\r\\n\\t\\t// Associate the connector on the Box\\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\r\\n\\t\\t\\r\\n\\t\\t// Put the Bounding Box in the collection\\r\\n\\t\\tbioBoundBoxes.setBoundingBox(Constants.RightFootRef, bioBoundBox);\\r\\n\\t\\r\\n\\t\\t// return the collection that holds both foot bound boxes\\r\\n\\t\\treturn (bioBoundBoxes);\\r\\n\\t}\",\n \"@Test\\n public void testBoundsAsCompositesWithMultiSliceRestrictionsWithTwoDescendingClusteringColumns()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.DESC, Sort.DESC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n\\n // (clustering_0, clustering1) > (1, 2)\\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n\\n // (clustering_0, clustering1) >= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n\\n // (clustering_0, clustering1) <= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n // (clustering_0, clustering1) < (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n\\n // (clustering_0, clustering1) > (1, 2) AND (clustering_0) < (2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2);\\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n\\n // (clustering_0, clustering1) >= (1, 2) AND (clustering_0, clustering1) <= (2, 1)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value2, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, value1, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n }\",\n \"private void buildBoundary(Set dict) {\\n for (String s : dict) {\\n int len = s.length();\\n min = Math.min(min, len);\\n max = Math.max(max, len);\\n }\\n }\",\n \"public void determineNodeBoundary(boolean drivable) {\\r\\n \\t\\t//System.out.println(\\\"Determine node boundary of \\\" + name);\\r\\n \\t\\tArrayList pointCloud = new ArrayList(); \\r\\n \\t\\t// Add all end points of (drive-able) crossSectionElements to the pointCloud\\r\\n \\t\\tfor (DirectionalLink dl : links) {\\r\\n \\t\\t\\tCrossSection cs = dl.link.getCrossSectionAtNode(dl.incoming);\\r\\n \\t\\t\\t//if (name.equals(\\\"node_een\\\"))\\r\\n \\t\\t\\t//\\tLog.logToFile(\\\"d:/hull.txt\\\", false, \\\"selecting crosssection %s %s %s\\\", cs.toString(), dl.incoming ? \\\"from\\\" : \\\"to\\\", dl.incoming ? dl.link.getFromNode_r().getName_r() : dl.link.getToNode_r().getName_r());\\r\\n \\t\\t\\tfor (int index = 2 * cs.getCrossSectionElementList_r().size(); --index >= 0; )\\r\\n \\t\\t\\t\\tif ((! drivable) || cs.elementFromNode(dl.incoming, true, index).getCrossSectionElementTypology().getDrivable()) {\\r\\n \\t\\t\\t\\t\\tLine2D.Double dlLine = cs.vectorAtNode(dl.incoming, true, index, false);\\r\\n \\t\\t\\t\\t\\tif (null == dlLine)\\r\\n \\t\\t\\t\\t\\t\\tcontinue;\\r\\n \\t\\t\\t\\t\\tpointCloud.add((Point2D.Double) dlLine.getP1());\\r\\n \\t\\t\\t\\t\\t//if (name.equals(\\\"node_een\\\"))\\r\\n \\t\\t\\t\\t\\t//\\tLog.logToFile(\\\"d:/hull.txt\\\", false, \\\"added endpoint %d %.3f,%.3f\\\", index, dlLine.x1, dlLine.y1);\\r\\n \\t\\t\\t\\t\\t// Add the intersections of the boundaries of different (drive-able) crossSectionElements\\r\\n \\t\\t\\t\\t\\tfor (DirectionalLink otherDL : links) {\\r\\n \\t\\t\\t\\t\\t\\tif (otherDL.angle >= dl.angle) // only search up to dl (and NEVER include dl itself)\\r\\n \\t\\t\\t\\t\\t\\t\\tbreak;\\t// this way we'll find each intersection only ONCE\\r\\n \\t\\t\\t\\t\\t\\tCrossSection otherCS = otherDL.link.getCrossSectionAtNode(otherDL.incoming);\\r\\n \\t\\t\\t\\t\\t\\tfor (int otherIndex = 2 * otherCS.getCrossSectionElementList_r().size(); --otherIndex >= 0; )\\r\\n \\t\\t\\t\\t\\t\\t\\tif ((! drivable) || (otherCS.elementFromNode(otherDL.incoming, true, otherIndex).getCrossSectionElementTypology().getDrivable())) {\\r\\n \\t\\t\\t\\t\\t\\t\\t\\tLine2D.Double otherDLLine = otherCS.vectorAtNode(otherDL.incoming, true, otherIndex, false);\\r\\n \\t\\t\\t\\t\\t\\t\\t\\tif (null == otherDLLine)\\r\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tcontinue;\\r\\n \\t\\t\\t\\t\\t\\t\\t\\t//if (name.equals(\\\"node_een\\\"))\\r\\n \\t\\t\\t\\t\\t\\t\\t\\t//\\tLog.logToFile(\\\"d:/hull.txt\\\", false, \\\"checking intersection between %s and %s\\\", GeometryTools.Line2DToString(dlLine), GeometryTools.Line2DToString(otherDLLine));\\r\\n \\t\\t\\t\\t\\t\\t\\t\\tif (Planar.lineIntersectsLine(dlLine, otherDLLine)) {\\r\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tPoint2D.Double intersection = Planar.intersection(dlLine, otherDLLine);\\r\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"Adding boundary intersection \\\" + intersection);\\r\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tpointCloud.add(intersection);\\r\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t//if (name.equals(\\\"node_een\\\"))\\r\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t//\\tLog.logToFile(\\\"d:/hull.txt\\\", false, \\\"added boundary intersection %.3f,%.3f\\\", intersection.x, intersection.y);\\r\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t}\\r\\n \\r\\n \\t\\t//System.out.println(\\\"pointCloud of \\\" + name + \\\" contains these points: \\\" + pointCloud.toString());\\r\\n \\t\\tif (0 == pointCloud.size())\\r\\n \\t\\t\\tpointCloud.add(getPoint());\\t// add design point of this node\\r\\n \\t\\tcircle = Planar.circleCoveringPoints(pointCloud);\\r\\n \\t\\t//ArrayList ppp = new ArrayList();\\r\\n \\t\\t//ppp.add(new Point2D.Double(this.x, this.y));\\r\\n \\t\\t//circle = GeometryTools.circleCoveringPoints(ppp);\\r\\n \\t\\t//System.out.format(Main.Locale, \\\"covering circle is %s\\\\r\\\\n\\\", circle.toString());\\r\\n \\t\\t// Create the convex hull consisting of the points where the drive-able parts of the links enter the covering circle\\r\\n \\t\\tArrayList points = new ArrayList();\\r\\n \\t\\tfor (DirectionalLink dl : links) {\\r\\n \\t\\t\\tCrossSection cs = dl.link.getCrossSectionAtNode(dl.incoming);\\r\\n \\t\\t\\tfor (int index = 2 * cs.getCrossSectionElementList_r().size(); --index >= 0; )\\r\\n \\t\\t\\t\\tif (cs.elementFromNode(dl.incoming, true, index).getCrossSectionElementTypology().getDrivable()) {\\r\\n \\t\\t\\t\\t\\tLine2D.Double line = cs.vectorAtNode(dl.incoming, true, index, false);\\r\\n \\t\\t\\t\\t\\tif (null == line)\\r\\n \\t\\t\\t\\t\\t\\tcontinue;\\r\\n \\t\\t\\t\\t\\tPoint2D.Double intersections[] = Planar.intersectRayAndCircle(line, circle);\\r\\n \\t\\t\\t\\t\\t//System.out.format(Main.Locale, \\\"line %s intersects circle %s at %d point(s)\\\\r\\\\n\\\", GeometryTools.Line2DToString(line), circle.toString(), intersections.length);\\r\\n \\t\\t\\t\\t\\tif (intersections.length > 1) {\\r\\n \\t\\t\\t\\t\\t\\tSystem.err.println(\\\"Peter thinks this never happens...\\\");\\r\\n \\t\\t\\t\\t\\t\\t// use the one that is closest to the far end of the line\\r\\n \\t\\t\\t\\t\\t\\tif (intersections[0].distance(line.getP2()) < intersections[1].distance(line.getP2()))\\r\\n \\t\\t\\t\\t\\t\\t\\tpoints.add(intersections[0]);\\r\\n \\t\\t\\t\\t\\t\\telse\\r\\n \\t\\t\\t\\t\\t\\t\\tpoints.add(intersections[1]);\\r\\n \\t\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t\\telse if (intersections.length > 0)\\r\\n \\t\\t\\t\\t\\t\\tpoints.add(intersections[0]);\\r\\n \\t\\t\\t\\t\\telse {\\r\\n \\t\\t\\t\\t\\t\\tSystem.out.println(\\\"line \\\" + Planar.Line2DToString(line) + \\\" does not intersect the circle \\\" + circle.toString());\\r\\n \\t\\t\\t\\t\\t\\t// probably a very near miss\\r\\n \\t\\t\\t\\t\\t\\tdouble ratio = circle.radius() / line.getP1().distance(circle.center());\\r\\n \\t\\t\\t\\t\\t\\tif ((ratio > 0.99) && (ratio < 1.01))\\r\\n \\t\\t\\t\\t\\t\\t\\tpoints.add(Planar.logPoint(\\\"adding almost intersection\\\", (Point2D.Double)(line.getP1())));\\r\\n \\t\\t\\t\\t\\t\\telse\\r\\n \\t\\t\\t\\t\\t\\t\\tSystem.err.println(\\\"Total miss: ratio is \\\" + ratio + \\\" (\\\" + circle.radius() / line.getP2().distance(circle.center()) + \\\")\\\");\\r\\n \\t\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t}\\r\\n \\t\\tif (points.size() == 0)\\r\\n \\t\\t\\treturn;\\r\\n \\t\\t// Compute the convex hull (in 2D) and convert that into an ArrayList\\r\\n \\t\\t//System.out.println(\\\"Computing convex hull of \\\" + points.toString());\\r\\n \\t\\t//if (name.equals(\\\"node_een\\\"))\\r\\n \\t\\t//\\tLog.logToFile(\\\"d:/hull.txt\\\", false, \\\"points is %s\\\", points.toString());\\r\\n \\t\\tconflictArea = new ArrayList();\\r\\n \\t\\tfor (Point2D.Double p : Planar.convexHull(points))\\r\\n \\t\\t\\tconflictArea.add(new Vertex(p, z));\\t// use Z-component of this node\\r\\n \\t\\tconflictArea.add(conflictArea.get(0));\\t// close the polygon\\r\\n \\t\\t//System.out.println(\\\"convex hull is \\\" + conflictArea.toString());\\r\\n \\t\\t//if (name.equals(\\\"node_een\\\"))\\r\\n \\t\\t//\\tLog.logToFile(\\\"d:/hull.txt\\\", false, \\\"hull is %s\\\", conflictArea.toString());\\r\\n \\t}\",\n \"protected void computeBounds() {\\r\\n bounds = new Rectangle(layout.location.x - icon.getIconWidth() / 2,\\r\\n layout.location.y - icon.getIconHeight() / 2, icon.getIconWidth(), icon.getIconHeight()).union(labelBox)\\r\\n .union(ports[0].getBounds()).union(ports[1].getBounds()).union(ports[2].getBounds())\\r\\n .union(component.getType() == TemplateComponent.TYPE_CHANNEL\\r\\n ? ports[3].getBounds().union(supHalo.getBounds())\\r\\n : ports[3].getBounds());\\r\\n }\",\n \"public abstract Regionlike getGridBounds();\",\n \"@Test\\n public void testBoundsAsCompositesWithMultiSliceRestrictionsMixingAscendingDescendingClusteringColumns()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.DESC, Sort.ASC, Sort.DESC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\\n ByteBuffer value4 = ByteBufferUtil.bytes(4);\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) > (1, 2, 3, 4)\\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2, value3, value4);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, value3, EOC.END);\\n assertComposite(bounds.get(3), value1, EOC.END);\\n\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, value4, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, EOC.END);\\n assertEmptyComposite(bounds.get(3));\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2, clustering_3) > (2, 3, 4)\\n Restriction eq = newSingleEq(cfMetaData, 0, value1);\\n slice = newMultiSlice(cfMetaData, 1, Bound.START, false, value2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n restrictions = restrictions.mergeWith(eq);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, value3, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, value4, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, EOC.END);\\n\\n // (clustering_0, clustering1) >= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n assertEmptyComposite(bounds.get(1));\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) >= (1, 2, 3, 4)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, value3, EOC.END);\\n assertComposite(bounds.get(3), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, value4, EOC.END);\\n assertComposite(bounds.get(2), value1, value2, EOC.END);\\n assertEmptyComposite(bounds.get(3));\\n\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) <= (1, 2, 3, 4)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1, value2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n assertComposite(bounds.get(1), value1, value2, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, value3, value4, EOC.NONE);\\n assertComposite(bounds.get(3), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, value3, EOC.END);\\n assertComposite(bounds.get(3), value1, EOC.END);\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) < (1, 2, 3, 4)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1, value2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n assertComposite(bounds.get(1), value1, value2, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, value3, value4, EOC.END);\\n assertComposite(bounds.get(3), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, value3, EOC.END);\\n assertComposite(bounds.get(3), value1, EOC.END);\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) > (1, 2, 3, 4) AND (clustering_0, clustering_1) < (2, 3)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2, value3, value4);\\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2, value3);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(5, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, value3, EOC.END);\\n assertComposite(bounds.get(3), value1, EOC.END);\\n assertComposite(bounds.get(4), value2, value3, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(5, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, value4, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, EOC.END);\\n assertComposite(bounds.get(3), value2, EOC.START);\\n assertComposite(bounds.get(4), value2, EOC.END);\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) >= (1, 2, 3, 4) AND (clustering_0, clustering1, clustering_2, clustering_3) <= (4, 3, 2, 1)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2, value3, value4);\\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value4, value3, value2, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(7, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, EOC.START);\\n assertComposite(bounds.get(2), value1, value2, value3, EOC.END);\\n assertComposite(bounds.get(3), value1, EOC.END);\\n assertComposite(bounds.get(4), value4, value3, EOC.START);\\n assertComposite(bounds.get(5), value4, value3, value2, value1, EOC.NONE);\\n assertComposite(bounds.get(6), value4, value3, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(7, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, value3, value4, EOC.END);\\n assertComposite(bounds.get(2), value1, value2, EOC.END);\\n assertComposite(bounds.get(3), value4, EOC.START);\\n assertComposite(bounds.get(4), value4, value3, value2, EOC.START);\\n assertComposite(bounds.get(5), value4, value3, value2, EOC.END);\\n assertComposite(bounds.get(6), value4, EOC.END);\\n }\",\n \"public Region getSiteRegionBounds() {\\n int numSources = eqkRupForecast.getNumSources();\\n\\n double minLat = Double.POSITIVE_INFINITY;\\n double maxLat = Double.NEGATIVE_INFINITY;\\n double minLon = Double.POSITIVE_INFINITY;\\n double maxLon = Double.NEGATIVE_INFINITY;\\n\\n\\n //Going over each and every source in the forecast\\n for (int sourceIndex = 0; sourceIndex < numSources; ++sourceIndex) {\\n // get the ith source\\n ProbEqkSource source = eqkRupForecast.getSource(sourceIndex);\\n int numRuptures = source.getNumRuptures();\\n\\n //going over all the ruptures in the source\\n for (int rupIndex = 0; rupIndex < numRuptures; ++rupIndex) {\\n ProbEqkRupture rupture = source.getRupture(rupIndex);\\n\\n RuptureSurface rupSurface = rupture.getRuptureSurface();\\n\\n //getting the iterator for all points on the rupture\\n ListIterator it = rupSurface.getLocationsIterator();\\n boolean rupInside = false;\\n //looping over all the rupture pt locations and if any of those lies\\n //within the provided distance range then include the rupture in the list.\\n while (it.hasNext()) {\\n Location ptLoc = (Location) it.next();\\n if (region.contains(ptLoc)) {\\n rupInside = true;\\n break;\\n }\\n }\\n it = rupSurface.getLocationsIterator();\\n while (it.hasNext() && rupInside) {\\n Location ptLoc = (Location) it.next();\\n double lat = ptLoc.getLatitude();\\n double lon = ptLoc.getLongitude();\\n double depth = ptLoc.getDepth();\\n if (lat < minLat)\\n minLat = lat;\\n if (lat > maxLat)\\n maxLat = lat;\\n if (lon < minLon)\\n minLon = lon;\\n if (lon > maxLon)\\n maxLon = lon;\\n if (depth > maxDepth)\\n maxDepth = depth;\\n }\\n }\\n }\\n return new Region(\\n \\t\\tnew Location(minLat, minLon),\\n \\t\\tnew Location(maxLat, maxLon));\\n }\",\n \"public Clusters()\\r\\n\\t{\\r\\n\\t\\tcluster = new boolean[MAX_CLUSTERS];\\r\\n\\t}\",\n \"@Test\\n public void testBoundsAsCompositesWithMultiSliceRestrictionsWithTwoClusteringColumn()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n\\n // (clustering_0, clustering1) > (1, 2)\\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n // (clustering_0, clustering1) >= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n // (clustering_0, clustering1) <= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n\\n // (clustering_0, clustering1) < (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n\\n // (clustering_0, clustering1) > (1, 2) AND (clustering_0) < (2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2);\\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.START);\\n\\n // (clustering_0, clustering1) >= (1, 2) AND (clustering_0, clustering1) <= (2, 1)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value2, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, value1, EOC.END);\\n }\",\n \"@Override\\n\\tpublic void buildBVH() {\\n\\t\\tif(this.bvhObjList.size()<=4) {\\n\\t\\t}else {\\n\\t\\t BVH nebt1 = new BVH(this.bvHi);\\n\\t\\t BVH nebt2 = new BVH(this.bvHi);\\n\\t\\tint tmp = this.calculateSplitDimension(this.bvhBox.getMax().sub(this.bvhBox.getMin()));\\n\\t\\tfloat splitpos;\\n\\t\\tif(tmp==0) {\\n\\t\\t\\tsplitpos = this.calculateMinMax().b.avg(this.calculateMinMax().a).x();\\n\\t\\t}else if(tmp==1) {\\n\\t\\t\\tsplitpos = this.calculateMinMax().b.avg(this.calculateMinMax().a).y();\\n\\t\\t}else {\\n\\t\\t\\tsplitpos = this.calculateMinMax().b.avg(this.calculateMinMax().a).z();\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\tthis.distributeObjects(nebt1, nebt2, tmp, splitpos);\\n\\t\\tthis.bvHi.add(nebt1);\\n\\t\\tthis.neb1 = bvHi.indexOf(nebt1);\\n\\t\\tthis.bvHi.add(nebt2);\\n\\t\\tthis.neb2 = bvHi.indexOf(nebt2);\\n\\t\\tnebt2.buildBVH();\\n\\t\\tnebt1.buildBVH();\\n\\n\\t\\t}\\n\\t}\",\n \"private void buildTree(int nodeNum, AABB nodeBounds,\\n ArrayList allPrimBounds,\\n IntArray primNums, int nPrims, int depth,\\n int badRefines) {\\n if (nPrims <= maxPrims || depth == 0) {\\n if ((nPrims > 16) && (depth == 0)) {\\n System.out.println(\\\"reached max. KdTree depth with \\\" + nPrims + \\n \\\" primitives\\\");\\n }\\n \\n nodesW.add(makeLeaf(primNums, nPrims, primitives));\\n totalPrims += nPrims;\\n totalDepth += (maxDepth - depth);\\n totalLeafs += 1;\\n return;\\n }\\n \\n /* Split - Position bestimmen */\\n \\n int bestAxis = -1, bestOffset = -1;\\n float bestCost = Float.POSITIVE_INFINITY;\\n float oldCost = isectCost * (float)nPrims;\\n Vector d = nodeBounds.max.sub(nodeBounds.min);\\n float totalSA = (2.f * (d.x*d.y + d.x*d.z + d.y*d.z));\\n float invTotalSA = 1.f / totalSA;\\n \\n /* Achse wählen */\\n int axis = d.dominantAxis();\\n int retries = 0;\\n boolean retry = false;\\n ArrayList edges = null;\\n \\n// final int splitCount = edges[axis].length;\\n \\n do {\\n edges = mkEdges(allPrimBounds, primNums, axis);\\n Collections.sort(edges);\\n final int splitCount = edges.size();\\n \\n// java.util.Arrays.sort(edges[axis], 0, splitCount);\\n \\n /* beste Split - Position für diese Achse finden */\\n int nBelow = 0, nAbove = nPrims;\\n \\n for (int i = 0; i < splitCount; ++i) {\\n if (edges.get(i).type == EdgeType.END) --nAbove;\\n float edget = edges.get(i).t;\\n \\n if (edget > nodeBounds.min.get(axis) &&\\n edget < nodeBounds.max.get(axis)) {\\n // Compute cost for split at _i_th edge\\n int otherAxis[][] = { {1,2}, {0,2}, {0,1} };\\n int otherAxis0 = otherAxis[axis][0];\\n int otherAxis1 = otherAxis[axis][1];\\n \\n float belowSA = 2 * (d.get(otherAxis0) * d.get(otherAxis1) +\\n (edget - nodeBounds.min.get(axis)) *\\n (d.get(otherAxis0) + d.get(otherAxis1)));\\n \\n float aboveSA = 2 * (d.get(otherAxis0) * d.get(otherAxis1) +\\n (nodeBounds.max.get(axis) - edget) *\\n (d.get(otherAxis0) + d.get(otherAxis1)));\\n \\n float pBelow = belowSA * invTotalSA;\\n float pAbove = aboveSA * invTotalSA;\\n \\n float eb = (nAbove == 0 || nBelow == 0) ? emptyBonus : 0.f;\\n float cost = traversalCost + isectCost * (1.f - eb) *\\n (pBelow * nBelow + pAbove * nAbove);\\n \\n if (cost < bestCost) {\\n /* neuer bester gefunden */\\n bestCost = cost;\\n bestAxis = axis;\\n bestOffset = i;\\n }\\n }\\n \\n if (edges.get(i).type == EdgeType.START) ++nBelow;\\n }\\n \\n if (!(nBelow == nPrims && nAbove == 0))\\n throw new IllegalStateException(\\\"hmm\\\");\\n \\n retry = ((bestAxis == -1) && (retries < 2));\\n \\n if (retry) {\\n ++retries;\\n axis = (axis+1) % 3;\\n }\\n \\n } while (retry);\\n \\n if (bestCost > oldCost) ++badRefines;\\n if ((bestCost > 4.f * oldCost && nPrims < 16) ||\\n bestAxis == -1 || badRefines == 3) {\\n nodesW.add(makeLeaf(primNums, nPrims, primitives));\\n if (nPrims > 16)\\n System.out.println(\\\"aborting KdTree build recursion (bc=\\\" +\\n bestCost + \\\", oc=\\\" + oldCost + \\\", #prims=\\\" + \\n nPrims + \\\", br=\\\" + badRefines + \\\")\\\");\\n totalPrims += nPrims;\\n totalDepth += (maxDepth - depth);\\n totalLeafs += 1;\\n return;\\n }\\n \\n /* Primitive nach oben / unten sortieren */\\n int n0 = 0, n1 = 0;\\n \\n final ArrayList prims0Tmp = new ArrayList();\\n final ArrayList prims1Tmp = new ArrayList();\\n \\n for (int i = 0; i < bestOffset; ++i) {\\n if (edges.get(i).type == EdgeType.START) {\\n prims0Tmp.add(edges.get(n0++).primNum);\\n// prims0.set(n0++, edges[bestAxis][i].primNum);\\n }\\n }\\n \\n for (int i = bestOffset + 1; i < edges.size(); ++i) {\\n if (edges.get(i).type == EdgeType.END) {\\n prims1Tmp.add(edges.get(n1++).primNum);\\n// prims1.set(n1++, edges[bestAxis][i].primNum);\\n }\\n }\\n \\n /* rekursiver Abstieg */\\n float tsplit = edges.get(bestOffset).t;\\n \\n nodesW.add(makeInterior(bestAxis, tsplit));\\n \\n AABB bounds[] = nodeBounds.split(tsplit, bestAxis);\\n \\n final IntArray prims0 = new IntArray(prims0Tmp.size());\\n for (int i=0; i < prims0Tmp.size(); i++) {\\n prims0.set(i, prims0Tmp.get(i));\\n }\\n \\n final IntArray prims1 = new IntArray(prims1Tmp.size());\\n for (int i=0; i < prims1Tmp.size(); i++) {\\n prims1.set(i, prims1Tmp.get(i));\\n }\\n \\n buildTree(nodeNum+1, bounds[0], allPrimBounds,\\n prims0, n0, depth-1, badRefines);\\n \\n nodesW.get(nodeNum).setAboveChild(nodesW.size());\\n \\n buildTree(nodesW.size(), bounds[1], allPrimBounds,\\n prims1, n1, depth-1, badRefines);\\n }\",\n \"private void calculateChunkBounds()\\n\\t{\\n\\t\\tchunkBounds[BOUND_LEFT] = ChunkUtils.convertXCoord((int) (cameraX - (viewportWidth / zoom) / ChunkUtils.LOADING_DISTANCE_FACTOR));\\n\\t\\tchunkBounds[BOUND_RIGHT] = ChunkUtils.convertXCoord((int) (cameraX + (viewportWidth/zoom)/ChunkUtils.LOADING_DISTANCE_FACTOR));\\n\\t\\tchunkBounds[BOUND_BOTTOM] = ChunkUtils.convertYCoord((int) (cameraY - (viewportHeight/zoom)/ChunkUtils.LOADING_DISTANCE_FACTOR));\\n\\t\\tchunkBounds[BOUND_TOP] = ChunkUtils.convertYCoord((int) (cameraY + (viewportHeight/zoom)/ChunkUtils.LOADING_DISTANCE_FACTOR));\\n\\t}\",\n \"@Override\\n protected void addBounds ()\\n {\\n ParticleSystemConfig.Layer psconfig = (ParticleSystemConfig.Layer)_config;\\n GroupPriority priorityMode = psconfig.priorityMode;\\n if (priorityMode == null) {\\n _bounds.getCenter(_center);\\n }\\n super.addBounds();\\n\\n // add layer bounds to group bounds, if applicable\\n if (priorityMode != null) {\\n ((ParticleSystem)_parentScope).getGroupBounds(\\n priorityMode.group).addLocal(_bounds);\\n }\\n }\",\n \"private BranchGroup createSceneGraph() {\\n\\n\\t\\t// create the main BranchGroup\\n\\t\\tBranchGroup objRoot = new BranchGroup();\\n\\n\\t\\tobjRoot.setCapability(TransformGroup.ALLOW_TRANSFORM_WRITE);\\n\\t\\tobjRoot.setCapability(TransformGroup.ALLOW_TRANSFORM_READ);\\n\\n\\t\\t// reckon the size of the graph\\n\\t\\tint nbRules = rules.length;\\n\\n\\t\\tfloat[] maxC = new float[criteres.length];\\n\\t\\tfloat[] minC = new float[criteres.length];\\n\\n\\t\\tint nRule, nCrit;\\n\\t\\tAttribute attr;\\n\\t\\tfloat val;\\n\\t\\tHashtable htAttrs = new Hashtable();\\n\\n\\t\\tfor (nRule = 0; nRule < nbRules; nRule++) {\\n\\t\\t\\t//make a list of all attributes\\n\\t\\t\\tIterator it = (rules[nRule].getCondition()).listIterator();\\n\\t\\t\\twhile (it.hasNext()) {\\n\\t\\t\\t\\tattr = (Attribute) it.next();\\n\\t\\t\\t\\thtAttrs.put(attr.toString(), attr);\\n\\t\\t\\t}\\n\\n\\t\\t\\tattr = rules[nRule].getConclusion();\\n\\t\\t\\thtAttrs.put(attr.toString(), attr);\\n\\n\\t\\t\\t//find min & max of each criteres\\n\\t\\t\\tfor (nCrit = 0; nCrit < criteres.length; nCrit++) {\\n\\t\\t\\t\\tval = (rules[nRule].getCritere(criteres[nCrit]).getValue());\\n\\n\\t\\t\\t\\tif (nRule == 0) {\\n\\t\\t\\t\\t\\tmaxC[nCrit] = val;\\n\\t\\t\\t\\t\\tminC[nCrit] = val;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif (maxC[nCrit] < val)\\n\\t\\t\\t\\t\\t\\tmaxC[nCrit] = val;\\n\\t\\t\\t\\t\\tif (minC[nCrit] > val)\\n\\t\\t\\t\\t\\t\\tminC[nCrit] = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tLinkedList lAttrs = new LinkedList(htAttrs.values());\\n\\t\\tint nbAttrs = lAttrs.size();\\n\\n\\t\\tfloat size = .040f;\\t\\t\\n//\\t\\tfloat size = 0.85f/(nbAttrs+10);\\n//\\t\\tfloat size = 0.05f - (0.0006f * nbRules);\\n\\n\\t\\t// create a new BranchGroup to turn the scene\\n\\t\\tTransform3D tRotateX = new Transform3D();\\n\\t\\ttRotateX.rotX(Math.PI / 6.0d);\\n\\t\\tTransform3D tRotateY = new Transform3D();\\n\\t\\ttRotateY.rotY(-Math.PI / 6.0d);\\n\\t\\ttRotateX.mul(tRotateY);\\n\\t\\tfloat minSize = Math.min(0.75f/(nbAttrs+10), 0.05f - (0.0006f * nbRules));\\n\\n\\n\\n\\t\\tTransform3D tScale = new Transform3D();\\n\\t\\ttScale.setScale(minSize/size);\\n\\t\\ttRotateX.mul(tScale);\\n\\t\\tTransformGroup tgRotate = new TransformGroup(tRotateX);\\n\\n\\t\\tobjRoot.addChild(tgRotate);\\n\\n\\t\\t// create a new BranchGroup \\n\\t\\tBranchGroup bgObjGraph = new BranchGroup();\\n\\n\\t\\ttgRotate.addChild(bgObjGraph);\\n\\n\\t\\t// Draw the graph\\n\\t\\tint nAtt;\\n\\t\\tboolean drawn;\\n\\t\\tRule currentRule;\\n\\t\\tLinkedList ruleLHS;\\n\\t\\tIterator idxRulesLHS;\\n\\t\\tfor (nRule = 0; nRule < nbRules; nRule++) {\\n\\t\\t\\tcurrentRule = rules[nRule];\\n\\t\\t\\tfor (nAtt = 0; nAtt < nbAttrs; nAtt++) {\\n\\t\\t\\t\\tidxRulesLHS = (currentRule.getCondition()).listIterator();\\n\\t\\t\\t\\tdrawn = false;\\n\\t\\t\\t\\tif (currentRule\\n\\t\\t\\t\\t\\t.getConclusion()\\n\\t\\t\\t\\t\\t.equals(((Attribute) lAttrs.get(nAtt)))) {\\n\\t\\t\\t\\t\\t//draw as a conclusion\\t\\n\\t\\t\\t\\t\\tbgObjGraph.addChild(\\n\\t\\t\\t\\t\\t\\tcreateBox(\\n\\t\\t\\t\\t\\t\\t\\t(nRule * size) - (nbRules / 2 * size),\\n\\t\\t\\t\\t\\t\\t\\tnAtt * size,\\n\\t\\t\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\t\\t\\tnew Color3f(Color.RED)));\\n\\t\\t\\t\\t\\tdrawn = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (!drawn) {\\n\\t\\t\\t\\t\\twhile (idxRulesLHS.hasNext()) {\\n\\t\\t\\t\\t\\t\\tif (((Attribute) idxRulesLHS.next())\\n\\t\\t\\t\\t\\t\\t\\t.equals((Attribute) lAttrs.get(nAtt))) {\\n\\t\\t\\t\\t\\t\\t\\t//draw as an attribute\\t\\n\\t\\t\\t\\t\\t\\t\\tbgObjGraph.addChild(\\n\\t\\t\\t\\t\\t\\t\\t\\tcreateBox(\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t(nRule * size) - (nbRules / 2 * size),\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tnAtt * size,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tnew Color3f(Color.green)));\\n\\t\\t\\t\\t\\t\\t\\tdrawn = true;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (!drawn) {\\n\\t\\t\\t\\t\\t//draw as nothing\\t\\n\\t\\t\\t\\t\\tbgObjGraph.addChild(\\n\\t\\t\\t\\t\\t\\tcreateBox(\\n\\t\\t\\t\\t\\t\\t\\t(nRule * size) - (nbRules / 2 * size),\\n\\t\\t\\t\\t\\t\\t\\tnAtt * size,\\n\\t\\t\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\t\\t\\tsize / 10,\\n\\t\\t\\t\\t\\t\\t\\tnew Color3f(Color.BLACK)));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// draw criteres values\\n\\t\\t\\t\\tfor (nCrit = 0; nCrit < criteres.length; nCrit++) {\\n\\t\\t\\t\\t\\tval = (rules[nRule].getCritere(criteres[nCrit]).getValue());\\n\\t\\t\\t\\t\\tbgObjGraph.addChild(\\n\\t\\t\\t\\t\\t\\tcreateBox((nRule*size)-(nbRules/2*size),\\n\\t\\t\\t\\t\\t\\t\\t-(nCrit+1)*size,\\n\\t\\t\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\t\\t\\t5*size*nCrit+(val-minC[nCrit])*4*size/(maxC[nCrit]-minC[nCrit]),\\n\\t\\t\\t\\t\\t\\t\\tnew Color3f(ColorArray.colorArray[nCrit + 3])));\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\t//draw rule ID\\t\\n\\t\\t\\tbgObjGraph.addChild(\\n\\t\\t\\t\\tcreateTextY(\\n\\t\\t\\t\\t\\t(nRule * size) - (nbRules / 2 * size),\\n\\t\\t\\t\\t\\tnAtt * size,\\n\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\tcurrentRule.getId(),\\n\\t\\t\\t\\t\\tnew Color3f(Color.WHITE)));\\n\\n\\t\\t}\\n\\n\\t\\t// draw ladder\\n\\t\\tint i;\\n\\t\\tLineArray axis;\\n\\t\\tfor (i = 0; i < 10; i++) {\\n\\t\\t\\taxis = new LineArray(2, LineArray.COORDINATES | LineArray.COLOR_3);\\n\\t\\t\\taxis.setCoordinate(\\n\\t\\t\\t\\t0,\\n\\t\\t\\t\\tnew Point3f(- (nbRules + 4) * size / 2, i * size, -size));\\n\\t\\t\\taxis.setCoordinate(\\n\\t\\t\\t\\t1,\\n\\t\\t\\t\\tnew Point3f((nbRules + 4) * size / 2, i * size, -size));\\n\\t\\t\\taxis.setColor(0, new Color3f(1f, 0f, 1f));\\n\\t\\t\\taxis.setColor(1, new Color3f(1f, 0f, 1f));\\n\\n\\t\\t\\tbgObjGraph.addChild(new Shape3D(axis));\\n\\t\\t}\\n\\n\\t\\t//draw min/max\\n\\t\\tfor (nCrit = 0; nCrit < criteres.length; nCrit++) {\\n\\t\\t\\tbgObjGraph.addChild(\\n\\t\\t\\t\\tcreateTextScale(\\n\\t\\t\\t\\t\\t(nbRules + 5) * size / 2,\\n\\t\\t\\t\\t\\tnCrit * 5 * size - size / 2,\\n\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\t(new Float(minC[nCrit])).toString(),\\n\\t\\t\\t\\t\\tnew Color3f(ColorArray.colorArray[nCrit + 3])));\\n\\t\\t\\tbgObjGraph.addChild(\\n\\t\\t\\t\\tcreateTextScale(\\n\\t\\t\\t\\t\\t(nbRules + 5) * size / 2,\\n\\t\\t\\t\\t\\tnCrit * 5 * size + 4 * size - size / 2,\\n\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\t(new Float(maxC[nCrit])).toString(),\\n\\t\\t\\t\\t\\tnew Color3f(ColorArray.colorArray[nCrit + 3])));\\n\\t\\t\\tbgObjGraph.addChild(\\n\\t\\t\\t\\tcreateTextScale(\\n\\t\\t\\t\\t\\t(nbRules + 8) * size / 2,\\n\\t\\t\\t\\t\\tnCrit * 5 * size + 2 * size - size / 2,\\n\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\tcriteres[nCrit],\\n\\t\\t\\t\\t\\tnew Color3f(ColorArray.colorArray[nCrit + 3])));\\n\\n\\t\\t}\\n\\n\\t\\t// write attributes\\n\\t\\tfor (nAtt = 0; nAtt < nbAttrs; nAtt++) {\\n\\t\\t\\tbgObjGraph.addChild(\\n\\t\\t\\t\\tcreateTextX(\\n\\t\\t\\t\\t\\t(nRule * size) + size - (nbRules / 2 * size),\\n\\t\\t\\t\\t\\tnAtt * size + size / 3,\\n\\t\\t\\t\\t\\tsize,\\n\\t\\t\\t\\t\\t((Attribute) lAttrs.get(nAtt)).toString(),\\n\\t\\t\\t\\t\\tnew Color3f(Color.WHITE)));\\n\\t\\t}\\n\\n\\n\\t\\t// draw legend\\n\\t\\tbgObjGraph.addChild(createBox(- (nbRules / 2 * size),(nbAttrs+5) * size,size,size,new Color3f(Color.green)));\\n\\t\\tbgObjGraph.addChild(createTextX( size - (nbRules / 2 * size),(nbAttrs+5) * size + size / 3,size,\\\"ANTECEDENT\\\",new Color3f(Color.WHITE)));\\n\\t\\tbgObjGraph.addChild(createBox(- (nbRules / 2 * size),(nbAttrs+7) * size,size,size,new Color3f(Color.red)));\\n\\t\\tbgObjGraph.addChild(createTextX( size - (nbRules / 2 * size),(nbAttrs+7) * size + size / 3,size,\\\"CONSEQUENT\\\",new Color3f(Color.WHITE)));\\n\\t\\t\\t\\n\\n\\t\\treturn objRoot;\\n\\t}\",\n \"public LatLngBounds setupBounds(){\\n\\t\\t\\n\\t\\t\\n\\t\\tdouble deltaLat = 0.000015; // correction value\\n\\t\\t\\n\\t\\tLatLng northEast = new LatLng(60.1876397959336 + (2.4 * deltaLat), 24.8207008838576);\\n\\t\\tLatLng southWest = new LatLng(60.1866756699501 + deltaLat, 24.8172971606177);\\n\\t\\t\\n\\t\\t\\n\\t\\t// 60.1866756699501\\n\\t\\treturn new LatLngBounds(southWest, northEast);\\n\\t}\",\n \"public void buildMap() {\\n // CUBES ENGINE INITIALIZATION MOVED TO APPSTATE METHOD\\n // Here we init cubes engine\\n CubesTestAssets.registerBlocks();\\n CubesSettings blockSettings = CubesTestAssets.getSettings(this.app);\\n blockSettings.setBlockSize(5);\\n //When blockSize = 5, global coords should be multiplied by 3 \\n this.blockScale = 3.0f;\\n this.halfBlockStep = 0.5f;\\n \\n testTerrain = new BlockTerrainControl(CubesTestAssets.getSettings(this.app), new Vector3Int(4, 1, 4));\\n testNode = new Node();\\n int wallHeight = 3;\\n //testTerrain.setBlockArea(new Vector3Int(0, 0, 0), new Vector3Int(32, 1, 64), CubesTestAssets.BLOCK_STONE);\\n this.testTerrain.setBlockArea( new Vector3Int(3,0,43), new Vector3Int(10,1,10), CubesTestAssets.BLOCK_STONE); // Zone 1 Floor\\n this.testTerrain.setBlockArea( new Vector3Int(3,1,43), new Vector3Int(10,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // South Wall\\n this.testTerrain.setBlockArea( new Vector3Int(3,1,52), new Vector3Int(10,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // North Wall\\n this.testTerrain.setBlockArea( new Vector3Int(3,1,43), new Vector3Int(1,wallHeight,10), CubesTestAssets.BLOCK_WOOD); // West Wall\\n this.testTerrain.setBlockArea( new Vector3Int(12,1,43), new Vector3Int(1,wallHeight,10), CubesTestAssets.BLOCK_WOOD); // East Wall\\n \\n this.testTerrain.removeBlockArea( new Vector3Int(12,1,46), new Vector3Int(1,wallHeight,4)); // Door A\\n \\n this.testTerrain.setBlockArea( new Vector3Int(12,0,45), new Vector3Int(13,1,6), CubesTestAssets.BLOCK_STONE); // Zone 2 Floor A\\n this.testTerrain.setBlockArea( new Vector3Int(12,1,45), new Vector3Int(8,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // South Wall\\n this.testTerrain.setBlockArea( new Vector3Int(12,1,50), new Vector3Int(13,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // North Wall\\n this.testTerrain.setBlockArea(new Vector3Int(19,0,42), new Vector3Int(6,1,3), CubesTestAssets.BLOCK_STONE); // Zone 2 Floor B\\n this.testTerrain.setBlockArea( new Vector3Int(19,1,42), new Vector3Int(1,wallHeight,3), CubesTestAssets.BLOCK_WOOD); //\\n this.testTerrain.setBlockArea( new Vector3Int(24,1,42), new Vector3Int(1,wallHeight,9), CubesTestAssets.BLOCK_WOOD); //\\n \\n this.testTerrain.setBlockArea( new Vector3Int(15,0,26), new Vector3Int(18,1,17), CubesTestAssets.BLOCK_STONE); // Zone 3 Floor\\n this.testTerrain.setBlockArea( new Vector3Int(15,1,42), new Vector3Int(18,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // South Wall\\n this.testTerrain.setBlockArea( new Vector3Int(15,1,26), new Vector3Int(18,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // North Wall\\n this.testTerrain.setBlockArea( new Vector3Int(15,1,26), new Vector3Int(1,wallHeight,17), CubesTestAssets.BLOCK_WOOD); // West Wall\\n this.testTerrain.setBlockArea( new Vector3Int(32,1,26), new Vector3Int(1,wallHeight,17), CubesTestAssets.BLOCK_WOOD); // East Wall\\n \\n this.testTerrain.removeBlockArea( new Vector3Int(20,1,42), new Vector3Int(4,wallHeight,1)); // Door B\\n this.testTerrain.removeBlockArea( new Vector3Int(15,1,27), new Vector3Int(1,wallHeight,6)); // Door C\\n \\n this.testTerrain.setBlockArea( new Vector3Int(10,0,26), new Vector3Int(5,1,8), CubesTestAssets.BLOCK_STONE); // Zone 4 Floor A\\n this.testTerrain.setBlockArea( new Vector3Int(10,1,26), new Vector3Int(5,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // South Wall\\n this.testTerrain.setBlockArea( new Vector3Int(3,0,18), new Vector3Int(8,1,16), CubesTestAssets.BLOCK_STONE); // Zone 4 Floor B\\n this.testTerrain.setBlockArea( new Vector3Int(3,1,18), new Vector3Int(1,wallHeight,16), CubesTestAssets.BLOCK_WOOD); // East Wall\\n this.testTerrain.setBlockArea( new Vector3Int(10,1,18), new Vector3Int(1,wallHeight,9), CubesTestAssets.BLOCK_WOOD); // West Wall\\n this.testTerrain.setBlockArea( new Vector3Int(3,1,33), new Vector3Int(13,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // North Wall\\n \\n this.testTerrain.setBlockArea( new Vector3Int(1,0,5), new Vector3Int(26,1,14), CubesTestAssets.BLOCK_STONE); // Zone 5\\n this.testTerrain.setBlockArea( new Vector3Int(1,1,18), new Vector3Int(26,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // South Wall\\n this.testTerrain.setBlockArea( new Vector3Int(1,1,5), new Vector3Int(26,wallHeight,1), CubesTestAssets.BLOCK_WOOD); // North Wall\\n this.testTerrain.setBlockArea( new Vector3Int(1,1,5), new Vector3Int(1,wallHeight,14), CubesTestAssets.BLOCK_WOOD); // West Wall\\n this.testTerrain.setBlockArea( new Vector3Int(26,1,5), new Vector3Int(1,wallHeight,14), CubesTestAssets.BLOCK_WOOD); // East Wall\\n \\n this.testTerrain.removeBlockArea( new Vector3Int(4,1,18), new Vector3Int(6,wallHeight,1)); // Door E\\n \\n // Populate the world with spawn points\\n this.initSpawnPoints();\\n \\n //Add voxel world/map to collisions\\n testTerrain.addChunkListener(new BlockChunkListener(){\\n @Override\\n public void onSpatialUpdated(BlockChunkControl blockChunk){\\n Geometry optimizedGeometry = blockChunk.getOptimizedGeometry_Opaque();\\n phyTerrain = optimizedGeometry.getControl(RigidBodyControl.class);\\n if(phyTerrain == null){\\n phyTerrain = new RigidBodyControl(0);\\n optimizedGeometry.addControl(phyTerrain);\\n bulletAppState.getPhysicsSpace().add(phyTerrain);\\n }\\n phyTerrain.setCollisionShape(new MeshCollisionShape(optimizedGeometry.getMesh()));\\n }\\n });\\n \\n testNode.addControl(testTerrain);\\n rootNode.attachChild(testNode);\\n }\",\n \"@Test\\n public void testBoundsAsCompositesWithOneEqRestrictionsAndTwoClusteringColumns()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC);\\n\\n ByteBuffer clustering_0 = ByteBufferUtil.bytes(1);\\n Restriction eq = newSingleEq(cfMetaData, 0, clustering_0);\\n\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(eq);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), clustering_0, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), clustering_0, EOC.END);\\n }\",\n \"@Test\\n public void testBoundsAsCompositesWithMultiSliceRestrictionsWithTwoAscendingAndTwoDescendingClusteringColumns()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC, Sort.DESC, Sort.DESC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\\n ByteBuffer value4 = ByteBufferUtil.bytes(4);\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) > (1, 2, 3, 4)\\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2, value3, value4);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.START);\\n assertEmptyComposite(bounds.get(1));\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2, clustering_3) > (2, 3, 4)\\n Restriction eq = newSingleEq(cfMetaData, 0, value1);\\n slice = newMultiSlice(cfMetaData, 1, Bound.START, false, value2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n restrictions = restrictions.mergeWith(eq);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2, clustering_3) > (2, 3, 4)\\n Restriction in = newSingleIN(cfMetaData, 0, value1, value2);\\n slice = newMultiSlice(cfMetaData, 1, Bound.START, false, value2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n restrictions = restrictions.mergeWith(in);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n assertComposite(bounds.get(2), value2, value2, EOC.START);\\n assertComposite(bounds.get(3), value2, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(4, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.START);\\n assertComposite(bounds.get(1), value1, EOC.END);\\n assertComposite(bounds.get(2), value2, value2, value3, value4, EOC.START);\\n assertComposite(bounds.get(3), value2, EOC.END);\\n\\n // (clustering_0, clustering1) >= (1, 2)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) >= (1, 2, 3, 4)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.END);\\n assertEmptyComposite(bounds.get(1));\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) <= (1, 2, 3, 4)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1, value2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n assertComposite(bounds.get(1), value1, value2, value3, value4, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) < (1, 2, 3, 4)\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1, value2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n assertComposite(bounds.get(1), value1, value2, value3, value4, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) > (1, 2, 3, 4) AND (clustering_0, clustering_1) < (2, 3)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1, value2, value3, value4);\\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2, value3);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.START);\\n assertComposite(bounds.get(1), value2, value3, EOC.START);\\n\\n // (clustering_0, clustering1, clustering_2, clustering_3) >= (1, 2, 3, 4) AND (clustering_0, clustering1, clustering_2, clustering_3) <= (4, 3, 2, 1)\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1, value2, value3, value4);\\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value4, value3, value2, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.START);\\n assertComposite(bounds.get(1), value1, value2, EOC.END);\\n assertComposite(bounds.get(2), value4, value3, value2, value1, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.END);\\n assertComposite(bounds.get(1), value4, value3, EOC.START);\\n assertComposite(bounds.get(2), value4, value3, EOC.END);\\n }\",\n \"@Test\\n public void testBoundsAsCompositesWithMultiEqAndSingleSliceRestrictions()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC, Sort.ASC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\\n\\n // (clustering_0, clustering_1) = (1, 2) AND clustering_2 > 3\\n Restriction multiEq = newMultiEq(cfMetaData, 0, value1, value2);\\n Restriction singleSlice = newSingleSlice(cfMetaData, 2, Bound.START, false, value3);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(multiEq).mergeWith(singleSlice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, EOC.END);\\n }\",\n \"public void buildMembership() {\\r\\n\\t\\tif (pointList == null || pointList.isEmpty())\\r\\n\\t\\t\\treturn;\\r\\n\\r\\n\\t\\t/* clear previous membership records */\\r\\n\\t\\tfor (Group g : groupList)\\r\\n\\t\\t\\tg.memberList.clear();\\r\\n\\r\\n\\t\\t/* update membership */\\r\\n\\t\\tList distanceList;\\r\\n\\t\\tfor (int i = 0; i < pointList.size(); i++) {\\r\\n\\t\\t\\tdistanceList = new ArrayList<>();\\r\\n\\r\\n\\t\\t\\tfor (double[] centerPoint : centerList)\\r\\n\\t\\t\\t\\tdistanceList.add(MathLib.Distance.euclidean(centerPoint, pointList.get(i)));\\r\\n\\t\\t\\tint idx = MathLib.getRank(distanceList, true)[0];\\r\\n\\t\\t\\tcenterAssignment.set(i, idx);\\r\\n\\t\\t\\tgroupList.get(idx).memberList.add(i);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public ReferencedEnvelope getBounds(){\\n if(bounds==null){\\n // Create Null envelope\\n this.bounds = new ReferencedEnvelope(getCRS());\\n // First try to find the BBOX definition in the gisNode directly\\n try{\\n if(gisNode.hasProperty(INeoConstants.PROPERTY_BBOX_NAME)){\\n double[] bbox = (double[])gisNode.getProperty(INeoConstants.PROPERTY_BBOX_NAME);\\n this.bounds = new ReferencedEnvelope(bbox[0],bbox[1],bbox[2],bbox[3],crs);\\n }else{\\n System.err.println(\\\"No BBox defined in the GeoNeo object\\\");\\n }\\n }catch(Exception bbox_e){\\n System.err.println(\\\"Failed to interpret BBOX: \\\"+bbox_e.getMessage());\\n bbox_e.printStackTrace(System.err);\\n }\\n // Secondly, if bounds is still empty, try find all feature geometries and calculate bounds\\n try{\\n if(this.bounds.isNull()){\\n // Try to create envelope from any data referenced by the gisNode\\n for(GeoNode node:getGeoNodes()){\\n //TODO: support high dimensions\\n this.bounds.expandToInclude(node.getCoords()[0], node.getCoords()[1]);\\n }\\n }\\n }catch(Exception bbox_e){\\n System.err.println(\\\"Failed to interpret BBOX: \\\"+bbox_e.getMessage());\\n bbox_e.printStackTrace(System.err);\\n }\\n }\\n return bounds;\\n }\",\n \"private void createGWBuildings()\\n\\t{\\n\\t\\t//Generate block 0 (50x50)\\n\\t\\t//(7,7)-(57,57)\\n\\t\\tmakeBlocker0();\\n\\n\\t\\t//Generate block 1 (50x50)\\n\\t\\t//(64,7)-(114,57)\\n\\t\\tmakeSEH();\\n\\t\\tmakeFullBright();\\n\\t\\tmakeKennedy();\\n\\t\\tmakeMunson();\\n\\n\\t\\t//Generate block 2 (80x50)\\n\\t\\t//(121,7)-(201,57)\\n\\t\\tmakeAcademicCenter();\\n\\t\\tmakeRomePhilips();\\n\\t\\tmakeDistrict();\\n\\t\\tmakeMarvin();\\n\\t\\tmakeLafayette();\\n\\n\\t\\t//Generate block 3 (65x50)\\n\\t\\t//(208,7)-(273,57)\\n\\t\\tmake2000Penn();\\n\\t\\tmakeSMPA();\\n\\t\\tmakeBlocker3();\\n\\n\\t\\t//Generate block 4 (63x50)\\n\\t\\t//(280,7)-(343,57)\\n\\t\\tmakeBlocker4();\\n\\n\\t\\t//Generate block 5 (50x60)\\n\\t\\t//(7,64)-(57,124)\\n\\t\\tmakeAmsterdam();\\n\\t\\tmakeHealWell();\\n\\t\\tmakeBlocker5();\\n\\n\\t\\t//Generate block 6 (50x60)\\n\\t\\t//(64,64)-(114,124)\\n\\t\\tmakeTompkins();\\n\\t\\tmakeMadison();\\n\\t\\tmakeDuquesAndFunger();\\n\\n\\t\\t//Generate block 7 (80x60)\\n\\t\\t//(121,64)-(201,124)\\n\\t\\tmakeGelman();\\n\\t\\tmakeLisner();\\n\\t\\tmakeStaughton();\\n\\t\\tmakeMonroe();\\n\\n\\t\\t//Generate block 8 (65x60)\\n\\t\\t//(208,64)-(273,124)\\n\\t\\tmakeCorcoran();\\n\\t\\tmakeLawSchool();\\n\\t\\tmakeLisnerHall();\\n\\t\\tmakeTextileMuseum();\\n\\n\\t\\t//Generate block 9 (63x60)\\n\\t\\t//(280,64)-(343,124)\\n\\t\\tmakeBlocker9();\\n\\n\\t\\t//Generate block 10 (50x50)\\n\\t\\t//(7,131)-(57,181)\\n\\t\\tmakeShenkman();\\n\\t\\tmakeBlocker10();\\n\\n\\t\\t//Generate block 11 (50x50)\\n\\t\\t//(64,131)-(114,181)\\n\\t\\tmakeTownHouses();\\n\\t\\tmakeSmithCenter();\\n\\n\\t\\t//Generate block 12 (80x50)\\n\\t\\t//(121,131)-(201,181)\\n\\t\\tmakeSouthHall();\\n\\t\\tmakeGuthridge();\\n\\t\\tmakeBlocker12();\\n\\n\\t\\t//Generate block 13 (65x50)\\n\\t\\t//(208,131)-(273,181)\\n\\t\\tmakeBlocker13();\\n\\t\\tmakeFSK();\\n\\t\\tmakePatomac();\\n\\n\\t\\t//Generate block 14 (63x50)\\n\\t\\t//(280,131)-(343,181)\\n\\t\\tmakeBlocker14();\\n\\n\\t\\t//Generate block 15 (50x57)\\n\\t\\t//(7,188)-(57,245)\\n\\t\\tmakeBlocker15();\\n\\n\\t\\t//Generate block 16 (50x57)\\n\\t\\t//(64,188)-(114,245)\\n\\t\\tmakeIHouse();\\n\\t\\tmakeBlocker16();\\n\\n\\t\\t//Generate block 17 (80x57)\\n\\t\\t//(121,188)-(201,245)\\n\\t\\tmakeBlocker17();\\n\\t\\tmakeDakota();\\n\\n\\t\\t//Generate block 18 (65x57)\\n\\t\\t//(208,188)-(273,245)\\n\\t\\tmakeBlocker18();\\n\\n\\t\\t//Generate block 19 (63x57)\\n\\t\\t//(280,188)-(343,245)\\n\\t\\tmakeBlocker19();\\n\\t\\tmakeElliot();\\n\\t\\tmakeThurston();\\n\\t}\",\n \"protected Rectangle determineBounds() {\\n return getNetTransform().createTransformedShape( _bounds ).getBounds();\\n }\",\n \"public void setCentroids(int n, double lower, double upper);\",\n \"@Test\\n public void testBoundsAsCompositesWithSliceRestrictionsAndOneDescendingClusteringColumn()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.DESC, Sort.DESC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n\\n Restriction slice = newSingleSlice(cfMetaData, 0, Bound.START, false, value1);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.START, true, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.END, true, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.END, false, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.START, false, value1);\\n Restriction slice2 = newSingleSlice(cfMetaData, 0, Bound.END, false, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.START, true, value1);\\n slice2 = newSingleSlice(cfMetaData, 0, Bound.END, true, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n }\",\n \"private void buildWalls() {\\n for (Position floor : floors) {\\n addWall(floor.xCoordinate, floor.yCoordinate);\\n }\\n }\",\n \"private void run()\\r\\n {\\n List clusters = createClusters();\\r\\n\\r\\n //compute MAX_WIDTH and MAX_HEIGHT\\r\\n computeCloudDimensions(clusters);\\r\\n\\r\\n double scale = 1.05;\\r\\n //try to layout words\\r\\n while (!doPacking(clusters))\\r\\n {\\r\\n //increase cloud dimensions\\r\\n MAX_WIDTH *= scale;\\r\\n MAX_HEIGHT *= scale;\\r\\n }\\r\\n\\r\\n doPacking(clusters);\\r\\n }\",\n \"@Test\\n public void testBoundsAsCompositesWithOneInRestrictionsAndOneClusteringColumn()\\n {\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\\n\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC);\\n\\n Restriction in = newSingleIN(cfMetaData, 0, value1, value2, value3);\\n\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(in);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n assertComposite(bounds.get(1), value2, EOC.START);\\n assertComposite(bounds.get(2), value3, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(3, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n assertComposite(bounds.get(1), value2, EOC.END);\\n assertComposite(bounds.get(2), value3, EOC.END);\\n }\",\n \"private static native long createEdgeBoxes_0(float alpha, float beta, float eta, float minScore, int maxBoxes, float edgeMinMag, float edgeMergeThr, float clusterMinMag, float maxAspectRatio, float minBoxArea, float gamma, float kappa);\",\n \"@Test\\n public void testBoundsAsCompositesWithMultiSliceRestrictionsWithOneDescendingClusteringColumn()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.DESC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n\\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1);\\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1);\\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n }\",\n \"public void reinitiallizeDistanceFunctionInside() {\\n\\t\\tint i, j;\\r\\n\\t\\tfor (i = 0; i < _levelSet.length; i++) {\\r\\n\\t\\t\\tfor (j = 0; j < _levelSet[i].length; j++) {\\r\\n\\t\\t\\t\\tint iPlus = imposeBorder(i + 1, _iSize);\\r\\n\\t\\t\\t\\tint iMinus = imposeBorder(i - 1, _iSize);\\r\\n\\t\\t\\t\\tint jPlus = imposeBorder(j + 1, _iSize);\\r\\n\\t\\t\\t\\tint jMinus = imposeBorder(j - 1, _iSize);\\r\\n\\t\\t\\t\\tif (_levelSet[i][j] <= 0) // // the check for points in region\\r\\n\\t\\t\\t\\t\\t// // the check for points in border\\r\\n\\t\\t\\t\\t\\tif (MatrixMath.anyNeighborIsOutside(_levelSet, i, j, iPlus,\\r\\n\\t\\t\\t\\t\\t\\t\\tiMinus, jPlus, jMinus)) {\\r\\n\\t\\t\\t\\t\\t\\t// points in border are placed in narrowband\\r\\n\\t\\t\\t\\t\\t\\t// _narrowBandInside.add(new Location(i, j));\\r\\n\\t\\t\\t\\t\\t\\t_narrowBandInside.add(new Location(i, j));\\r\\n\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t// and location in distance matrix is set to infinite\\r\\n\\t\\t\\t\\t\\t\\t_levelSet[i][j] = Double.NEGATIVE_INFINITY;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t// iterate until narrow band is empty\\r\\n\\t\\t// OrderByLevelSetValue comparator = new OrderByLevelSetValue();\\r\\n\\t\\t// while (_narrowBandInside.size() > 0) {\\r\\n\\t\\twhile (_narrowBandInside.size() > 0) {\\r\\n\\t\\t\\t// get the maximum value\\r\\n\\t\\t\\t// Location maxVal = _narrowBandInside.last();\\r\\n\\t\\t\\tLocation maxVal = _narrowBandInside.last();\\r\\n\\t\\t\\t// System.out.println(\\\"maxVal \\\" + maxVal);\\r\\n\\t\\t\\t// System.out.println(\\\"_narrowBandInside.contains(maxVal) \\\"\\r\\n\\t\\t\\t// + _narrowBandInside.contains(maxVal));\\r\\n\\t\\t\\t// System.out.println(\\\"maxVal.compareTo(maxVal) \\\"\\r\\n\\t\\t\\t// + maxVal.compareTo(maxVal));\\r\\n\\r\\n\\t\\t\\t// get the neighbors that are still in _faraway\\r\\n\\t\\t\\tint iPlus = imposeBorder(maxVal.i + 1, _iSize);\\r\\n\\t\\t\\tint iMinus = imposeBorder(maxVal.i - 1, _iSize);\\r\\n\\t\\t\\tint jPlus = imposeBorder(maxVal.j + 1, _iSize);\\r\\n\\t\\t\\tint jMinus = imposeBorder(maxVal.j - 1, _iSize);\\r\\n\\t\\t\\ttransferNeighborInside(iPlus, maxVal.j);\\r\\n\\t\\t\\ttransferNeighborInside(iMinus, maxVal.j);\\r\\n\\t\\t\\ttransferNeighborInside(maxVal.i, jPlus);\\r\\n\\t\\t\\ttransferNeighborInside(maxVal.i, jMinus);\\r\\n\\t\\t\\t// remove the value from the narrowband\\r\\n\\t\\t\\t// _narrowBandInside.remove(maxVal);\\r\\n\\t\\t\\t_narrowBandInside.remove(maxVal);\\r\\n\\t\\t}\\r\\n\\t\\t// done\\r\\n\\t}\",\n \"public GJBox2D boundingBox() {\\n\\t\\tdouble xmin = Double.MAX_VALUE;\\n\\t\\tdouble ymin = Double.MAX_VALUE;\\n\\t\\tdouble xmax = Double.MIN_VALUE;\\n\\t\\tdouble ymax = Double.MIN_VALUE;\\n\\n\\t\\t// coordinates of current point\\n\\t\\tdouble x, y;\\n\\t\\t\\n\\t\\t// Iterate on each control point of each segment\\n\\t\\tfor (Segment seg : this.segments) {\\n\\t\\t\\tfor (GJPoint2D p : seg.controlPoints()) {\\n\\t\\t\\t\\t// get current coordinates\\n\\t\\t\\t\\tx = p.x();\\n\\t\\t\\t\\ty = p.y();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// update bounds\\n\\t\\t\\t\\txmin = Math.min(xmin, x);\\n\\t\\t\\t\\tymin = Math.min(ymin, y);\\n\\t\\t\\t\\txmax = Math.max(xmax, x);\\n\\t\\t\\t\\tymax = Math.max(ymax, y);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// createFromCollection a new GJBox2D with the bounds\\n\\t\\treturn new GJBox2D(xmin, xmax, ymin, ymax);\\n\\t}\",\n \"private void buildMapArea(MapBuilderBase mapBuilder) {\\n\\t\\tmap = new Tile[width][height];\\n\\n\\t\\tthis.name = mapBuilder.buildMap(map);\\n\\t\\tupdateValues();\\n\\n\\t\\t// TODO: pathfinding precalculations?\\n\\n\\t\\t// Log.debug(\\\"Calculating path maps...\\\");\\n\\t\\t// pointGraph = new PointGraph();\\n\\t\\t// for (int x = 0; x < width; x++) {\\n\\t\\t// for (int y = 0; y < height; y++) {\\n\\t\\t// if (getTileAt(x, y).isPassable)\\n\\t\\t// pointGraph.addVertex(new Vertex(new Point(x, y)));\\n\\t\\t// }\\n\\t\\t// }\\n\\t\\t// pointGraph.calculateEdges();\\n\\t\\t// Log.debug(\\\"done\\\");\\n\\t}\",\n \"public static BsonDocument createPartitionBounds(final BsonValue lower, final BsonValue upper) {\\n BsonDocument partitionBoundary = new BsonDocument();\\n if (lower.getBsonType() != BsonType.MIN_KEY) {\\n partitionBoundary.append(\\\"$gte\\\", lower);\\n }\\n if (upper.getBsonType() != BsonType.MAX_KEY) {\\n partitionBoundary.append(\\\"$lt\\\", upper);\\n }\\n return partitionBoundary;\\n }\",\n \"@Test\\n public void testBoundsAsCompositesWithSliceRestrictionsAndOneClusteringColumn()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n\\n Restriction slice = newSingleSlice(cfMetaData, 0, Bound.START, false, value1);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.START, true, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.END, true, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.END, false, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.START, false, value1);\\n Restriction slice2 = newSingleSlice(cfMetaData, 0, Bound.END, false, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.START);\\n\\n slice = newSingleSlice(cfMetaData, 0, Bound.START, true, value1);\\n slice2 = newSingleSlice(cfMetaData, 0, Bound.END, true, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.END);\\n }\",\n \"@Test\\n public void testBoundsAsCompositesWithOneEqRestrictionsAndOneClusteringColumn()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC);\\n\\n ByteBuffer clustering_0 = ByteBufferUtil.bytes(1);\\n Restriction eq = newSingleEq(cfMetaData, 0, clustering_0);\\n\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(eq);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), clustering_0, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), clustering_0, EOC.END);\\n }\",\n \"Long getResultMaskBoundary();\",\n \"public Bounds(int minX, int minZ, int maxX, int maxZ) {\\n this.minX = minX;\\n this.minZ = minZ;\\n this.maxX = maxX;\\n this.maxZ = maxZ;\\n }\",\n \"private Graph initializeBounds(Graph graphIn)\\n {\\n Random rand = new Random();\\n \\n DEdge[] allEdges = graphIn.listAllEdges();\\n for(DEdge de : allEdges)\\n {\\n de.setLowerb(0);\\n de.setUpperb(rand.nextInt(100));\\n // Use bad networks for performance testing ??\\n }\\n return graphIn;\\n }\",\n \"protected double[] calculateDataBoundingBox() {\\n \\t\\tdouble min_x = Double.MAX_VALUE;\\n \\t\\tdouble min_y = Double.MAX_VALUE;\\n \\t\\tdouble max_x = 0.0D;\\n \\t\\tdouble max_y = 0.0D;\\n \\t\\t// check the points\\n \\t\\tfor (int i=0; i max_x) max_x = p[0][i];\\n \\t\\t\\tif (p[1][i] > max_y) max_y = p[1][i];\\n \\t\\t}\\n \\t\\treturn new double[]{min_x, min_y, max_x, max_y};\\n \\t}\",\n \"@Test\\n public void testBoundsAsCompositesWithSingleEqAndSliceRestrictions()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC, Sort.ASC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\\n ByteBuffer value4 = ByteBufferUtil.bytes(4);\\n ByteBuffer value5 = ByteBufferUtil.bytes(5);\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2) > (2, 3)\\n Restriction singleEq = newSingleEq(cfMetaData, 0, value1);\\n Restriction multiSlice = newMultiSlice(cfMetaData, 1, Bound.START, false, value2, value3);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiSlice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2) > (2, 3) AND (clustering_1) < (4)\\n singleEq = newSingleEq(cfMetaData, 0, value1);\\n multiSlice = newMultiSlice(cfMetaData, 1, Bound.START, false, value2, value3);\\n Restriction multiSlice2 = newMultiSlice(cfMetaData, 1, Bound.END, false, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(multiSlice2).mergeWith(singleEq).mergeWith(multiSlice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value4, EOC.START);\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2) => (2, 3) AND (clustering_1, clustering_2) <= (4, 5)\\n singleEq = newSingleEq(cfMetaData, 0, value1);\\n multiSlice = newMultiSlice(cfMetaData, 1, Bound.START, true, value2, value3);\\n multiSlice2 = newMultiSlice(cfMetaData, 1, Bound.END, true, value4, value5);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(multiSlice2).mergeWith(singleEq).mergeWith(multiSlice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value4, value5, EOC.END);\\n }\",\n \"private Node createVirtualWorldBoundsShape() {\\n \\t\\tPoint3d lower = new Point3d();\\n \\t\\tPoint3d upper = new Point3d();\\n \\t\\tmyVirtualWorldBounds.getLower(lower);\\n \\t\\tmyVirtualWorldBounds.getUpper(upper);\\n \\t\\t\\n \\t\\tdouble[] coordinates = { lower.x, lower.y, lower.z, upper.x, lower.y,\\n \\t\\t\\t\\tlower.z, upper.x, lower.y, upper.z, lower.x, lower.y, upper.z,\\n \\t\\t\\t\\tlower.x, upper.y, lower.z, upper.x, upper.y, lower.z, upper.x,\\n \\t\\t\\t\\tupper.y, upper.z, lower.x, upper.y, upper.z };\\n \\t\\t\\n \\t\\tint[] coordinateIndices = { 0, 1, 1, 2, 2, 3, 3, 0, 4, 5, 5, 6, 6, 7,\\n \\t\\t\\t\\t7, 4, 0, 4, 1, 5, 2, 6, 3, 7 };\\n \\t\\t\\n \\t\\tIndexedLineArray geometry = new IndexedLineArray(\\n \\t\\t\\t\\tcoordinates.length / 3, IndexedLineArray.COORDINATES,\\n \\t\\t\\t\\tcoordinateIndices.length);\\n \\t\\t\\n \\t\\tgeometry.setCoordinates(0, coordinates);\\n \\t\\tgeometry.setCoordinateIndices(0, coordinateIndices);\\n \\t\\t\\n \\t\\treturn new Shape3D(geometry);\\n \\t}\",\n \"public List getBoundingsOfCell() {\\n\\n\\t\\tfloat minXPoint = Float.POSITIVE_INFINITY;\\n\\t\\tfloat maxXPoint = Float.NEGATIVE_INFINITY;\\n\\t\\tfloat minYPoint = Float.POSITIVE_INFINITY;\\n\\t\\tfloat maxYPoint = Float.NEGATIVE_INFINITY;\\n\\n\\t\\tfor (int i = 0; i < face.edges().size(); i++) {\\n\\n\\t\\t\\tDCEL_Edge e = (DCEL_Edge) face.edges().get(i);\\n\\n\\t\\t\\tArc2_Sweep arc = (Arc2_Sweep) e.reference;\\n\\n\\t\\t\\t// Looking for most left located point of cell\\n\\t\\t\\tif (minXPoint > arc.minX().x) {\\n\\t\\t\\t\\tminXPoint = arc.minX().x;\\n\\t\\t\\t}\\n\\t\\t\\t// Looking for most right located point of cell\\n\\t\\t\\tif (maxXPoint < arc.maxX().x) {\\n\\t\\t\\t\\tmaxXPoint = arc.maxX().x;\\n\\t\\t\\t}\\n\\t\\t\\t// Looking for highest located point of cell\\n\\t\\t\\tif (minYPoint > arc.minY().y) {\\n\\t\\t\\t\\tminYPoint = arc.minY().y;\\n\\t\\t\\t}\\n\\t\\t\\t// Looking for lowest located point of cell\\n\\t\\t\\tif (maxYPoint < arc.maxY().y) {\\n\\t\\t\\t\\tmaxYPoint = arc.maxY().y;\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tList boundings = new ArrayList();\\n\\t\\tboundings.add(minXPoint);\\n\\t\\tboundings.add(maxXPoint);\\n\\t\\tboundings.add(minYPoint);\\n\\t\\tboundings.add(maxYPoint);\\n\\t\\treturn boundings;\\n\\n\\t}\",\n \"@Test\\n public void testBoundsAsCompositesWithSingleEqAndMultiEqRestrictions()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC, Sort.ASC, Sort.ASC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\\n ByteBuffer value4 = ByteBufferUtil.bytes(4);\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2) = (2, 3)\\n Restriction singleEq = newSingleEq(cfMetaData, 0, value1);\\n Restriction multiEq = newMultiEq(cfMetaData, 1, value2, value3);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiEq);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\\n\\n // clustering_0 = 1 AND clustering_1 = 2 AND (clustering_2, clustering_3) = (3, 4)\\n singleEq = newSingleEq(cfMetaData, 0, value1);\\n Restriction singleEq2 = newSingleEq(cfMetaData, 1, value2);\\n multiEq = newMultiEq(cfMetaData, 2, value3, value4);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(singleEq).mergeWith(singleEq2).mergeWith(multiEq);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.END);\\n\\n // (clustering_0, clustering_1) = (1, 2) AND clustering_2 = 3\\n singleEq = newSingleEq(cfMetaData, 2, value3);\\n multiEq = newMultiEq(cfMetaData, 0, value1, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiEq);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2) = (2, 3) AND clustering_3 = 4\\n singleEq = newSingleEq(cfMetaData, 0, value1);\\n singleEq2 = newSingleEq(cfMetaData, 3, value4);\\n multiEq = newMultiEq(cfMetaData, 1, value2, value3);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiEq).mergeWith(singleEq2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, value4, EOC.END);\\n }\",\n \"private void updateBoundingBox() {\\n // TODO(sonpham): Optimize this. There is an amazing amount of repetition in this code.\\n double downUnitX = MathUtils.quickCos((float) (anchorAngle + Math.PI));\\n double downUnitY = MathUtils.quickSin((float) (anchorAngle + Math.PI));\\n double sideUnitX = MathUtils.quickCos((float) (anchorAngle + Math.PI / 2));\\n double sideUnitY = MathUtils.quickSin((float) (anchorAngle + Math.PI / 2));\\n\\n double aliveHeight = aliveTroopsMap.size() * 1.0 / width * unitStats.spacing;\\n double fullToAliveRatio = 1.0 * troops.size() / aliveTroopsMap.size() ;\\n\\n double topLeftX = averageX - downUnitX * aliveHeight / 2 - sideUnitX * unitStats.spacing * width / 2;\\n double topLeftY = averageY - downUnitY * aliveHeight / 2 - sideUnitY * unitStats.spacing * width / 2;\\n\\n double topRightX = averageX - downUnitX * aliveHeight / 2 + sideUnitX * unitStats.spacing * width / 2;\\n double topRightY = averageY - downUnitY * aliveHeight / 2 + sideUnitY * unitStats.spacing * width / 2;\\n\\n double healthBotLeftX = averageX + downUnitX * aliveHeight / 2 - sideUnitX * unitStats.spacing * width / 2;\\n double healthBotLeftY = averageY + downUnitY * aliveHeight / 2 - sideUnitY * unitStats.spacing * width / 2;\\n\\n double healthBotRightX = averageX + downUnitX * aliveHeight / 2 + sideUnitX * unitStats.spacing * width / 2;\\n double healthBotRightY = averageY + downUnitY * aliveHeight / 2 + sideUnitY * unitStats.spacing * width / 2;\\n\\n double botLeftX = (healthBotLeftX - topLeftX) * fullToAliveRatio + topLeftX;\\n double botLeftY = (healthBotLeftY - topLeftY) * fullToAliveRatio + topLeftY;\\n\\n double botRightX = (healthBotRightX - topRightX) * fullToAliveRatio + topRightX;\\n double botRightY = (healthBotRightY - topRightY) * fullToAliveRatio + topRightY;\\n\\n aliveBoundingBox[0][0] = topLeftX; aliveBoundingBox[0][1] = topLeftY;\\n aliveBoundingBox[1][0] = topRightX; aliveBoundingBox[1][1] = topRightY;\\n aliveBoundingBox[2][0] = healthBotRightX; aliveBoundingBox[2][1] = healthBotRightY;\\n aliveBoundingBox[3][0] = healthBotLeftX; aliveBoundingBox[3][1] = healthBotLeftY;\\n\\n boundingBox[0][0] = topLeftX; boundingBox[0][1] = topLeftY;\\n boundingBox[1][0] = topRightX; boundingBox[1][1] = topRightY;\\n boundingBox[2][0] = botRightX; boundingBox[2][1] = botRightY;\\n boundingBox[3][0] = botLeftX; boundingBox[3][1] = botLeftY;\\n }\",\n \"@Test\\n public void testBoundsAsCompositesWithMultiSliceRestrictionsWithOneClusteringColumn()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n\\n Restriction slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1);\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, true, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.END, false, value1);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertEmptyComposite(bounds.get(0));\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.START);\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, false, value1);\\n Restriction slice2 = newMultiSlice(cfMetaData, 0, Bound.END, false, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.END);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.START);\\n\\n slice = newMultiSlice(cfMetaData, 0, Bound.START, true, value1);\\n slice2 = newMultiSlice(cfMetaData, 0, Bound.END, true, value2);\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(slice).mergeWith(slice2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, EOC.NONE);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value2, EOC.END);\\n }\",\n \"public List build() {\\n\\t\\treturn this.mapBuilder.build();\\n\\t}\",\n \"public static void main(String[] args)\\r\\n\\t{\\n\\t\\tList locations = new ArrayList();\\r\\n\\t\\tlocations.add(new Location(150, 981));\\r\\n\\t\\tlocations.add(new Location(136, 0));\\r\\n\\t\\tlocations.add(new Location(158, 88));\\r\\n\\t\\tlocations.add(new Location(330, 60));\\r\\n\\t\\tlocations.add(new Location(0, 1001));\\r\\n\\t\\tlocations.add(new Location(150, 0));\\r\\n\\t\\tlocations.add(new Location(0, 0));\\r\\n\\t\\tlocations.add(new Location(0, 0));\\r\\n\\t\\tlocations.add(new Location(0, 0));\\r\\n\\t\\tlocations.add(new Location(446, 88));\\r\\n\\t\\tlocations.add(new Location(562, 88));\\r\\n\\t\\tlocations.add(new Location(256, 88));\\r\\n\\t\\tlocations.add(new Location(678, 88));\\r\\n\\t\\tlocations.add(new Location(794, 88));\\r\\n\\t\\tlocations.add(new Location(0, 1028));\\r\\n\\t\\tlocations.add(new Location(136, 0));\\r\\n\\t\\tlocations.add(new Location(150, 0));\\r\\n\\t\\tlocations.add(new Location(150, 88));\\r\\n\\t\\tlocations.add(new Location(150, 1028));\\r\\n\\t\\tlocations.add(new Location(150, 88));\\r\\n\\t\\tlocations.add(new Location(150, 88));\\r\\n\\t\\tlocations.add(new Location(150, 88));\\r\\n\\t\\tlocations.add(new Location(150, 88));\\r\\n\\t\\tlocations.add(new Location(150, 88));\\r\\n\\t\\tlocations.add(new Location(150, 88));\\r\\n\\t\\tlocations.add(new Location(136, 103));\\r\\n\\t\\tlocations.add(new Location(150, 0));\\r\\n\\t\\tList clusterInput = new ArrayList(locations.size());\\r\\n\\t\\tfor (Location location : locations)\\r\\n\\t\\t\\tclusterInput.add(new LocationWrapper(location));\\r\\n\\r\\n\\t\\t// initialize a new clustering algorithm.\\r\\n\\t\\t// we use KMeans++ with 10 clusters and 10000 iterations maximum.\\r\\n\\t\\t// we did not specify a distance measure; the default (euclidean\\r\\n\\t\\t// distance) is used.\\r\\n\\t\\t// org.apache.commons.math3.ml.clustering.FuzzyKMeansClusterer\\r\\n\\t\\t// clusterer = new\\r\\n\\t\\t// org.apache.commons.math3.ml.clustering.FuzzyKMeansClusterer(2,\\r\\n\\t\\t// 2);\\r\\n\\t\\t// KMeansPlusPlusClusterer clusterer = new\\r\\n\\t\\t// KMeansPlusPlusClusterer(2, 10);\\r\\n\\r\\n\\t\\tDBSCANClusterer clusterer = new DBSCANClusterer(1200.0, 5);\\r\\n\\t\\tList> clusterResults = clusterer.cluster(clusterInput);\\r\\n\\t\\t// List> clusterResults =\\r\\n\\t\\t// clusterer.cluster(clusterInput);\\r\\n\\r\\n\\t\\t// output the clusters\\r\\n\\t\\tSystem.out.println(\\\"clusterResults.size() = \\\" + clusterResults.size());\\r\\n\\t\\tfor (int i = 0; i < clusterResults.size(); i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.println(\\\"Cluster \\\" + i);\\r\\n\\t\\t\\tfor (LocationWrapper locationWrapper : clusterResults.get(i).getPoints())\\r\\n\\t\\t\\t\\tSystem.out.println(locationWrapper.getLocation());\\r\\n\\t\\t\\tSystem.out.println();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public GeometryBoundingBox(double west, double south, double east, double north, Double minAltitude,\\n Double maxAltitude) {\\n this.west = west;\\n this.south = south;\\n this.east = east;\\n this.north = north;\\n this.minAltitude = minAltitude;\\n this.maxAltitude = maxAltitude;\\n }\",\n \"protected void buildRadius()\\r\\n\\t{\\n\\t\\tif (m_Qmax == null || m_Qmin == null)\\r\\n\\t\\t{\\r\\n\\t\\t\\tupdateQMinQMax();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tm_Radius = getMaxDistanceOrigin();\\r\\n\\t}\",\n \"protected void computeGridParameters() {\\n float padding = 0.02f * overlay.getScalingValue();\\n boolean flipX = x2 < x1;\\n float xx1 = flipX ? (x1 + padding) : (x1 - padding);\\n float xx2 = flipX ? (x2 - padding) : (x2 + padding);\\n boolean flipY = y2 < y1;\\n float yy1 = flipY ? (y1 + padding) : (y1 - padding);\\n float yy2 = flipY ? (y2 - padding) : (y2 + padding);\\n \\n xGrid1 = xx1; yGrid1 = yy1;\\n xGrid2 = xx2; yGrid2 = yy1;\\n xGrid3 = xx1; yGrid3 = yy2;\\n xGrid4 = xx2; yGrid4 = yy2;\\n horizGridCount = 3; vertGridCount = 3;\\n }\",\n \"private Coordinate[] generateBoundingBox(final Geometry geometry) {\\n if (geometry == null || geometry.getCoordinates() == null || geometry.getCoordinates().length == 0) {\\n return new Coordinate[]{new Coordinate(0,0),new Coordinate(0,0)};\\n }\\n final Coordinate firstPoint = geometry.getCoordinates()[0];\\n double minLat = firstPoint.y;\\n double minLon = firstPoint.x;\\n double maxLat = firstPoint.y;\\n double maxLon = firstPoint.x;\\n for (final Coordinate coordinate : geometry.getCoordinates()) {\\n if (coordinate.x < minLon) {\\n minLon = coordinate.x;\\n }\\n if (coordinate.y < minLat) {\\n minLat = coordinate.y;\\n }\\n if (coordinate.x > maxLon) {\\n maxLon = coordinate.x;\\n }\\n if (coordinate.y > maxLat) {\\n maxLat = coordinate.y;\\n }\\n }\\n return new Coordinate[]{\\n new Coordinate(minLon, minLat),\\n new Coordinate(maxLon, maxLat)\\n };\\n }\",\n \"public void buildBridges() {\\n\\t\\tList firstTier = getValidLinks(0);\\r\\n\\t\\t\\r\\n\\t\\tbuildNextBridge(firstTier, 0);\\r\\n\\t}\",\n \"Collection getIsBoundaryNodeOf();\",\n \"private void setBoundaryColors() {\\n determineBoundaryColors(entities[0].boundaries);\\n determineBoundaryColors(entities[1].boundaries);\\n }\",\n \"public BoundsUserSpace() {\\n super();\\n }\",\n \"public StructureVillagePieces.Village buildComponent(StructureVillagePieces.PieceWeight parPieceWeight, StructureVillagePieces.Start parStart, List parPiecesList, Random parRand, int parMinX, int parMinY, int parMinZ, EnumFacing parFacing, int parType) {\\n/* 50 */ System.out.println(\\\"TekHouse6 buildComponent() at \\\" + parMinX + \\\", \\\" + parMinY + \\\", \\\" + parMinZ);\\n/* */ \\n/* 52 */ StructureBoundingBox structureboundingbox = StructureBoundingBox.getComponentToAddBoundingBox(parMinX, parMinY, parMinZ, 0, 0, 0, 9, 7, 12, parFacing);\\n/* 53 */ return (canVillageGoDeeper(structureboundingbox) && StructureComponent.findIntersecting(parPiecesList, structureboundingbox) == null) ? (StructureVillagePieces.Village)new TekHouse6(parStart, parType, parRand, structureboundingbox, parFacing) : null;\\n/* */ }\",\n \"public void buildWorld() {\\n buildBoundaryWall();\\n buildDiscreteWorld();\\n removeBoundaryWall();\\n reorganizeNote();\\n connectWorld();\\n buildWall();\\n }\",\n \"void makeNborLists(){\\n\\t\\t\\tfor (int i = 0; i < N; i++){\\n\\t\\t\\t\\tint ct = 0;\\n\\t\\t\\t\\tint boundsCt = 0;\\n\\t\\t\\t\\tfor (int j = 0; j < maxNbors; j++){\\n\\t\\t\\t\\t\\tint nborSite = nborList[i][j];\\n\\t\\t\\t\\t\\tif(nborSite>=1){\\n\\t\\t\\t\\t\\t\\tif (aliveLattice[nborSite]){\\n\\t\\t\\t\\t\\t\\t\\tct += 1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\tboundsCt += 1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tint noDead = maxNbors - ct;\\n\\t\\t\\t\\t\\tfracDeadNbors[i] = (double)noDead/maxNbors;\\n\\t\\t\\t\\t\\tif(deadDissipation==true) noNborsForSite[i] = noNbors; \\n\\t\\t\\t\\t\\telse if (deadDissipation==false){\\n\\t\\t\\t\\t\\t\\tif(boundaryConditions==\\\"Open\\\")\\n\\t\\t\\t\\t\\t\\t\\tnoNborsForSite[i]=ct+boundsCt;\\n\\t\\t\\t\\t\\t\\telse if(boundaryConditions == \\\"Periodic\\\")\\n\\t\\t\\t\\t\\t\\t\\tnoNborsForSite[i]=ct;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(deadDissipation==true){\\n\\t\\t\\t\\tfor (int i = 0; i < N; i++)\\tnoNborsForSite[i] = noNbors; \\n\\t\\t\\t\\tfor (int i = 0; i < N; i++){\\n\\t\\t\\t\\t\\tint ct = 0;\\n\\t\\t\\t\\t\\tfor (int j = 0; j < maxNbors; j++){\\n\\t\\t\\t\\t\\t\\tif (aliveLattice[nborList[i][j]]){\\n\\t\\t\\t\\t\\t\\t\\tct += 1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tint noDead = maxNbors - ct;\\n\\t\\t\\t\\t\\t\\tfracDeadNbors[i] = (double)noDead/maxNbors;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else if (deadDissipation==false){\\n\\t\\t\\t\\tfor (int i = 0; i < N; i++){\\n\\t\\t\\t\\t\\tint ct = 0;\\n\\t\\t\\t\\t\\tfor (int j = 0; j < maxNbors; j++){\\n\\t\\t\\t\\t\\t\\tif (aliveLattice[nborList[i][j]]){\\n\\t\\t\\t\\t\\t\\t\\tct += 1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tint noDead = maxNbors - ct;\\n\\t\\t\\t\\t\\t\\tfracDeadNbors[i] = (double)noDead/maxNbors;\\n\\t\\t\\t\\t\\t\\tnoNborsForSite[i]=ct;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t}\",\n \"@Override\\n public List getBounds() {\\n return Collections.unmodifiableList(bounds);\\n }\",\n \"public void setNeighbors(){\\t\\t\\t\\t\\n\\t\\tint row = position[0];\\n\\t\\tint column = position[1];\\t\\t\\n\\t\\tif(column+1 < RatMap.SIDELENGTH){\\n\\t\\t\\teastCell = RatMap.getMapCell(row,column+1);\\t\\t\\t\\n\\t\\t}else{\\n\\t\\t\\teastCell = null;\\n\\t\\t}\\t\\n\\t\\tif(row+1 < RatMap.SIDELENGTH){\\n\\t\\t\\tnorthCell = RatMap.getMapCell(row+1,column);\\n\\t\\t}else{\\n\\t\\t\\tnorthCell = null;\\n\\t\\t}\\t\\n\\t\\tif(column-1 > -1){\\n\\t\\t\\twestCell = RatMap.getMapCell(row, column-1);\\t\\t\\t\\n\\t\\t}else{\\n\\t\\t\\twestCell = null;\\n\\t\\t}\\n\\t\\tif(row-1 > -1){\\n\\t\\t\\tsouthCell = RatMap.getMapCell(row-1, column);\\n\\t\\t}else{\\n\\t\\t\\tsouthCell = null;\\n\\t\\t}\\n\\t}\",\n \"@Test\\r\\n\\tpublic void censusBoundaryTest() throws FileNotFoundException\\r\\n\\t{\\r\\n\\t\\tint [] p=new int[5];\\r\\n\\t\\tString fileName=\\\"BadgerTestC.txt\\\";\\r\\n\\t\\tWorld w=new World(fileName);\\r\\n\\t\\t\\r\\n\\t\\tw.grid[0][1].census(p);\\r\\n\\t\\tassertEquals(2,p[0]);\\r\\n\\t\\tassertEquals(0, p[1]);\\r\\n\\t\\tassertEquals(2,p[2]);\\r\\n\\t\\tassertEquals(0,p[3]);\\r\\n\\t\\tassertEquals(2,p[4]);\\r\\n\\t}\",\n \"public void createMinimap() {\\n if (gameField.getFields().size() == 1024) {\\n rootSize = 32;\\n blockSize = 8;\\n } else { //if size == 64^2 == 4096\\n rootSize = 64;\\n blockSize = 4;\\n }\\n int magnification = gameFieldController.getMagnification();\\n if (AdvancedWarsApplication.getInstance().getGameScreenCon().base.getScene() != null) {\\n positionBoxSizeX = blockSize *\\n (AdvancedWarsApplication.getInstance().getGameScreenCon().base.getScene().getWidth() / (rootSize * magnification));\\n\\n positionBoxSizeY = blockSize *\\n (AdvancedWarsApplication.getInstance().getGameScreenCon().base.getScene().getHeight() / (rootSize * magnification));\\n } else {\\n //for offline test\\n positionBoxSizeX = (blockSize * 1920) / (rootSize * magnification);\\n positionBoxSizeY = (blockSize * 1080) / (rootSize * magnification);\\n }\\n\\n for (int i = 0; i < rootSize; ++i) {\\n for (int j = 0; j < rootSize; ++j) {\\n Field currentField = gameField.getFields().get(i * rootSize + j);\\n Rectangle rectangle = new Rectangle(blockSize, blockSize);\\n if (!currentField.getType().equals(\\\"Grass\\\")) {\\n if (currentField.getType().equals(\\\"Water\\\")) {\\n rectangle.setFill(Color.rgb(11, 89, 139));\\n } else if (currentField.getType().equals(\\\"Forest\\\")) {\\n rectangle.setFill(Color.rgb(38, 106, 0));\\n } else { //if currentField equals Mountain\\n rectangle.setFill(Color.rgb(95, 111, 54));\\n }\\n rectangle.relocate((i * blockSize) + 1, (j * blockSize) + 1);\\n drawPane.getChildren().add(rectangle);\\n }\\n }\\n }\\n Rectangle rect = new Rectangle(positionBoxSizeX, positionBoxSizeY);\\n Rectangle clip = new Rectangle(1, 1, positionBoxSizeX - 2, positionBoxSizeY - 2);\\n positionBox = Shape.subtract(rect, clip);\\n positionBox.setFill(Color.WHITE);\\n drawPane.getChildren().add(positionBox);\\n isCreated = true;\\n }\",\n \"private void setNeighbors()\\r\\n {\\r\\n for (int x = 0; x < length+2; ++x)\\r\\n {\\r\\n for (int y = 0; y < width+2; ++y)\\r\\n {\\r\\n // North\\r\\n if (!this.board[x][y].northwall)\\r\\n {\\r\\n this.board[x][y].neighbors.add(this.board[x][y-1]);\\r\\n }\\r\\n // South\\r\\n if (!this.board[x][y].southwall)\\r\\n {\\r\\n this.board[x][y].neighbors.add(this.board[x][y+1]);\\r\\n }\\r\\n // East\\r\\n if (!this.board[x][y].eastwall)\\r\\n {\\r\\n this.board[x][y].neighbors.add(this.board[x+1][y]);\\r\\n }\\r\\n // West\\r\\n if (!this.board[x][y].westwall)\\r\\n {\\r\\n this.board[x][y].neighbors.add(this.board[x-1][y]);\\r\\n }\\r\\n }\\r\\n }\\r\\n }\",\n \"private void setParentBounds() {\\n GraphRepresentation baseGraph = graphRepresentationFactory.getBaseGraph();\\n\\n Iterator iterator = tasks.iterator();\\n while (iterator.hasNext()) {\\n Task nextTask = iterator.next();\\n List nextTaskParents = baseGraph.getParents(nextTask.getIdentifier());\\n nextTask.setParentBound(nextTaskParents.size());\\n }\\n }\",\n \"private boolean doPacking(List clusters)\\r\\n {\\n RectanglePacker packer = new RectanglePacker((int)MAX_WIDTH, (int)MAX_HEIGHT, 0);\\r\\n\\r\\n for (Cluster cluster : clusters)\\r\\n {\\r\\n SWCRectangle bbox = cluster.getBoundingBox();\\r\\n RectanglePacker.Rectangle res = packer.insert((int)bbox.getWidth(), (int)bbox.getHeight(), cluster);\\r\\n\\r\\n //unable to pack rectangles\\r\\n if (res == null)\\r\\n return false;\\r\\n }\\r\\n\\r\\n //fill out wordPositions\\r\\n for (Cluster cluster : clusters)\\r\\n {\\r\\n SWCRectangle bbox = cluster.getBoundingBox();\\r\\n Rectangle rect = packer.findRectangle(cluster);\\r\\n\\r\\n for (Word w : cluster.wordPositions.keySet())\\r\\n {\\r\\n SWCRectangle r = cluster.wordPositions.get(w);\\r\\n wordPositions.put(w, new SWCRectangle(r.getX() + rect.x - bbox.getX(), r.getY() + rect.y - bbox.getY(), r.getWidth(), r.getHeight()));\\r\\n }\\r\\n }\\r\\n\\r\\n return true;\\r\\n }\",\n \"public void calculateBounds(boolean force) {\\n\\t\\tdouble left=java.lang.Double.MAX_VALUE, right=java.lang.Double.MIN_VALUE, \\n\\t\\ttop=java.lang.Double.MAX_VALUE, bottom=java.lang.Double.MIN_VALUE;\\n\\t\\t\\n\\t\\tdouble theta;\\n\\t\\tfor (int i=_segments-1; i>=0; i--) {\\n\\t\\t\\t/* Save calculation: if rotation hasn't changed and it is not forced,\\n\\t\\t\\t * don't calculate points again.\\n\\t\\t\\t */\\n\\t\\t\\tif (_lastTheta != _theta || force) {\\n\\t\\t\\t\\ttheta=_theta+FastMath.atan2(_startPointY[i] ,_startPointX[i]);\\n\\t\\t\\t\\tx1[i]=(int)(_m1[i]*FastMath.cos(theta));\\n\\t\\t\\t\\ty1[i]=(int)(_m1[i]*FastMath.sin(theta));\\n\\t\\t\\t\\ttheta=_theta+ FastMath.atan2(_endPointY[i], _endPointX[i]);\\n\\t\\t\\t\\tx2[i]=(int)(_m2[i]*FastMath.cos(theta));\\n\\t\\t\\t\\ty2[i]=(int)(_m2[i]*FastMath.sin(theta));\\n\\t\\t\\t}\\n\\t\\t\\t// Finds the rectangle that comprises the organism\\n\\t\\t\\tleft = Utils.min(left, x1[i]+ _dCenterX, x2[i]+ _dCenterX);\\n\\t\\t\\tright = Utils.max(right, x1[i]+ _dCenterX, x2[i]+ _dCenterX);\\n\\t\\t\\ttop = Utils.min(top, y1[i]+ _dCenterY, y2[i]+ _dCenterY);\\n\\t\\t\\tbottom = Utils.max(bottom, y1[i]+ _dCenterY, y2[i]+ _dCenterY);\\n\\t\\t}\\n\\t\\tsetBounds((int)left, (int)top, (int)(right-left+1)+1, (int)(bottom-top+1)+1);\\n\\t\\t_lastTheta = _theta;\\n\\t}\",\n \"public Gridder()\\n\\t{\\n grid = new Cell[MapConstant.MAP_X][MapConstant.MAP_Y];\\n for (int row = 0; row < grid.length; row++) {\\n for (int col = 0; col < grid[0].length; col++) {\\n grid[row][col] = new Cell(row, col);\\n\\n // Set the virtual walls of the arena\\n if (row == 0 || col == 0 || row == MapConstant.MAP_X - 1 || col == MapConstant.MAP_Y - 1) {\\n grid[row][col].setVirtualWall(true);\\n }\\n }\\n }\\n\\t}\",\n \"private BioMightBoundBox setupDefaultBoundBox(String parentID) \\r\\n\\t{\\r\\n\\t\\t// Initialize the position of the bounding box vars\\r\\n\\t\\tBigDecimal xPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal yPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal zPos= new BigDecimal(0.0);\\r\\n\\t\\t\\r\\n\\t\\t// Set to base 1x1x1 cube\\r\\n\\t\\tBigDecimal xVector= new BigDecimal(1.0);\\r\\n\\t\\tBigDecimal yVector= new BigDecimal(1.0); \\r\\n\\t\\tBigDecimal zVector= new BigDecimal(1.0);\\r\\n\\t\\r\\n\\t\\t// Initialize the BoundBox\\r\\n\\t\\tBioMightBoundBox bioBoundBox = null;\\r\\n\\t\\r\\n\\t\\t// Initialize the Connectors \\r\\n\\t\\tBioMightConnectors bioMightConnectors = null; \\r\\n\\r\\n\\t\\t// Initialize the Connector \\r\\n\\t\\tBioMightConnector bioMightConnector= null;\\r\\n\\t\\r\\n\\t\\tdouble circumference = 0.0;\\r\\n\\t\\tdouble[] startPos = {0.0, 0.0, 0.0};\\r\\n\\t\\tdouble[][] startPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\t// ARMS BOUND BOX\\t\\t\\r\\n\\t\\t//\\r\\n\\t\\t// Set up the Bounding Box for the Arms\\r\\n\\t\\t// For default model, length of arms is 4.5\\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(0.0);\\r\\n\\t\\tyPos = new BigDecimal(-15.0);\\r\\n\\t\\tzPos= new BigDecimal(-5.0);\\r\\n\\t\\r\\n\\t\\txVector= new BigDecimal(11.5);\\r\\n\\t\\tyVector= new BigDecimal(6.0); \\r\\n\\t\\tzVector= new BigDecimal(5.0);\\r\\n\\t\\t\\r\\n\\t\\t// Setup the boundbox\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\t// Set up its connectors\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\t\\r\\n\\t\\t//********************************************\\r\\n\\t\\t// ARM - ORGAN CONNECTORS\\r\\n\\t\\t//********************************************\\r\\n\\t\\r\\n\\t\\t// EpitheliumTissue Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(0.0, -5.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, Constants.ArmEpitheliumRef,\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(Constants.ArmEpitheliumRef, bioMightConnector);\\r\\n\\t\\r\\n\\t\\t//********************************************\\t\\r\\n\\t\\t// ARMS - VASCULAR CONNECTORS \\r\\n\\t\\t//********************************************\\r\\n\\t\\r\\n\\t\\t// InternalCarotidArteryEpithelium\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(0.0, -5.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, \\\"InternalCarotidArteryEpithelium\\\",\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(\\\"InternalCarotidArteryEpithelium\\\", bioMightConnector);\\r\\n\\t\\r\\n\\t\\t// ExternalCarotidArteryEpithelium \\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(0.0, -5.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, \\\"ExternalCarotidArteryEpithelium\\\",\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(\\\"ExternalCarotidArteryEpithelium\\\", bioMightConnector);\\r\\n\\t\\r\\n\\t\\t//********************************************\\r\\n\\t\\t// ARMS - MUSCULAR CONNECTORS\\r\\n\\t\\t//********************************************\\r\\n\\r\\n\\t\\r\\n\\t\\t//********************************************\\r\\n\\t\\t// ARMS - SKELETAL CONNECTORS\\r\\n\\t\\t//********************************************\\r\\n\\r\\n\\t\\t// ThoracicVertebrae T6 \\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(0.0, -5.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, \\\"CervicalVertebrae\\\",\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(\\\"CervicalVertebrae\\\", bioMightConnector);\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t// Stuff the Connectors into the Bounding Box \\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\r\\n\\t\\t\\r\\n\\t\\treturn (bioBoundBox);\\t\\r\\n\\t}\",\n \"public void initializeNeighbors() {\\n\\t\\tfor (int r = 0; r < getRows(); r++) {\\n\\t\\t\\tfor (int c = 0; c < getCols(); c++) {\\n\\t\\t\\t\\tList nbs = new ArrayList<>();\\n\\t\\t\\t\\tinitializeNF(shapeType, r, c);\\n\\t\\t\\t\\tmyNF.findNeighbors();\\n\\t\\t\\t\\tfor (int[] arr : myNF.getNeighborLocations()){\\n\\t\\t\\t\\t\\tif (contains(arr[0], arr[1])){\\n\\t\\t\\t\\t\\t\\tnbs.add(get(arr[0], arr[1]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tget(r, c).setNeighbors(nbs);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public void initClusters(){\\n\\t\\tUnitRow unitRow = data.getUnitRow();\\n\\t\\tUnit currentUnit = null;\\n\\t\\tLeaf leaf = null;\\n\\n\\t\\tfor (int i = 0; i < unitRow.getLength(); i++){\\n\\t\\t\\tcurrentUnit = unitRow.getUnit(i);\\n\\t\\t\\tleaf = new Leaf(currentUnit);\\n\\t\\t\\tclusters.add(leaf);\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"Clusters initialized.\\\");\\n\\t}\",\n \"private void calcBoxVerts() {\\n\\t\\tif (verts != null) {\\n\\t\\t\\tdouble minX = verts[0].getElement(0);\\n\\t\\t\\tdouble maxX = minX;\\n\\t\\t\\tdouble minY = verts[0].getElement(1);\\n\\t\\t\\tdouble maxY = minY;\\n\\t\\t\\tdouble minZ = verts[0].getElement(2);\\n\\t\\t\\tdouble maxZ = minZ;\\n\\t\\t\\tfor (int i = 1; i < verts.length; i++) {\\n\\t\\t\\t\\tif (verts[i].getElement(0) < minX) {\\n\\t\\t\\t\\t\\tminX = verts[i].getElement(0);\\n\\t\\t\\t\\t} else if (verts[i].getElement(0) > maxX) {\\n\\t\\t\\t\\t\\tmaxX = verts[i].getElement(0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (verts[i].getElement(1) < minY) {\\n\\t\\t\\t\\t\\tminY = verts[i].getElement(1);\\n\\t\\t\\t\\t} else if (verts[i].getElement(1) > maxY) {\\n\\t\\t\\t\\t\\tmaxY = verts[i].getElement(1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (verts[i].getElement(2) < minZ) {\\n\\t\\t\\t\\t\\tminZ = verts[i].getElement(2);\\n\\t\\t\\t\\t} else if (verts[i].getElement(2) > maxZ) {\\n\\t\\t\\t\\t\\tmaxZ = verts[i].getElement(2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tVector[] boxVerts = new Vector[8];\\n\\t\\t\\tboxVerts[0] = new Vector(3);\\n\\t\\t\\tboxVerts[0].setElements(new double[] {minX, minY, minZ});\\n\\t\\t\\tboxVerts[1] = new Vector(3);\\n\\t\\t\\tboxVerts[1].setElements(new double[] {maxX, minY, minZ});\\n\\t\\t\\tboxVerts[2] = new Vector(3);\\n\\t\\t\\tboxVerts[2].setElements(new double[] {minX, minY, maxZ});\\n\\t\\t\\tboxVerts[3] = new Vector(3);\\n\\t\\t\\tboxVerts[3].setElements(new double[] {maxX, minY, maxZ});\\n\\t\\t\\tboxVerts[4] = new Vector(3);\\n\\t\\t\\tboxVerts[4].setElements(new double[] {minX, maxY, minZ});\\n\\t\\t\\tboxVerts[5] = new Vector(3);\\n\\t\\t\\tboxVerts[5].setElements(new double[] {maxX, maxY, minZ});\\n\\t\\t\\tboxVerts[6] = new Vector(3);\\n\\t\\t\\tboxVerts[6].setElements(new double[] {minX, maxY, maxZ});\\n\\t\\t\\tboxVerts[7] = new Vector(3);\\n\\t\\t\\tboxVerts[7].setElements(new double[] {maxX, maxY, maxZ});\\n\\t\\t\\tthis.boxVerts = boxVerts;\\n\\t\\t} else {\\n\\t\\t\\tthis.boxVerts = null;\\n\\t\\t}\\n\\t}\",\n \"private void updateBoundingBox()\\n\\t{\\n\\t\\tif (this.facingDirection != null)\\n\\t\\t{\\n\\t\\t\\tdouble d0 = (double) this.hangingPosition.getX() + 0.5D;\\n\\t\\t\\tdouble d1 = (double) this.hangingPosition.getY() + 0.5D;\\n\\t\\t\\tdouble d2 = (double) this.hangingPosition.getZ() + 0.5D;\\n\\t\\t\\tdouble d3 = 0.46875D;\\n\\t\\t\\tdouble d4 = this.someFunc(this.getWidthPixels());\\n\\t\\t\\tdouble d5 = this.someFunc(this.getHeightPixels());\\n\\t\\t\\td0 = d0 - (double) this.facingDirection.getFrontOffsetX() * 0.46875D;\\n\\t\\t\\td2 = d2 - (double) this.facingDirection.getFrontOffsetZ() * 0.46875D;\\n\\t\\t\\td1 = d1 + d5;\\n\\t\\t\\tEnumFacing enumfacing = this.facingDirection.rotateYCCW();\\n\\t\\t\\td0 = d0 + d4 * (double) enumfacing.getFrontOffsetX();\\n\\t\\t\\td2 = d2 + d4 * (double) enumfacing.getFrontOffsetZ();\\n\\t\\t\\tthis.posX = d0;\\n\\t\\t\\tthis.posY = d1;\\n\\t\\t\\tthis.posZ = d2;\\n\\t\\t\\tdouble d6 = (double) this.getWidthPixels();\\n\\t\\t\\tdouble d7 = (double) this.getHeightPixels();\\n\\t\\t\\tdouble d8 = (double) this.getWidthPixels();\\n\\n\\t\\t\\tif (this.facingDirection.getAxis() == EnumFacing.Axis.Z)\\n\\t\\t\\t{\\n\\t\\t\\t\\td8 = 1.0D;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\td6 = 1.0D;\\n\\t\\t\\t}\\n\\n\\t\\t\\t// ???\\n\\n\\t\\t\\td6 = d6 / (this.getWidthPixels() / this.blocksToTakeUp() * 2D);\\n\\t\\t\\td7 = d7 / (this.getHeightPixels() / this.blocksToTakeUp() * 2D);\\n\\t\\t\\td8 = d8 / (this.getWidthPixels() / this.blocksToTakeUp() * 2D);\\n\\t\\t\\tthis.setEntityBoundingBox(new AxisAlignedBB(d0 - d6, d1 - d7, d2 - d8, d0 + d6, d1 + d7, d2 + d8));\\n\\t\\t}\\n\\t}\",\n \"@Test\\n public void testBoundsAsCompositesWithSingleEqAndMultiINRestrictions()\\n {\\n CFMetaData cfMetaData = newCFMetaData(Sort.ASC, Sort.ASC, Sort.ASC, Sort.ASC);\\n\\n ByteBuffer value1 = ByteBufferUtil.bytes(1);\\n ByteBuffer value2 = ByteBufferUtil.bytes(2);\\n ByteBuffer value3 = ByteBufferUtil.bytes(3);\\n ByteBuffer value4 = ByteBufferUtil.bytes(4);\\n ByteBuffer value5 = ByteBufferUtil.bytes(5);\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2) IN ((2, 3), (4, 5))\\n Restriction singleEq = newSingleEq(cfMetaData, 0, value1);\\n Restriction multiIN = newMultiIN(cfMetaData, 1, asList(value2, value3), asList(value4, value5));\\n PrimaryKeyRestrictions restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiIN);\\n\\n List bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.START);\\n assertComposite(bounds.get(1), value1, value4, value5, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\\n assertComposite(bounds.get(1), value1, value4, value5, EOC.END);\\n\\n // clustering_0 = 1 AND (clustering_1, clustering_2) IN ((2, 3))\\n singleEq = newSingleEq(cfMetaData, 0, value1);\\n multiIN = newMultiIN(cfMetaData, 1, asList(value2, value3));\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(multiIN).mergeWith(singleEq);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(1, bounds.size());\\n assertComposite(bounds.get(0), value1, value2, value3, EOC.END);\\n\\n // clustering_0 = 1 AND clustering_1 = 5 AND (clustering_2, clustering_3) IN ((2, 3), (4, 5))\\n singleEq = newSingleEq(cfMetaData, 0, value1);\\n Restriction singleEq2 = newSingleEq(cfMetaData, 1, value5);\\n multiIN = newMultiIN(cfMetaData, 2, asList(value2, value3), asList(value4, value5));\\n restrictions = new PrimaryKeyRestrictionSet(cfMetaData.comparator);\\n restrictions = restrictions.mergeWith(singleEq).mergeWith(multiIN).mergeWith(singleEq2);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.START, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value5, value2, value3, EOC.START);\\n assertComposite(bounds.get(1), value1, value5, value4, value5, EOC.START);\\n\\n bounds = restrictions.boundsAsComposites(cfMetaData, Bound.END, QueryOptions.DEFAULT);\\n assertEquals(2, bounds.size());\\n assertComposite(bounds.get(0), value1, value5, value2, value3, EOC.END);\\n assertComposite(bounds.get(1), value1, value5, value4, value5, EOC.END);\\n }\",\n \"public float[] getBounds() {\\r\\n\\t\\tfloat[] bounds = {x_ - width_/ 2, x_ + width_ / 2, y_ - height_ / 2, y_ + height_ / 2};\\r\\n\\t\\treturn bounds;\\r\\n\\t}\",\n \"public Bounds bounds(String ipAddrsFile, String subnetsFile) throws IOException {\\n\\t\\tfinal Map nodes = parseAddresses(ipAddrsFile);\\n\\t\\tfinal Map subnets = parseSubnets(subnetsFile, nodes);\\n\\n\\t\\tfinal Universe universe = universe(nodes.keySet());\\n\\t\\tfinal Bounds bounds = new Bounds(universe);\\n\\t\\tfinal TupleFactory factory = universe.factory();\\n\\n\\t\\t// bind the integers\\n\\t\\tfor (int i = 0; i < 32; i++) {\\n\\t\\t\\tbounds.boundExactly(1 << i, factory.setOf(Integer.valueOf(1 << i)));\\n\\t\\t}\\n\\n\\t\\t// bind the port relation exactly to the port names\\n\\t\\tbounds.boundExactly(port, factory.range(factory.tuple(universe.atom(0)),\\n\\t\\t\\t\\tfactory.tuple(universe.atom(nodes.keySet().size() - 1))));\\n\\n\\t\\t// bind the unknown relation exactly to the port names of ports with\\n\\t\\t// unknown addresses or masks\\n\\t\\tfinal TupleSet unknownBound = factory.noneOf(1);\\n\\t\\tfor (NetNode n : nodes.values()) {\\n\\t\\t\\tif (!n.known()) {\\n\\t\\t\\t\\tunknownBound.add(factory.tuple(n.port));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbounds.boundExactly(unknown, unknownBound);\\n\\n\\t\\t// bind the subnet relation exactly, choosing the first element of each\\n\\t\\t// subnet as the representative\\n\\t\\tfinal TupleSet subnetBound = factory.noneOf(2);\\n\\t\\tfor (Map.Entry entry : subnets.entrySet()) {\\n\\t\\t\\tfinal NetNode rep = entry.getKey();\\n\\t\\t\\tfor (NetNode member : entry.getValue().members) {\\n\\t\\t\\t\\tsubnetBound.add(factory.tuple(rep.port, member.port));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbounds.boundExactly(subnet, subnetBound);\\n\\n\\t\\t// bind the addr relation so that each address is guaranteed to be\\n\\t\\t// between minAddr (121.96.0.0) and maxAddr (121.96.255.255), inclusive\\n\\t\\tfinal TupleSet lAddr = factory.noneOf(2), uAddr = factory.noneOf(2);\\n\\t\\tfor (NetNode node : nodes.values()) {\\n\\t\\t\\tif (node.varAddress) { // unknown address\\n\\t\\t\\t\\tlAddr.addAll(portToBits(factory, node.port, minAddr));\\n\\t\\t\\t\\tuAddr.addAll(portToBits(factory, node.port, maxAddr));\\n\\t\\t\\t} else { // known address\\n\\t\\t\\t\\tfinal TupleSet portToAddrBits = portToBits(factory, node.port, node.address);\\n\\t\\t\\t\\tlAddr.addAll(portToAddrBits);\\n\\t\\t\\t\\tuAddr.addAll(portToAddrBits);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbounds.bound(addr, lAddr, uAddr);\\n\\n\\t\\t// bind the group and groupMask relations so that all ports with the\\n\\t\\t// same interface on the same subnet are guaranteed to have the same\\n\\t\\t// mask\\n\\t\\tfinal TupleSet lMask = factory.noneOf(2), uMask = factory.noneOf(2), groupBound = factory.noneOf(2);\\n\\t\\tfor (Subnet sub : subnets.values()) {\\n\\t\\t\\tfor (Map.Entry> entry : sub.groups.entrySet()) {\\n\\t\\t\\t\\tfinal NetNode rep = entry.getKey();\\n\\t\\t\\t\\tfor (NetNode member : entry.getValue()) {\\n\\t\\t\\t\\t\\tgroupBound.add(factory.tuple(member.port, rep.port));\\n\\t\\t\\t\\t\\tnodes.remove(member.port); // remove a grouped member out of\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// the addresses set\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (rep.varMask) { // unknown mask for the representative\\n\\t\\t\\t\\t\\tuMask.addAll(portToBits(factory, rep.port, 31));\\n\\t\\t\\t\\t} else { // known mask for the representative\\n\\t\\t\\t\\t\\tfinal TupleSet portToMaskBits = portToBits(factory, rep.port, rep.mask);\\n\\t\\t\\t\\t\\tlMask.addAll(portToMaskBits);\\n\\t\\t\\t\\t\\tuMask.addAll(portToMaskBits);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// bind the group and groupMask relations for ports that are not a part\\n\\t\\t// of any subnet\\n\\t\\tfor (NetNode ungrouped : nodes.values()) {\\n\\t\\t\\tgroupBound.add(factory.tuple(ungrouped.port, ungrouped.port));\\n\\t\\t\\tif (ungrouped.varMask) { // unknown mask for the representative\\n\\t\\t\\t\\tuMask.addAll(portToBits(factory, ungrouped.port, 31));\\n\\t\\t\\t} else { // known mask for the representative\\n\\t\\t\\t\\tfinal TupleSet portToMaskBits = portToBits(factory, ungrouped.port, ungrouped.mask);\\n\\t\\t\\t\\tlMask.addAll(portToMaskBits);\\n\\t\\t\\t\\tuMask.addAll(portToMaskBits);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tbounds.bound(groupMask, lMask, uMask);\\n\\t\\tbounds.boundExactly(group, groupBound);\\n\\n\\t\\t// System.out.println(\\\"groupMask.size: \\\" + uMask.size() + \\\", group.size:\\n\\t\\t// \\\" + groupBound.size());\\n\\t\\t// System.out.println(\\\"ports.size: \\\" + bounds.upperBound(port).size() +\\n\\t\\t// \\\", unknown.size: \\\" + unknownBound.size());\\n\\t\\treturn bounds;\\n\\n\\t}\",\n \"public double[] setMapBounds(double ulLon, double ulLat, double lrLon, double lrLat)\\n/* 154: */ {\\n/* 117:182 */ int x_min = 2147483647;\\n/* 118:183 */ int y_min = 2147483647;\\n/* 119:184 */ int x_max = -2147483648;\\n/* 120:185 */ int y_max = -2147483648;\\n/* 121:186 */ int mapZoomMax = 20;\\n/* 122: */\\n/* 123:188 */ x_max = Math.max(x_max, MercatorProj.LonToX(lrLon, mapZoomMax));\\n/* 124:189 */ x_max = Math.max(x_max, MercatorProj.LonToX(ulLon, mapZoomMax));\\n/* 125:190 */ y_max = Math.max(y_max, MercatorProj.LatToY(ulLat, mapZoomMax));\\n/* 126:191 */ y_max = Math.max(y_max, MercatorProj.LatToY(lrLat, mapZoomMax));\\n/* 127:192 */ x_min = Math.min(x_min, MercatorProj.LonToX(ulLon, mapZoomMax));\\n/* 128:193 */ x_min = Math.min(x_min, MercatorProj.LonToX(lrLon, mapZoomMax));\\n/* 129:194 */ y_min = Math.min(y_min, MercatorProj.LatToY(ulLat, mapZoomMax));\\n/* 130:195 */ y_min = Math.min(y_min, MercatorProj.LatToY(lrLat, mapZoomMax));\\n /* x_max= (int)(Math.max(ulLon,lrLon)*1000000);\\n x_min= (int)(Math.min(ulLon,lrLon)*1000000);\\n y_max= (int)(Math.max(ulLat,lrLat)*1000000);\\n y_min= (int)(Math.min(ulLat,lrLat)*1000000);*/\\n/* 134:199 */ int height = Math.max(0, this.mapPanel.getHeight());\\n/* 135:200 */ int width = Math.max(0, this.mapPanel.getWidth());\\n/* 136:201 */ int newZoom = mapZoomMax;\\n/* 137:202 */ int x = x_max - x_min;\\n/* 138:203 */ int y = y_max - y_min;\\n/* 139:204 */ while ((x > width) || (y > height))\\n/* 140: */ {\\n/* 141:205 */ newZoom--;\\n/* 142:206 */ x >>= 1;\\n/* 143:207 */ y >>= 1;\\n/* 144: */ }\\n/* 145:209 */ x = x_min + (x_max - x_min)/2;\\n/* 146:210 */ y = y_min + (y_max - y_min)/2;\\n/* 147:211 */ int z = 1 << mapZoomMax - newZoom;\\n/* 148:212 */ x /= z;\\n/* 149:213 */ y /= z;\\n /* int Cx=256;\\n int Cy=256;\\n //Cx>>=(newZoom);\\n //Cy>>=(newZoom);\\n double x1=((x*(width/2))/Cx);\\n double y1=((y*(height/2))/Cy);\\n x=(int) x1;\\n y=(int) y1;\\n x >>=(newZoom-this.mapPanel.zoom);\\n y >>=(newZoom-this.mapPanel.zoom);\\n //x = x+156;\\n //y = y-137;*/\\n x=x/10000;\\n y=y/10000;\\n /* 150:214 */ this.mapPanel.setZoom(new Point((int)x, (int)y), newZoom);\\n double[] res = { this.mapPanel.zoom, this.mapPanel.centerX, this.mapPanel.centerY,x,y, newZoom, z };\\n traceln(Arrays.toString(res));\\n traceln( x_max+\\\",\\\"+x_min+\\\",\\\"+y_max+\\\",\\\"+y_min+\\\",x:\\\"+x+\\\",y:\\\"+y+\\\",z:\\\"+z+\\\",nZomm:\\\"+newZoom);\\n // this.mapPanel.getBounds().getX()setBounds( (int)ulLon,(int)ulLat, (int)width,(int)height);\\n return res;\\n\\n/* 167: */ }\",\n \"public void testGetBoundingBox(){\\r\\n\\t\\tdouble xc = 0;\\r\\n\\t\\tdouble yc = 0;\\r\\n\\t\\tdouble r = 10;\\r\\n\\t\\tdouble r2 = r*Math.sqrt(2)/2;\\r\\n\\t\\tdouble t0 = PI/4;\\r\\n\\t\\tdouble t1 = 3*PI/4;\\r\\n\\t\\tdouble t2 = 5*PI/4;\\r\\n\\t\\tdouble t3 = 7*PI/4;\\r\\n\\t\\tdouble dt = PI/2;\\r\\n\\t\\t\\r\\n\\t\\t// declare variables\\r\\n\\t\\tCircleArc2D arc0, arc1, arc2, arc3;\\r\\n\\t\\tBox2D box0, box1, box2, box3;\\r\\n\\t\\tBox2D bounds0, bounds1, bounds2, bounds3;\\r\\n\\t\\t\\r\\n\\t\\t// top\\r\\n\\t\\tarc0 \\t= new CircleArc2D(xc, yc, r, t0, dt);\\r\\n\\t\\tbox0 \\t= new Box2D(xc-r2, xc+r2, r2, r);\\r\\n\\t\\tbounds0 = arc0.boundingBox();\\r\\n\\t\\tassertTrue(box0.almostEquals(bounds0, Shape2D.ACCURACY));\\r\\n\\r\\n\\t\\t// left\\r\\n\\t\\tarc1 \\t= new CircleArc2D(xc, yc, r, t1, dt);\\r\\n\\t\\tbox1 \\t= new Box2D(xc-r, xc-r2, -r2, r2);\\r\\n\\t\\tbounds1 = arc1.boundingBox();\\r\\n\\t\\tassertTrue(box1.almostEquals(bounds1, Shape2D.ACCURACY));\\r\\n\\r\\n\\t\\t// bottom\\r\\n\\t\\tarc2 \\t= new CircleArc2D(xc, yc, r, t2, dt);\\r\\n\\t\\tbox2 \\t= new Box2D(xc-r2, xc+r2, -r, -r2);\\r\\n\\t\\tbounds2 = arc2.boundingBox();\\r\\n\\t\\tassertTrue(box2.almostEquals(bounds2, Shape2D.ACCURACY));\\r\\n\\r\\n\\t\\t// right\\r\\n\\t\\tarc3 \\t= new CircleArc2D(xc, yc, r, t3, dt);\\r\\n\\t\\tbox3 \\t= new Box2D(r2, r, -r2, r2);\\r\\n\\t\\tbounds3 = arc3.boundingBox();\\r\\n\\t\\tassertTrue(box3.almostEquals(bounds3, Shape2D.ACCURACY));\\r\\n\\r\\n\\t\\t/// circle arcs with extent 3*pi/2\\r\\n\\t\\tdt = 3*PI/2;\\r\\n\\t\\t\\r\\n\\t\\t// top\\r\\n\\t\\tarc0 \\t= new CircleArc2D(xc, yc, r, t3, dt);\\r\\n\\t\\tbox0 \\t= new Box2D(xc-r, xc+r, -r2, r);\\r\\n\\t\\tbounds0 = arc0.boundingBox();\\r\\n\\t\\tassertTrue(box0.almostEquals(bounds0, Shape2D.ACCURACY));\\r\\n\\r\\n\\t\\t// left\\r\\n\\t\\tarc1 \\t= new CircleArc2D(xc, yc, r, t0, dt);\\r\\n\\t\\tbox1 \\t= new Box2D(xc-r, xc+r2, -r, r);\\r\\n\\t\\tbounds1 = arc1.boundingBox();\\r\\n\\t\\tassertTrue(box1.almostEquals(bounds1, Shape2D.ACCURACY));\\r\\n\\r\\n\\t\\t// bottom\\r\\n\\t\\tarc2 \\t= new CircleArc2D(xc, yc, r, t1, dt);\\r\\n\\t\\tbox2 \\t= new Box2D(xc-r, xc+r, -r, r2);\\r\\n\\t\\tbounds2 = arc2.boundingBox();\\r\\n\\t\\tassertTrue(box2.almostEquals(bounds2, Shape2D.ACCURACY));\\r\\n\\r\\n\\t\\t// right\\r\\n\\t\\tarc3 \\t= new CircleArc2D(xc, yc, r, t2, dt);\\r\\n\\t\\tbox3 \\t= new Box2D(-r2, r, -r, r);\\r\\n\\t\\tbounds3 = arc3.boundingBox();\\r\\n\\t\\tassertTrue(box3.almostEquals(bounds3, Shape2D.ACCURACY));\\r\\n\\t\\r\\n\\t}\",\n \"private void generateMap(){\\n int[] blockStepX = {X_STEP, 0, -X_STEP, -X_STEP, 0, X_STEP};\\n int[] blockStepY = {Y_STEP_ONE, Y_STEP_TWO, Y_STEP_ONE, -Y_STEP_ONE, -Y_STEP_TWO, -Y_STEP_ONE};\\n int blockSpecialValue = 0;\\n int cellSpecial = 0;\\n\\n mapCells[origin.x/10][origin.y/10] = new EschatonCell(new CellPosition(0, 0, 0),\\n new Point(origin.x, origin.y), blockSpecialValue);\\n\\n cellGrid[0][0][0] = new EschatonCell(new CellPosition(0, 0, 0),\\n new Point(origin.x, origin.y), blockSpecialValue);\\n\\n for (int distanceFromOrigin = 0; distanceFromOrigin < config.getSizeOfMap();\\n distanceFromOrigin++){\\n\\n int[] blockXVals = {origin.x,\\n origin.x + X_STEP * distanceFromOrigin,\\n origin.x + X_STEP * distanceFromOrigin,\\n origin.x,\\n origin.x - X_STEP * distanceFromOrigin,\\n origin.x - X_STEP * distanceFromOrigin};\\n\\n int[] blockYVals = {origin.y - Y_STEP_TWO * distanceFromOrigin,\\n origin.y - Y_STEP_ONE * distanceFromOrigin,\\n origin.y + Y_STEP_ONE * distanceFromOrigin,\\n origin.y + Y_STEP_TWO * distanceFromOrigin,\\n origin.y + Y_STEP_ONE * distanceFromOrigin,\\n origin.y - Y_STEP_ONE * distanceFromOrigin};\\n\\n blockSpecialValue = getRandomNumber(distanceFromOrigin, 0, 0);\\n\\n for (int block = 0; block < NUMBER_OF_BLOCKS; block ++){\\n\\n int blockXOrdinal = blockXVals[block];\\n int blockYOrdinal = blockYVals[block];\\n\\n for (int blockSize = 0; blockSize < distanceFromOrigin; blockSize++){\\n if(blockSpecialValue == blockSize){\\n cellSpecial = getRandomNumber(2, 1, 1);\\n }else {\\n cellSpecial = 0;\\n }\\n cellGrid [distanceFromOrigin][block+1][blockSize+1] = makeNewCell(\\n new CellPosition(distanceFromOrigin,block+1, blockSize+1),\\n new Point(blockXOrdinal + blockStepX[block] * (blockSize + 1),\\n blockYOrdinal + blockStepY[block] * (blockSize + 1)), cellSpecial);\\n }\\n }\\n }\\n }\",\n \"public void createClusters() {\\n\\t\\t/*\\n\\t\\t * double simAvg = documentDao.getSimilarity(avg); double simMax =\\n\\t\\t * documentDao.getSimilarity(max); double simMin =\\n\\t\\t * documentDao.getSimilarity(min);\\n\\t\\t */\\n\\n\\t\\t// initClusters();\\n\\n\\t\\tList docList = documentDao.getDocumentListOrderBySimilarity();\\n\\t\\tList clusterList = clusterDao.getClusterList();\\n\\n\\t\\tint i = 0;\\n\\t\\tCluster cluster = clusterList.get(i);\\n\\t\\tfor (Document document : docList) {\\n\\t\\t\\twhile (document.getSimilarity() < cluster.getLow()) {\\n\\t\\t\\t\\tcluster = clusterList.get(++i);\\n\\t\\t\\t}\\n\\t\\t\\tif (document.getSimilarity() < cluster.getHigh() && document.getSimilarity() >= cluster.getLow()) {\\n\\t\\t\\t\\tdocument.setClusterId(cluster.getId());\\n\\t\\t\\t\\tdocumentDao.insertDocument(document);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\",\n \"private void getNeighbouringCells(Index3D current, Index3D center, int clusterLabel) {\\n\\n int integerIndexForm = current.i1() + current.i2() * x + current.i3() * x * y;\\n\\n /**Check if the voxel is part of the cluster */\\n if ((getLabel(current) == clusterLabel) &&\\n !cellCluster.contains(integerIndexForm)) {\\n\\n if (!current.equals(center)) {\\n voxelStack.push(current);\\n }\\n\\n /**Spread recursively from the voxel if it exists within the\\n * boundary of the center voxel */\\n if (checkSubBoundary(current, center)) {\\n cellCluster.add(integerIndexForm);\\n\\n /**Check for all 26-neighbour voxels reachable from the\\n * current voxel */\\n for (int i = current.i1() - 1; i < x\\n && i >= 0 && i <= current.i1() + 1; i++) {\\n for (int j = current.i2() - 1; j < y\\n && j >= 0 && j <= current.i2() + 1; j++) {\\n for (int k = current.i3() - 1; k < z\\n && k >= 0 && k <= current.i3() + 1; k++) {\\n getNeighbouringCells(new Index3D(i, j, k), center, clusterLabel);\\n }\\n }\\n }\\n }\\n }\\n }\",\n \"private void initExplorationBounds() {\\n switch (configuration.getCoverageCriteria()) {\\n case GOAL_COVERAGE:\\n case BRANCH_COVERAGE:\\n configuration.setObjectScope(configuration.isIncrementalLoopUnroll() ?\\n FajitaConfiguration.INITIAL_INCREMENTAL_OBJECT_SCOPE :\\n configuration.getMaximumObjectScope()\\n );\\n configuration.setLoopUnroll(configuration.isIncrementalLoopUnroll() ?\\n FajitaConfiguration.INITIAL_INCREMENAL_LOOP_UNROLL :\\n configuration.getMaximumLoopUnroll()\\n );\\n break;\\n case CLASS_COVERAGE:\\n case DUAL_CLASS_BRANCH_COVERAGE:\\n configuration.setObjectScope(configuration.getMaximumObjectScope());\\n configuration.setLoopUnroll(configuration.getMaximumLoopUnroll());\\n break;\\n }\\n }\",\n \"public Cluster(Point minPoint, Point maxPoint) {\\n\\t\\tthis.minPoint = minPoint;\\n\\t\\tthis.maxPoint = maxPoint;\\n\\t}\",\n \"@NonNull JavaBoundingBox[] collision();\",\n \"private void setBounds(RectProto.Builder builderForValue) {\\n this.bounds_ = (RectProto) builderForValue.build();\\n this.bitField0_ |= 8;\\n }\",\n \"@Override\\n\\tprotected void buildCircuit() {\\n\\t\\tthis.circuit.add(new Point2f(97, -98));\\n\\t\\tthis.circuit.add(new Point2f(-3, -98));\\n\\t\\tthis.circuit.add(new Point2f(-3, -2));\\n\\t\\t\\n\\t\\t// U-turn (step 2)\\n\\t\\tthis.circuit.add(new Point2f(-111, -2));\\n\\t\\tthis.circuit.add(new Point2f(-111, 2));\\n\\t\\t\\n\\t\\t// Semi-Loop, bottom-left block (step 3)\\n\\t\\tthis.circuit.add(new Point2f(-3, 2));\\n\\t\\tthis.circuit.add(new Point2f(-3, 106));\\n\\t\\tthis.circuit.add(new Point2f(97, 106));\\n\\t}\",\n \"public void ComputeBounds( Vec3 min, Vec3 max )\\r\\n\\t{\\r\\n\\t\\tfor ( int iTempCount = 1; iTempCount <= 3; iTempCount++ )\\r\\n\\t\\t{\\r\\n\\t\\t\\tVec3 tempPoint = m_vertices[iTempCount];\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif ( tempPoint.xCoord < min.xCoord )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmin.xCoord = tempPoint.xCoord;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if ( tempPoint.xCoord > max.xCoord )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmax.xCoord = tempPoint.xCoord;\\r\\n\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif ( tempPoint.yCoord < min.yCoord )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmin.yCoord = tempPoint.yCoord;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if ( tempPoint.yCoord > max.yCoord )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmax.yCoord = tempPoint.yCoord;\\r\\n\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif ( tempPoint.zCoord < min.zCoord )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmin.zCoord = tempPoint.zCoord;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if ( tempPoint.zCoord > max.zCoord )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tmax.zCoord = tempPoint.zCoord;\\r\\n\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t}\\t\\t\\r\\n\\t}\"\n]"},"negative_scores":{"kind":"list like","value":["0.5955002","0.5948939","0.5758232","0.57174754","0.5699636","0.56248194","0.56018734","0.54651815","0.5463193","0.5407469","0.53848016","0.5370827","0.53603095","0.5323533","0.5301888","0.529562","0.52829105","0.52731025","0.5270946","0.5263991","0.5229957","0.5203069","0.5171937","0.5161771","0.51484025","0.51405376","0.51392955","0.5133741","0.5131023","0.5130976","0.5118342","0.51125216","0.5110185","0.510815","0.5105889","0.5105824","0.5099933","0.5090062","0.5081323","0.5061195","0.50581","0.50347877","0.5030945","0.5024817","0.50188255","0.49833256","0.49722895","0.49702278","0.4959845","0.49557284","0.49541816","0.49504206","0.49113792","0.49038112","0.49029428","0.49002942","0.48991704","0.4891567","0.48739892","0.48708224","0.48670435","0.48663327","0.4859014","0.48545048","0.48489216","0.48400643","0.48252636","0.48235983","0.4812963","0.48106557","0.48024175","0.47685885","0.47542167","0.47535688","0.4748939","0.47455487","0.4736942","0.4736847","0.47268072","0.47175533","0.4708136","0.47065285","0.47061864","0.47015464","0.46924353","0.4690048","0.46878284","0.46864164","0.46822852","0.46815762","0.46801177","0.46671334","0.46616948","0.46615714","0.46566164","0.46536222","0.46526104","0.46488783","0.46465656","0.46453595"],"string":"[\n \"0.5955002\",\n \"0.5948939\",\n \"0.5758232\",\n \"0.57174754\",\n \"0.5699636\",\n \"0.56248194\",\n \"0.56018734\",\n \"0.54651815\",\n \"0.5463193\",\n \"0.5407469\",\n \"0.53848016\",\n \"0.5370827\",\n \"0.53603095\",\n \"0.5323533\",\n \"0.5301888\",\n \"0.529562\",\n \"0.52829105\",\n \"0.52731025\",\n \"0.5270946\",\n \"0.5263991\",\n \"0.5229957\",\n \"0.5203069\",\n \"0.5171937\",\n \"0.5161771\",\n \"0.51484025\",\n \"0.51405376\",\n \"0.51392955\",\n \"0.5133741\",\n \"0.5131023\",\n \"0.5130976\",\n \"0.5118342\",\n \"0.51125216\",\n \"0.5110185\",\n \"0.510815\",\n \"0.5105889\",\n \"0.5105824\",\n \"0.5099933\",\n \"0.5090062\",\n \"0.5081323\",\n \"0.5061195\",\n \"0.50581\",\n \"0.50347877\",\n \"0.5030945\",\n \"0.5024817\",\n \"0.50188255\",\n \"0.49833256\",\n \"0.49722895\",\n \"0.49702278\",\n \"0.4959845\",\n \"0.49557284\",\n \"0.49541816\",\n \"0.49504206\",\n \"0.49113792\",\n \"0.49038112\",\n \"0.49029428\",\n \"0.49002942\",\n \"0.48991704\",\n \"0.4891567\",\n \"0.48739892\",\n \"0.48708224\",\n \"0.48670435\",\n \"0.48663327\",\n \"0.4859014\",\n \"0.48545048\",\n \"0.48489216\",\n \"0.48400643\",\n \"0.48252636\",\n \"0.48235983\",\n \"0.4812963\",\n \"0.48106557\",\n \"0.48024175\",\n \"0.47685885\",\n \"0.47542167\",\n \"0.47535688\",\n \"0.4748939\",\n \"0.47455487\",\n \"0.4736942\",\n \"0.4736847\",\n \"0.47268072\",\n \"0.47175533\",\n \"0.4708136\",\n \"0.47065285\",\n \"0.47061864\",\n \"0.47015464\",\n \"0.46924353\",\n \"0.4690048\",\n \"0.46878284\",\n \"0.46864164\",\n \"0.46822852\",\n \"0.46815762\",\n \"0.46801177\",\n \"0.46671334\",\n \"0.46616948\",\n \"0.46615714\",\n \"0.46566164\",\n \"0.46536222\",\n \"0.46526104\",\n \"0.46488783\",\n \"0.46465656\",\n \"0.46453595\"\n]"},"document_score":{"kind":"string","value":"0.7197272"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":991,"cells":{"query":{"kind":"string","value":"Removes the cluster boundaries."},"document":{"kind":"string","value":"private void removeBoundaries(Graph graph, Boundaries boundaries) {\n for (Edge boundaryEdge : boundaries.edges) {\n graph.remove(boundaryEdge);\n }\n for (Node boundaryNode : boundaries.nodes) {\n graph.remove(boundaryNode);\n }\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public Centroid removeCentroid();","public void clearCentroids();","public void removeNeighbours(){\n\t\tgetNeighbours().removeAll(getNeighbours());\n\t}","public void clearCentroidVectors();","void removeNeighbors();","public void removeAllEdges() {\n }","void removeIsBoundaryNodeOf(Boundary oldIsBoundaryNodeOf);","public void cleanUp(){\n\t\t//offset(-1*bounds.left, -1*bounds.top);\n\t}","public void balanceCentroids() {\n for(Cluster cluster : clusters)\n cluster.recalculateCentroid();\n }","private void removeArea() {\n \t\tthis.set.remove( this.area );\n \t\tthis.finish();\n \t}","@Override\n public void prune(long boundaryValue)\n {\n Iterator iterator = segments.iterator();\n while(iterator.hasNext())\n {\n MemorySegment segment = iterator.next();\n if(segment.lastVal() < boundaryValue)\n {\n iterator.remove();\n }\n }\n\n //Note: This maintains a currentSegment even if all segments have\n // been pruned.\n if(segments.size() == 0)\n {\n addSegment();\n }\n }","void forceRemoveNodesAndExit(Collection nodesToRemove) throws Exception;","private void clean() {\n Iterable v = vertices();\n Iterator iter = v.iterator();\n while (iter.hasNext()) {\n Long n = iter.next();\n if (world.get(n).adj.size() == 0) {\n iter.remove();\n }\n }\n }","public void removeCutVertices() {\n boolean found;\n LinkedList isolated = new LinkedList<>();\n do {\n found = false;\n for (Map.Entry> entry : adjacencyMap.entrySet()) {\n// System.out.println(\"adjacency print key: \" + entry.getKey() + \"value: \" +\n// entry.getValue() + \"set size: \" + entry.getValue().size());\n if (entry.getValue().size() == 1) {\n// System.out.println(\"found cut vertex\");\n found = true; // loop yielded a cut vertex\n // get the only vertex in the set\n for (Integer integer : entry.getValue()) {\n// System.out.println(\"started set iterator\" + integer);\n int removalSet = integer; // take the value of the set element\n // create a temp set\n Set tempSet = adjacencyMap.get(removalSet);\n tempSet.remove(entry.getKey()); // remove the cut vertex from this set\n adjacencyMap.replace(removalSet, tempSet); // put the smaller set in place\n }\n isolated.add(entry.getKey());\n\n\n }\n\n }\n // remove isolated vertices\n for (Integer vert : isolated) {\n adjacencyMap.remove(vert);\n }\n isolated.clear();\n } while (found);\n }","private void trimX() {\n\t\tint indexIntoBranches = 0;\n\t\tfor (int i = 0; i < this.branches.size(); i++) {\n\t\t\tif (this.branches.get(i).size() == this.numXVertices) {\n\t\t\t\tindexIntoBranches = i;\n\t\t\t}\n\t\t}\n\n\t\tthis.allX = (ArrayList) this.branches.get(indexIntoBranches).clone(); // We need this for a set difference above\n\n\t\tfor (int k = 0; k < this.branches.get(indexIntoBranches).size(); k++) {\n\t\t\tfor (int j = 0; j < this.branches.get(indexIntoBranches).size(); j++) {\n\t\t\t\t// Ignore if the index is the same - otherwise remove the edges\n\t\t\t\tif (!(k == j)) {\n\t\t\t\t\tthis.branches.get(indexIntoBranches).get(k)\n\t\t\t\t\t\t\t.removeNeighbor(this.branches.get(indexIntoBranches).get(j));\n\t\t\t\t\tthis.branches.get(indexIntoBranches).get(j)\n\t\t\t\t\t\t\t.removeNeighbor(this.branches.get(indexIntoBranches).get(k));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","private void clearBounds() {\n this.bounds_ = null;\n this.bitField0_ &= -9;\n }","private void destroyBounds() {\n size -= 4;\n this.setBounds(bounds.left, bounds.top);\n if (size <= 0) models.remove(this);\n }","public void prune(double belowThreshold) {\n \n for(T first : getFirstDimension()) {\n \n for(T second : getMatches(first)) {\n \n if(get(first, second)[] toRemove = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n toRemove[i] = new ArrayList();\n }\n for (int i = 0; i < n; i++) {\n for (int j : x[i].getDomain()) {\n ////System.out.println(i + \" \" + j);\n if (map2Node[i] != map2Node[Map.get(j)] && MaxMatch[i] != Map.get(j)) {\n toRemove[i].add(j);\n if (debug == 1) System.out.println(\"Remove arc : \" + i + \" => \" + j);\n }\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j : toRemove[i]) {\n x[i].removeValue(j);\n }\n }\n }","void unsetRoadTerrain();","public void invalidateBounds() {\n\t\telementsBounds = null;\n\t}","public void removeKMeansListener(SME_KMeansListener l);","protected void removeFromCluster (int bodyOid)\n {\n ClusterRecord clrec = getCluster(bodyOid);\n if (clrec != null) {\n clrec.removeBody(bodyOid);\n }\n }","public void unsetIntersectingRoadwayRef()\r\n {\r\n synchronized (monitor())\r\n {\r\n check_orphaned();\r\n get_store().remove_attribute(INTERSECTINGROADWAYREF$20);\r\n }\r\n }","void removeAllSpawn();","void removeRegion(Region region);","public void clearVectors();","public void removeEdge(int start, int end);","public void removeIndexInterval(long index0, long index1) {\n return;\r\n }","private void removeQueryBoundsFromGeometryRegistry(QueryRegion region)\r\n {\r\n myToolbox.getGeometryRegistry().removeGeometriesForSource(this, new HashSet(region.getGeometries()));\r\n }","public void deleteSelected() {\r\n \t\tObject cells[] = graph.getSelectionCells();\r\n \t\tGraphModel graphmodel = graph.getModel();\r\n \r\n \t\t// If a cell is a blocking region avoid removing its edges and\r\n \t\t// select its element at the end of the removal process\r\n \t\tSet edges = new HashSet();\r\n \t\tSet | |