* <code>CollationKey.compareTo(CollationKey)</code> and the method
* <code>Collator.compare(String, String)</code> compare two strings
* and returns their relative order. The performance characterictics
- * of these two approaches can differ.</p>
+ * of these two approaches can differ.
+ * Note that collation keys are often less efficient than simply doing comparison.
+ * For more details, see the ICU User Guide.
+ * </p>
*
* <p>During the construction of a <code>CollationKey</code>, the
* entire source string is examined and processed into a series of
* Transforms the String into a CollationKey suitable for efficient
* repeated comparison. The resulting key depends on the collator's
* rules, strength and decomposition mode.
+ * </p></p>Note that collation keys are often less efficient than simply doing comparison.
+ * For more details, see the ICU User Guide.
* </p>
* <p>See the CollationKey class documentation for more information.</p>
* @param source the string to be transformed into a CollationKey.
* the rules of this Collator and stores the result into the user provided argument
* key. If key has a internal byte array of length that's too small for the result,
* the internal byte array will be grown to the exact required size.
+ * </p>Note that collation keys are often less efficient than simply doing comparison.
+ * For more details, see the ICU User Guide.
* @param source the text String to be transformed into a RawCollationKey
* @return If key is null, a new instance of RawCollationKey will be
* created and returned, otherwise the user provided key will be