1 /* AxisHints.java -- Hints specific to an axis 2 Copyright (C) 2006 Free Software Foundation, Inc. 3 4 This file is part of GNU Classpath. 5 6 GNU Classpath is free software; you can redistribute it and/or modify 7 it under the terms of the GNU General Public License as published by 8 the Free Software Foundation; either version 2, or (at your option) 9 any later version. 10 11 GNU Classpath is distributed in the hope that it will be useful, but 12 WITHOUT ANY WARRANTY; without even the implied warranty of 13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14 General Public License for more details. 15 16 You should have received a copy of the GNU General Public License 17 along with GNU Classpath; see the file COPYING. If not, write to the 18 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 19 02110-1301 USA. 20 21 Linking this library statically or dynamically with other modules is 22 making a combined work based on this library. Thus, the terms and 23 conditions of the GNU General Public License cover the whole 24 combination. 25 26 As a special exception, the copyright holders of this library give you 27 permission to link this library with independent modules to produce an 28 executable, regardless of the license terms of these independent 29 modules, and to copy and distribute the resulting executable under 30 terms of your choice, provided that you also meet, for each linked 31 independent module, the terms and conditions of the license of that 32 module. An independent module is a module which is not derived from 33 or based on this library. If you modify this library, you may extend 34 this exception to your version of the library, but you are not 35 obligated to do so. If you do not wish to do so, delete this 36 exception statement from your version. */ 37 38 39 package gnu.java.awt.font.autofit; 40 41 class AxisHints 42 { 43 44 Segment[] segments; 45 int majorDir; 46 int numSegments; 47 int numEdges; 48 Edge[] edges; 49 AxisHints()50 AxisHints() 51 { 52 segments = new Segment[4]; 53 edges = new Edge[4]; 54 } 55 newSegment()56 Segment newSegment() 57 { 58 if (numSegments >= segments.length) 59 { 60 // Grow array. 61 int newMax = segments.length; 62 newMax += (newMax >> 2) + 4; // From FreeType. 63 Segment[] newSegs = new Segment[newMax]; 64 System.arraycopy(segments, 0, newSegs, 0, numSegments); 65 segments = newSegs; 66 } 67 Segment seg = new Segment(); 68 segments[numSegments] = seg; 69 numSegments++; 70 return seg; 71 } 72 newEdge(int pos)73 public Edge newEdge(int pos) 74 { 75 if (numEdges >= edges.length) 76 { 77 // Grow array. 78 int newMax = edges.length; 79 newMax += (newMax >> 2) + 4; // From FreeType. 80 Edge[] newEdges = new Edge[newMax]; 81 System.arraycopy(edges, 0, newEdges, 0, numEdges); 82 edges = newEdges; 83 } 84 int edgeIndex = numEdges; 85 Edge edge = edges[edgeIndex] = new Edge(); 86 while (edgeIndex > 0 && edges[edgeIndex - 1].fpos > pos) 87 { 88 edges[edgeIndex] = edges[edgeIndex - 1]; 89 edgeIndex--; 90 } 91 edges[edgeIndex] = edge; 92 numEdges++; 93 edge.fpos = pos; 94 95 return edge; 96 97 } 98 getEdgeIndex(Edge edge2)99 int getEdgeIndex(Edge edge2) 100 { 101 int idx = -1; 102 for (int i = 0; i < numEdges; i++) 103 { 104 if (edges[i] == edge2) 105 { 106 idx = i; 107 break; 108 } 109 } 110 return idx; 111 } 112 } 113