CartesianGeometricUtilities { public static double euclideanDistance(ArrayList<Double> x1, ArrayList<Double> x2) { double sum = 0; for (int i = 0; i < x1.size(); i++) { sum += Math.pow(x1.get(i) - x2.get(i), 2); } return Math.sqrt(sum); }  static Tuple2D centerAndScale(Tuple2D toScale, int width, int height); static Vertex centerAndScale(Vertex toScale, int width, int height, int depth); static double centerAndScale(double toScale, int maxDimension); static Tuple2D Bottom1DCenterAndScale(Tuple2D toScale, int width, int height); static Tuple2D bottomCenterAndScale(Tuple2D toScale, int width, int height); static double bottomScale(double toScale, int maxDimension); static double shortestDistanceToLineSegment(ILocated2D p1, ILocated2D l1, ILocated2D l2); static double shortestDistanceToLineSegment(double x, double y, double x1, double x2, double y1, double y2); static double euclideanDistance(ArrayList<Double> x1, ArrayList<Double> x2); static double[] polarToCartesian(double r, double theta); static double signedAngleFromSourceHeadingToTarget(ILocated2D source, ILocated2D target, double sourceRads); static double signedAngleDifference(ILocated2D v1, ILocated2D v2); static double signedAngleDifference(double rad1, double rad2); static boolean sourceHeadingTowardsTarget(double sourceRadians, ILocated2D source, ILocated2D target,
			double allowance); static boolean onSideOf(ILocated2D source, double sourceRadians, ILocated2D other, boolean right); static double restrictRadians(double rads);  }
@Test public void testEuclideanDistance() { double x = 3; double y = 4; ArrayList<Double> x1 = new ArrayList<Double>(); ArrayList<Double> x2 = new ArrayList<Double>(); x1.add(x); x1.add(0.0); x2.add(0.0); x2.add(y); assertEquals(5, CartesianGeometricUtilities.euclideanDistance(x1, x2), DOUBLE_THRESHOLD); }