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-nodejs6 /
root /
usr /
include /
unicode /
Delete
Unzip
Name
Size
Permission
Date
Action
alphaindex.h
26.27
KB
-rw-r--r--
2019-12-13 16:03
appendable.h
8.43
KB
-rw-r--r--
2019-12-13 16:03
basictz.h
8.84
KB
-rw-r--r--
2019-12-13 16:03
brkiter.h
27.54
KB
-rw-r--r--
2019-12-13 16:03
bytestream.h
9.59
KB
-rw-r--r--
2019-12-13 16:03
bytestrie.h
19.26
KB
-rw-r--r--
2019-12-13 16:03
bytestriebuilder.h
7.1
KB
-rw-r--r--
2019-12-13 16:03
calendar.h
105.35
KB
-rw-r--r--
2019-12-13 16:03
caniter.h
7.35
KB
-rw-r--r--
2019-12-13 16:03
casemap.h
25.31
KB
-rw-r--r--
2019-12-13 16:03
char16ptr.h
7.29
KB
-rw-r--r--
2019-12-13 16:03
chariter.h
24
KB
-rw-r--r--
2019-12-13 16:03
choicfmt.h
23.85
KB
-rw-r--r--
2019-12-13 16:03
coleitr.h
13.7
KB
-rw-r--r--
2019-12-13 16:03
coll.h
55.61
KB
-rw-r--r--
2019-12-13 16:03
compactdecimalformat.h
16.58
KB
-rw-r--r--
2019-12-13 16:03
curramt.h
3.69
KB
-rw-r--r--
2019-12-13 16:03
currpinf.h
7.08
KB
-rw-r--r--
2019-12-13 16:03
currunit.h
3.49
KB
-rw-r--r--
2019-12-13 16:03
datefmt.h
40.18
KB
-rw-r--r--
2019-12-13 16:03
dbbi.h
1.11
KB
-rw-r--r--
2019-12-13 16:03
dcfmtsym.h
17.66
KB
-rw-r--r--
2019-12-13 16:03
decimfmt.h
89.73
KB
-rw-r--r--
2019-12-13 16:03
docmain.h
6.56
KB
-rw-r--r--
2019-12-13 16:03
dtfmtsym.h
37.64
KB
-rw-r--r--
2019-12-13 16:03
dtintrv.h
3.76
KB
-rw-r--r--
2019-12-13 16:03
dtitvfmt.h
42.87
KB
-rw-r--r--
2019-12-13 16:03
dtitvinf.h
18.46
KB
-rw-r--r--
2019-12-13 16:03
dtptngen.h
23.72
KB
-rw-r--r--
2019-12-13 16:03
dtrule.h
8.62
KB
-rw-r--r--
2019-12-13 16:03
edits.h
15.54
KB
-rw-r--r--
2019-12-13 16:03
enumset.h
2.05
KB
-rw-r--r--
2019-12-13 16:03
errorcode.h
4.78
KB
-rw-r--r--
2019-12-13 16:03
fieldpos.h
8.63
KB
-rw-r--r--
2019-12-13 16:03
filteredbrk.h
5.46
KB
-rw-r--r--
2019-12-13 16:03
fmtable.h
24.39
KB
-rw-r--r--
2019-12-13 16:03
format.h
12.44
KB
-rw-r--r--
2019-12-13 16:03
fpositer.h
3.14
KB
-rw-r--r--
2019-12-13 16:03
gender.h
3.18
KB
-rw-r--r--
2019-12-13 16:03
gregocal.h
31.57
KB
-rw-r--r--
2019-12-13 16:03
icudataver.h
1.03
KB
-rw-r--r--
2019-12-13 16:03
icuplug.h
11.86
KB
-rw-r--r--
2019-12-13 16:03
idna.h
12.63
KB
-rw-r--r--
2019-12-13 16:03
listformatter.h
4.98
KB
-rw-r--r--
2019-12-13 16:03
localpointer.h
16.88
KB
-rw-r--r--
2019-12-13 16:03
locdspnm.h
7.05
KB
-rw-r--r--
2019-12-13 16:03
locid.h
31.4
KB
-rw-r--r--
2019-12-13 16:03
measfmt.h
11.25
KB
-rw-r--r--
2019-12-13 16:03
measunit.h
37.74
KB
-rw-r--r--
2019-12-13 16:03
measure.h
4.26
KB
-rw-r--r--
2019-12-13 16:03
messagepattern.h
33.64
KB
-rw-r--r--
2019-12-13 16:03
msgfmt.h
43.16
KB
-rw-r--r--
2019-12-13 16:03
normalizer2.h
33.97
KB
-rw-r--r--
2019-12-13 16:03
normlzr.h
30.74
KB
-rw-r--r--
2019-12-13 16:03
nounit.h
2.6
KB
-rw-r--r--
2019-12-13 16:03
numberformatter.h
64.98
KB
-rw-r--r--
2019-12-13 16:03
numfmt.h
47.76
KB
-rw-r--r--
2019-12-13 16:03
numsys.h
6.73
KB
-rw-r--r--
2019-12-13 16:03
parseerr.h
3.08
KB
-rw-r--r--
2019-12-13 16:03
parsepos.h
5.45
KB
-rw-r--r--
2019-12-13 16:03
platform.h
27.19
KB
-rw-r--r--
2019-12-13 16:03
plurfmt.h
25.66
KB
-rw-r--r--
2019-12-13 16:03
plurrule.h
18.34
KB
-rw-r--r--
2019-12-13 16:03
ptypes.h
3.47
KB
-rw-r--r--
2019-12-13 16:03
putil.h
6.34
KB
-rw-r--r--
2019-12-13 16:03
rbbi.h
27.09
KB
-rw-r--r--
2019-12-13 16:03
rbnf.h
49.76
KB
-rw-r--r--
2019-12-13 16:03
rbtz.h
15.47
KB
-rw-r--r--
2019-12-13 16:03
regex.h
84.91
KB
-rw-r--r--
2019-12-13 16:03
region.h
9.12
KB
-rw-r--r--
2019-12-13 16:03
reldatefmt.h
14.3
KB
-rw-r--r--
2019-12-13 16:03
rep.h
9.5
KB
-rw-r--r--
2019-12-13 16:03
resbund.h
18.01
KB
-rw-r--r--
2019-12-13 16:03
schriter.h
6.26
KB
-rw-r--r--
2019-12-13 16:03
scientificnumberformatter.h
6.59
KB
-rw-r--r--
2019-12-13 16:03
search.h
22.21
KB
-rw-r--r--
2019-12-13 16:03
selfmt.h
14.24
KB
-rw-r--r--
2019-12-13 16:03
simpleformatter.h
11.43
KB
-rw-r--r--
2019-12-13 16:03
simpletz.h
45.24
KB
-rw-r--r--
2019-12-13 16:03
smpdtfmt.h
70.09
KB
-rw-r--r--
2019-12-13 16:03
sortkey.h
11.12
KB
-rw-r--r--
2019-12-13 16:03
std_string.h
1015
B
-rw-r--r--
2019-12-13 16:03
strenum.h
10.04
KB
-rw-r--r--
2019-12-13 16:03
stringoptions.h
5.89
KB
-rw-r--r--
2019-12-13 16:03
stringpiece.h
6.46
KB
-rw-r--r--
2019-12-13 16:03
stringtriebuilder.h
15.2
KB
-rw-r--r--
2019-12-13 16:03
stsearch.h
21.29
KB
-rw-r--r--
2019-12-13 16:03
symtable.h
4.21
KB
-rw-r--r--
2019-12-13 16:03
tblcoll.h
36.4
KB
-rw-r--r--
2019-12-13 16:03
timezone.h
40.83
KB
-rw-r--r--
2019-12-13 16:03
tmunit.h
3.29
KB
-rw-r--r--
2019-12-13 16:03
tmutamt.h
4.8
KB
-rw-r--r--
2019-12-13 16:03
tmutfmt.h
7.79
KB
-rw-r--r--
2019-12-13 16:03
translit.h
54.53
KB
-rw-r--r--
2019-12-13 16:03
tzfmt.h
42.81
KB
-rw-r--r--
2019-12-13 16:03
tznames.h
16.79
KB
-rw-r--r--
2019-12-13 16:03
tzrule.h
35.32
KB
-rw-r--r--
2019-12-13 16:03
tztrans.h
6.07
KB
-rw-r--r--
2019-12-13 16:03
ubidi.h
89.28
KB
-rw-r--r--
2019-12-13 16:03
ubiditransform.h
12.71
KB
-rw-r--r--
2019-12-13 16:03
ubrk.h
24.08
KB
-rw-r--r--
2019-12-13 16:03
ucal.h
54.56
KB
-rw-r--r--
2019-12-13 16:03
ucasemap.h
15.18
KB
-rw-r--r--
2019-12-13 16:03
ucat.h
5.36
KB
-rw-r--r--
2019-12-13 16:03
uchar.h
131.61
KB
-rw-r--r--
2019-12-13 16:03
ucharstrie.h
21.06
KB
-rw-r--r--
2019-12-13 16:03
ucharstriebuilder.h
7.14
KB
-rw-r--r--
2019-12-13 16:03
uchriter.h
13.14
KB
-rw-r--r--
2019-12-13 16:03
uclean.h
11.24
KB
-rw-r--r--
2019-12-13 16:03
ucnv.h
83.06
KB
-rw-r--r--
2019-12-13 16:03
ucnv_cb.h
6.59
KB
-rw-r--r--
2019-12-13 16:03
ucnv_err.h
20.98
KB
-rw-r--r--
2019-12-13 16:03
ucnvsel.h
6.14
KB
-rw-r--r--
2019-12-13 16:03
ucol.h
61.36
KB
-rw-r--r--
2019-12-13 16:03
ucoleitr.h
9.46
KB
-rw-r--r--
2019-12-13 16:03
uconfig.h
11.91
KB
-rw-r--r--
2019-12-13 16:03
ucsdet.h
14.67
KB
-rw-r--r--
2019-12-13 16:03
ucurr.h
15.15
KB
-rw-r--r--
2019-12-13 16:03
udat.h
60.13
KB
-rw-r--r--
2019-12-13 16:03
udata.h
15.53
KB
-rw-r--r--
2019-12-13 16:03
udateintervalformat.h
6.79
KB
-rw-r--r--
2019-12-13 16:03
udatpg.h
24.11
KB
-rw-r--r--
2019-12-13 16:03
udisplaycontext.h
5.89
KB
-rw-r--r--
2019-12-13 16:03
uenum.h
7.9
KB
-rw-r--r--
2019-12-13 16:03
ufieldpositer.h
4.36
KB
-rw-r--r--
2019-12-13 16:03
uformattable.h
10.94
KB
-rw-r--r--
2019-12-13 16:03
ugender.h
2
KB
-rw-r--r--
2019-12-13 16:03
uidna.h
33.37
KB
-rw-r--r--
2019-12-13 16:03
uiter.h
22.77
KB
-rw-r--r--
2019-12-13 16:03
uldnames.h
10.45
KB
-rw-r--r--
2019-12-13 16:03
ulistformatter.h
4.54
KB
-rw-r--r--
2019-12-13 16:03
uloc.h
50.75
KB
-rw-r--r--
2019-12-13 16:03
ulocdata.h
11.26
KB
-rw-r--r--
2019-12-13 16:03
umachine.h
13.1
KB
-rw-r--r--
2019-12-13 16:03
umisc.h
1.33
KB
-rw-r--r--
2019-12-13 16:03
umsg.h
24.23
KB
-rw-r--r--
2019-12-13 16:03
unifilt.h
3.63
KB
-rw-r--r--
2019-12-13 16:03
unifunct.h
3.98
KB
-rw-r--r--
2019-12-13 16:03
unimatch.h
6.04
KB
-rw-r--r--
2019-12-13 16:03
unirepl.h
3.32
KB
-rw-r--r--
2019-12-13 16:03
uniset.h
63.98
KB
-rw-r--r--
2019-12-13 16:03
unistr.h
175.58
KB
-rw-r--r--
2019-12-13 16:03
unorm.h
20.45
KB
-rw-r--r--
2019-12-13 16:03
unorm2.h
24.66
KB
-rw-r--r--
2019-12-13 16:03
unum.h
52.49
KB
-rw-r--r--
2019-12-13 16:03
unumsys.h
7.14
KB
-rw-r--r--
2019-12-13 16:03
uobject.h
10.72
KB
-rw-r--r--
2019-12-13 16:03
upluralrules.h
6.77
KB
-rw-r--r--
2019-12-13 16:03
uregex.h
72.05
KB
-rw-r--r--
2019-12-13 16:03
uregion.h
9.84
KB
-rw-r--r--
2019-12-13 16:03
ureldatefmt.h
12.22
KB
-rw-r--r--
2019-12-13 16:03
urename.h
124.49
KB
-rw-r--r--
2019-12-13 16:03
urep.h
5.38
KB
-rw-r--r--
2019-12-13 16:03
ures.h
36.52
KB
-rw-r--r--
2019-12-13 16:03
uscript.h
25.91
KB
-rw-r--r--
2019-12-13 16:03
usearch.h
38.14
KB
-rw-r--r--
2019-12-13 16:03
uset.h
39.91
KB
-rw-r--r--
2019-12-13 16:03
usetiter.h
9.49
KB
-rw-r--r--
2019-12-13 16:03
ushape.h
18
KB
-rw-r--r--
2019-12-13 16:03
uspoof.h
64.9
KB
-rw-r--r--
2019-12-13 16:03
usprep.h
8.13
KB
-rw-r--r--
2019-12-13 16:03
ustdio.h
38.54
KB
-rw-r--r--
2019-12-13 16:03
ustream.h
1.8
KB
-rw-r--r--
2019-12-13 16:03
ustring.h
72.52
KB
-rw-r--r--
2019-12-13 16:03
ustringtrie.h
3.15
KB
-rw-r--r--
2019-12-13 16:03
utext.h
58.11
KB
-rw-r--r--
2019-12-13 16:03
utf.h
7.86
KB
-rw-r--r--
2019-12-13 16:03
utf16.h
22.49
KB
-rw-r--r--
2019-12-13 16:03
utf32.h
763
B
-rw-r--r--
2019-12-13 16:03
utf8.h
28.16
KB
-rw-r--r--
2019-12-13 16:03
utf_old.h
43.78
KB
-rw-r--r--
2019-12-13 16:03
utmscale.h
13.78
KB
-rw-r--r--
2019-12-13 16:03
utrace.h
13.89
KB
-rw-r--r--
2019-12-13 16:03
utrans.h
25.53
KB
-rw-r--r--
2019-12-13 16:03
utypes.h
29.92
KB
-rw-r--r--
2019-12-13 16:03
uvernum.h
5.69
KB
-rw-r--r--
2019-12-13 16:03
uversion.h
6.4
KB
-rw-r--r--
2019-12-13 16:03
vtzone.h
20.17
KB
-rw-r--r--
2019-12-13 16:03
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