public class FilteredNormalizer2 extends Normalizer2
Normalizer2.Mode| Constructor and Description |
|---|
FilteredNormalizer2(Normalizer2 n2,
UnicodeSet filterSet)
Constructs a filtered normalizer wrapping any Normalizer2 instance
and a filter set.
|
| Modifier and Type | Method and Description |
|---|---|
StringBuilder |
append(StringBuilder first,
CharSequence second)
Appends the second string to the first string
(merging them at the boundary) and returns the first string.
|
int |
composePair(int a,
int b)
Performs pairwise composition of a & b and returns the composite if there is one.
|
int |
getCombiningClass(int c)
Gets the combining class of c.
|
String |
getDecomposition(int c)
Gets the decomposition mapping of c.
|
String |
getRawDecomposition(int c)
Gets the raw decomposition mapping of c.
|
boolean |
hasBoundaryAfter(int c)
Tests if the character always has a normalization boundary after it,
regardless of context.
|
boolean |
hasBoundaryBefore(int c)
Tests if the character always has a normalization boundary before it,
regardless of context.
|
boolean |
isInert(int c)
Tests if the character is normalization-inert.
|
boolean |
isNormalized(CharSequence s)
Tests if the string is normalized.
|
Appendable |
normalize(CharSequence src,
Appendable dest)
Writes the normalized form of the source string to the destination Appendable
and returns the destination Appendable.
|
StringBuilder |
normalize(CharSequence src,
StringBuilder dest)
Writes the normalized form of the source string to the destination string
(replacing its contents) and returns the destination string.
|
StringBuilder |
normalizeSecondAndAppend(StringBuilder first,
CharSequence second)
Appends the normalized form of the second string to the first string
(merging them at the boundary) and returns the first string.
|
Normalizer.QuickCheckResult |
quickCheck(CharSequence s)
Tests if the string is normalized.
|
int |
spanQuickCheckYes(CharSequence s)
Returns the end of the normalized substring of the input string.
|
getInstance, getNFCInstance, getNFDInstance, getNFKCCasefoldInstance, getNFKCInstance, getNFKDInstance, normalizepublic FilteredNormalizer2(Normalizer2 n2, UnicodeSet filterSet)
n2 - wrapped Normalizer2 instancefilterSet - UnicodeSet which determines the characters to be normalizedpublic StringBuilder normalize(CharSequence src, StringBuilder dest)
normalize in class Normalizer2src - source stringdest - destination string; its contents is replaced with normalized srcpublic Appendable normalize(CharSequence src, Appendable dest)
Any IOException is wrapped into a ICUUncheckedIOException.
normalize in class Normalizer2src - source stringdest - destination Appendable; gets normalized src appendedpublic StringBuilder normalizeSecondAndAppend(StringBuilder first, CharSequence second)
normalizeSecondAndAppend in class Normalizer2first - string, should be normalizedsecond - string, will be normalizedpublic StringBuilder append(StringBuilder first, CharSequence second)
append in class Normalizer2first - string, should be normalizedsecond - string, should be normalizedpublic String getDecomposition(int c)
getDecomposition in class Normalizer2c - code pointpublic String getRawDecomposition(int c)
This is similar to the getDecomposition() method but returns the raw decomposition mapping as specified in UnicodeData.txt or (for custom data) in the mapping files processed by the gennorm2 tool. By contrast, getDecomposition() returns the processed, recursively-decomposed version of this mapping.
When used on a standard NFKC Normalizer2 instance, getRawDecomposition() returns the Unicode Decomposition_Mapping (dm) property.
When used on a standard NFC Normalizer2 instance, it returns the Decomposition_Mapping only if the Decomposition_Type (dt) is Canonical (Can); in this case, the result contains either one or two code points (=1..4 Java chars).
This function is independent of the mode of the Normalizer2. The default implementation returns null.
getRawDecomposition in class Normalizer2c - code pointpublic int composePair(int a,
int b)
Returns a composite code point c only if c has a two-way mapping to a+b. In standard Unicode normalization, this means that c has a canonical decomposition to a+b and c does not have the Full_Composition_Exclusion property.
This function is independent of the mode of the Normalizer2. The default implementation returns a negative value.
composePair in class Normalizer2a - A (normalization starter) code point.b - Another code point.public int getCombiningClass(int c)
getCombiningClass in class Normalizer2c - code pointpublic boolean isNormalized(CharSequence s)
isNormalized in class Normalizer2s - input stringpublic Normalizer.QuickCheckResult quickCheck(CharSequence s)
quickCheck in class Normalizer2s - input stringpublic int spanQuickCheckYes(CharSequence s)
end=spanQuickCheckYes(s);
the substring s.subSequence(0, end)
will pass the quick check with a "yes" result.
The returned end index is usually one or more characters before the "no" or "maybe" character: The end index is at a normalization boundary. (See the class documentation for more about normalization boundaries.)
When the goal is a normalized string and most input strings are expected to be normalized already, then call this method, and if it returns a prefix shorter than the input string, copy that prefix and use normalizeSecondAndAppend() for the remainder.
spanQuickCheckYes in class Normalizer2s - input stringpublic boolean hasBoundaryBefore(int c)
hasBoundaryBefore in class Normalizer2c - character to testpublic boolean hasBoundaryAfter(int c)
Note that this operation may be significantly slower than hasBoundaryBefore().
hasBoundaryAfter in class Normalizer2c - character to testpublic boolean isInert(int c)
Note that this operation may be significantly slower than hasBoundaryBefore().
isInert in class Normalizer2c - character to test