Linux vps-61133.fhnet.fr 4.9.0-19-amd64 #1 SMP Debian 4.9.320-2 (2022-06-30) x86_64
Apache/2.4.25 (Debian)
Server IP : 93.113.207.21 & Your IP : 216.73.216.35
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
usr /
include /
unicode /
Delete
Unzip
Name
Size
Permission
Date
Action
alphaindex.h
26.13
KB
-rw-r--r--
2021-10-12 12:29
appendable.h
8.25
KB
-rw-r--r--
2021-10-12 12:29
basictz.h
8.73
KB
-rw-r--r--
2021-10-12 12:29
brkiter.h
27.31
KB
-rw-r--r--
2021-10-12 12:29
bytestream.h
9.16
KB
-rw-r--r--
2021-10-12 12:29
bytestrie.h
19.19
KB
-rw-r--r--
2021-10-12 12:29
bytestriebuilder.h
7.06
KB
-rw-r--r--
2021-10-12 12:29
calendar.h
105.26
KB
-rw-r--r--
2021-10-12 12:29
caniter.h
7.24
KB
-rw-r--r--
2021-10-12 12:29
chariter.h
23.71
KB
-rw-r--r--
2021-10-12 12:29
choicfmt.h
23.74
KB
-rw-r--r--
2021-10-12 12:29
coleitr.h
13.57
KB
-rw-r--r--
2021-10-12 12:29
coll.h
55.46
KB
-rw-r--r--
2021-10-12 12:29
compactdecimalformat.h
16.56
KB
-rw-r--r--
2021-10-12 12:29
curramt.h
3.57
KB
-rw-r--r--
2021-10-12 12:29
currpinf.h
6.97
KB
-rw-r--r--
2021-10-12 12:29
currunit.h
2.81
KB
-rw-r--r--
2021-10-12 12:29
datefmt.h
40.07
KB
-rw-r--r--
2021-10-12 12:29
dbbi.h
1020
B
-rw-r--r--
2021-10-12 12:29
dcfmtsym.h
16.46
KB
-rw-r--r--
2021-10-12 12:29
decimfmt.h
90.45
KB
-rw-r--r--
2021-10-12 12:29
docmain.h
6.28
KB
-rw-r--r--
2021-10-12 12:29
dtfmtsym.h
37.05
KB
-rw-r--r--
2021-10-12 12:29
dtintrv.h
3.65
KB
-rw-r--r--
2021-10-12 12:29
dtitvfmt.h
42.76
KB
-rw-r--r--
2021-10-12 12:29
dtitvinf.h
18.34
KB
-rw-r--r--
2021-10-12 12:29
dtptngen.h
23.18
KB
-rw-r--r--
2021-10-12 12:29
dtrule.h
8.51
KB
-rw-r--r--
2021-10-12 12:29
enumset.h
1.94
KB
-rw-r--r--
2021-10-12 12:29
errorcode.h
4.67
KB
-rw-r--r--
2021-10-12 12:29
fieldpos.h
8.51
KB
-rw-r--r--
2021-10-12 12:29
filteredbrk.h
4.22
KB
-rw-r--r--
2021-10-12 12:29
fmtable.h
24.29
KB
-rw-r--r--
2021-10-12 12:29
format.h
12.33
KB
-rw-r--r--
2021-10-12 12:29
fpositer.h
2.87
KB
-rw-r--r--
2021-10-12 12:29
gender.h
3.07
KB
-rw-r--r--
2021-10-12 12:29
gregocal.h
31.46
KB
-rw-r--r--
2021-10-12 12:29
icudataver.h
938
B
-rw-r--r--
2021-10-12 12:29
icuplug.h
11.58
KB
-rw-r--r--
2021-10-12 12:29
idna.h
12.55
KB
-rw-r--r--
2021-10-12 12:29
listformatter.h
4.73
KB
-rw-r--r--
2021-10-12 12:29
localpointer.h
18.17
KB
-rw-r--r--
2021-10-12 12:29
locdspnm.h
6.92
KB
-rw-r--r--
2021-10-12 12:29
locid.h
31.3
KB
-rw-r--r--
2021-10-12 12:29
measfmt.h
10.43
KB
-rw-r--r--
2021-10-12 12:29
measunit.h
37.64
KB
-rw-r--r--
2021-10-12 12:29
measure.h
4.15
KB
-rw-r--r--
2021-10-12 12:29
messagepattern.h
33.53
KB
-rw-r--r--
2021-10-12 12:29
msgfmt.h
43.05
KB
-rw-r--r--
2021-10-12 12:29
normalizer2.h
28.17
KB
-rw-r--r--
2021-10-12 12:29
normlzr.h
30.65
KB
-rw-r--r--
2021-10-12 12:29
numfmt.h
45.85
KB
-rw-r--r--
2021-10-12 12:29
numsys.h
6.62
KB
-rw-r--r--
2021-10-12 12:29
parseerr.h
2.97
KB
-rw-r--r--
2021-10-12 12:29
parsepos.h
5.34
KB
-rw-r--r--
2021-10-12 12:29
platform.h
26.96
KB
-rw-r--r--
2021-10-12 12:29
plurfmt.h
25.55
KB
-rw-r--r--
2021-10-12 12:29
plurrule.h
17.16
KB
-rw-r--r--
2021-10-12 12:29
ptypes.h
3.36
KB
-rw-r--r--
2021-10-12 12:29
putil.h
6.23
KB
-rw-r--r--
2021-10-12 12:29
rbbi.h
29.2
KB
-rw-r--r--
2021-10-12 12:29
rbnf.h
46.66
KB
-rw-r--r--
2021-10-12 12:29
rbtz.h
15.36
KB
-rw-r--r--
2021-10-12 12:29
regex.h
84.75
KB
-rw-r--r--
2021-10-12 12:29
region.h
9
KB
-rw-r--r--
2021-10-12 12:29
reldatefmt.h
13.73
KB
-rw-r--r--
2021-10-12 12:29
rep.h
9.38
KB
-rw-r--r--
2021-10-12 12:29
resbund.h
17.89
KB
-rw-r--r--
2021-10-12 12:29
schriter.h
6.15
KB
-rw-r--r--
2021-10-12 12:29
scientificnumberformatter.h
6.48
KB
-rw-r--r--
2021-10-12 12:29
search.h
22.1
KB
-rw-r--r--
2021-10-12 12:29
selfmt.h
14.13
KB
-rw-r--r--
2021-10-12 12:29
simpleformatter.h
11.14
KB
-rw-r--r--
2021-10-12 12:29
simpletz.h
45.13
KB
-rw-r--r--
2021-10-12 12:29
smpdtfmt.h
69.24
KB
-rw-r--r--
2021-10-12 12:29
sortkey.h
11.01
KB
-rw-r--r--
2021-10-12 12:29
std_string.h
905
B
-rw-r--r--
2021-10-12 12:29
strenum.h
9.92
KB
-rw-r--r--
2021-10-12 12:29
stringpiece.h
6.38
KB
-rw-r--r--
2021-10-12 12:29
stringtriebuilder.h
14.56
KB
-rw-r--r--
2021-10-12 12:29
stsearch.h
21.18
KB
-rw-r--r--
2021-10-12 12:29
symtable.h
4.1
KB
-rw-r--r--
2021-10-12 12:29
tblcoll.h
36.24
KB
-rw-r--r--
2021-10-12 12:29
timezone.h
40.71
KB
-rw-r--r--
2021-10-12 12:29
tmunit.h
2.94
KB
-rw-r--r--
2021-10-12 12:29
tmutamt.h
4.69
KB
-rw-r--r--
2021-10-12 12:29
tmutfmt.h
7.61
KB
-rw-r--r--
2021-10-12 12:29
translit.h
54.41
KB
-rw-r--r--
2021-10-12 12:29
tzfmt.h
42.69
KB
-rw-r--r--
2021-10-12 12:29
tznames.h
16.25
KB
-rw-r--r--
2021-10-12 12:29
tzrule.h
35.21
KB
-rw-r--r--
2021-10-12 12:29
tztrans.h
5.96
KB
-rw-r--r--
2021-10-12 12:29
ubidi.h
88.57
KB
-rw-r--r--
2021-10-12 12:29
ubrk.h
20.05
KB
-rw-r--r--
2021-10-12 12:29
ucal.h
54.18
KB
-rw-r--r--
2021-10-12 12:29
ucasemap.h
16.45
KB
-rw-r--r--
2021-10-12 12:29
ucat.h
5.25
KB
-rw-r--r--
2021-10-12 12:29
uchar.h
122.74
KB
-rw-r--r--
2021-10-12 12:29
ucharstrie.h
20.8
KB
-rw-r--r--
2021-10-12 12:29
ucharstriebuilder.h
7.01
KB
-rw-r--r--
2021-10-12 12:29
uchriter.h
12.82
KB
-rw-r--r--
2021-10-12 12:29
uclean.h
11.03
KB
-rw-r--r--
2021-10-12 12:29
ucnv.h
82.81
KB
-rw-r--r--
2021-10-12 12:29
ucnv_cb.h
6.48
KB
-rw-r--r--
2021-10-12 12:29
ucnv_err.h
20.87
KB
-rw-r--r--
2021-10-12 12:29
ucnvsel.h
6.03
KB
-rw-r--r--
2021-10-12 12:29
ucol.h
60.51
KB
-rw-r--r--
2021-10-12 12:29
ucoleitr.h
9.34
KB
-rw-r--r--
2021-10-12 12:29
uconfig.h
11.76
KB
-rw-r--r--
2021-10-12 12:29
ucsdet.h
14.35
KB
-rw-r--r--
2021-10-12 12:29
ucurr.h
14.92
KB
-rw-r--r--
2021-10-12 12:29
udat.h
59.91
KB
-rw-r--r--
2021-10-12 12:29
udata.h
15.28
KB
-rw-r--r--
2021-10-12 12:29
udateintervalformat.h
6.68
KB
-rw-r--r--
2021-10-12 12:29
udatpg.h
23.5
KB
-rw-r--r--
2021-10-12 12:29
udisplaycontext.h
4.87
KB
-rw-r--r--
2021-10-12 12:29
uenum.h
7.76
KB
-rw-r--r--
2021-10-12 12:29
ufieldpositer.h
4.24
KB
-rw-r--r--
2021-10-12 12:29
uformattable.h
10.65
KB
-rw-r--r--
2021-10-12 12:29
ugender.h
1.89
KB
-rw-r--r--
2021-10-12 12:29
uidna.h
33.26
KB
-rw-r--r--
2021-10-12 12:29
uiter.h
22.67
KB
-rw-r--r--
2021-10-12 12:29
uldnames.h
10.34
KB
-rw-r--r--
2021-10-12 12:29
ulistformatter.h
4.43
KB
-rw-r--r--
2021-10-12 12:29
uloc.h
49.78
KB
-rw-r--r--
2021-10-12 12:29
ulocdata.h
10.57
KB
-rw-r--r--
2021-10-12 12:29
umachine.h
10.94
KB
-rw-r--r--
2021-10-12 12:29
umisc.h
1.23
KB
-rw-r--r--
2021-10-12 12:29
umsg.h
24.12
KB
-rw-r--r--
2021-10-12 12:29
unifilt.h
3.52
KB
-rw-r--r--
2021-10-12 12:29
unifunct.h
3.87
KB
-rw-r--r--
2021-10-12 12:29
unimatch.h
5.93
KB
-rw-r--r--
2021-10-12 12:29
unirepl.h
3.21
KB
-rw-r--r--
2021-10-12 12:29
uniset.h
63.86
KB
-rw-r--r--
2021-10-12 12:29
unistr.h
170.03
KB
-rw-r--r--
2021-10-12 12:29
unorm.h
20.18
KB
-rw-r--r--
2021-10-12 12:29
unorm2.h
25.11
KB
-rw-r--r--
2021-10-12 12:29
unum.h
49.13
KB
-rw-r--r--
2021-10-12 12:29
unumsys.h
7.03
KB
-rw-r--r--
2021-10-12 12:29
uobject.h
10.61
KB
-rw-r--r--
2021-10-12 12:29
upluralrules.h
4.47
KB
-rw-r--r--
2021-10-12 12:29
uregex.h
71.95
KB
-rw-r--r--
2021-10-12 12:29
uregion.h
9.58
KB
-rw-r--r--
2021-10-12 12:29
ureldatefmt.h
11.85
KB
-rw-r--r--
2021-10-12 12:29
urename.h
123.32
KB
-rw-r--r--
2021-10-12 12:29
urep.h
5.27
KB
-rw-r--r--
2021-10-12 12:29
ures.h
36.25
KB
-rw-r--r--
2021-10-12 12:29
uscript.h
25.24
KB
-rw-r--r--
2021-10-12 12:29
usearch.h
37.71
KB
-rw-r--r--
2021-10-12 12:29
uset.h
39.67
KB
-rw-r--r--
2021-10-12 12:29
usetiter.h
9.38
KB
-rw-r--r--
2021-10-12 12:29
ushape.h
17.89
KB
-rw-r--r--
2021-10-12 12:29
uspoof.h
45.43
KB
-rw-r--r--
2021-10-12 12:29
usprep.h
8.02
KB
-rw-r--r--
2021-10-12 12:29
ustdio.h
38.43
KB
-rw-r--r--
2021-10-12 12:29
ustream.h
1.8
KB
-rw-r--r--
2021-10-12 12:29
ustring.h
72.69
KB
-rw-r--r--
2021-10-12 12:29
ustringtrie.h
3.04
KB
-rw-r--r--
2021-10-12 12:29
utext.h
57.97
KB
-rw-r--r--
2021-10-12 12:29
utf.h
7.64
KB
-rw-r--r--
2021-10-12 12:29
utf16.h
18.63
KB
-rw-r--r--
2021-10-12 12:29
utf32.h
653
B
-rw-r--r--
2021-10-12 12:29
utf8.h
27.62
KB
-rw-r--r--
2021-10-12 12:29
utf_old.h
42.5
KB
-rw-r--r--
2021-10-12 12:29
utmscale.h
13.37
KB
-rw-r--r--
2021-10-12 12:29
utrace.h
13.09
KB
-rw-r--r--
2021-10-12 12:29
utrans.h
25.42
KB
-rw-r--r--
2021-10-12 12:29
utypes.h
31.05
KB
-rw-r--r--
2021-10-12 12:29
uvernum.h
5.62
KB
-rw-r--r--
2021-10-12 12:29
uversion.h
6.29
KB
-rw-r--r--
2021-10-12 12:29
vtzone.h
20.06
KB
-rw-r--r--
2021-10-12 12:29
Save
Rename
/* ******************************************************************************* * Copyright (C) 2010-2012,2014, International Business Machines * Corporation and others. All Rights Reserved. ******************************************************************************* * file name: stringtriebuilder.h * encoding: US-ASCII * 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 UChar 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, UChar 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 UChar 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; #ifndef U_HIDE_INTERNAL_API /** @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; }; // 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(0x111111*37+v), value(v) {} virtual UBool operator==(const Node &other) const; virtual void write(StringTrieBuilder &builder); protected: int32_t value; }; /** * @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*37+v; } protected: UBool hasValue; int32_t value; }; /** * @internal */ class IntermediateValueNode : public ValueNode { public: IntermediateValueNode(int32_t v, Node *nextNode) : ValueNode(0x222222*37+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; }; /** * @internal */ class LinearMatchNode : public ValueNode { public: LinearMatchNode(int32_t len, Node *nextNode) : ValueNode((0x333333*37+len)*37+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; }; /** * @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]=(UChar)c; equal[length]=NULL; values[length]=value; ++length; hash=(hash*37+c)*37+value; } // Adds a unit which leads to another match node. void add(int32_t c, Node *node) { units[length]=(UChar)c; equal[length]=node; values[length]=0; ++length; hash=(hash*37+c)*37+hashCode(node); } protected: Node *equal[kMaxBranchLinearSubNodeLength]; // NULL means "has final value". int32_t length; int32_t values[kMaxBranchLinearSubNodeLength]; UChar units[kMaxBranchLinearSubNodeLength]; }; /** * @internal */ class SplitBranchNode : public BranchNode { public: SplitBranchNode(UChar middleUnit, Node *lessThanNode, Node *greaterOrEqualNode) : BranchNode(((0x555555*37+middleUnit)*37+ hashCode(lessThanNode))*37+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: UChar 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((0x666666*37+len)*37+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__