1: {A}{RING ABOVE}{d}{DOT ABOVE}{CEDILLA}
2: {A}{RING ABOVE}{d}{CEDILLA}{DOT ABOVE}
3: {A}{RING ABOVE}{d WITH DOT ABOVE}{CEDILLA}
4: {A}{RING ABOVE}{d WITH CEDILLA}{DOT ABOVE}
5: {A WITH RING ABOVE}{d}{DOT ABOVE}{CEDILLA}
6: {A WITH RING ABOVE}{d}{CEDILLA}{DOT ABOVE}
7: {A WITH RING ABOVE}{d WITH DOT ABOVE}{CEDILLA}
8: {A WITH RING ABOVE}{d WITH CEDILLA}{DOT ABOVE}
9: {ANGSTROM SIGN}{d}{DOT ABOVE}{CEDILLA}
10: {ANGSTROM SIGN}{d}{CEDILLA}{DOT ABOVE}
11: {ANGSTROM SIGN}{d WITH DOT ABOVE}{CEDILLA}
12: {ANGSTROM SIGN}{d WITH CEDILLA}{DOT ABOVE}
| Modifier and Type | Field and Description |
|---|---|
| private transient StringBuilder | |
| private int[] | |
| private boolean | |
| private final Normalizer2Impl | |
| private final Normalizer2 | |
| private String[][] | |
| private static boolean | |
| private static final Set | |
| private static boolean | |
| private String |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| private Set | extract(int comp, String segment, int segmentPos, StringBuffer buf)
See if the decomposition of cp2 is at segment starting at segmentPos (with canonical rearrangment!) If so, take the remainder, and return the equivalents |
| private String[] | |
| private Set | |
| public String | Returns: gets the source: NOTE: it is the NFD form of the source originally passed inGets the NFD form of the current source we are iterating over. |
| public String | Returns: the next string that is canonically equivalent. The value null is returned when the iteration is done.Get the next canonically equivalent string. |
| public static void | |
| public void | |
| public void |
| buffer | back to summary |
|---|---|
| private transient StringBuilder buffer | |
| current | back to summary |
|---|---|
| private int[] current | |
| done | back to summary |
|---|---|
| private boolean done | |
| nfcImpl | back to summary |
|---|---|
| private final Normalizer2Impl nfcImpl | |
| nfd | back to summary |
|---|---|
| private final Normalizer2 nfd | |
| pieces | back to summary |
|---|---|
| private String[][] pieces | |
| PROGRESS | back to summary |
|---|---|
| private static boolean PROGRESS | |
| SET_WITH_NULL_STRING | back to summary |
|---|---|
| private static final Set<String> SET_WITH_NULL_STRING | |
| SKIP_ZEROS | back to summary |
|---|---|
| private static boolean SKIP_ZEROS | |
| source | back to summary |
|---|---|
| private String source | |
| CanonicalIterator | back to summary |
|---|---|
| public CanonicalIterator(String source) Construct a CanonicalIterator object | |
| extract | back to summary |
|---|---|
| private Set See if the decomposition of cp2 is at segment starting at segmentPos (with canonical rearrangment!) If so, take the remainder, and return the equivalents | |
| getEquivalents | back to summary |
|---|---|
| private String[] getEquivalents(String segment) | |
| getEquivalents2 | back to summary |
|---|---|
| private Set | |
| getSource | back to summary |
|---|---|
| public String getSource() Gets the NFD form of the current source we are iterating over. | |
| next | back to summary |
|---|---|
| public String next() Get the next canonically equivalent string.
Warning The strings are not guaranteed to be in any particular order. | |
| permute | back to summary |
|---|---|
| public static void permute(String source, boolean skipZeros, Set<String> output)
Deprecated This API is ICU internal only. Simple implementation of permutation.
Warning The strings are not guaranteed to be in any particular order.
| |
| reset | back to summary |
|---|---|
| public void reset() Resets the iterator so that one can start again from the beginning.
| |
| setSource | back to summary |
|---|---|
| public void setSource(String newSource) Set a new source for this iterator. Allows object reuse. | |