Lines Matching full:keys

178 ## Sort Keys
181 it can be more efficient to use sort keys.
182 Sort keys are useful in situations where a large amount of data is indexed
185 The comparison of sort keys is a very efficient and simple binary compare of strings of
188 An important property of ICU sort keys is that you can obtain the same results
189 by comparing 2 strings as you do by comparing the sort keys of the 2 strings
199 ICU actually compresses the sort keys so that they take the
207 One of the more important issues when considering using sort keys is the sort
209 following question: "What is the maximum size for sort keys generated for
216 2.  Compression is used in building sort keys. Most 'regular' sequences of
217     characters produce very compact sort keys.
221 generated sort keys are longer than supplied buffers too often
225 and keep a list of indices to sort keys in this buffer (see the "large buffers"
226 [Collation Example](examples#using-large-buffers-to-manage-sort-keys)
233 These values are based on average lengths of sort keys generated with tertiary
237 ### Partial sort keys
241 parts of sort keys at a time. ICU4C 2.6+ provides an API that allows producing
242 parts of sort keys (`ucol_nextSortKeyPart` API). These sort keys may or may not be
243 compressed; that is, they may or may not be compatible with regular sort keys.
245 ### Merging sort keys
247 Sometimes, it is useful to be able to merge sort keys. One example is having
248 separate sort keys for first and last names. If you need to perform an operation
250 strings and regenerating sort keys, you should merge the sort keys. The merging
254 Keys](http://www.unicode.org/reports/tr10/#Interleaved_Levels).
261 the same results as merging their individual sort keys.
266 Having sort keys for strings allows for easy creation of bounds - sort keys that
331 keys.
477 6.  Compressing sort keys efficiently.
490     create the sort keys first and compare the sort keys instead.
491     Generating the sort keys of two strings is about 5-10
494 3.  Follow the best practice guidelines for generating sort keys. Do not call
501 sort keys. When they do want to customize the ordering, the most common options
529 For Sort Keys, most of these options either leave the storage alone or reduce
546 Sort keys are often stored on disk for later reuse. A common example is the use
547 of keys to build indexes in databases. When comparing keys, it is important to
548 know that both keys were generated by the same algorithms and weightings.
549 Otherwise, identical strings with keys generated on two different dates, for
550 example, might compare as unequal. Sort keys can be affected by new versions of
566 require regenerating any saved or stored sort keys.
569 so it is safer to regenerate sort keys any time after any part of ICU has been updated.
579 compare and create sort keys with the default locale in C, C++ and Java.