Lines Matching refs:key
35 * the key is created, binary comparisons are fast. This approach is
90 final java.text.CollationKey key;
96 this.key = delegate;
154 // * @param key array of bytes that represent the collation order of argument
159 // public CollationKey(String source, byte key[])
165 // * CollationKey constructor that forces key to release its internal byte
166 // * array for adoption. key will have a null byte array after this
169 // * @param key RawCollationKey object that represents the collation order of
175 // public CollationKey(String source, RawCollationKey key)
189 return key.getSourceString();
201 * int key, targetkey;
204 * key = key1[i] & 0xFF;
206 * if (key < targetkey) {
210 * if (targetkey < key) {
214 * } while (key != 0 && targetKey != 0);
225 return key.toByteArray();
232 * collation rules of the Collator that created this key are
250 return key.compareTo(target.key);
256 * this key are applied.</p>
295 return key.equals(target.key);
300 * on the key itself, not the String from which the key was created. Thus
310 return key.hashCode();
315 // * Produce a bound for the sort order of a given collation key and a
351 // * collation key can have.
