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
|
/*
* This program is free software; you can redistribute it and/or modify it under the
* terms of the GNU Lesser General Public License, version 2.1 as published by the Free Software
* Foundation.
*
* You should have received a copy of the GNU Lesser General Public License along with this
* program; if not, you can obtain a copy at http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html
* or from the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
* This program 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 Lesser General Public License for more details.
*
* Copyright (c) 2009 Pentaho Corporation. All rights reserved.
*/
package org.pentaho.reporting.libraries.fonts.text;
import org.pentaho.reporting.libraries.fonts.encoding.CodePointBuffer;
import org.pentaho.reporting.libraries.fonts.encoding.manual.Utf16LE;
import junit.framework.TestCase;
/**
* Todo: Document Me
*
* @author Thomas Morgner
*/
public class GraphemeClusterProducerTest extends TestCase
{
public GraphemeClusterProducerTest()
{
}
public void testGraphemeClusterGenerationWindows()
{
CodePointBuffer buffer = Utf16LE.getInstance().decodeString("T\r\n\r\n\r\nT", null); //$NON-NLS-1$
final int[] data = buffer.getBuffer();
final boolean[] result = new boolean[]
{
true, true, false, true, false, true, false, true
};
GraphemeClusterProducer prod = new GraphemeClusterProducer();
for (int i = 0; i < buffer.getLength(); i++)
{
final int codepoint = data[i];
if (prod.createGraphemeCluster(codepoint) != result[i])
{
TestCase.fail();
}
}
}
public void testGraphemeClusterGenerationUnix()
{
CodePointBuffer buffer = Utf16LE.getInstance().decodeString("T\n\n\nT", null); //$NON-NLS-1$
final int[] data = buffer.getBuffer();
final boolean[] result = new boolean[]
{
true, true, true, true, true
};
GraphemeClusterProducer prod = new GraphemeClusterProducer();
for (int i = 0; i < buffer.getLength(); i++)
{
final int codepoint = data[i];
if (prod.createGraphemeCluster(codepoint) != result[i])
{
TestCase.fail();
}
}
}
public void testGraphemeClusterGenerationOldMac()
{
CodePointBuffer buffer = Utf16LE.getInstance().decodeString("T\r\r\rT", null); //$NON-NLS-1$
final int[] data = buffer.getBuffer();
final boolean[] result = new boolean[]
{
true, true, true, true, true
};
GraphemeClusterProducer prod = new GraphemeClusterProducer();
for (int i = 0; i < buffer.getLength(); i++)
{
final int codepoint = data[i];
if (prod.createGraphemeCluster(codepoint) != result[i])
{
TestCase.fail();
}
}
}
}
|
