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 // edits.h // created: 2016dec30 Markus W. Scherer #ifndef __EDITS_H__ #define __EDITS_H__ #include "unicode/utypes.h" #include "unicode/uobject.h" /** * \file * \brief C++ API: C++ class Edits for low-level string transformations on styled text. */ U_NAMESPACE_BEGIN #ifndef U_HIDE_DRAFT_API /** * Records lengths of string edits but not replacement text. * Supports replacements, insertions, deletions in linear progression. * Does not support moving/reordering of text. * * An Edits object tracks a separate UErrorCode, but ICU string transformation functions * (e.g., case mapping functions) merge any such errors into their API's UErrorCode. * * @draft ICU 59 */ class U_COMMON_API Edits U_FINAL : public UMemory { public: /** * Constructs an empty object. * @draft ICU 59 */ Edits() : array(stackArray), capacity(STACK_CAPACITY), length(0), delta(0), numChanges(0), errorCode_(U_ZERO_ERROR) {} /** * Copy constructor. * @param other source edits * @draft ICU 60 */ Edits(const Edits &other) : array(stackArray), capacity(STACK_CAPACITY), length(other.length), delta(other.delta), numChanges(other.numChanges), errorCode_(other.errorCode_) { copyArray(other); } /** * Move constructor, might leave src empty. * This object will have the same contents that the source object had. * @param src source edits * @draft ICU 60 */ Edits(Edits &&src) U_NOEXCEPT : array(stackArray), capacity(STACK_CAPACITY), length(src.length), delta(src.delta), numChanges(src.numChanges), errorCode_(src.errorCode_) { moveArray(src); } /** * Destructor. * @draft ICU 59 */ ~Edits(); /** * Assignment operator. * @param other source edits * @return *this * @draft ICU 60 */ Edits &operator=(const Edits &other); /** * Move assignment operator, might leave src empty. * This object will have the same contents that the source object had. * The behavior is undefined if *this and src are the same object. * @param src source edits * @return *this * @draft ICU 60 */ Edits &operator=(Edits &&src) U_NOEXCEPT; /** * Resets the data but may not release memory. * @draft ICU 59 */ void reset() U_NOEXCEPT; /** * Adds a record for an unchanged segment of text. * Normally called from inside ICU string transformation functions, not user code. * @draft ICU 59 */ void addUnchanged(int32_t unchangedLength); /** * Adds a record for a text replacement/insertion/deletion. * Normally called from inside ICU string transformation functions, not user code. * @draft ICU 59 */ void addReplace(int32_t oldLength, int32_t newLength); /** * Sets the UErrorCode if an error occurred while recording edits. * Preserves older error codes in the outErrorCode. * Normally called from inside ICU string transformation functions, not user code. * @param outErrorCode Set to an error code if it does not contain one already * and an error occurred while recording edits. * Otherwise unchanged. * @return TRUE if U_FAILURE(outErrorCode) * @draft ICU 59 */ UBool copyErrorTo(UErrorCode &outErrorCode); /** * How much longer is the new text compared with the old text? * @return new length minus old length * @draft ICU 59 */ int32_t lengthDelta() const { return delta; } /** * @return TRUE if there are any change edits * @draft ICU 59 */ UBool hasChanges() const { return numChanges != 0; } /** * @return the number of change edits * @draft ICU 60 */ int32_t numberOfChanges() const { return numChanges; } /** * Access to the list of edits. * @see getCoarseIterator * @see getFineIterator * @draft ICU 59 */ struct U_COMMON_API Iterator U_FINAL : public UMemory { /** * Default constructor, empty iterator. * @draft ICU 60 */ Iterator() : array(nullptr), index(0), length(0), remaining(0), onlyChanges_(FALSE), coarse(FALSE), dir(0), changed(FALSE), oldLength_(0), newLength_(0), srcIndex(0), replIndex(0), destIndex(0) {} /** * Copy constructor. * @draft ICU 59 */ Iterator(const Iterator &other) = default; /** * Assignment operator. * @draft ICU 59 */ Iterator &operator=(const Iterator &other) = default; /** * Advances to the next edit. * @param errorCode ICU error code. Its input value must pass the U_SUCCESS() test, * or else the function returns immediately. Check for U_FAILURE() * on output or use with function chaining. (See User Guide for details.) * @return TRUE if there is another edit * @draft ICU 59 */ UBool next(UErrorCode &errorCode) { return next(onlyChanges_, errorCode); } /** * Finds the edit that contains the source index. * The source index may be found in a non-change * even if normal iteration would skip non-changes. * Normal iteration can continue from a found edit. * * The iterator state before this search logically does not matter. * (It may affect the performance of the search.) * * The iterator state after this search is undefined * if the source index is out of bounds for the source string. * * @param i source index * @param errorCode ICU error code. Its input value must pass the U_SUCCESS() test, * or else the function returns immediately. Check for U_FAILURE() * on output or use with function chaining. (See User Guide for details.) * @return TRUE if the edit for the source index was found * @draft ICU 59 */ UBool findSourceIndex(int32_t i, UErrorCode &errorCode) { return findIndex(i, TRUE, errorCode) == 0; } /** * Finds the edit that contains the destination index. * The destination index may be found in a non-change * even if normal iteration would skip non-changes. * Normal iteration can continue from a found edit. * * The iterator state before this search logically does not matter. * (It may affect the performance of the search.) * * The iterator state after this search is undefined * if the source index is out of bounds for the source string. * * @param i destination index * @param errorCode ICU error code. Its input value must pass the U_SUCCESS() test, * or else the function returns immediately. Check for U_FAILURE() * on output or use with function chaining. (See User Guide for details.) * @return TRUE if the edit for the destination index was found * @draft ICU 60 */ UBool findDestinationIndex(int32_t i, UErrorCode &errorCode) { return findIndex(i, FALSE, errorCode) == 0; } /** * Returns the destination index corresponding to the given source index. * If the source index is inside a change edit (not at its start), * then the destination index at the end of that edit is returned, * since there is no information about index mapping inside a change edit. * * (This means that indexes to the start and middle of an edit, * for example around a grapheme cluster, are mapped to indexes * encompassing the entire edit. * The alternative, mapping an interior index to the start, * would map such an interval to an empty one.) * * This operation will usually but not always modify this object. * The iterator state after this search is undefined. * * @param i source index * @param errorCode ICU error code. Its input value must pass the U_SUCCESS() test, * or else the function returns immediately. Check for U_FAILURE() * on output or use with function chaining. (See User Guide for details.) * @return destination index; undefined if i is not 0..string length * @draft ICU 60 */ int32_t destinationIndexFromSourceIndex(int32_t i, UErrorCode &errorCode); /** * Returns the source index corresponding to the given destination index. * If the destination index is inside a change edit (not at its start), * then the source index at the end of that edit is returned, * since there is no information about index mapping inside a change edit. * * (This means that indexes to the start and middle of an edit, * for example around a grapheme cluster, are mapped to indexes * encompassing the entire edit. * The alternative, mapping an interior index to the start, * would map such an interval to an empty one.) * * This operation will usually but not always modify this object. * The iterator state after this search is undefined. * * @param i destination index * @param errorCode ICU error code. Its input value must pass the U_SUCCESS() test, * or else the function returns immediately. Check for U_FAILURE() * on output or use with function chaining. (See User Guide for details.) * @return source index; undefined if i is not 0..string length * @draft ICU 60 */ int32_t sourceIndexFromDestinationIndex(int32_t i, UErrorCode &errorCode); /** * @return TRUE if this edit replaces oldLength() units with newLength() different ones. * FALSE if oldLength units remain unchanged. * @draft ICU 59 */ UBool hasChange() const { return changed; } /** * @return the number of units in the original string which are replaced or remain unchanged. * @draft ICU 59 */ int32_t oldLength() const { return oldLength_; } /** * @return the number of units in the modified string, if hasChange() is TRUE. * Same as oldLength if hasChange() is FALSE. * @draft ICU 59 */ int32_t newLength() const { return newLength_; } /** * @return the current index into the source string * @draft ICU 59 */ int32_t sourceIndex() const { return srcIndex; } /** * @return the current index into the replacement-characters-only string, * not counting unchanged spans * @draft ICU 59 */ int32_t replacementIndex() const { return replIndex; } /** * @return the current index into the full destination string * @draft ICU 59 */ int32_t destinationIndex() const { return destIndex; } private: friend class Edits; Iterator(const uint16_t *a, int32_t len, UBool oc, UBool crs); int32_t readLength(int32_t head); void updateNextIndexes(); void updatePreviousIndexes(); UBool noNext(); UBool next(UBool onlyChanges, UErrorCode &errorCode); UBool previous(UErrorCode &errorCode); /** @return -1: error or i<0; 0: found; 1: i>=string length */ int32_t findIndex(int32_t i, UBool findSource, UErrorCode &errorCode); const uint16_t *array; int32_t index, length; // 0 if we are not within compressed equal-length changes. // Otherwise the number of remaining changes, including the current one. int32_t remaining; UBool onlyChanges_, coarse; int8_t dir; // iteration direction: back(<0), initial(0), forward(>0) UBool changed; int32_t oldLength_, newLength_; int32_t srcIndex, replIndex, destIndex; }; /** * Returns an Iterator for coarse-grained changes for simple string updates. * Skips non-changes. * @return an Iterator that merges adjacent changes. * @draft ICU 59 */ Iterator getCoarseChangesIterator() const { return Iterator(array, length, TRUE, TRUE); } /** * Returns an Iterator for coarse-grained changes and non-changes for simple string updates. * @return an Iterator that merges adjacent changes. * @draft ICU 59 */ Iterator getCoarseIterator() const { return Iterator(array, length, FALSE, TRUE); } /** * Returns an Iterator for fine-grained changes for modifying styled text. * Skips non-changes. * @return an Iterator that separates adjacent changes. * @draft ICU 59 */ Iterator getFineChangesIterator() const { return Iterator(array, length, TRUE, FALSE); } /** * Returns an Iterator for fine-grained changes and non-changes for modifying styled text. * @return an Iterator that separates adjacent changes. * @draft ICU 59 */ Iterator getFineIterator() const { return Iterator(array, length, FALSE, FALSE); } /** * Merges the two input Edits and appends the result to this object. * * Consider two string transformations (for example, normalization and case mapping) * where each records Edits in addition to writing an output string.<br> * Edits ab reflect how substrings of input string a * map to substrings of intermediate string b.<br> * Edits bc reflect how substrings of intermediate string b * map to substrings of output string c.<br> * This function merges ab and bc such that the additional edits * recorded in this object reflect how substrings of input string a * map to substrings of output string c. * * If unrelated Edits are passed in where the output string of the first * has a different length than the input string of the second, * then a U_ILLEGAL_ARGUMENT_ERROR is reported. * * @param ab reflects how substrings of input string a * map to substrings of intermediate string b. * @param bc reflects how substrings of intermediate string b * map to substrings of output string c. * @param errorCode ICU error code. Its input value must pass the U_SUCCESS() test, * or else the function returns immediately. Check for U_FAILURE() * on output or use with function chaining. (See User Guide for details.) * @return *this, with the merged edits appended * @draft ICU 60 */ Edits &mergeAndAppend(const Edits &ab, const Edits &bc, UErrorCode &errorCode); private: void releaseArray() U_NOEXCEPT; Edits ©Array(const Edits &other); Edits &moveArray(Edits &src) U_NOEXCEPT; void setLastUnit(int32_t last) { array[length - 1] = (uint16_t)last; } int32_t lastUnit() const { return length > 0 ? array[length - 1] : 0xffff; } void append(int32_t r); UBool growArray(); static const int32_t STACK_CAPACITY = 100; uint16_t *array; int32_t capacity; int32_t length; int32_t delta; int32_t numChanges; UErrorCode errorCode_; uint16_t stackArray[STACK_CAPACITY]; }; #endif // U_HIDE_DRAFT_API U_NAMESPACE_END #endif // __EDITS_H__