Linux server1.dn-server.com 4.18.0-553.89.1.lve.el8.x86_64 #1 SMP Wed Dec 10 13:58:50 UTC 2025 x86_64
LiteSpeed
Server IP : 195.201.204.189 & Your IP : 216.73.216.198
Domains :
Cant Read [ /etc/named.conf ]
User : beriska1
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
opt /
alt /
alt-nodejs11 /
root /
usr /
include /
unicode /
Delete
Unzip
Name
Size
Permission
Date
Action
alphaindex.h
26.42
KB
-rw-r--r--
2019-12-13 18:13
appendable.h
8.43
KB
-rw-r--r--
2019-12-13 18:13
basictz.h
8.84
KB
-rw-r--r--
2019-12-13 18:13
brkiter.h
27.64
KB
-rw-r--r--
2019-12-13 18:13
bytestream.h
9.54
KB
-rw-r--r--
2019-12-13 18:13
bytestrie.h
19.26
KB
-rw-r--r--
2019-12-13 18:13
bytestriebuilder.h
7.02
KB
-rw-r--r--
2019-12-13 18:13
calendar.h
105.06
KB
-rw-r--r--
2019-12-13 18:13
caniter.h
7.37
KB
-rw-r--r--
2019-12-13 18:13
casemap.h
25.26
KB
-rw-r--r--
2019-12-13 18:13
char16ptr.h
7.16
KB
-rw-r--r--
2019-12-13 18:13
chariter.h
24
KB
-rw-r--r--
2019-12-13 18:13
choicfmt.h
23.85
KB
-rw-r--r--
2019-12-13 18:13
coleitr.h
13.7
KB
-rw-r--r--
2019-12-13 18:13
coll.h
55.59
KB
-rw-r--r--
2019-12-13 18:13
compactdecimalformat.h
6.81
KB
-rw-r--r--
2019-12-13 18:13
curramt.h
3.69
KB
-rw-r--r--
2019-12-13 18:13
currpinf.h
7.24
KB
-rw-r--r--
2019-12-13 18:13
currunit.h
3.99
KB
-rw-r--r--
2019-12-13 18:13
datefmt.h
40.37
KB
-rw-r--r--
2019-12-13 18:13
dbbi.h
1.11
KB
-rw-r--r--
2019-12-13 18:13
dcfmtsym.h
20.1
KB
-rw-r--r--
2019-12-13 18:13
decimfmt.h
87.82
KB
-rw-r--r--
2019-12-13 18:13
docmain.h
6.96
KB
-rw-r--r--
2019-12-13 18:13
dtfmtsym.h
37.64
KB
-rw-r--r--
2019-12-13 18:13
dtintrv.h
3.78
KB
-rw-r--r--
2019-12-13 18:13
dtitvfmt.h
46.56
KB
-rw-r--r--
2019-12-13 18:13
dtitvinf.h
18.46
KB
-rw-r--r--
2019-12-13 18:13
dtptngen.h
25.08
KB
-rw-r--r--
2019-12-13 18:13
dtrule.h
8.62
KB
-rw-r--r--
2019-12-13 18:13
edits.h
20.67
KB
-rw-r--r--
2019-12-13 18:13
enumset.h
2.08
KB
-rw-r--r--
2019-12-13 18:13
errorcode.h
4.78
KB
-rw-r--r--
2019-12-13 18:13
fieldpos.h
8.63
KB
-rw-r--r--
2019-12-13 18:13
filteredbrk.h
5.24
KB
-rw-r--r--
2019-12-13 18:13
fmtable.h
24.36
KB
-rw-r--r--
2019-12-13 18:13
format.h
12.44
KB
-rw-r--r--
2019-12-13 18:13
formattedvalue.h
9.73
KB
-rw-r--r--
2019-12-13 18:13
fpositer.h
2.98
KB
-rw-r--r--
2019-12-13 18:13
gender.h
3.27
KB
-rw-r--r--
2019-12-13 18:13
gregocal.h
31.57
KB
-rw-r--r--
2019-12-13 18:13
icudataver.h
1.03
KB
-rw-r--r--
2019-12-13 18:13
icuplug.h
11.88
KB
-rw-r--r--
2019-12-13 18:13
idna.h
12.63
KB
-rw-r--r--
2019-12-13 18:13
listformatter.h
9.42
KB
-rw-r--r--
2019-12-13 18:13
localebuilder.h
10.54
KB
-rw-r--r--
2019-12-13 18:13
localpointer.h
19.69
KB
-rw-r--r--
2019-12-13 18:13
locdspnm.h
7.06
KB
-rw-r--r--
2019-12-13 18:13
locid.h
44.94
KB
-rw-r--r--
2019-12-13 18:13
measfmt.h
11.44
KB
-rw-r--r--
2019-12-13 18:13
measunit.h
88.17
KB
-rw-r--r--
2019-12-13 18:13
measure.h
4.26
KB
-rw-r--r--
2019-12-13 18:13
messagepattern.h
33.65
KB
-rw-r--r--
2019-12-13 18:13
msgfmt.h
44.04
KB
-rw-r--r--
2019-12-13 18:13
normalizer2.h
33.97
KB
-rw-r--r--
2019-12-13 18:13
normlzr.h
30.74
KB
-rw-r--r--
2019-12-13 18:13
nounit.h
2.63
KB
-rw-r--r--
2019-12-13 18:13
numberformatter.h
84.62
KB
-rw-r--r--
2019-12-13 18:13
numberrangeformatter.h
29.93
KB
-rw-r--r--
2019-12-13 18:13
numfmt.h
49.35
KB
-rw-r--r--
2019-12-13 18:13
numsys.h
7.13
KB
-rw-r--r--
2019-12-13 18:13
parseerr.h
3.08
KB
-rw-r--r--
2019-12-13 18:13
parsepos.h
5.5
KB
-rw-r--r--
2019-12-13 18:13
platform.h
27.1
KB
-rw-r--r--
2019-12-13 18:13
plurfmt.h
25.18
KB
-rw-r--r--
2019-12-13 18:13
plurrule.h
18.33
KB
-rw-r--r--
2019-12-13 18:13
ptypes.h
3.49
KB
-rw-r--r--
2019-12-13 18:13
putil.h
6.33
KB
-rw-r--r--
2019-12-13 18:13
rbbi.h
26.42
KB
-rw-r--r--
2019-12-13 18:13
rbnf.h
49.79
KB
-rw-r--r--
2019-12-13 18:13
rbtz.h
15.47
KB
-rw-r--r--
2019-12-13 18:13
regex.h
84.3
KB
-rw-r--r--
2019-12-13 18:13
region.h
9.12
KB
-rw-r--r--
2019-12-13 18:13
reldatefmt.h
22.37
KB
-rw-r--r--
2019-12-13 18:13
rep.h
9.5
KB
-rw-r--r--
2019-12-13 18:13
resbund.h
18.01
KB
-rw-r--r--
2019-12-13 18:13
schriter.h
6.26
KB
-rw-r--r--
2019-12-13 18:13
scientificnumberformatter.h
6.32
KB
-rw-r--r--
2019-12-13 18:13
search.h
22.21
KB
-rw-r--r--
2019-12-13 18:13
selfmt.h
14.24
KB
-rw-r--r--
2019-12-13 18:13
simpleformatter.h
12.53
KB
-rw-r--r--
2019-12-13 18:13
simpletz.h
45.3
KB
-rw-r--r--
2019-12-13 18:13
smpdtfmt.h
70.9
KB
-rw-r--r--
2019-12-13 18:13
sortkey.h
11.12
KB
-rw-r--r--
2019-12-13 18:13
std_string.h
1015
B
-rw-r--r--
2019-12-13 18:13
strenum.h
10.04
KB
-rw-r--r--
2019-12-13 18:13
stringoptions.h
5.79
KB
-rw-r--r--
2019-12-13 18:13
stringpiece.h
6.46
KB
-rw-r--r--
2019-12-13 18:13
stringtriebuilder.h
15.27
KB
-rw-r--r--
2019-12-13 18:13
stsearch.h
21.29
KB
-rw-r--r--
2019-12-13 18:13
symtable.h
4.21
KB
-rw-r--r--
2019-12-13 18:13
tblcoll.h
36.4
KB
-rw-r--r--
2019-12-13 18:13
timezone.h
41.2
KB
-rw-r--r--
2019-12-13 18:13
tmunit.h
3.29
KB
-rw-r--r--
2019-12-13 18:13
tmutamt.h
4.8
KB
-rw-r--r--
2019-12-13 18:13
tmutfmt.h
7.79
KB
-rw-r--r--
2019-12-13 18:13
translit.h
65.76
KB
-rw-r--r--
2019-12-13 18:13
tzfmt.h
42.82
KB
-rw-r--r--
2019-12-13 18:13
tznames.h
16.79
KB
-rw-r--r--
2019-12-13 18:13
tzrule.h
35.32
KB
-rw-r--r--
2019-12-13 18:13
tztrans.h
6.07
KB
-rw-r--r--
2019-12-13 18:13
ubidi.h
89.56
KB
-rw-r--r--
2019-12-13 18:13
ubiditransform.h
12.65
KB
-rw-r--r--
2019-12-13 18:13
ubrk.h
23.97
KB
-rw-r--r--
2019-12-13 18:13
ucal.h
55.54
KB
-rw-r--r--
2019-12-13 18:13
ucasemap.h
15.18
KB
-rw-r--r--
2019-12-13 18:13
ucat.h
5.36
KB
-rw-r--r--
2019-12-13 18:13
uchar.h
140.66
KB
-rw-r--r--
2019-12-13 18:13
ucharstrie.h
21.06
KB
-rw-r--r--
2019-12-13 18:13
ucharstriebuilder.h
7.14
KB
-rw-r--r--
2019-12-13 18:13
uchriter.h
13.14
KB
-rw-r--r--
2019-12-13 18:13
uclean.h
11.21
KB
-rw-r--r--
2019-12-13 18:13
ucnv.h
83.09
KB
-rw-r--r--
2019-12-13 18:13
ucnv_cb.h
6.59
KB
-rw-r--r--
2019-12-13 18:13
ucnv_err.h
20.99
KB
-rw-r--r--
2019-12-13 18:13
ucnvsel.h
6.14
KB
-rw-r--r--
2019-12-13 18:13
ucol.h
61.39
KB
-rw-r--r--
2019-12-13 18:13
ucoleitr.h
9.46
KB
-rw-r--r--
2019-12-13 18:13
uconfig.h
12.05
KB
-rw-r--r--
2019-12-13 18:13
ucpmap.h
5.58
KB
-rw-r--r--
2019-12-13 18:13
ucptrie.h
22.29
KB
-rw-r--r--
2019-12-13 18:13
ucsdet.h
14.67
KB
-rw-r--r--
2019-12-13 18:13
ucurr.h
16.15
KB
-rw-r--r--
2019-12-13 18:13
udat.h
60.81
KB
-rw-r--r--
2019-12-13 18:13
udata.h
15.53
KB
-rw-r--r--
2019-12-13 18:13
udateintervalformat.h
10.03
KB
-rw-r--r--
2019-12-13 18:13
udatpg.h
25.94
KB
-rw-r--r--
2019-12-13 18:13
udisplaycontext.h
5.89
KB
-rw-r--r--
2019-12-13 18:13
uenum.h
7.78
KB
-rw-r--r--
2019-12-13 18:13
ufieldpositer.h
4.36
KB
-rw-r--r--
2019-12-13 18:13
uformattable.h
10.94
KB
-rw-r--r--
2019-12-13 18:13
uformattedvalue.h
12.14
KB
-rw-r--r--
2019-12-13 18:13
ugender.h
2
KB
-rw-r--r--
2019-12-13 18:13
uidna.h
33.37
KB
-rw-r--r--
2019-12-13 18:13
uiter.h
22.77
KB
-rw-r--r--
2019-12-13 18:13
uldnames.h
10.45
KB
-rw-r--r--
2019-12-13 18:13
ulistformatter.h
8.83
KB
-rw-r--r--
2019-12-13 18:13
uloc.h
50.75
KB
-rw-r--r--
2019-12-13 18:13
ulocdata.h
11.26
KB
-rw-r--r--
2019-12-13 18:13
umachine.h
13.19
KB
-rw-r--r--
2019-12-13 18:13
umisc.h
1.33
KB
-rw-r--r--
2019-12-13 18:13
umsg.h
24.23
KB
-rw-r--r--
2019-12-13 18:13
umutablecptrie.h
8.28
KB
-rw-r--r--
2019-12-13 18:13
unifilt.h
3.63
KB
-rw-r--r--
2019-12-13 18:13
unifunct.h
3.98
KB
-rw-r--r--
2019-12-13 18:13
unimatch.h
6.04
KB
-rw-r--r--
2019-12-13 18:13
unirepl.h
3.32
KB
-rw-r--r--
2019-12-13 18:13
uniset.h
64.88
KB
-rw-r--r--
2019-12-13 18:13
unistr.h
170.39
KB
-rw-r--r--
2019-12-13 18:13
unorm.h
20.45
KB
-rw-r--r--
2019-12-13 18:13
unorm2.h
24.66
KB
-rw-r--r--
2019-12-13 18:13
unum.h
53.55
KB
-rw-r--r--
2019-12-13 18:13
unumberformatter.h
25.19
KB
-rw-r--r--
2019-12-13 18:13
unumsys.h
7.21
KB
-rw-r--r--
2019-12-13 18:13
uobject.h
10.85
KB
-rw-r--r--
2019-12-13 18:13
upluralrules.h
7.88
KB
-rw-r--r--
2019-12-13 18:13
uregex.h
72.05
KB
-rw-r--r--
2019-12-13 18:13
uregion.h
9.84
KB
-rw-r--r--
2019-12-13 18:13
ureldatefmt.h
17.26
KB
-rw-r--r--
2019-12-13 18:13
urename.h
131.4
KB
-rw-r--r--
2019-12-13 18:13
urep.h
5.38
KB
-rw-r--r--
2019-12-13 18:13
ures.h
36.54
KB
-rw-r--r--
2019-12-13 18:13
uscript.h
26.87
KB
-rw-r--r--
2019-12-13 18:13
usearch.h
38.12
KB
-rw-r--r--
2019-12-13 18:13
uset.h
40
KB
-rw-r--r--
2019-12-13 18:13
usetiter.h
9.49
KB
-rw-r--r--
2019-12-13 18:13
ushape.h
18
KB
-rw-r--r--
2019-12-13 18:13
uspoof.h
66.03
KB
-rw-r--r--
2019-12-13 18:13
usprep.h
8.14
KB
-rw-r--r--
2019-12-13 18:13
ustdio.h
38.54
KB
-rw-r--r--
2019-12-13 18:13
ustream.h
1.8
KB
-rw-r--r--
2019-12-13 18:13
ustring.h
72.47
KB
-rw-r--r--
2019-12-13 18:13
ustringtrie.h
3.15
KB
-rw-r--r--
2019-12-13 18:13
utext.h
58.11
KB
-rw-r--r--
2019-12-13 18:13
utf.h
7.86
KB
-rw-r--r--
2019-12-13 18:13
utf16.h
22.33
KB
-rw-r--r--
2019-12-13 18:13
utf32.h
763
B
-rw-r--r--
2019-12-13 18:13
utf8.h
29.96
KB
-rw-r--r--
2019-12-13 18:13
utf_old.h
43.78
KB
-rw-r--r--
2019-12-13 18:13
utmscale.h
13.78
KB
-rw-r--r--
2019-12-13 18:13
utrace.h
13.89
KB
-rw-r--r--
2019-12-13 18:13
utrans.h
25.54
KB
-rw-r--r--
2019-12-13 18:13
utypes.h
30.38
KB
-rw-r--r--
2019-12-13 18:13
uvernum.h
6.67
KB
-rw-r--r--
2019-12-13 18:13
uversion.h
6.7
KB
-rw-r--r--
2019-12-13 18:13
vtzone.h
20.17
KB
-rw-r--r--
2019-12-13 18:13
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" /** * \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 */ UBool 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 */ UBool 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; /** * 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 UBool 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