File: LigatureCaretTest.java

package info (click to toggle)
openjdk-11 11.0.4%2B11-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 757,028 kB
  • sloc: java: 5,016,041; xml: 1,191,974; cpp: 934,731; ansic: 555,697; sh: 24,299; objc: 12,703; python: 3,602; asm: 3,415; makefile: 2,772; awk: 351; sed: 172; perl: 114; jsp: 24; csh: 3
file content (190 lines) | stat: -rw-r--r-- 6,290 bytes parent folder | download | duplicates (16)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
/*
 * Copyright (c) 1998, 2016, 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.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

/**
 *  @test
 *  @bug 4178145 8144015
*/

/*
 * Copyright 1998 IBM Corp.  All Rights Reserved.
 */

import java.awt.Color;
import java.awt.Font;
import java.awt.Frame;
import java.awt.Graphics;
import java.awt.Graphics2D;
import java.awt.GraphicsEnvironment;
import java.awt.font.TextAttribute;
import java.awt.font.TextLayout;
import java.awt.font.TextHitInfo;
import java.awt.font.FontRenderContext;
import java.util.Hashtable;

/**
 * This test ensures that TextLayout will not place a caret within
 * an Arabic lam-alef ligature, and will correctly caret through
 * bidirectional text with numbers.
 */

public class LigatureCaretTest {

    public static void main(String[] args) {

        testBidiWithNumbers();
        testLamAlef();
        System.out.println("LigatureCaretTest PASSED");
    }

    private static final FontRenderContext frc =
                                new FontRenderContext(null, false, false);

    private static Font getFontForText(String s) {
        GraphicsEnvironment ge =
           GraphicsEnvironment.getLocalGraphicsEnvironment();
        Font[] fonts = ge.getAllFonts();

        for (Font f : fonts) {
           if (f.canDisplayUpTo(s) == -1) {
               return f.deriveFont(Font.PLAIN, 24);
           }
        }
        return null;
    }

    /**
     * Caret through text mixed-direction text and check the results.
     * If the test fails an Error is thrown.
     * @exception an Error is thrown if the test fails
     */
    public static void testBidiWithNumbers() {

        String bidiWithNumbers = "abc\u05D0\u05D1\u05D2123abc";
        Font font = getFontForText(bidiWithNumbers);
        if (font == null) {
            return;
        }
        Hashtable map = new Hashtable();
        map.put(TextAttribute.FONT, font);

        // visual order for the text:
        // abc123<gimel><bet><aleph>abc

        int[] carets = { 0, 1, 2, 3, 7, 8, 6, 5, 4, 9, 10, 11, 12 };
        TextLayout layout = new TextLayout(bidiWithNumbers, map, frc);

        // Caret through TextLayout in both directions and check results.
        for (int i=0; i < carets.length-1; i++) {

            TextHitInfo hit = layout.getNextRightHit(carets[i]);
            if (hit.getInsertionIndex() != carets[i+1]) {
                throw new Error("right hit failed within layout");
            }
        }

        if (layout.getNextRightHit(carets[carets.length-1]) != null) {
            throw new Error("right hit failed at end of layout");
        }

        for (int i=carets.length-1; i > 0; i--) {

            TextHitInfo hit = layout.getNextLeftHit(carets[i]);
            if (hit.getInsertionIndex() != carets[i-1]) {
                throw new Error("left hit failed within layout");
            }
        }

        if (layout.getNextLeftHit(carets[0]) != null) {
            throw new Error("left hit failed at end of layout");
        }
    }

    /**
     * Ensure proper careting and hit-testing behavior with
     * a lam-alef ligature.
     * If the test fails, an Error is thrown.
     * @exception an Error is thrown if the test fails
     */
    public static void testLamAlef() {

        // lam-alef form a mandantory ligature.
        final String lamAlef = "\u0644\u0627";
        final String ltrText = "abcd";

        Font font = getFontForText(lamAlef+ltrText);
        if (font == null) {
            return;
        }
        Hashtable map = new Hashtable();
        map.put(TextAttribute.FONT, font);

        // Create a TextLayout with just a lam-alef sequence.  There
        // should only be two valid caret positions:  one at
        // insertion offset 0 and the other at insertion offset 2.
        TextLayout layout = new TextLayout(lamAlef, map, frc);

        TextHitInfo hit;

        hit = layout.getNextLeftHit(0);
        if (hit.getInsertionIndex() != 2) {
            throw new Error("Left hit failed.  Hit:" + hit);
        }

        hit = layout.getNextRightHit(2);
        if (hit.getInsertionIndex() != 0) {
            throw new Error("Right hit failed.  Hit:" + hit);
        }

        hit = layout.hitTestChar(layout.getAdvance()/2, 0);
        if (hit.getInsertionIndex() != 0 && hit.getInsertionIndex() != 2) {
            throw new Error("Hit-test allowed incorrect caret.  Hit:" + hit);
        }


        // Create a TextLayout with some left-to-right text
        // before the lam-alef sequence.  There should not be
        // a caret position between the lam and alef.
        layout = new TextLayout(ltrText+lamAlef, map, frc);

        final int ltrLen = ltrText.length();
        final int layoutLen = layout.getCharacterCount();

        for (int i=0; i < ltrLen; i++) {
            hit = layout.getNextRightHit(i);
            if (hit.getInsertionIndex() != i+1) {
                throw new Error("Right hit failed in ltr text.");
            }
        }

        hit = layout.getNextRightHit(ltrLen);
        if (layoutLen != hit.getInsertionIndex()) {
            throw new Error("Right hit failed at direction boundary.");
        }

        hit = layout.getNextLeftHit(layoutLen);
        if (hit.getInsertionIndex() != ltrLen) {
            throw new Error("Left hit failed at end of text.");
        }
    }
}