HomeSort by relevance Sort by last modified time
    Searched full:decomposition (Results 1 - 25 of 113) sorted by null

1 2 3 4 5

  /external/icu4c/data/unidata/
NormalizationCorrections.txt 11 # Consortium ordinarily precludes any change to the decomposition
14 # exceptional (and rare) conditions, an error in a decomposition
34 # Field 1: Original (erroneous) decomposition
35 # Field 2: Corrected decomposition
  /libcore/luni/src/main/java/java/text/
Normalizer.java 37 * Normalization Form D - Canonical Decomposition.
42 * Normalization Form C - Canonical Decomposition, followed by Canonical Composition.
47 * Normalization Form KD - Compatibility Decomposition.
52 * Normalization Form KC - Compatibility Decomposition, followed by Canonical Composition.
Collator.java 61 * This {@code Collator} deals only with two decomposition modes, the canonical
62 * decomposition mode and one that does not use any decomposition. The
63 * compatibility decomposition mode
65 * canonical decomposition mode is set, {@code Collator} handles un-normalized
67 * NFD. If canonical decomposition is turned off, it is the user's
94 * System.out.println("\u00e0\u0325 is not equal to a\u0325\u0300 without decomposition");
97 * System.out.println("Error: \u00e0\u0325 should be equal to a\u0325\u0300 with decomposition");
99 * System.out.println("\u00e0\u0325 is equal to a\u0325\u0300 with decomposition");
102 * System.out.println("Error: \u00e0\u0325 should be not equal to a\u0325\u0300 without decomposition")
    [all...]
  /external/icu4c/common/
unormcmp.cpp 81 * the decomposition, pushing the previous pointer onto a stack.
82 * When the end of the decomposition is reached, then the code unit reader
87 * The top part of the loop works on code units, while lookups for decomposition
94 * and the code point decomposes/case-folds, then the decomposition/folding
105 * Assumption: A decomposition or case-folding result string never contains
108 * decomposition/case-folding boundaries.
115 * The API function may also NFD the input and turn off decomposition.
129 /* stack element for previous-level source/decomposition pointers */
153 /* decomposition and case folding variables */
333 * compare this decomposition with the lead surrogate in the other strin
    [all...]
unormimp.h 144 * Bit 7 of the length byte for a decomposition string in extra data is
145 * a flag indicating whether the decomposition string is
147 * of the decomposition (like for A-umlaut);
283 * [0] Lengths of the canonical and compatibility decomposition strings.
291 * decomposition. If this flag is set, then the decomposition
295 * decomposition string, not counting the cc word.
303 * High byte: leading cc==cc of the first code point in the decomposition string
304 * Low byte: trailing cc==cc of the last code point in the decomposition string
305 * - The decomposition string in UTF-16, with length code units
    [all...]
filterednormalizer2.cpp 152 FilteredNormalizer2::getDecomposition(UChar32 c, UnicodeString &decomposition) const {
153 return set.contains(c) && norm2.getDecomposition(c, decomposition);
ustrcase.c 641 /* stack element for previous-level source/decomposition pointers */
823 * compare this decomposition with the lead surrogate in the other string
825 * the decomposition would replace the entire code point
851 /* get ready to read from decomposition, continue with loop */
868 * compare this decomposition with the lead surrogate in the other string
870 * the decomposition would replace the entire code point
896 /* get ready to read from decomposition, continue with loop */
902 * no decomposition/case folding, max level for both sides:
normalizer2.cpp 177 getDecomposition(UChar32 c, UnicodeString &decomposition) const {
185 decomposition.setTo(buffer, length); // copy the string (Jamos from Hangul syllable c)
187 decomposition.setTo(FALSE, d, length); // read-only alias
768 UChar32 c, UChar *decomposition, int32_t capacity,
773 if(decomposition==NULL ? capacity!=0 : capacity<0) {
777 UnicodeString destString(decomposition, 0, capacity);
779 return destString.extract(decomposition, capacity, *pErrorCode);
  /external/icu4c/common/unicode/
unorm2.h 44 * Decomposition followed by composition.
63 * If a string is in this form, then further decomposition <i>without reordering</i>
263 * Gets the decomposition mapping of c. Equivalent to unorm2_normalize(string(c))
268 * @param decomposition String buffer which will be set to c's
269 * decomposition mapping, if there is one.
270 * @param capacity number of UChars that can be written to decomposition
275 * @return the non-negative length of c's decomposition, if there is one; otherwise a negative value
280 UChar32 c, UChar *decomposition, int32_t capacity,
normalizer2.h 178 * Gets the decomposition mapping of c.
182 * if c does not have a decomposition mapping in this instance's data.
185 * @param decomposition String object which will be set to c's
186 * decomposition mapping, if there is one.
187 * @return TRUE if c has a decomposition, otherwise FALSE
191 getDecomposition(UChar32 c, UnicodeString &decomposition) const = 0;
385 * Gets the decomposition mapping of c. Equivalent to normalize(UnicodeString(c))
389 * @param decomposition String object which will be set to c's
390 * decomposition mapping, if there is one.
391 * @return TRUE if c has a decomposition, otherwise FALS
    [all...]
unorm.h 104 * The form is defined such that the "raw decomposition", the recursive canonical decomposition of each character,
134 /** No decomposition/composition. @stable ICU 2.0 */
136 /** Canonical decomposition. @stable ICU 2.0 */
138 /** Compatibility decomposition. @stable ICU 2.0 */
140 /** Canonical decomposition followed by canonical composition. @stable ICU 2.0 */
144 /** Compatibility decomposition followed by canonical composition. @stable ICU 2.0 */
  /external/icu4c/test/intltest/
apicoll.h 32 * - get/set decomposition mode and comparison level
51 * Tests decomposition setting
regcoll.h 69 // Full Decomposition mode not implemented
186 // Collation with decomposition off doesn't work for Europe
  /external/webkit/LayoutTests/fast/dom/HTMLAnchorElement/script-tests/
set-href-attribute-hash.js 29 // http://dev.w3.org/html5/spec/infrastructure.html#url-decomposition-idl-attributes .
36 // http://dev.w3.org/html5/spec/infrastructure.html#url-decomposition-idl-attributes .
set-href-attribute-hostname.js 28 // http://dev.w3.org/html5/spec/infrastructure.html#url-decomposition-idl-attributes .
35 // http://dev.w3.org/html5/spec/infrastructure.html#url-decomposition-idl-attributes .
set-href-attribute-host.js 50 // http://dev.w3.org/html5/spec/infrastructure.html#url-decomposition-idl-attributes .
57 // http://dev.w3.org/html5/spec/infrastructure.html#url-decomposition-idl-attributes .
109 // http://dev.w3.org/html5/spec/infrastructure.html#url-decomposition-idl-attributes .
set-href-attribute-search.js 43 // http://dev.w3.org/html5/spec/infrastructure.html#url-decomposition-idl-attributes .
  /external/giflib/
gif_lib_private.h 45 unsigned long CrntShiftDWord; /* For bytes decomposition into codes. */
  /external/webkit/Source/WebCore/workers/
WorkerLocation.h 51 // URI decomposition attributes
  /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
CollatorTest.java 187 assertTrue("Wrong decomposition",
256 assertTrue("Collator should not be using decomposition", !c.equals(
260 assertTrue("Collator should be using decomposition", c.equals("\u212B",
263 assertTrue("Should not be equal under canonical decomposition", !c
266 assertTrue("Should be equal under full decomposition", c.equals(
  /external/webkit/Source/WebCore/page/
Location.idl 52 // URI decomposition attributes
  /libcore/luni/src/test/java/libcore/java/text/
CollatorTest.java 83 assertFalse("Error: \u00e0\u0325 should not equal to a\u0325\u0300 without decomposition",
86 assertTrue("Error: \u00e0\u0325 should equal to a\u0325\u0300 with decomposition",
  /external/webkit/Source/JavaScriptCore/icu/unicode/
unorm.h 98 * The form is defined such that the "raw decomposition", the recursive canonical decomposition of each character,
128 /** No decomposition/composition. @stable ICU 2.0 */
130 /** Canonical decomposition. @stable ICU 2.0 */
132 /** Compatibility decomposition. @stable ICU 2.0 */
134 /** Canonical decomposition followed by canonical composition. @stable ICU 2.0 */
138 /** Compatibility decomposition followed by canonical composition. @stable ICU 2.0 */
  /external/webkit/Source/WebCore/icu/unicode/
unorm.h 98 * The form is defined such that the "raw decomposition", the recursive canonical decomposition of each character,
128 /** No decomposition/composition. @stable ICU 2.0 */
130 /** Canonical decomposition. @stable ICU 2.0 */
132 /** Compatibility decomposition. @stable ICU 2.0 */
134 /** Canonical decomposition followed by canonical composition. @stable ICU 2.0 */
138 /** Compatibility decomposition followed by canonical composition. @stable ICU 2.0 */
  /external/webkit/Source/WebKit/mac/icu/unicode/
unorm.h 98 * The form is defined such that the "raw decomposition", the recursive canonical decomposition of each character,
128 /** No decomposition/composition. @stable ICU 2.0 */
130 /** Canonical decomposition. @stable ICU 2.0 */
132 /** Compatibility decomposition. @stable ICU 2.0 */
134 /** Canonical decomposition followed by canonical composition. @stable ICU 2.0 */
138 /** Compatibility decomposition followed by canonical composition. @stable ICU 2.0 */

Completed in 430 milliseconds

1 2 3 4 5