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