< prev index next >

src/java.desktop/share/classes/sun/java2d/loops/ProcessPath.java

Print this page

        

*** 1,7 **** /* ! * Copyright (c) 2005, 2014, 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) 2005, 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
*** 858,868 **** private static void ProcessQuad(ProcessHandler hnd, float[] coords, int[] pixelInfo) { /* Temporary array for holding parameters corresponding to the extreme * in X and Y points */ ! double params[] = new double[2]; int cnt = 0; double param; /* Simple check for monotonicity in X before searching for the extreme * points of the X(t) function. We first check if the curve is --- 858,868 ---- private static void ProcessQuad(ProcessHandler hnd, float[] coords, int[] pixelInfo) { /* Temporary array for holding parameters corresponding to the extreme * in X and Y points */ ! double[] params = new double[2]; int cnt = 0; double param; /* Simple check for monotonicity in X before searching for the extreme * points of the X(t) function. We first check if the curve is
*** 1226,1238 **** float[] coords, int[] pixelInfo) { /* Temporary array for holding parameters corresponding to the extreme * in X and Y points */ ! double params[] = new double[4]; ! double eqn[] = new double[3]; ! double res[] = new double[2]; int cnt = 0; /* Simple check for monotonicity in X before searching for the extreme * points of the X(t) function. We first check if the curve is * monotonic in X by seeing if all of the X coordinates are strongly --- 1226,1238 ---- float[] coords, int[] pixelInfo) { /* Temporary array for holding parameters corresponding to the extreme * in X and Y points */ ! double[] params = new double[4]; ! double[] eqn = new double[3]; ! double[] res = new double[2]; int cnt = 0; /* Simple check for monotonicity in X before searching for the extreme * points of the X(t) function. We first check if the curve is * monotonic in X by seeing if all of the X coordinates are strongly
*** 1360,1370 **** float x2, float y2, int[] pixelInfo) { float xMin, yMin, xMax, yMax; int X1, Y1, X2, Y2, X3, Y3, res; boolean clipped = false; float x3,y3; ! float c[] = new float[]{x1, y1, x2, y2, 0, 0}; boolean lastClipped; xMin = hnd.dhnd.xMinf; yMin = hnd.dhnd.yMinf; --- 1360,1370 ---- float x2, float y2, int[] pixelInfo) { float xMin, yMin, xMax, yMax; int X1, Y1, X2, Y2, X3, Y3, res; boolean clipped = false; float x3,y3; ! float[] c = new float[]{x1, y1, x2, y2, 0, 0}; boolean lastClipped; xMin = hnd.dhnd.xMinf; yMin = hnd.dhnd.yMinf;
*** 1464,1478 **** } private static boolean doProcessPath(ProcessHandler hnd, Path2D.Float p2df, float transXf, float transYf) { ! float coords[] = new float[8]; ! float tCoords[] = new float[8]; ! float closeCoord[] = new float[] {0.0f, 0.0f}; ! float firstCoord[] = new float[2]; ! int pixelInfo[] = new int[5]; boolean subpathStarted = false; boolean skip = false; float lastX, lastY; pixelInfo[0] = 0; --- 1464,1478 ---- } private static boolean doProcessPath(ProcessHandler hnd, Path2D.Float p2df, float transXf, float transYf) { ! float[] coords = new float[8]; ! float[] tCoords = new float[8]; ! float[] closeCoord = new float[] {0.0f, 0.0f}; ! float[] firstCoord = new float[2]; ! int[] pixelInfo = new int[5]; boolean subpathStarted = false; boolean skip = false; float lastX, lastY; pixelInfo[0] = 0;
*** 2041,2051 **** boolean lastClipped; /* This function is used only for filling shapes, so there is no * check for the type of clipping */ ! int c[] = new int[]{x1, y1, x2, y2, 0, 0}; outXMin = (int)(dhnd.xMinf * MDP_MULT); outXMax = (int)(dhnd.xMaxf * MDP_MULT); outYMin = (int)(dhnd.yMinf * MDP_MULT); outYMax = (int)(dhnd.yMaxf * MDP_MULT); --- 2041,2051 ---- boolean lastClipped; /* This function is used only for filling shapes, so there is no * check for the type of clipping */ ! int[] c = new int[]{x1, y1, x2, y2, 0, 0}; outXMin = (int)(dhnd.xMinf * MDP_MULT); outXMax = (int)(dhnd.xMaxf * MDP_MULT); outYMin = (int)(dhnd.yMinf * MDP_MULT); outYMax = (int)(dhnd.yMaxf * MDP_MULT);
< prev index next >