1 /*
2 * Copyright (c) 1998, 2003, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation. Oracle designates this
8 * particular file as subject to the "Classpath" exception as provided
9 * by Oracle in the LICENSE file that accompanied this code.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
83 {
84 Crossings cross = new EvenOdd(xlo, ylo, xhi, yhi);
85 Enumeration enum_ = curves.elements();
86 while (enum_.hasMoreElements()) {
87 Curve c = (Curve) enum_.nextElement();
88 if (c.accumulateCrossings(cross)) {
89 return null;
90 }
91 }
92 if (debug) {
93 cross.print();
94 }
95 return cross;
96 }
97
98 public static Crossings findCrossings(PathIterator pi,
99 double xlo, double ylo,
100 double xhi, double yhi)
101 {
102 Crossings cross;
103 if (pi.getWindingRule() == pi.WIND_EVEN_ODD) {
104 cross = new EvenOdd(xlo, ylo, xhi, yhi);
105 } else {
106 cross = new NonZero(xlo, ylo, xhi, yhi);
107 }
108 // coords array is big enough for holding:
109 // coordinates returned from currentSegment (6)
110 // OR
111 // two subdivided quadratic curves (2+4+4=10)
112 // AND
113 // 0-1 horizontal splitting parameters
114 // OR
115 // 2 parametric equation derivative coefficients
116 // OR
117 // three subdivided cubic curves (2+6+6+6=20)
118 // AND
119 // 0-2 horizontal splitting parameters
120 // OR
121 // 3 parametric equation derivative coefficients
122 double coords[] = new double[23];
123 double movx = 0;
|
1 /*
2 * Copyright (c) 1998, 2014, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation. Oracle designates this
8 * particular file as subject to the "Classpath" exception as provided
9 * by Oracle in the LICENSE file that accompanied this code.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
83 {
84 Crossings cross = new EvenOdd(xlo, ylo, xhi, yhi);
85 Enumeration enum_ = curves.elements();
86 while (enum_.hasMoreElements()) {
87 Curve c = (Curve) enum_.nextElement();
88 if (c.accumulateCrossings(cross)) {
89 return null;
90 }
91 }
92 if (debug) {
93 cross.print();
94 }
95 return cross;
96 }
97
98 public static Crossings findCrossings(PathIterator pi,
99 double xlo, double ylo,
100 double xhi, double yhi)
101 {
102 Crossings cross;
103 if (pi.getWindingRule() == PathIterator.WIND_EVEN_ODD) {
104 cross = new EvenOdd(xlo, ylo, xhi, yhi);
105 } else {
106 cross = new NonZero(xlo, ylo, xhi, yhi);
107 }
108 // coords array is big enough for holding:
109 // coordinates returned from currentSegment (6)
110 // OR
111 // two subdivided quadratic curves (2+4+4=10)
112 // AND
113 // 0-1 horizontal splitting parameters
114 // OR
115 // 2 parametric equation derivative coefficients
116 // OR
117 // three subdivided cubic curves (2+6+6+6=20)
118 // AND
119 // 0-2 horizontal splitting parameters
120 // OR
121 // 3 parametric equation derivative coefficients
122 double coords[] = new double[23];
123 double movx = 0;
|