| /external/icu/icu4c/source/samples/uresb/ |
| root.txt | 29 collation { "ROOT collation help topic" }
39 collation { "collation" }
|
| sr.txt | 31 collation { "This is collation help topic" }
41 collation { "collation" }
|
| en.txt | 30 collation { "This is collation help topic" }
40 collation { "collation" }
|
| /libcore/luni/src/main/java/libcore/icu/ |
| CollationElementIteratorICU.java | 15 * Collation element iterator JNI wrapper.
16 * Iterates over the collation elements of a data string.
41 * Reset the collation elements to their initial state.
50 * Get the ordering priority of the next collation element in the text.
51 * A single character may contain more than one collation element.
52 * @return next collation elements ordering, or NULLORDER if the end of the
61 * Get the ordering priority of the previous collation element in the text.
62 * A single character may contain more than one collation element.
63 * @return previous collation element ordering, or NULLORDER if the end of
74 * @param order collation order returned by previous or next
[all...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| collate3.test | 22 # collate3.1.* - Errors related to unknown collation sequences.
23 # collate3.2.* - Errors related to undefined collation sequences.
26 # collate3.5.* - Collation factory.
31 # unknown collation sequence an error is returned.
42 } {1 {no such collation sequence: garbage}}
47 } {1 {no such collation sequence: garbage}}
52 } {1 {no such collation sequence: garbage}}
59 # Create a table with a default collation sequence, then close
60 # and re-open the database without re-registering the collation
62 # the collation sequence in
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/unicode/ |
| ucoleitr.h | 55 * in the given collation object.
88 * ucol_next() returns the collation order of the next.
89 * ucol_prev() returns the collation order of the previous character.
90 * The Collation Element Iterator moves only in one direction between calls to
95 * ucol_prev or ucol_next, the first or last collation order will be returned.
100 * collation orders with the value UCOL_IGNORABLE are ignored.
101 * Character based on the comparison level of the collator. A collation order
103 * type of the collation order is <strong>t_int32</strong>.
109 * Open the collation elements for a string.
111 * @param coll The collator containing the desired collation rules
[all...] |
| sortkey.h | 44 * Collation keys are generated by the Collator class. Use the CollationKey objects
79 * long lists of words by retrieving collation keys with Collator::getCollationKey().
80 * You can then cache the collation keys and compare them using CollationKey::compareTo().
85 * collation rules, and the way in which secondary and tertiary differences
99 * This creates an empty collation key based on the null string. An empty
100 * collation key contains no sorting information. When comparing two empty
101 * collation keys, the result is Collator::EQUAL. Comparing empty collation key
102 * with non-empty collation key is always Collator::LESS.
109 * Creates a collation key based on the collation key values
[all...] |
| coleitr.h | 10 * \brief C++ API: Collation Element Iterator.
26 * 12/10/99 aliu Ported Thai collation support from Java.
58 * the given collation object.
91 * CollationElementIterator::next returns the collation order of the next
93 * CollationElementIterator::previous returns the collation order of the
95 * The Collation Element Iterator moves only in one direction between calls to
103 * CollationElementIterator::next(), the first or last collation order will be
109 * on the same string are equivalent, if collation orders with the value
111 * Character based on the comparison level of the collator. A collation order
113 * type of the collation order is <strong>t_int32</strong>.
[all...] |
| /external/icu/icu4c/source/common/ |
| ucol_swp.h | 16 * Swap collation binaries.
29 * Does the data look like a collation binary?
37 * Swap ICU collation data like ucadata.icu. See udataswp.h.
46 * Swap inverse UCA collation data (invuca.icu). See udataswp.h.
|
| /external/chromium_org/third_party/icu/source/test/cintltst/ |
| ccurrtst.h | 16 * Collation currency tests.
30 /* Perform Collation Currency Test */
|
| cintltst.vcxproj.filters | 10 <Filter Include="collation">
67 <Filter>collation</Filter>
70 <Filter>collation</Filter>
73 <Filter>collation</Filter>
76 <Filter>collation</Filter>
79 <Filter>collation</Filter>
82 <Filter>collation</Filter>
85 <Filter>collation</Filter>
88 <Filter>collation</Filter>
91 <Filter>collation</Filter>
[all...] |
| /external/icu/icu4c/source/test/cintltst/ |
| ccurrtst.h | 16 * Collation currency tests.
30 /* Perform Collation Currency Test */
|
| cintltst.vcxproj.filters | 10 <Filter Include="collation">
67 <Filter>collation</Filter>
70 <Filter>collation</Filter>
73 <Filter>collation</Filter>
76 <Filter>collation</Filter>
79 <Filter>collation</Filter>
82 <Filter>collation</Filter>
85 <Filter>collation</Filter>
88 <Filter>collation</Filter>
91 <Filter>collation</Filter
[all...] |
| /external/icu/icu4c/source/i18n/unicode/ |
| ucoleitr.h | 47 * in the given collation object.
48 * For example, consider the following in Slovak and in traditional Spanish collation:
53 * And in German phonebook collation,
80 * ucol_next() returns the collation order of the next.
81 * ucol_prev() returns the collation order of the previous character.
82 * The Collation Element Iterator moves only in one direction between calls to
87 * ucol_prev or ucol_next, the first or last collation order will be returned.
92 * collation orders with the value 0 are ignored.
93 * Character based on the comparison level of the collator. A collation order
95 * type of the collation order is <strong>int32_t</strong>.
[all...] |
| sortkey.h | 45 * Collation keys are generated by the Collator class. Use the CollationKey objects
80 * long lists of words by retrieving collation keys with Collator::getCollationKey().
81 * You can then cache the collation keys and compare them using CollationKey::compareTo().
86 * collation rules, and the way in which secondary and tertiary differences
100 * This creates an empty collation key based on the null string. An empty
101 * collation key contains no sorting information. When comparing two empty
102 * collation keys, the result is Collator::EQUAL. Comparing empty collation key
103 * with non-empty collation key is always Collator::LESS.
110 * Creates a collation key based on the collation key values
[all...] |
| coleitr.h | 10 * \brief C++ API: Collation Element Iterator.
24 * 12/10/99 aliu Ported Thai collation support from Java.
58 * the given collation object.
59 * For example, consider the following in Slovak and in traditional Spanish collation:
63 * And in German phonebook collation,
91 * The method next() returns the collation order of the next character based on
93 * collation order of the previous character based on the comparison level of
94 * the collator. The Collation Element Iterator moves only in one direction
100 * Hence at the next call of next() or previous(), the first or last collation order,
101 * or collation order at the spefcifieid position will be returned. If a change o
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationsets.cpp | 20 #include "collation.h"
34 if(ce32 == Collation::FALLBACK_CE32) {
56 U_ASSERT(ce32 != Collation::FALLBACK_CE32);
57 if(Collation::isSpecialCE32(ce32)) {
59 if(ce32 == Collation::FALLBACK_CE32) {
68 if(Collation::isSelfContainedCE32(ce32) && Collation::isSelfContainedCE32(baseCE32)) {
82 if(Collation::isPrefixCE32(ce32)) {
83 const UChar *p = data->contexts + Collation::indexFromCE32(ce32);
85 if(Collation::isPrefixCE32(baseCE32))
[all...] |
| collationdatabuilder.cpp | 27 #include "collation.h"
56 ce32(ce), defaultCE32(Collation::NO_CE32), builtCE32(Collation::NO_CE32),
83 * so that the normal collation implementation can process them.
104 * Build-time collation element and character iterator.
111 * We do this so that we need not implement the collation algorithm
158 jamoCE32s[j] = Collation::makeCE32FromTagAndIndex(Collation::BUILDER_DATA_TAG, jamo) |
185 if(ce32 == Collation::FALLBACK_CE32) {
196 if(cesLength < Collation::MAX_EXPANSION_LENGTH)
[all...] |
| collationiterator.cpp | 22 #include "collation.h"
172 // Compare the iterator state but not the collation data (trie & data fields):
197 while(U_SUCCESS(errorCode) && nextCE(errorCode) != Collation::NO_CE) {
207 return (c < 0) ? Collation::FALLBACK_CE32 : data->getCE32(c);
244 return Collation::NO_CE_PRIMARY;
251 while(Collation::isSpecialCE32(ce32)) {
252 switch(Collation::tagFromCE32(ce32)) {
253 case Collation::FALLBACK_TAG:
254 case Collation::RESERVED_TAG_3:
257 case Collation::LONG_PRIMARY_TAG
[all...] |
| i18n.vcxproj.filters | 4 <Filter Include="collation">
28 <Filter>collation</Filter>
31 <Filter>collation</Filter>
34 <Filter>collation</Filter>
37 <Filter>collation</Filter>
40 <Filter>collation</Filter>
43 <Filter>collation</Filter>
46 <Filter>collation</Filter>
49 <Filter>collation</Filter>
52 <Filter>collation</Filter
[all...] |
| collationcompare.cpp | 8 * created on: 2012feb14 with new and old collation code
18 #include "collation.h"
50 if(leftPrimary < variableTop && leftPrimary > Collation::MERGE_SEPARATOR_PRIMARY) {
67 leftPrimary > Collation::MERGE_SEPARATOR_PRIMARY);
75 if(rightPrimary < variableTop && rightPrimary > Collation::MERGE_SEPARATOR_PRIMARY) {
92 rightPrimary > Collation::MERGE_SEPARATOR_PRIMARY);
100 leftPrimary = Collation::reorder(reorderTable, leftPrimary);
101 rightPrimary = Collation::reorder(reorderTable, rightPrimary);
105 if(leftPrimary == Collation::NO_CE_PRIMARY) { break; }
130 if(leftSecondary == Collation::NO_CE_WEIGHT16) { break;
[all...] |
| collationkeys.cpp | 17 #include "collation.h"
204 CollationKeys::LevelCallback::needToWrite(Collation::Level /*level*/) { return TRUE; }
207 * Map from collation strength (UColAttributeValue)
208 * to a mask of Collation::Level bits up to that strength,
228 Collation::Level minLevel, LevelCallback &callback,
236 levels |= Collation::CASE_LEVEL_FLAG;
272 if(p < variableTop && p > Collation::MERGE_SEPARATOR_PRIMARY) {
286 if((levels & Collation::QUATERNARY_LEVEL_FLAG) != 0) {
300 } while(p < variableTop && p > Collation::MERGE_SEPARATOR_PRIMARY);
306 if(p > Collation::NO_CE_PRIMARY && (levels & Collation::PRIMARY_LEVEL_FLAG) != 0)
[all...] |
| collationbasedatabuilder.cpp | 21 #include "collation.h"
109 compressibleBytes[Collation::UNASSIGNED_IMPLICIT_BYTE] = TRUE;
114 trie = utrie2_open(Collation::UNASSIGNED_CE32, Collation::FFFD_CE32, &errorCode);
118 utrie2_set32(trie, c, Collation::UNASSIGNED_CE32, &errorCode);
121 utrie2_set32(trie, 0xfffe, Collation::MERGE_SEPARATOR_CE32, &errorCode);
126 uint32_t hangulCE32 = Collation::makeCE32FromTagAndIndex(Collation::HANGUL_TAG, 0);
133 int64_t ce = Collation::makeCE(Collation::FIRST_UNASSIGNED_PRIMARY)
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| ucol_swp.h | 16 * Swap collation binaries.
29 * Does the data look like a collation binary?
37 * Swap a header-less collation binary, inside a resource bundle or ucadata.icu.
47 * Swap ICU collation data like ucadata.icu. See udataswp.h.
56 * Swap inverse UCA collation data (invuca.icu). See udataswp.h.
|
| /libcore/luni/src/main/java/java/text/ |
| CollationElementIterator.java | 24 * result of each iteration is a 32-bit collation element that defines the
30 * "ca": the first collation element is collation_element('c') and second
31 * collation element is collation_element('a').
34 * collation element for the two characters 'c' and 'h':
36 * "cha": the first collation element is collation_element('ch') and the second
40 * and 'e', the iterator returns two collation elements for the single character
43 * "\u0086b": the first collation element is collation_element('a'), the
44 * second one is collation_element('e'), and the third collation element is
58 * valid collation elements to return.
70 * specified collation element. Returns {@code 1} if there is no expansio
[all...] |
