| /external/chromium/third_party/icu/source/test/intltest/ |
| cntabcol.cpp | 28 // fill up one contraction so that it has to expand
36 // test whether the filled up contraction really contains the data we input
56 // This should make a new contraction
59 errln("Error setting a non existing contraction error = %i (%s)\n", status, u_errorName(status));
78 // fill up one contraction so that it has to expand
86 // test whether the filled up contraction really contains the data we input
108 // fill up one contraction so that it has to expand
150 errln("found a non existing contraction!\n");
159 errln("managed to change a non existing contraction!\n");
165 errln("managed to change a non existing contraction!\n")
[all...] |
| g7coll.h | 15 * known as contraction), you can also add characters that act like a sequence of
19 * Effect : Expansion and contraction can actually be combined.
|
| /external/icu4c/test/intltest/ |
| cntabcol.cpp | 28 // fill up one contraction so that it has to expand
36 // test whether the filled up contraction really contains the data we input
56 // This should make a new contraction
59 errln("Error setting a non existing contraction error = %i (%s)\n", status, u_errorName(status));
78 // fill up one contraction so that it has to expand
86 // test whether the filled up contraction really contains the data we input
108 // fill up one contraction so that it has to expand
150 errln("found a non existing contraction!\n");
159 errln("managed to change a non existing contraction!\n");
165 errln("managed to change a non existing contraction!\n")
[all...] |
| g7coll.h | 15 * known as contraction), you can also add characters that act like a sequence of
19 * Effect : Expansion and contraction can actually be combined.
|
| /external/chromium/third_party/icu/source/i18n/ |
| ucol_cnt.h | 16 * This module maintains a contraction table structure in expanded form
73 /* sets a part of contraction sequence in table. If element is non existant, it creates on. Returns element handle */
76 /* inserts a part of contraction sequence in table. Sequences behind the offset are moved back. If element is non existant, it creates on. Returns element handle */
|
| ucol_elm.cpp | 819 // long. Although this table could quite easily mimic complete contraction stuff
869 // the first codepoint is also unsafe, as it forms a 'contraction' with the prefix
884 // Add the last char of the contraction to the contraction-end hash table.
894 // If there are any Jamos in the contraction, we should turn on special
903 /* if it wasn't contraction, we wouldn't end up here*/
910 } else { /* we are adding to existing contraction */
911 /* there were already some elements in the table, so we need to add a new contraction */
[all...] |
| ucol_imp.h | 98 * in case the base contraction symbol is tailored.
107 * uint32_t contractionIndex; - offset to contraction table (UChar *contractionIndex). Used to look up contraction sequences. Contents
110 * uint32_t contractionCEs; - offset to resulting contraction CEs (uint32_t *contractionCEs). When a contraction is resolved in the
113 * uint32_t contractionSize; - size of contraction table in elements (both Index and CEs).
132 * uint8_t contractionUCACombosWidth; - number of UChars per UCA contraction in contractionUCACombos (formatVersion 2.3)
700 CONTRACTION_TAG = 2, /* Start of a contraction */
703 SURROGATE_TAG = 5, /* Lead surrogate that is tailored and doesn't start a contraction */
[all...] |
| ucol_sit.cpp | 696 // we might have a contraction that ends from previous level
710 // check whether we're doing contraction or prefix
764 UChar contraction[internalBufferSize]; local
774 // we start our contraction from middle, since we don't know if it
776 contraction[internalBufferSize/2] = (UChar)start;
777 addSpecial(((contContext *)context), contraction, internalBufferSize, CE, internalBufferSize/2, internalBufferSize/2+1, status);
803 * @return the size of the contraction set
891 // Contraction set consists only of strings
|
| usearch.cpp | 753 // * if it is the start or middle of a contraction: to be done after
755 // * thai or lao base consonant character: similar to contraction
756 // * high surrogate character: similar to contraction
783 * ie. not the middle of a contraction, swappable characters or supplementary
797 int32_t result = textoffset; // first contraction character
[all...] |
| ucol_cnt.cpp | 16 * This module maintains a contraction table structure in expanded form
210 // TODO: this one apparently updates the contraction CEs to point to a real address (relative to the
369 /* inserts a part of contraction sequence in table. Sequences behind the offset are moved back. If element is non existent, it creates on. Returns element handle */
440 /* sets a part of contraction sequence in table. If element is non existant, it creates on. Returns element handle */
|
| ucol_elm.h | 65 uint32_t cSize; /* Number of characters in sequence - for contraction */
|
| ucol.cpp | 690 * Approximate determination if a character is at a contraction end.
691 * Guaranteed to be TRUE if a character is at the end of a contraction,
720 * in contraction processing.
819 for (c=0; c<0x300; c++) { // Find the Contraction-ending char.
[all...] |
| /external/icu4c/i18n/ |
| ucol_cnt.h | 16 * This module maintains a contraction table structure in expanded form
73 /* sets a part of contraction sequence in table. If element is non existant, it creates on. Returns element handle */
76 /* inserts a part of contraction sequence in table. Sequences behind the offset are moved back. If element is non existant, it creates on. Returns element handle */
|
| ucol_elm.cpp | 820 // long. Although this table could quite easily mimic complete contraction stuff
870 // the first codepoint is also unsafe, as it forms a 'contraction' with the prefix
885 // Add the last char of the contraction to the contraction-end hash table.
895 // If there are any Jamos in the contraction, we should turn on special
904 /* if it wasn't contraction, we wouldn't end up here*/
911 } else { /* we are adding to existing contraction */
912 /* there were already some elements in the table, so we need to add a new contraction */
[all...] |
| ucol_imp.h | 102 * in case the base contraction symbol is tailored.
111 * uint32_t contractionIndex; - offset to contraction table (UChar *contractionIndex). Used to look up contraction sequences. Contents
114 * uint32_t contractionCEs; - offset to resulting contraction CEs (uint32_t *contractionCEs). When a contraction is resolved in the
117 * uint32_t contractionSize; - size of contraction table in elements (both Index and CEs).
136 * uint8_t contractionUCACombosWidth; - number of UChars per UCA contraction in contractionUCACombos (formatVersion 2.3)
727 CONTRACTION_TAG = 2, /* Start of a contraction */
730 SURROGATE_TAG = 5, /* Lead surrogate that is tailored and doesn't start a contraction */
[all...] |
| ucol_sit.cpp | 695 // we might have a contraction that ends from previous level
709 // check whether we're doing contraction or prefix
763 UChar contraction[internalBufferSize]; local
773 // we start our contraction from middle, since we don't know if it
775 contraction[internalBufferSize/2] = (UChar)start;
776 addSpecial(((contContext *)context), contraction, internalBufferSize, CE, internalBufferSize/2, internalBufferSize/2+1, status);
802 * @return the size of the contraction set
890 // Contraction set consists only of strings
|
| usearch.cpp | 763 // * if it is the start or middle of a contraction: to be done after
765 // * thai or lao base consonant character: similar to contraction
766 // * high surrogate character: similar to contraction
793 * ie. not the middle of a contraction, swappable characters or supplementary
807 int32_t result = textoffset; // first contraction character
[all...] |
| ucol_cnt.cpp | 16 * This module maintains a contraction table structure in expanded form
210 // TODO: this one apparently updates the contraction CEs to point to a real address (relative to the
369 /* inserts a part of contraction sequence in table. Sequences behind the offset are moved back. If element is non existent, it creates on. Returns element handle */
440 /* sets a part of contraction sequence in table. If element is non existant, it creates on. Returns element handle */
|
| ucol_elm.h | 65 uint32_t cSize; /* Number of characters in sequence - for contraction */
|
| ucol.cpp | 746 * Approximate determination if a character is at a contraction end.
747 * Guaranteed to be TRUE if a character is at the end of a contraction,
776 * in contraction processing.
875 for (c=0; c<0x300; c++) { // Find the Contraction-ending char.
[all...] |
| /external/chromium/third_party/icu/source/test/cintltst/ |
| cg7coll.h | 22 * known as contraction), you can also add characters that act like a sequence of
26 * Effect : Expansion and contraction can actually be combined.
|
| usrchdat.c | 280 static const SearchData CONTRACTION[] = {
290 /* contraction prefix */
305 /* ends not with a contraction character */
318 * "ab" generates a contraction that's an expansion. The "z" matches the
641 /* contraction prefix */
657 /* ends not with a contraction character */
668 * "ab" generates a contraction that's an expansion. The "z" matches the
|
| /external/icu4c/test/cintltst/ |
| cg7coll.h | 22 * known as contraction), you can also add characters that act like a sequence of
26 * Effect : Expansion and contraction can actually be combined.
|
| /external/chromium/googleurl/src/ |
| url_canon_ip.cc | 333 // The index of the hex component that the "::" contraction precedes, or
334 // -1 if there is no contraction.
367 // (separator between hex components, or start of a contraction), or end of
399 // We found a "::" contraction.
401 // There can be at most one contraction in the literal.
441 // success writes the length of the contraction (if any) to
452 // If there was a "::" contraction, its size is going to be:
503 // components are, the "::" contraction, and the embedded IPv4 address.
510 // how may zero bytes the "::" contraction represents.
517 // Loop through each hex components, and contraction in order
[all...] |
| /libcore/luni/src/main/java/java/text/ |
| CollationElementIterator.java | 83 * {@code setOffset(offset)} sets the index in the middle of a contraction,
85 * contraction, which may not be equal to the original offset that was set.
|
