boolean ret = this.capturePoint.epsilonEquals(other.capturePoint, epsilon); ret &= this.desiredCapturePoint.epsilonEquals(other.desiredCapturePoint, epsilon); ret &= this.leftFootSupportPolygonStore[i].epsilonEquals(other.leftFootSupportPolygonStore[i], epsilon); ret &= this.rightFootSupportPolygonStore[i].epsilonEquals(other.rightFootSupportPolygonStore[i], epsilon);
if (curr.epsilonEquals(temp, 1e-7))
@Override public boolean epsilonEquals(ConvexPolygon2d convexPolygon, double threshold) { checkIfUpToDate(); if (getNumberOfVertices() != convexPolygon.getNumberOfVertices()) return false; for (int i = 0; i < convexPolygon.getNumberOfVertices(); i++) { if (!convexPolygon.getVertex(i).epsilonEquals(getVertex(i), threshold)) return false; } return true; }
@Override public boolean epsilonEquals(BlindWalkingPacket other, double epsilon) { boolean ret = this.getDesiredDestination().epsilonEquals(other.getDesiredDestination(), epsilon); ret &= (this.getBlindWalkingDirection().equals(other.getBlindWalkingDirection())); ret &= (this.getBlindWalkingSpeed().equals(other.getBlindWalkingSpeed())); return ret; }
if (foundIntersections == 2 && pointToPack1.epsilonEquals(pointToPack2, epsilon)) foundIntersections--; if (foundIntersections == 2) break; if (foundIntersections == 2 && pointToPack1.epsilonEquals(pointToPack2, epsilon)) foundIntersections--; if (foundIntersections == 2) break; if (foundIntersections == 2 && pointToPack1.epsilonEquals(pointToPack2, epsilon)) foundIntersections--; if (foundIntersections == 2) break; // performance only
if (!currentPoint.epsilonEquals(dummyPointA, 1e-13) && !currentPoint.epsilonEquals(dummyPointB, 1e-13)) if (!currentPoint.epsilonEquals(dummyPoint1, 1e-13) && !currentPoint.epsilonEquals(dummyPoint2, 1e-13))
if (foundIntersections == 2 && pointToPack1.epsilonEquals(pointToPack2, epsilon)) foundIntersections--;