Linux yavrix.internet-webhosting.com 3.10.0-962.3.2.lve1.5.88.el7.x86_64 #1 SMP Fri Sep 26 14:06:42 UTC 2025 x86_64
LiteSpeed
Server IP : 103.8.25.136 & Your IP : 216.73.216.204
Domains :
Cant Read [ /etc/named.conf ]
User : klinikpe
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
opt /
alt /
libicu65 /
usr /
include /
unicode /
Delete
Unzip
Name
Size
Permission
Date
Action
alphaindex.h
26.48
KB
-rw-r--r--
2026-06-02 15:52
appendable.h
8.49
KB
-rw-r--r--
2026-06-02 15:52
basictz.h
9.15
KB
-rw-r--r--
2026-06-02 15:52
brkiter.h
27.8
KB
-rw-r--r--
2026-06-02 15:52
bytestream.h
9.6
KB
-rw-r--r--
2026-06-02 15:52
bytestrie.h
20.77
KB
-rw-r--r--
2026-06-02 15:52
bytestriebuilder.h
7.08
KB
-rw-r--r--
2026-06-02 15:52
calendar.h
105.74
KB
-rw-r--r--
2026-06-02 15:52
caniter.h
7.43
KB
-rw-r--r--
2026-06-02 15:52
casemap.h
25.33
KB
-rw-r--r--
2026-06-02 15:52
char16ptr.h
7.22
KB
-rw-r--r--
2026-06-02 15:52
chariter.h
24.05
KB
-rw-r--r--
2026-06-02 15:52
choicfmt.h
23.91
KB
-rw-r--r--
2026-06-02 15:52
coleitr.h
13.76
KB
-rw-r--r--
2026-06-02 15:52
coll.h
56.23
KB
-rw-r--r--
2026-06-02 15:52
compactdecimalformat.h
6.88
KB
-rw-r--r--
2026-06-02 15:52
curramt.h
3.76
KB
-rw-r--r--
2026-06-02 15:52
currpinf.h
7.3
KB
-rw-r--r--
2026-06-02 15:52
currunit.h
4.05
KB
-rw-r--r--
2026-06-02 15:52
datefmt.h
40.67
KB
-rw-r--r--
2026-06-02 15:52
dbbi.h
1.19
KB
-rw-r--r--
2026-06-02 15:52
dcfmtsym.h
20.13
KB
-rw-r--r--
2026-06-02 15:52
decimfmt.h
87.38
KB
-rw-r--r--
2026-06-02 15:52
docmain.h
6.97
KB
-rw-r--r--
2026-06-02 15:52
dtfmtsym.h
37.7
KB
-rw-r--r--
2026-06-02 15:52
dtintrv.h
3.84
KB
-rw-r--r--
2026-06-02 15:52
dtitvfmt.h
46.63
KB
-rw-r--r--
2026-06-02 15:52
dtitvinf.h
18.51
KB
-rw-r--r--
2026-06-02 15:52
dtptngen.h
25.08
KB
-rw-r--r--
2026-06-02 15:52
dtrule.h
8.68
KB
-rw-r--r--
2026-06-02 15:52
edits.h
20.74
KB
-rw-r--r--
2026-06-02 15:52
enumset.h
2.08
KB
-rw-r--r--
2026-06-02 15:52
errorcode.h
4.84
KB
-rw-r--r--
2026-06-02 15:52
fieldpos.h
8.69
KB
-rw-r--r--
2026-06-02 15:52
filteredbrk.h
5.37
KB
-rw-r--r--
2026-06-02 15:52
fmtable.h
24.42
KB
-rw-r--r--
2026-06-02 15:52
format.h
12.5
KB
-rw-r--r--
2026-06-02 15:52
formattedvalue.h
10.27
KB
-rw-r--r--
2026-06-02 15:52
fpositer.h
3.04
KB
-rw-r--r--
2026-06-02 15:52
gender.h
3.33
KB
-rw-r--r--
2026-06-02 15:52
gregocal.h
31.71
KB
-rw-r--r--
2026-06-02 15:52
icudataver.h
1.03
KB
-rw-r--r--
2026-06-02 15:52
icuplug.h
11.88
KB
-rw-r--r--
2026-06-02 15:52
idna.h
12.7
KB
-rw-r--r--
2026-06-02 15:52
listformatter.h
9.47
KB
-rw-r--r--
2026-06-02 15:52
localebuilder.h
11.27
KB
-rw-r--r--
2026-06-02 15:52
localematcher.h
22.5
KB
-rw-r--r--
2026-06-02 15:52
localpointer.h
19.69
KB
-rw-r--r--
2026-06-02 15:52
locdspnm.h
7.12
KB
-rw-r--r--
2026-06-02 15:52
locid.h
47.4
KB
-rw-r--r--
2026-06-02 15:52
measfmt.h
11.33
KB
-rw-r--r--
2026-06-02 15:52
measunit.h
93.31
KB
-rw-r--r--
2026-06-02 15:52
measure.h
4.32
KB
-rw-r--r--
2026-06-02 15:52
messagepattern.h
33.71
KB
-rw-r--r--
2026-06-02 15:52
msgfmt.h
44.11
KB
-rw-r--r--
2026-06-02 15:52
normalizer2.h
34.03
KB
-rw-r--r--
2026-06-02 15:52
normlzr.h
30.94
KB
-rw-r--r--
2026-06-02 15:52
nounit.h
2.69
KB
-rw-r--r--
2026-06-02 15:52
numberformatter.h
86.31
KB
-rw-r--r--
2026-06-02 15:52
numberrangeformatter.h
30.14
KB
-rw-r--r--
2026-06-02 15:52
numfmt.h
49.81
KB
-rw-r--r--
2026-06-02 15:52
numsys.h
7.19
KB
-rw-r--r--
2026-06-02 15:52
parseerr.h
3.08
KB
-rw-r--r--
2026-06-02 15:52
parsepos.h
5.56
KB
-rw-r--r--
2026-06-02 15:52
platform.h
28.08
KB
-rw-r--r--
2026-06-02 15:52
plurfmt.h
25.2
KB
-rw-r--r--
2026-06-02 15:52
plurrule.h
18.39
KB
-rw-r--r--
2026-06-02 15:52
ptypes.h
3.49
KB
-rw-r--r--
2026-06-02 15:52
putil.h
6.33
KB
-rw-r--r--
2026-06-02 15:52
rbbi.h
26.58
KB
-rw-r--r--
2026-06-02 15:52
rbnf.h
48.73
KB
-rw-r--r--
2026-06-02 15:52
rbtz.h
15.6
KB
-rw-r--r--
2026-06-02 15:52
regex.h
84.36
KB
-rw-r--r--
2026-06-02 15:52
region.h
9.18
KB
-rw-r--r--
2026-06-02 15:52
reldatefmt.h
22.62
KB
-rw-r--r--
2026-06-02 15:52
rep.h
9.37
KB
-rw-r--r--
2026-06-02 15:52
resbund.h
18.07
KB
-rw-r--r--
2026-06-02 15:52
schriter.h
6.32
KB
-rw-r--r--
2026-06-02 15:52
scientificnumberformatter.h
6.4
KB
-rw-r--r--
2026-06-02 15:52
search.h
22.22
KB
-rw-r--r--
2026-06-02 15:52
selfmt.h
14.3
KB
-rw-r--r--
2026-06-02 15:52
simpleformatter.h
12.59
KB
-rw-r--r--
2026-06-02 15:52
simpletz.h
45.44
KB
-rw-r--r--
2026-06-02 15:52
smpdtfmt.h
70.97
KB
-rw-r--r--
2026-06-02 15:52
sortkey.h
11.18
KB
-rw-r--r--
2026-06-02 15:52
std_string.h
1.05
KB
-rw-r--r--
2026-06-02 15:52
strenum.h
9.92
KB
-rw-r--r--
2026-06-02 15:52
stringoptions.h
5.79
KB
-rw-r--r--
2026-06-02 15:52
stringpiece.h
7.38
KB
-rw-r--r--
2026-06-02 15:52
stringtriebuilder.h
15.33
KB
-rw-r--r--
2026-06-02 15:52
stsearch.h
21.3
KB
-rw-r--r--
2026-06-02 15:52
symtable.h
4.27
KB
-rw-r--r--
2026-06-02 15:52
tblcoll.h
36.61
KB
-rw-r--r--
2026-06-02 15:52
timezone.h
41.02
KB
-rw-r--r--
2026-06-02 15:52
tmunit.h
3.38
KB
-rw-r--r--
2026-06-02 15:52
tmutamt.h
4.9
KB
-rw-r--r--
2026-06-02 15:52
tmutfmt.h
7.85
KB
-rw-r--r--
2026-06-02 15:52
translit.h
65.82
KB
-rw-r--r--
2026-06-02 15:52
tzfmt.h
42.89
KB
-rw-r--r--
2026-06-02 15:52
tznames.h
16.85
KB
-rw-r--r--
2026-06-02 15:52
tzrule.h
35.37
KB
-rw-r--r--
2026-06-02 15:52
tztrans.h
6.12
KB
-rw-r--r--
2026-06-02 15:52
ubidi.h
89.56
KB
-rw-r--r--
2026-06-02 15:52
ubiditransform.h
12.65
KB
-rw-r--r--
2026-06-02 15:52
ubrk.h
23.97
KB
-rw-r--r--
2026-06-02 15:52
ucal.h
56.9
KB
-rw-r--r--
2026-06-02 15:52
ucasemap.h
15.18
KB
-rw-r--r--
2026-06-02 15:52
ucat.h
5.36
KB
-rw-r--r--
2026-06-02 15:52
uchar.h
140.56
KB
-rw-r--r--
2026-06-02 15:52
ucharstrie.h
22.58
KB
-rw-r--r--
2026-06-02 15:52
ucharstriebuilder.h
7.21
KB
-rw-r--r--
2026-06-02 15:52
uchriter.h
13.2
KB
-rw-r--r--
2026-06-02 15:52
uclean.h
11.21
KB
-rw-r--r--
2026-06-02 15:52
ucnv.h
83.09
KB
-rw-r--r--
2026-06-02 15:52
ucnv_cb.h
6.59
KB
-rw-r--r--
2026-06-02 15:52
ucnv_err.h
20.99
KB
-rw-r--r--
2026-06-02 15:52
ucnvsel.h
6.14
KB
-rw-r--r--
2026-06-02 15:52
ucol.h
61.46
KB
-rw-r--r--
2026-06-02 15:52
ucoleitr.h
9.46
KB
-rw-r--r--
2026-06-02 15:52
uconfig.h
12.07
KB
-rw-r--r--
2026-06-02 15:52
ucpmap.h
5.53
KB
-rw-r--r--
2026-06-02 15:52
ucptrie.h
22.46
KB
-rw-r--r--
2026-06-02 15:52
ucsdet.h
14.67
KB
-rw-r--r--
2026-06-02 15:52
ucurr.h
16.12
KB
-rw-r--r--
2026-06-02 15:52
udat.h
60.88
KB
-rw-r--r--
2026-06-02 15:52
udata.h
15.56
KB
-rw-r--r--
2026-06-02 15:52
udateintervalformat.h
10.03
KB
-rw-r--r--
2026-06-02 15:52
udatpg.h
26.01
KB
-rw-r--r--
2026-06-02 15:52
udisplaycontext.h
5.89
KB
-rw-r--r--
2026-06-02 15:52
uenum.h
7.78
KB
-rw-r--r--
2026-06-02 15:52
ufieldpositer.h
4.36
KB
-rw-r--r--
2026-06-02 15:52
uformattable.h
10.94
KB
-rw-r--r--
2026-06-02 15:52
uformattedvalue.h
12.14
KB
-rw-r--r--
2026-06-02 15:52
ugender.h
2
KB
-rw-r--r--
2026-06-02 15:52
uidna.h
33.37
KB
-rw-r--r--
2026-06-02 15:52
uiter.h
22.77
KB
-rw-r--r--
2026-06-02 15:52
uldnames.h
10.45
KB
-rw-r--r--
2026-06-02 15:52
ulistformatter.h
8.83
KB
-rw-r--r--
2026-06-02 15:52
uloc.h
52.54
KB
-rw-r--r--
2026-06-02 15:52
ulocdata.h
11.26
KB
-rw-r--r--
2026-06-02 15:52
umachine.h
14.53
KB
-rw-r--r--
2026-06-02 15:52
umisc.h
1.33
KB
-rw-r--r--
2026-06-02 15:52
umsg.h
24.23
KB
-rw-r--r--
2026-06-02 15:52
umutablecptrie.h
8.24
KB
-rw-r--r--
2026-06-02 15:52
unifilt.h
3.96
KB
-rw-r--r--
2026-06-02 15:52
unifunct.h
4.04
KB
-rw-r--r--
2026-06-02 15:52
unimatch.h
6.1
KB
-rw-r--r--
2026-06-02 15:52
unirepl.h
3.38
KB
-rw-r--r--
2026-06-02 15:52
uniset.h
64.9
KB
-rw-r--r--
2026-06-02 15:52
unistr.h
170.43
KB
-rw-r--r--
2026-06-02 15:52
unorm.h
20.52
KB
-rw-r--r--
2026-06-02 15:52
unorm2.h
24.66
KB
-rw-r--r--
2026-06-02 15:52
unum.h
53.62
KB
-rw-r--r--
2026-06-02 15:52
unumberformatter.h
25.36
KB
-rw-r--r--
2026-06-02 15:52
unumsys.h
7.21
KB
-rw-r--r--
2026-06-02 15:52
uobject.h
10.68
KB
-rw-r--r--
2026-06-02 15:52
upluralrules.h
7.88
KB
-rw-r--r--
2026-06-02 15:52
uregex.h
72.05
KB
-rw-r--r--
2026-06-02 15:52
uregion.h
9.84
KB
-rw-r--r--
2026-06-02 15:52
ureldatefmt.h
17.26
KB
-rw-r--r--
2026-06-02 15:52
urename.h
130.97
KB
-rw-r--r--
2026-06-02 15:52
urep.h
5.38
KB
-rw-r--r--
2026-06-02 15:52
ures.h
36.54
KB
-rw-r--r--
2026-06-02 15:52
uscript.h
26.87
KB
-rw-r--r--
2026-06-02 15:52
usearch.h
38.12
KB
-rw-r--r--
2026-06-02 15:52
uset.h
40
KB
-rw-r--r--
2026-06-02 15:52
usetiter.h
9.55
KB
-rw-r--r--
2026-06-02 15:52
ushape.h
18
KB
-rw-r--r--
2026-06-02 15:52
uspoof.h
65.9
KB
-rw-r--r--
2026-06-02 15:52
usprep.h
8.14
KB
-rw-r--r--
2026-06-02 15:52
ustdio.h
38.54
KB
-rw-r--r--
2026-06-02 15:52
ustream.h
1.89
KB
-rw-r--r--
2026-06-02 15:52
ustring.h
72.47
KB
-rw-r--r--
2026-06-02 15:52
ustringtrie.h
3.15
KB
-rw-r--r--
2026-06-02 15:52
utext.h
58.13
KB
-rw-r--r--
2026-06-02 15:52
utf.h
7.86
KB
-rw-r--r--
2026-06-02 15:52
utf16.h
23.32
KB
-rw-r--r--
2026-06-02 15:52
utf32.h
763
B
-rw-r--r--
2026-06-02 15:52
utf8.h
30.96
KB
-rw-r--r--
2026-06-02 15:52
utf_old.h
45.83
KB
-rw-r--r--
2026-06-02 15:52
utmscale.h
13.78
KB
-rw-r--r--
2026-06-02 15:52
utrace.h
15.73
KB
-rw-r--r--
2026-06-02 15:52
utrans.h
25.52
KB
-rw-r--r--
2026-06-02 15:52
utypes.h
30.74
KB
-rw-r--r--
2026-06-02 15:52
uvernum.h
6.67
KB
-rw-r--r--
2026-06-02 15:52
uversion.h
6
KB
-rw-r--r--
2026-06-02 15:52
vtzone.h
20.3
KB
-rw-r--r--
2026-06-02 15:52
Save
Rename
// © 2016 and later: Unicode, Inc. and others. // License & terms of use: http://www.unicode.org/copyright.html /* ******************************************************************************* * Copyright (C) 2010-2012,2014, International Business Machines * Corporation and others. All Rights Reserved. ******************************************************************************* * file name: stringtriebuilder.h * encoding: UTF-8 * tab size: 8 (not used) * indentation:4 * * created on: 2010dec24 * created by: Markus W. Scherer */ #ifndef __STRINGTRIEBUILDER_H__ #define __STRINGTRIEBUILDER_H__ #include "unicode/utypes.h" #if U_SHOW_CPLUSPLUS_API #include "unicode/uobject.h" /** * \file * \brief C++ API: Builder API for trie builders */ // Forward declaration. /// \cond struct UHashtable; typedef struct UHashtable UHashtable; /// \endcond /** * Build options for BytesTrieBuilder and CharsTrieBuilder. * @stable ICU 4.8 */ enum UStringTrieBuildOption { /** * Builds a trie quickly. * @stable ICU 4.8 */ USTRINGTRIE_BUILD_FAST, /** * Builds a trie more slowly, attempting to generate * a shorter but equivalent serialization. * This build option also uses more memory. * * This option can be effective when many integer values are the same * and string/byte sequence suffixes can be shared. * Runtime speed is not expected to improve. * @stable ICU 4.8 */ USTRINGTRIE_BUILD_SMALL }; U_NAMESPACE_BEGIN /** * Base class for string trie builder classes. * * This class is not intended for public subclassing. * @stable ICU 4.8 */ class U_COMMON_API StringTrieBuilder : public UObject { public: #ifndef U_HIDE_INTERNAL_API /** @internal */ static int32_t hashNode(const void *node); /** @internal */ static UBool equalNodes(const void *left, const void *right); #endif /* U_HIDE_INTERNAL_API */ protected: // Do not enclose the protected default constructor with #ifndef U_HIDE_INTERNAL_API // or else the compiler will create a public default constructor. /** @internal */ StringTrieBuilder(); /** @internal */ virtual ~StringTrieBuilder(); #ifndef U_HIDE_INTERNAL_API /** @internal */ void createCompactBuilder(int32_t sizeGuess, UErrorCode &errorCode); /** @internal */ void deleteCompactBuilder(); /** @internal */ void build(UStringTrieBuildOption buildOption, int32_t elementsLength, UErrorCode &errorCode); /** @internal */ int32_t writeNode(int32_t start, int32_t limit, int32_t unitIndex); /** @internal */ int32_t writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length); #endif /* U_HIDE_INTERNAL_API */ class Node; #ifndef U_HIDE_INTERNAL_API /** @internal */ Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode); /** @internal */ Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length, UErrorCode &errorCode); #endif /* U_HIDE_INTERNAL_API */ /** @internal */ virtual int32_t getElementStringLength(int32_t i) const = 0; /** @internal */ virtual char16_t getElementUnit(int32_t i, int32_t unitIndex) const = 0; /** @internal */ virtual int32_t getElementValue(int32_t i) const = 0; // Finds the first unit index after this one where // the first and last element have different units again. /** @internal */ virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const = 0; // Number of different units at unitIndex. /** @internal */ virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const = 0; /** @internal */ virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const = 0; /** @internal */ virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, char16_t unit) const = 0; /** @internal */ virtual UBool matchNodesCanHaveValues() const = 0; /** @internal */ virtual int32_t getMaxBranchLinearSubNodeLength() const = 0; /** @internal */ virtual int32_t getMinLinearMatch() const = 0; /** @internal */ virtual int32_t getMaxLinearMatchLength() const = 0; #ifndef U_HIDE_INTERNAL_API // max(BytesTrie::kMaxBranchLinearSubNodeLength, UCharsTrie::kMaxBranchLinearSubNodeLength). /** @internal */ static const int32_t kMaxBranchLinearSubNodeLength=5; // Maximum number of nested split-branch levels for a branch on all 2^16 possible char16_t units. // log2(2^16/kMaxBranchLinearSubNodeLength) rounded up. /** @internal */ static const int32_t kMaxSplitBranchLevels=14; /** * Makes sure that there is only one unique node registered that is * equivalent to newNode. * @param newNode Input node. The builder takes ownership. * @param errorCode ICU in/out UErrorCode. Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==NULL. * @return newNode if it is the first of its kind, or * an equivalent node if newNode is a duplicate. * @internal */ Node *registerNode(Node *newNode, UErrorCode &errorCode); /** * Makes sure that there is only one unique FinalValueNode registered * with this value. * Avoids creating a node if the value is a duplicate. * @param value A final value. * @param errorCode ICU in/out UErrorCode. Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==NULL. * @return A FinalValueNode with the given value. * @internal */ Node *registerFinalValue(int32_t value, UErrorCode &errorCode); #endif /* U_HIDE_INTERNAL_API */ /* * C++ note: * registerNode() and registerFinalValue() take ownership of their input nodes, * and only return owned nodes. * If they see a failure UErrorCode, they will delete the input node. * If they get a NULL pointer, they will record a U_MEMORY_ALLOCATION_ERROR. * If there is a failure, they return NULL. * * NULL Node pointers can be safely passed into other Nodes because * they call the static Node::hashCode() which checks for a NULL pointer first. * * Therefore, as long as builder functions register a new node, * they need to check for failures only before explicitly dereferencing * a Node pointer, or before setting a new UErrorCode. */ // Hash set of nodes, maps from nodes to integer 1. /** @internal */ UHashtable *nodes; // Do not conditionalize the following with #ifndef U_HIDE_INTERNAL_API, // it is needed for layout of other objects. /** * @internal * \cond */ class Node : public UObject { public: Node(int32_t initialHash) : hash(initialHash), offset(0) {} inline int32_t hashCode() const { return hash; } // Handles node==NULL. static inline int32_t hashCode(const Node *node) { return node==NULL ? 0 : node->hashCode(); } // Base class operator==() compares the actual class types. virtual UBool operator==(const Node &other) const; inline UBool operator!=(const Node &other) const { return !operator==(other); } /** * Traverses the Node graph and numbers branch edges, with rightmost edges first. * This is to avoid writing a duplicate node twice. * * Branch nodes in this trie data structure are not symmetric. * Most branch edges "jump" to other nodes but the rightmost branch edges * just continue without a jump. * Therefore, write() must write the rightmost branch edge last * (trie units are written backwards), and must write it at that point even if * it is a duplicate of a node previously written elsewhere. * * This function visits and marks right branch edges first. * Edges are numbered with increasingly negative values because we share the * offset field which gets positive values when nodes are written. * A branch edge also remembers the first number for any of its edges. * * When a further-left branch edge has a number in the range of the rightmost * edge's numbers, then it will be written as part of the required right edge * and we can avoid writing it first. * * After root.markRightEdgesFirst(-1) the offsets of all nodes are negative * edge numbers. * * @param edgeNumber The first edge number for this node and its sub-nodes. * @return An edge number that is at least the maximum-negative * of the input edge number and the numbers of this node and all of its sub-nodes. */ virtual int32_t markRightEdgesFirst(int32_t edgeNumber); // write() must set the offset to a positive value. virtual void write(StringTrieBuilder &builder) = 0; // See markRightEdgesFirst. inline void writeUnlessInsideRightEdge(int32_t firstRight, int32_t lastRight, StringTrieBuilder &builder) { // Note: Edge numbers are negative, lastRight<=firstRight. // If offset>0 then this node and its sub-nodes have been written already // and we need not write them again. // If this node is part of the unwritten right branch edge, // then we wait until that is written. if(offset<0 && (offset<lastRight || firstRight<offset)) { write(builder); } } inline int32_t getOffset() const { return offset; } protected: int32_t hash; int32_t offset; }; #ifndef U_HIDE_INTERNAL_API // This class should not be overridden because // registerFinalValue() compares a stack-allocated FinalValueNode // (stack-allocated so that we don't unnecessarily create lots of duplicate nodes) // with the input node, and the // !Node::operator==(other) used inside FinalValueNode::operator==(other) // will be false if the typeid's are different. /** @internal */ class FinalValueNode : public Node { public: FinalValueNode(int32_t v) : Node(0x111111u*37u+v), value(v) {} virtual UBool operator==(const Node &other) const; virtual void write(StringTrieBuilder &builder); protected: int32_t value; }; #endif /* U_HIDE_INTERNAL_API */ // Do not conditionalize the following with #ifndef U_HIDE_INTERNAL_API, // it is needed for layout of other objects. /** * @internal */ class ValueNode : public Node { public: ValueNode(int32_t initialHash) : Node(initialHash), hasValue(FALSE), value(0) {} virtual UBool operator==(const Node &other) const; void setValue(int32_t v) { hasValue=TRUE; value=v; hash=hash*37u+v; } protected: UBool hasValue; int32_t value; }; #ifndef U_HIDE_INTERNAL_API /** * @internal */ class IntermediateValueNode : public ValueNode { public: IntermediateValueNode(int32_t v, Node *nextNode) : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); } virtual UBool operator==(const Node &other) const; virtual int32_t markRightEdgesFirst(int32_t edgeNumber); virtual void write(StringTrieBuilder &builder); protected: Node *next; }; #endif /* U_HIDE_INTERNAL_API */ // Do not conditionalize the following with #ifndef U_HIDE_INTERNAL_API, // it is needed for layout of other objects. /** * @internal */ class LinearMatchNode : public ValueNode { public: LinearMatchNode(int32_t len, Node *nextNode) : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)), length(len), next(nextNode) {} virtual UBool operator==(const Node &other) const; virtual int32_t markRightEdgesFirst(int32_t edgeNumber); protected: int32_t length; Node *next; }; #ifndef U_HIDE_INTERNAL_API /** * @internal */ class BranchNode : public Node { public: BranchNode(int32_t initialHash) : Node(initialHash) {} protected: int32_t firstEdgeNumber; }; /** * @internal */ class ListBranchNode : public BranchNode { public: ListBranchNode() : BranchNode(0x444444), length(0) {} virtual UBool operator==(const Node &other) const; virtual int32_t markRightEdgesFirst(int32_t edgeNumber); virtual void write(StringTrieBuilder &builder); // Adds a unit with a final value. void add(int32_t c, int32_t value) { units[length]=(char16_t)c; equal[length]=NULL; values[length]=value; ++length; hash=(hash*37u+c)*37u+value; } // Adds a unit which leads to another match node. void add(int32_t c, Node *node) { units[length]=(char16_t)c; equal[length]=node; values[length]=0; ++length; hash=(hash*37u+c)*37u+hashCode(node); } protected: Node *equal[kMaxBranchLinearSubNodeLength]; // NULL means "has final value". int32_t length; int32_t values[kMaxBranchLinearSubNodeLength]; char16_t units[kMaxBranchLinearSubNodeLength]; }; /** * @internal */ class SplitBranchNode : public BranchNode { public: SplitBranchNode(char16_t middleUnit, Node *lessThanNode, Node *greaterOrEqualNode) : BranchNode(((0x555555u*37u+middleUnit)*37u+ hashCode(lessThanNode))*37u+hashCode(greaterOrEqualNode)), unit(middleUnit), lessThan(lessThanNode), greaterOrEqual(greaterOrEqualNode) {} virtual UBool operator==(const Node &other) const; virtual int32_t markRightEdgesFirst(int32_t edgeNumber); virtual void write(StringTrieBuilder &builder); protected: char16_t unit; Node *lessThan; Node *greaterOrEqual; }; // Branch head node, for writing the actual node lead unit. /** @internal */ class BranchHeadNode : public ValueNode { public: BranchHeadNode(int32_t len, Node *subNode) : ValueNode((0x666666u*37u+len)*37u+hashCode(subNode)), length(len), next(subNode) {} virtual UBool operator==(const Node &other) const; virtual int32_t markRightEdgesFirst(int32_t edgeNumber); virtual void write(StringTrieBuilder &builder); protected: int32_t length; Node *next; // A branch sub-node. }; #endif /* U_HIDE_INTERNAL_API */ /// \endcond /** @internal */ virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length, Node *nextNode) const = 0; /** @internal */ virtual int32_t write(int32_t unit) = 0; /** @internal */ virtual int32_t writeElementUnits(int32_t i, int32_t unitIndex, int32_t length) = 0; /** @internal */ virtual int32_t writeValueAndFinal(int32_t i, UBool isFinal) = 0; /** @internal */ virtual int32_t writeValueAndType(UBool hasValue, int32_t value, int32_t node) = 0; /** @internal */ virtual int32_t writeDeltaTo(int32_t jumpTarget) = 0; }; U_NAMESPACE_END #endif /* U_SHOW_CPLUSPLUS_API */ #endif // __STRINGTRIEBUILDER_H__