Linux srv25.usacloudserver.us 5.14.0-570.39.1.el9_6.x86_64 #1 SMP PREEMPT_DYNAMIC Thu Sep 4 05:08:52 EDT 2025 x86_64
LiteSpeed
Server IP : 23.137.84.82 & Your IP : 216.73.216.127
Domains :
Cant Read [ /etc/named.conf ]
User : epicgamerzoneco
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
opt /
alt /
libicu71 /
usr /
include /
unicode /
Delete
Unzip
Name
Size
Permission
Date
Action
alphaindex.h
26.52
KB
-rw-r--r--
2022-12-01 11:12
appendable.h
8.53
KB
-rw-r--r--
2022-12-01 11:12
basictz.h
9.86
KB
-rw-r--r--
2022-12-01 11:12
brkiter.h
27.81
KB
-rw-r--r--
2022-12-01 11:12
bytestream.h
10.75
KB
-rw-r--r--
2022-12-01 11:12
bytestrie.h
20.77
KB
-rw-r--r--
2022-12-01 11:12
bytestriebuilder.h
7.46
KB
-rw-r--r--
2022-12-01 11:12
calendar.h
105.88
KB
-rw-r--r--
2022-12-01 11:12
caniter.h
7.44
KB
-rw-r--r--
2022-12-01 11:12
casemap.h
25.33
KB
-rw-r--r--
2022-12-01 11:12
char16ptr.h
7.22
KB
-rw-r--r--
2022-12-01 11:12
chariter.h
24.06
KB
-rw-r--r--
2022-12-01 11:12
choicfmt.h
23.97
KB
-rw-r--r--
2022-12-01 11:12
coleitr.h
13.77
KB
-rw-r--r--
2022-12-01 11:12
coll.h
56.26
KB
-rw-r--r--
2022-12-01 11:12
compactdecimalformat.h
6.88
KB
-rw-r--r--
2022-12-01 11:12
curramt.h
3.78
KB
-rw-r--r--
2022-12-01 11:12
currpinf.h
7.3
KB
-rw-r--r--
2022-12-01 11:12
currunit.h
4.02
KB
-rw-r--r--
2022-12-01 11:12
datefmt.h
40.71
KB
-rw-r--r--
2022-12-01 11:12
dbbi.h
1.19
KB
-rw-r--r--
2022-12-01 11:12
dcfmtsym.h
20.61
KB
-rw-r--r--
2022-12-01 11:12
decimfmt.h
87.57
KB
-rw-r--r--
2022-12-01 11:12
docmain.h
7.21
KB
-rw-r--r--
2022-12-01 11:12
dtfmtsym.h
38.21
KB
-rw-r--r--
2022-12-01 11:12
dtintrv.h
3.84
KB
-rw-r--r--
2022-12-01 11:12
dtitvfmt.h
49.27
KB
-rw-r--r--
2022-12-01 11:12
dtitvinf.h
18.63
KB
-rw-r--r--
2022-12-01 11:12
dtptngen.h
28.84
KB
-rw-r--r--
2022-12-01 11:12
dtrule.h
8.69
KB
-rw-r--r--
2022-12-01 11:12
edits.h
20.74
KB
-rw-r--r--
2022-12-01 11:12
enumset.h
2.08
KB
-rw-r--r--
2022-12-01 11:12
errorcode.h
4.84
KB
-rw-r--r--
2022-12-01 11:12
fieldpos.h
8.7
KB
-rw-r--r--
2022-12-01 11:12
filteredbrk.h
5.37
KB
-rw-r--r--
2022-12-01 11:12
fmtable.h
24.43
KB
-rw-r--r--
2022-12-01 11:12
format.h
12.5
KB
-rw-r--r--
2022-12-01 11:12
formattedvalue.h
9.75
KB
-rw-r--r--
2022-12-01 11:12
fpositer.h
3.03
KB
-rw-r--r--
2022-12-01 11:12
gender.h
3.33
KB
-rw-r--r--
2022-12-01 11:12
gregocal.h
31.88
KB
-rw-r--r--
2022-12-01 11:12
icudataver.h
1.02
KB
-rw-r--r--
2022-12-01 11:12
icuplug.h
11.83
KB
-rw-r--r--
2022-12-01 11:12
idna.h
12.7
KB
-rw-r--r--
2022-12-01 11:12
listformatter.h
8.79
KB
-rw-r--r--
2022-12-01 11:12
localebuilder.h
11.08
KB
-rw-r--r--
2022-12-01 11:12
localematcher.h
26.84
KB
-rw-r--r--
2022-12-01 11:12
localpointer.h
19.36
KB
-rw-r--r--
2022-12-01 11:12
locdspnm.h
7.12
KB
-rw-r--r--
2022-12-01 11:12
locid.h
47.66
KB
-rw-r--r--
2022-12-01 11:12
measfmt.h
11.42
KB
-rw-r--r--
2022-12-01 11:12
measunit.h
104.97
KB
-rw-r--r--
2022-12-01 11:12
measure.h
4.33
KB
-rw-r--r--
2022-12-01 11:12
messagepattern.h
33.71
KB
-rw-r--r--
2022-12-01 11:12
msgfmt.h
44.22
KB
-rw-r--r--
2022-12-01 11:12
normalizer2.h
33.66
KB
-rw-r--r--
2022-12-01 11:12
normlzr.h
30.95
KB
-rw-r--r--
2022-12-01 11:12
nounit.h
2.25
KB
-rw-r--r--
2022-12-01 11:12
numberformatter.h
94.15
KB
-rw-r--r--
2022-12-01 11:12
numberrangeformatter.h
25.19
KB
-rw-r--r--
2022-12-01 11:12
numfmt.h
49.84
KB
-rw-r--r--
2022-12-01 11:12
numsys.h
7.33
KB
-rw-r--r--
2022-12-01 11:12
parseerr.h
3.08
KB
-rw-r--r--
2022-12-01 11:12
parsepos.h
5.57
KB
-rw-r--r--
2022-12-01 11:12
platform.h
28.09
KB
-rw-r--r--
2022-12-01 11:12
plurfmt.h
25.24
KB
-rw-r--r--
2022-12-01 11:12
plurrule.h
20.82
KB
-rw-r--r--
2022-12-01 11:12
ptypes.h
3.49
KB
-rw-r--r--
2022-12-01 11:12
putil.h
6.32
KB
-rw-r--r--
2022-12-01 11:12
rbbi.h
28.64
KB
-rw-r--r--
2022-12-01 11:12
rbnf.h
48.85
KB
-rw-r--r--
2022-12-01 11:12
rbtz.h
15.77
KB
-rw-r--r--
2022-12-01 11:12
regex.h
84.36
KB
-rw-r--r--
2022-12-01 11:12
region.h
9.18
KB
-rw-r--r--
2022-12-01 11:12
reldatefmt.h
22.22
KB
-rw-r--r--
2022-12-01 11:12
rep.h
9.37
KB
-rw-r--r--
2022-12-01 11:12
resbund.h
18.08
KB
-rw-r--r--
2022-12-01 11:12
schriter.h
6.36
KB
-rw-r--r--
2022-12-01 11:12
scientificnumberformatter.h
6.43
KB
-rw-r--r--
2022-12-01 11:12
search.h
22.22
KB
-rw-r--r--
2022-12-01 11:12
selfmt.h
14.34
KB
-rw-r--r--
2022-12-01 11:12
simpleformatter.h
12.59
KB
-rw-r--r--
2022-12-01 11:12
simpletz.h
45.64
KB
-rw-r--r--
2022-12-01 11:12
smpdtfmt.h
71.07
KB
-rw-r--r--
2022-12-01 11:12
sortkey.h
11.18
KB
-rw-r--r--
2022-12-01 11:12
std_string.h
1.05
KB
-rw-r--r--
2022-12-01 11:12
strenum.h
9.92
KB
-rw-r--r--
2022-12-01 11:12
stringoptions.h
5.79
KB
-rw-r--r--
2022-12-01 11:12
stringpiece.h
10.05
KB
-rw-r--r--
2022-12-01 11:12
stringtriebuilder.h
15.47
KB
-rw-r--r--
2022-12-01 11:12
stsearch.h
21.41
KB
-rw-r--r--
2022-12-01 11:12
symtable.h
4.27
KB
-rw-r--r--
2022-12-01 11:12
tblcoll.h
36.92
KB
-rw-r--r--
2022-12-01 11:12
timezone.h
43.81
KB
-rw-r--r--
2022-12-01 11:12
tmunit.h
3.4
KB
-rw-r--r--
2022-12-01 11:12
tmutamt.h
4.91
KB
-rw-r--r--
2022-12-01 11:12
tmutfmt.h
7.42
KB
-rw-r--r--
2022-12-01 11:12
translit.h
65.82
KB
-rw-r--r--
2022-12-01 11:12
tzfmt.h
42.93
KB
-rw-r--r--
2022-12-01 11:12
tznames.h
16.85
KB
-rw-r--r--
2022-12-01 11:12
tzrule.h
35.6
KB
-rw-r--r--
2022-12-01 11:12
tztrans.h
6.13
KB
-rw-r--r--
2022-12-01 11:12
ubidi.h
89.61
KB
-rw-r--r--
2022-12-01 11:12
ubiditransform.h
12.7
KB
-rw-r--r--
2022-12-01 11:12
ubrk.h
24.43
KB
-rw-r--r--
2022-12-01 11:12
ucal.h
60.68
KB
-rw-r--r--
2022-12-01 11:12
ucasemap.h
15.21
KB
-rw-r--r--
2022-12-01 11:12
ucat.h
5.35
KB
-rw-r--r--
2022-12-01 11:12
uchar.h
144.64
KB
-rw-r--r--
2022-12-01 11:12
ucharstrie.h
22.53
KB
-rw-r--r--
2022-12-01 11:12
ucharstriebuilder.h
7.47
KB
-rw-r--r--
2022-12-01 11:12
uchriter.h
13.42
KB
-rw-r--r--
2022-12-01 11:12
uclean.h
11.2
KB
-rw-r--r--
2022-12-01 11:12
ucnv.h
83.46
KB
-rw-r--r--
2022-12-01 11:12
ucnv_cb.h
6.58
KB
-rw-r--r--
2022-12-01 11:12
ucnv_err.h
20.98
KB
-rw-r--r--
2022-12-01 11:12
ucnvsel.h
6.19
KB
-rw-r--r--
2022-12-01 11:12
ucol.h
61.95
KB
-rw-r--r--
2022-12-01 11:12
ucoleitr.h
9.82
KB
-rw-r--r--
2022-12-01 11:12
uconfig.h
12.07
KB
-rw-r--r--
2022-12-01 11:12
ucpmap.h
5.53
KB
-rw-r--r--
2022-12-01 11:12
ucptrie.h
22.5
KB
-rw-r--r--
2022-12-01 11:12
ucsdet.h
14.69
KB
-rw-r--r--
2022-12-01 11:12
ucurr.h
16.72
KB
-rw-r--r--
2022-12-01 11:12
udat.h
62.4
KB
-rw-r--r--
2022-12-01 11:12
udata.h
15.63
KB
-rw-r--r--
2022-12-01 11:12
udateintervalformat.h
11.93
KB
-rw-r--r--
2022-12-01 11:12
udatpg.h
30.18
KB
-rw-r--r--
2022-12-01 11:12
udisplaycontext.h
5.94
KB
-rw-r--r--
2022-12-01 11:12
uenum.h
7.79
KB
-rw-r--r--
2022-12-01 11:12
ufieldpositer.h
4.41
KB
-rw-r--r--
2022-12-01 11:12
uformattable.h
10.97
KB
-rw-r--r--
2022-12-01 11:12
uformattedvalue.h
12.3
KB
-rw-r--r--
2022-12-01 11:12
ugender.h
2.06
KB
-rw-r--r--
2022-12-01 11:12
uidna.h
33.43
KB
-rw-r--r--
2022-12-01 11:12
uiter.h
22.75
KB
-rw-r--r--
2022-12-01 11:12
uldnames.h
10.48
KB
-rw-r--r--
2022-12-01 11:12
ulistformatter.h
10.78
KB
-rw-r--r--
2022-12-01 11:12
uloc.h
54.63
KB
-rw-r--r--
2022-12-01 11:12
ulocdata.h
11.3
KB
-rw-r--r--
2022-12-01 11:12
umachine.h
16.05
KB
-rw-r--r--
2022-12-01 11:12
umisc.h
1.33
KB
-rw-r--r--
2022-12-01 11:12
umsg.h
24.25
KB
-rw-r--r--
2022-12-01 11:12
umutablecptrie.h
8.29
KB
-rw-r--r--
2022-12-01 11:12
unifilt.h
4
KB
-rw-r--r--
2022-12-01 11:12
unifunct.h
4.05
KB
-rw-r--r--
2022-12-01 11:12
unimatch.h
6.1
KB
-rw-r--r--
2022-12-01 11:12
unirepl.h
3.38
KB
-rw-r--r--
2022-12-01 11:12
uniset.h
66.46
KB
-rw-r--r--
2022-12-01 11:12
unistr.h
170.53
KB
-rw-r--r--
2022-12-01 11:12
unorm.h
20.55
KB
-rw-r--r--
2022-12-01 11:12
unorm2.h
24.68
KB
-rw-r--r--
2022-12-01 11:12
unounclass.h
735
B
-rw-r--r--
2022-12-01 11:12
unum.h
55.31
KB
-rw-r--r--
2022-12-01 11:12
unumberformatter.h
30.28
KB
-rw-r--r--
2022-12-01 11:12
unumberrangeformatter.h
15.37
KB
-rw-r--r--
2022-12-01 11:12
unumsys.h
7.26
KB
-rw-r--r--
2022-12-01 11:12
uobject.h
10.68
KB
-rw-r--r--
2022-12-01 11:12
upluralrules.h
8.79
KB
-rw-r--r--
2022-12-01 11:12
uregex.h
71.99
KB
-rw-r--r--
2022-12-01 11:12
uregion.h
9.81
KB
-rw-r--r--
2022-12-01 11:12
ureldatefmt.h
17.04
KB
-rw-r--r--
2022-12-01 11:12
urename.h
135
KB
-rw-r--r--
2022-12-01 11:12
urep.h
5.38
KB
-rw-r--r--
2022-12-01 11:12
ures.h
36.54
KB
-rw-r--r--
2022-12-01 11:12
uscript.h
27.63
KB
-rw-r--r--
2022-12-01 11:12
usearch.h
39.21
KB
-rw-r--r--
2022-12-01 11:12
uset.h
44.29
KB
-rw-r--r--
2022-12-01 11:12
usetiter.h
9.68
KB
-rw-r--r--
2022-12-01 11:12
ushape.h
18
KB
-rw-r--r--
2022-12-01 11:12
uspoof.h
65.84
KB
-rw-r--r--
2022-12-01 11:12
usprep.h
8.19
KB
-rw-r--r--
2022-12-01 11:12
ustdio.h
38.56
KB
-rw-r--r--
2022-12-01 11:12
ustream.h
1.89
KB
-rw-r--r--
2022-12-01 11:12
ustring.h
72.36
KB
-rw-r--r--
2022-12-01 11:12
ustringtrie.h
3.15
KB
-rw-r--r--
2022-12-01 11:12
utext.h
58.08
KB
-rw-r--r--
2022-12-01 11:12
utf.h
7.87
KB
-rw-r--r--
2022-12-01 11:12
utf16.h
23.35
KB
-rw-r--r--
2022-12-01 11:12
utf32.h
763
B
-rw-r--r--
2022-12-01 11:12
utf8.h
30.83
KB
-rw-r--r--
2022-12-01 11:12
utf_old.h
45.83
KB
-rw-r--r--
2022-12-01 11:12
utmscale.h
13.78
KB
-rw-r--r--
2022-12-01 11:12
utrace.h
17.18
KB
-rw-r--r--
2022-12-01 11:12
utrans.h
25.54
KB
-rw-r--r--
2022-12-01 11:12
utypes.h
31.06
KB
-rw-r--r--
2022-12-01 11:12
uvernum.h
6.68
KB
-rw-r--r--
2022-12-01 11:12
uversion.h
5.99
KB
-rw-r--r--
2022-12-01 11:12
vtzone.h
20.74
KB
-rw-r--r--
2022-12-01 11:12
Save
Rename
// © 2016 and later: Unicode, Inc. and others. // License & terms of use: http://www.unicode.org/copyright.html /* ***************************************************************************** * Copyright (C) 1996-2014, International Business Machines Corporation and others. * All Rights Reserved. ***************************************************************************** * * File sortkey.h * * Created by: Helena Shih * * Modification History: * * Date Name Description * * 6/20/97 helena Java class name change. * 8/18/97 helena Added internal API documentation. * 6/26/98 erm Changed to use byte arrays and memcmp. ***************************************************************************** */ #ifndef SORTKEY_H #define SORTKEY_H #include "unicode/utypes.h" #if U_SHOW_CPLUSPLUS_API /** * \file * \brief C++ API: Keys for comparing strings multiple times. */ #if !UCONFIG_NO_COLLATION #include "unicode/uobject.h" #include "unicode/unistr.h" #include "unicode/coll.h" U_NAMESPACE_BEGIN /* forward declaration */ class RuleBasedCollator; class CollationKeyByteSink; /** * * Collation keys are generated by the Collator class. Use the CollationKey objects * instead of Collator to compare strings multiple times. A CollationKey * preprocesses the comparison information from the Collator object to * make the comparison faster. If you are not going to comparing strings * multiple times, then using the Collator object is generally faster, * since it only processes as much of the string as needed to make a * comparison. * <p> For example (with strength == tertiary) * <p>When comparing "Abernathy" to "Baggins-Smythworthy", Collator * only needs to process a couple of characters, while a comparison * with CollationKeys will process all of the characters. On the other hand, * if you are doing a sort of a number of fields, it is much faster to use * CollationKeys, since you will be comparing strings multiple times. * <p>Typical use of CollationKeys are in databases, where you store a CollationKey * in a hidden field, and use it for sorting or indexing. * * <p>Example of use: * <pre> * \code * UErrorCode success = U_ZERO_ERROR; * Collator* myCollator = Collator::createInstance(success); * CollationKey* keys = new CollationKey [3]; * myCollator->getCollationKey("Tom", keys[0], success ); * myCollator->getCollationKey("Dick", keys[1], success ); * myCollator->getCollationKey("Harry", keys[2], success ); * * // Inside body of sort routine, compare keys this way: * CollationKey tmp; * if(keys[0].compareTo( keys[1] ) > 0 ) { * tmp = keys[0]; keys[0] = keys[1]; keys[1] = tmp; * } * //... * \endcode * </pre> * <p>Because Collator::compare()'s algorithm is complex, it is faster to sort * long lists of words by retrieving collation keys with Collator::getCollationKey(). * You can then cache the collation keys and compare them using CollationKey::compareTo(). * <p> * <strong>Note:</strong> <code>Collator</code>s with different Locale, * CollationStrength and DecompositionMode settings will return different * CollationKeys for the same set of strings. Locales have specific * collation rules, and the way in which secondary and tertiary differences * are taken into account, for example, will result in different CollationKeys * for same strings. * <p> * @see Collator * @see RuleBasedCollator * @version 1.3 12/18/96 * @author Helena Shih * @stable ICU 2.0 */ class U_I18N_API CollationKey : public UObject { public: /** * This creates an empty collation key based on the null string. An empty * collation key contains no sorting information. When comparing two empty * collation keys, the result is Collator::EQUAL. Comparing empty collation key * with non-empty collation key is always Collator::LESS. * @stable ICU 2.0 */ CollationKey(); /** * Creates a collation key based on the collation key values. * @param values the collation key values * @param count number of collation key values, including trailing nulls. * @stable ICU 2.0 */ CollationKey(const uint8_t* values, int32_t count); /** * Copy constructor. * @param other the object to be copied. * @stable ICU 2.0 */ CollationKey(const CollationKey& other); /** * Sort key destructor. * @stable ICU 2.0 */ virtual ~CollationKey(); /** * Assignment operator * @param other the object to be copied. * @stable ICU 2.0 */ const CollationKey& operator=(const CollationKey& other); /** * Compare if two collation keys are the same. * @param source the collation key to compare to. * @return Returns true if two collation keys are equal, false otherwise. * @stable ICU 2.0 */ bool operator==(const CollationKey& source) const; /** * Compare if two collation keys are not the same. * @param source the collation key to compare to. * @return Returns true if two collation keys are different, false otherwise. * @stable ICU 2.0 */ bool operator!=(const CollationKey& source) const; /** * Test to see if the key is in an invalid state. The key will be in an * invalid state if it couldn't allocate memory for some operation. * @return Returns true if the key is in an invalid, false otherwise. * @stable ICU 2.0 */ UBool isBogus(void) const; /** * Returns a pointer to the collation key values. The storage is owned * by the collation key and the pointer will become invalid if the key * is deleted. * @param count the output parameter of number of collation key values, * including any trailing nulls. * @return a pointer to the collation key values. * @stable ICU 2.0 */ const uint8_t* getByteArray(int32_t& count) const; #ifdef U_USE_COLLATION_KEY_DEPRECATES /** * Extracts the collation key values into a new array. The caller owns * this storage and should free it. * @param count the output parameter of number of collation key values, * including any trailing nulls. * @obsolete ICU 2.6. Use getByteArray instead since this API will be removed in that release. */ uint8_t* toByteArray(int32_t& count) const; #endif #ifndef U_HIDE_DEPRECATED_API /** * Convenience method which does a string(bit-wise) comparison of the * two collation keys. * @param target target collation key to be compared with * @return Returns Collator::LESS if sourceKey < targetKey, * Collator::GREATER if sourceKey > targetKey and Collator::EQUAL * otherwise. * @deprecated ICU 2.6 use the overload with error code */ Collator::EComparisonResult compareTo(const CollationKey& target) const; #endif /* U_HIDE_DEPRECATED_API */ /** * Convenience method which does a string(bit-wise) comparison of the * two collation keys. * @param target target collation key to be compared with * @param status error code * @return Returns UCOL_LESS if sourceKey < targetKey, * UCOL_GREATER if sourceKey > targetKey and UCOL_EQUAL * otherwise. * @stable ICU 2.6 */ UCollationResult compareTo(const CollationKey& target, UErrorCode &status) const; /** * Creates an integer that is unique to the collation key. NOTE: this * is not the same as String.hashCode. * <p>Example of use: * <pre> * . UErrorCode status = U_ZERO_ERROR; * . Collator *myCollation = Collator::createInstance(Locale::US, status); * . if (U_FAILURE(status)) return; * . CollationKey key1, key2; * . UErrorCode status1 = U_ZERO_ERROR, status2 = U_ZERO_ERROR; * . myCollation->getCollationKey("abc", key1, status1); * . if (U_FAILURE(status1)) { delete myCollation; return; } * . myCollation->getCollationKey("ABC", key2, status2); * . if (U_FAILURE(status2)) { delete myCollation; return; } * . // key1.hashCode() != key2.hashCode() * </pre> * @return the hash value based on the string's collation order. * @see UnicodeString#hashCode * @stable ICU 2.0 */ int32_t hashCode(void) const; /** * ICU "poor man's RTTI", returns a UClassID for the actual class. * @stable ICU 2.2 */ virtual UClassID getDynamicClassID() const override; /** * ICU "poor man's RTTI", returns a UClassID for this class. * @stable ICU 2.2 */ static UClassID U_EXPORT2 getStaticClassID(); private: /** * Replaces the current bytes buffer with a new one of newCapacity * and copies length bytes from the old buffer to the new one. * @return the new buffer, or NULL if the allocation failed */ uint8_t *reallocate(int32_t newCapacity, int32_t length); /** * Set a new length for a new sort key in the existing fBytes. */ void setLength(int32_t newLength); uint8_t *getBytes() { return (fFlagAndLength >= 0) ? fUnion.fStackBuffer : fUnion.fFields.fBytes; } const uint8_t *getBytes() const { return (fFlagAndLength >= 0) ? fUnion.fStackBuffer : fUnion.fFields.fBytes; } int32_t getCapacity() const { return (fFlagAndLength >= 0) ? (int32_t)sizeof(fUnion) : fUnion.fFields.fCapacity; } int32_t getLength() const { return fFlagAndLength & 0x7fffffff; } /** * Set the CollationKey to a "bogus" or invalid state * @return this CollationKey */ CollationKey& setToBogus(void); /** * Resets this CollationKey to an empty state * @return this CollationKey */ CollationKey& reset(void); /** * Allow private access to RuleBasedCollator */ friend class RuleBasedCollator; friend class CollationKeyByteSink; // Class fields. sizeof(CollationKey) is intended to be 48 bytes // on a machine with 64-bit pointers. // We use a union to maximize the size of the internal buffer, // similar to UnicodeString but not as tight and complex. // (implicit) *vtable; /** * Sort key length and flag. * Bit 31 is set if the buffer is heap-allocated. * Bits 30..0 contain the sort key length. */ int32_t fFlagAndLength; /** * Unique hash value of this CollationKey. * Special value 2 if the key is bogus. */ mutable int32_t fHashCode; /** * fUnion provides 32 bytes for the internal buffer or for * pointer+capacity. */ union StackBufferOrFields { /** fStackBuffer is used iff fFlagAndLength>=0, else fFields is used */ uint8_t fStackBuffer[32]; struct { uint8_t *fBytes; int32_t fCapacity; } fFields; } fUnion; }; inline bool CollationKey::operator!=(const CollationKey& other) const { return !(*this == other); } inline UBool CollationKey::isBogus() const { return fHashCode == 2; // kBogusHashCode } inline const uint8_t* CollationKey::getByteArray(int32_t &count) const { count = getLength(); return getBytes(); } U_NAMESPACE_END #endif /* #if !UCONFIG_NO_COLLATION */ #endif /* U_SHOW_CPLUSPLUS_API */ #endif