Prune trailing whitespace
This commit is contained in:
@@ -65,9 +65,9 @@ public class AffineTransform implements Cloneable, Serializable
|
||||
|
||||
/*
|
||||
* Method returns type of affine transformation.
|
||||
*
|
||||
*
|
||||
* Transform matrix is m00 m01 m02 m10 m11 m12
|
||||
*
|
||||
*
|
||||
* According analytic geometry new basis vectors are (m00, m01) and (m10,
|
||||
* m11), translation vector is (m02, m12). Original basis vectors are (1, 0)
|
||||
* and (0, 1). Type transformations classification: TYPE_IDENTITY - new
|
||||
@@ -294,7 +294,7 @@ public class AffineTransform implements Cloneable, Serializable
|
||||
|
||||
/**
|
||||
* Multiply matrix of two AffineTransform objects
|
||||
*
|
||||
*
|
||||
* @param t1
|
||||
* - the AffineTransform object is a multiplicand
|
||||
* @param t2
|
||||
|
||||
@@ -17,7 +17,7 @@ class Crossing
|
||||
|
||||
/**
|
||||
* Solves quadratic equation
|
||||
*
|
||||
*
|
||||
* @param eqn the coefficients of the equation
|
||||
* @param res the roots of the equation
|
||||
* @return a number of roots
|
||||
@@ -50,7 +50,7 @@ class Crossing
|
||||
|
||||
/**
|
||||
* Solves cubic equation
|
||||
*
|
||||
*
|
||||
* @param eqn the coefficients of the equation
|
||||
* @param res the roots of the equation
|
||||
* @return a number of roots
|
||||
@@ -103,7 +103,7 @@ class Crossing
|
||||
|
||||
/**
|
||||
* Excludes double roots. Roots are double if they lies enough close with each other.
|
||||
*
|
||||
*
|
||||
* @param res the roots
|
||||
* @param rc the roots count
|
||||
* @return new roots count
|
||||
|
||||
@@ -39,14 +39,14 @@ public interface IShape
|
||||
|
||||
/**
|
||||
* Returns an iterator over the path described by this shape.
|
||||
*
|
||||
*
|
||||
* @param at if supplied, the points in the path are transformed using this.
|
||||
*/
|
||||
PathIterator getPathIterator (AffineTransform at);
|
||||
|
||||
/**
|
||||
* Returns an iterator over the path described by this shape.
|
||||
*
|
||||
*
|
||||
* @param at if supplied, the points in the path are transformed using this.
|
||||
* @param flatness when approximating curved segments with lines, this controls the maximum
|
||||
* distance the lines are allowed to deviate from the approximated curve, thus a higher
|
||||
|
||||
@@ -22,7 +22,7 @@ public class Lines
|
||||
// F = (x2-x3, y2-y3) = A-B
|
||||
//
|
||||
// Result is ((AxB) * (AxC) <= 0) and ((DxE) * (DxF) <= 0)
|
||||
//
|
||||
//
|
||||
// DxE = (C-B)x(-B) = BxB-CxB = BxC
|
||||
// DxF = (C-B)x(A-B) = CxA-CxB-BxA+BxB = AxB+BxC-AxC
|
||||
x2 -= x1; // A
|
||||
|
||||
@@ -263,7 +263,7 @@ public final class Path implements IShape, Cloneable
|
||||
/**
|
||||
* Checks points and types buffer size to add pointCount points. If necessary realloc buffers
|
||||
* to enlarge size.
|
||||
*
|
||||
*
|
||||
* @param pointCount the point count to be added in buffer
|
||||
*/
|
||||
protected void checkBuf (int pointCount, boolean checkMove) {
|
||||
@@ -284,7 +284,7 @@ public final class Path implements IShape, Cloneable
|
||||
|
||||
/**
|
||||
* Checks cross count according to path rule to define is it point inside shape or not.
|
||||
*
|
||||
*
|
||||
* @param cross the point cross count.
|
||||
* @return true if point is inside path, or false otherwise.
|
||||
*/
|
||||
|
||||
Reference in New Issue
Block a user