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
|
/*
* 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) 2006 - 2009 Pentaho Corporation and Contributors. All rights reserved.
*/
package org.pentaho.reporting.libraries.fonts.text;
/**
* Creation-Date: 11.06.2006, 17:02:27
*
* @author Thomas Morgner
*/
public class GraphemeClusterProducer implements ClassificationProducer
{
private int lastClassification;
private GraphemeClassifier classifier;
public GraphemeClusterProducer()
{
classifier = GraphemeClassifier.getClassifier();
}
/**
* Returns an alternating counter for the grapheme clusters. The value
* returned can be tested for equality; if two subsequent calls return
* the same value, the characters of these calls belong to the same cluster.
*
* @param codePoint
* @return true, if a new cluster starts, false if the old cluster continues.
*/
public boolean createGraphemeCluster (final int codePoint)
{
final int classification = classifier.getGraphemeClassification(codePoint);
if (classification == GraphemeClassifier.EXTEND)
{
lastClassification = classification;
return false;
}
if (lastClassification == GraphemeClassifier.CR &&
classification == GraphemeClassifier.LF)
{
lastClassification = classification;
return false;
}
if (lastClassification == GraphemeClassifier.L)
{
if ((classification & GraphemeClassifier.ANY_HANGUL_MASK) ==
GraphemeClassifier.ANY_HANGUL_MASK)
{
lastClassification = classification;
return false;
}
}
final boolean oldLVorV =
(lastClassification & GraphemeClassifier.V_OR_LV_MASK) ==
GraphemeClassifier.V_OR_LV_MASK;
final boolean newVorT =
(classification & GraphemeClassifier.V_OR_T_MASK) ==
GraphemeClassifier.V_OR_T_MASK;
if (oldLVorV && newVorT)
{
lastClassification = classification;
return false;
}
final boolean oldLVTorT =
(lastClassification & GraphemeClassifier.LVT_OR_T_MASK) ==
GraphemeClassifier.LVT_OR_T_MASK;
if (oldLVTorT && classification == GraphemeClassifier.T)
{
lastClassification = classification;
return false;
}
lastClassification = classification;
return true;
}
public Object clone() throws CloneNotSupportedException
{
return super.clone();
}
}
|
