< prev index next >

src/java.desktop/share/classes/sun/awt/geom/Order2.java

Print this page

        

*** 1,7 **** /* ! * Copyright (c) 1998, 2006, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. Oracle designates this --- 1,7 ---- /* ! * Copyright (c) 1998, 2018, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. Oracle designates this
*** 45,55 **** private double xcoeff2; private double ycoeff0; private double ycoeff1; private double ycoeff2; ! public static void insert(Vector<Curve> curves, double tmp[], double x0, double y0, double cx0, double cy0, double x1, double y1, int direction) { --- 45,55 ---- private double xcoeff2; private double ycoeff0; private double ycoeff1; private double ycoeff2; ! public static void insert(Vector<Curve> curves, double[] tmp, double x0, double y0, double cx0, double cy0, double x1, double y1, int direction) {
*** 107,117 **** * which is either always horizontal or never horizontal. * Completely horizontal curves need to be eliminated by other * means outside of this method. */ public static int getHorizontalParams(double c0, double cp, double c1, ! double ret[]) { if (c0 <= cp && cp <= c1) { return 0; } c0 -= cp; c1 -= cp; --- 107,117 ---- * which is either always horizontal or never horizontal. * Completely horizontal curves need to be eliminated by other * means outside of this method. */ public static int getHorizontalParams(double c0, double cp, double c1, ! double[] ret) { if (c0 <= cp && cp <= c1) { return 0; } c0 -= cp; c1 -= cp;
*** 133,143 **** * Split the quadratic Bezier stored at coords[pos...pos+5] representing * the paramtric range [0..1] into two subcurves representing the * parametric subranges [0..t] and [t..1]. Store the results back * into the array at coords[pos...pos+5] and coords[pos+4...pos+9]. */ ! public static void split(double coords[], int pos, double t) { double x0, y0, cx, cy, x1, y1; coords[pos+8] = x1 = coords[pos+4]; coords[pos+9] = y1 = coords[pos+5]; cx = coords[pos+2]; cy = coords[pos+3]; --- 133,143 ---- * Split the quadratic Bezier stored at coords[pos...pos+5] representing * the paramtric range [0..1] into two subcurves representing the * parametric subranges [0..t] and [t..1]. Store the results back * into the array at coords[pos...pos+5] and coords[pos+4...pos+9]. */ ! public static void split(double[] coords, int pos, double t) { double x0, y0, cx, cy, x1, y1; coords[pos+8] = x1 = coords[pos+4]; coords[pos+9] = y1 = coords[pos+5]; cx = coords[pos+2]; cy = coords[pos+3];
*** 405,415 **** if (yend >= y1) { t1 = 1; } else { t1 = TforY(yend, ycoeff0, ycoeff1, ycoeff2); } ! double eqn[] = new double[10]; eqn[0] = x0; eqn[1] = y0; eqn[2] = cx0; eqn[3] = cy0; eqn[4] = x1; --- 405,415 ---- if (yend >= y1) { t1 = 1; } else { t1 = TforY(yend, ycoeff0, ycoeff1, ycoeff2); } ! double[] eqn = new double[10]; eqn[0] = x0; eqn[1] = y0; eqn[2] = cx0; eqn[3] = cy0; eqn[4] = x1;
*** 432,442 **** public Curve getReversedCurve() { return new Order2(x0, y0, cx0, cy0, x1, y1, -direction); } ! public int getSegment(double coords[]) { coords[0] = cx0; coords[1] = cy0; if (direction == INCREASING) { coords[2] = x1; coords[3] = y1; --- 432,442 ---- public Curve getReversedCurve() { return new Order2(x0, y0, cx0, cy0, x1, y1, -direction); } ! public int getSegment(double[] coords) { coords[0] = cx0; coords[1] = cy0; if (direction == INCREASING) { coords[2] = x1; coords[3] = y1;
< prev index next >