FM / unicode

/usr/include/unicode

Name	Size	Mode	Actions
alphaindex.h	27158	0644	edit dl rm
appendable.h	8739	0644	edit dl rm
basictz.h	10163	0644	edit dl rm
brkiter.h	28478	0644	edit dl rm
bytestream.h	11013	0644	edit dl rm
bytestrie.h	21268	0644	edit dl rm
bytestriebuilder.h	7640	0644	edit dl rm
calendar.h	108424	0644	edit dl rm
caniter.h	7621	0644	edit dl rm
casemap.h	25933	0644	edit dl rm
char16ptr.h	7393	0644	edit dl rm
chariter.h	24638	0644	edit dl rm
choicfmt.h	24544	0644	edit dl rm
coleitr.h	14102	0644	edit dl rm
coll.h	57615	0644	edit dl rm
compactdecimalformat.h	7047	0644	edit dl rm
curramt.h	3869	0644	edit dl rm
currpinf.h	7479	0644	edit dl rm
currunit.h	4112	0644	edit dl rm
datefmt.h	41690	0644	edit dl rm
dbbi.h	1223	0644	edit dl rm
dcfmtsym.h	21101	0644	edit dl rm
decimfmt.h	89676	0644	edit dl rm
docmain.h	7380	0644	edit dl rm
dtfmtsym.h	39126	0644	edit dl rm
dtintrv.h	3935	0644	edit dl rm
dtitvfmt.h	50448	0644	edit dl rm
dtitvinf.h	19072	0644	edit dl rm
dtptngen.h	26692	0644	edit dl rm
dtrule.h	8898	0644	edit dl rm
edits.h	21237	0644	edit dl rm
enumset.h	2130	0644	edit dl rm
errorcode.h	4956	0644	edit dl rm
fieldpos.h	8906	0644	edit dl rm
filteredbrk.h	5501	0644	edit dl rm
fmtable.h	25020	0644	edit dl rm
format.h	12802	0644	edit dl rm
formattedvalue.h	9987	0644	edit dl rm
fpositer.h	3107	0644	edit dl rm
gender.h	3408	0644	edit dl rm
gregocal.h	32642	0644	edit dl rm
icudataver.h	1049	0644	edit dl rm
icuplug.h	12109	0644	edit dl rm
idna.h	13000	0644	edit dl rm
listformatter.h	9004	0644	edit dl rm
localebuilder.h	11350	0644	edit dl rm
localematcher.h	27467	0644	edit dl rm
localpointer.h	19825	0644	edit dl rm
locdspnm.h	7292	0644	edit dl rm
locid.h	48804	0644	edit dl rm
measfmt.h	11690	0644	edit dl rm
measunit.h	107613	0644	edit dl rm
measure.h	4431	0644	edit dl rm
messagepattern.h	34517	0644	edit dl rm
msgfmt.h	45278	0644	edit dl rm
normalizer2.h	34466	0644	edit dl rm
normlzr.h	31690	0644	edit dl rm
nounit.h	2305	0644	edit dl rm
numberformatter.h	94505	0644	edit dl rm
numberrangeformatter.h	25790	0644	edit dl rm
numfmt.h	51034	0644	edit dl rm
numsys.h	7509	0644	edit dl rm
parseerr.h	3155	0644	edit dl rm
parsepos.h	5699	0644	edit dl rm
platform.h	28768	0644	edit dl rm
plurfmt.h	25847	0644	edit dl rm
plurrule.h	21316	0644	edit dl rm
ptypes.h	3577	0644	edit dl rm
putil.h	6471	0644	edit dl rm
rbbi.h	28413	0644	edit dl rm
rbnf.h	50021	0644	edit dl rm
rbtz.h	16210	0644	edit dl rm
regex.h	86385	0644	edit dl rm
region.h	9402	0644	edit dl rm
reldatefmt.h	22751	0644	edit dl rm
rep.h	9599	0644	edit dl rm
resbund.h	18513	0644	edit dl rm
schriter.h	6511	0644	edit dl rm
scientificnumberformatter.h	6589	0644	edit dl rm
search.h	22755	0644	edit dl rm
selfmt.h	14686	0644	edit dl rm
simpleformatter.h	12888	0644	edit dl rm
simpletz.h	46798	0644	edit dl rm
smpdtfmt.h	72778	0644	edit dl rm
sortkey.h	11452	0644	edit dl rm
std_string.h	1076	0644	edit dl rm
strenum.h	10157	0644	edit dl rm
stringoptions.h	5926	0644	edit dl rm
stringpiece.h	10287	0644	edit dl rm
stringtriebuilder.h	15842	0644	edit dl rm
stsearch.h	21926	0644	edit dl rm
symtable.h	4374	0644	edit dl rm
tblcoll.h	37801	0644	edit dl rm
timezone.h	44858	0644	edit dl rm
tmunit.h	3479	0644	edit dl rm
tmutamt.h	5029	0644	edit dl rm
tmutfmt.h	7602	0644	edit dl rm
translit.h	67397	0644	edit dl rm
tzfmt.h	43961	0644	edit dl rm
tznames.h	17251	0644	edit dl rm
tzrule.h	36450	0644	edit dl rm
tztrans.h	6278	0644	edit dl rm
ubidi.h	91759	0644	edit dl rm
ubiditransform.h	13003	0644	edit dl rm
ubrk.h	25043	0644	edit dl rm
ucal.h	62463	0644	edit dl rm
ucasemap.h	15579	0644	edit dl rm
ucat.h	5478	0644	edit dl rm
uchar.h	148111	0644	edit dl rm
ucharstrie.h	23066	0644	edit dl rm
ucharstriebuilder.h	7645	0644	edit dl rm
uchriter.h	13747	0644	edit dl rm
uclean.h	11468	0644	edit dl rm
ucnv.h	85051	0644	edit dl rm
ucnvsel.h	6339	0644	edit dl rm
ucnv_cb.h	6738	0644	edit dl rm
ucnv_err.h	21481	0644	edit dl rm
ucol.h	62987	0644	edit dl rm
ucoleitr.h	10056	0644	edit dl rm
uconfig.h	12356	0644	edit dl rm
ucpmap.h	5663	0644	edit dl rm
ucptrie.h	23044	0644	edit dl rm
ucsdet.h	15043	0644	edit dl rm
ucurr.h	17122	0644	edit dl rm
udat.h	63902	0644	edit dl rm
udata.h	16004	0644	edit dl rm
udateintervalformat.h	12218	0644	edit dl rm
udatpg.h	27405	0644	edit dl rm
udisplaycontext.h	6084	0644	edit dl rm
uenum.h	7981	0644	edit dl rm
ufieldpositer.h	4513	0644	edit dl rm
uformattable.h	11233	0644	edit dl rm
uformattedvalue.h	12600	0644	edit dl rm
ugender.h	2106	0644	edit dl rm
uidna.h	34229	0644	edit dl rm
uiter.h	23299	0644	edit dl rm
uldnames.h	10733	0644	edit dl rm
ulistformatter.h	11043	0644	edit dl rm
uloc.h	55936	0644	edit dl rm
ulocdata.h	11572	0644	edit dl rm
umachine.h	16439	0644	edit dl rm
umisc.h	1365	0644	edit dl rm
umsg.h	24832	0644	edit dl rm
umutablecptrie.h	8490	0644	edit dl rm
unifilt.h	4091	0644	edit dl rm
unifunct.h	4151	0644	edit dl rm
unimatch.h	6244	0644	edit dl rm
unirepl.h	3464	0644	edit dl rm
uniset.h	68108	0644	edit dl rm
unistr.h	174627	0644	edit dl rm
unorm.h	21042	0644	edit dl rm
unorm2.h	25269	0644	edit dl rm
unum.h	56269	0644	edit dl rm
unumberformatter.h	31177	0644	edit dl rm
unumberrangeformatter.h	15737	0644	edit dl rm
unumsys.h	7430	0644	edit dl rm
uobject.h	10934	0644	edit dl rm
upluralrules.h	8997	0644	edit dl rm
uregex.h	73719	0644	edit dl rm
uregion.h	10047	0644	edit dl rm
ureldatefmt.h	17448	0644	edit dl rm
urename.h	137853	0644	edit dl rm
urep.h	5507	0644	edit dl rm
ures.h	37418	0644	edit dl rm
uscript.h	28291	0644	edit dl rm
usearch.h	40153	0644	edit dl rm
uset.h	45503	0644	edit dl rm
usetiter.h	9910	0644	edit dl rm
ushape.h	18430	0644	edit dl rm
uspoof.h	67425	0644	edit dl rm
usprep.h	8382	0644	edit dl rm
ustdio.h	39482	0644	edit dl rm
ustream.h	1934	0644	edit dl rm
ustring.h	74096	0644	edit dl rm
ustringtrie.h	3224	0644	edit dl rm
utext.h	59471	0644	edit dl rm
utf.h	8057	0644	edit dl rm
utf8.h	31572	0644	edit dl rm
utf16.h	23910	0644	edit dl rm
utf32.h	763	0644	edit dl rm
utf_old.h	46929	0644	edit dl rm
utmscale.h	14107	0644	edit dl rm
utrace.h	17595	0644	edit dl rm
utrans.h	26157	0644	edit dl rm
utypes.h	31807	0644	edit dl rm
uvernum.h	6839	0644	edit dl rm
uversion.h	6137	0644	edit dl rm
vtzone.h	21303	0644	edit dl rm

Edit: /usr/include/unicode/edits.h (21237B)

// © 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"

#if U_SHOW_CPLUSPLUS_API

#include "unicode/uobject.h"

/**
 * \file
 * \brief C++ API: C++ class Edits for low-level string transformations on styled text.
 */

U_NAMESPACE_BEGIN

class UnicodeString;

/**
 * Records lengths of string edits but not replacement text. Supports replacements, insertions, deletions
 * in linear progression. Does not support moving/reordering of text.
 *
 * There are two types of edits: change edits and no-change edits. Add edits to
 * instances of this class using {@link #addReplace(int32_t, int32_t)} (for change edits) and
 * {@link #addUnchanged(int32_t)} (for no-change edits). Change edits are retained with full granularity,
 * whereas adjacent no-change edits are always merged together. In no-change edits, there is a one-to-one
 * mapping between code points in the source and destination strings.
 *
 * After all edits have been added, instances of this class should be considered immutable, and an
 * {@link Edits::Iterator} can be used for queries.
 *
 * There are four flavors of Edits::Iterator:
 *
 * <ul>
 * <li>{@link #getFineIterator()} retains full granularity of change edits.
 * <li>{@link #getFineChangesIterator()} retains full granularity of change edits, and when calling
 * next() on the iterator, skips over no-change edits (unchanged regions).
 * <li>{@link #getCoarseIterator()} treats adjacent change edits as a single edit. (Adjacent no-change
 * edits are automatically merged during the construction phase.)
 * <li>{@link #getCoarseChangesIterator()} treats adjacent change edits as a single edit, and when
 * calling next() on the iterator, skips over no-change edits (unchanged regions).
 * </ul>
 *
 * For example, consider the string "abcßDeF", which case-folds to "abcssdef". This string has the
 * following fine edits:
 * <ul>
 * <li>abc ⇨ abc (no-change)
 * <li>ß ⇨ ss (change)
 * <li>D ⇨ d (change)
 * <li>e ⇨ e (no-change)
 * <li>F ⇨ f (change)
 * </ul>
 * and the following coarse edits (note how adjacent change edits get merged together):
 * <ul>
 * <li>abc ⇨ abc (no-change)
 * <li>ßD ⇨ ssd (change)
 * <li>e ⇨ e (no-change)
 * <li>F ⇨ f (change)
 * </ul>
 *
 * The "fine changes" and "coarse changes" iterators will step through only the change edits when their
 * `Edits::Iterator::next()` methods are called. They are identical to the non-change iterators when
 * their `Edits::Iterator::findSourceIndex()` or `Edits::Iterator::findDestinationIndex()`
 * methods are used to walk through the string.
 *
 * For examples of how to use this class, see the test `TestCaseMapEditsIteratorDocs` in
 * UCharacterCaseTest.java.
 *
 * 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.
 *
 * @stable ICU 59
 */
class U_COMMON_API Edits U_FINAL : public UMemory {
public:
 /**
 * Constructs an empty object.
 * @stable ICU 59
 */
 Edits() :
 array(stackArray), capacity(STACK_CAPACITY), length(0), delta(0), numChanges(0),
 errorCode_(U_ZERO_ERROR) {}
 /**
 * Copy constructor.
 * @param other source edits
 * @stable 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
 * @stable 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.
     * @stable ICU 59
     */
    ~Edits();

/**
     * Assignment operator.
     * @param other source edits
     * @return *this
     * @stable 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
     * @stable ICU 60
     */
    Edits &operator=(Edits &&src) U_NOEXCEPT;

/**
     * Resets the data but may not release memory.
     * @stable ICU 59
     */
    void reset() U_NOEXCEPT;

/**
     * Adds a no-change edit: a record for an unchanged segment of text.
     * Normally called from inside ICU string transformation functions, not user code.
     * @stable ICU 59
     */
    void addUnchanged(int32_t unchangedLength);
    /**
     * Adds a change edit: a record for a text replacement/insertion/deletion.
     * Normally called from inside ICU string transformation functions, not user code.
     * @stable 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)
     * @stable ICU 59
     */
    UBool copyErrorTo(UErrorCode &outErrorCode) const;

/**
     * How much longer is the new text compared with the old text?
     * @return new length minus old length
     * @stable ICU 59
     */
    int32_t lengthDelta() const { return delta; }
    /**
     * @return true if there are any change edits
     * @stable ICU 59
     */
    UBool hasChanges() const { return numChanges != 0; }

/**
     * @return the number of change edits
     * @stable ICU 60
     */
    int32_t numberOfChanges() const { return numChanges; }

/**
     * Access to the list of edits.
     *
     * At any moment in time, an instance of this class points to a single edit: a "window" into a span
     * of the source string and the corresponding span of the destination string. The source string span
     * starts at {@link #sourceIndex()} and runs for {@link #oldLength()} chars; the destination string
     * span starts at {@link #destinationIndex()} and runs for {@link #newLength()} chars.
     *
     * The iterator can be moved between edits using the `next()`, `findSourceIndex(int32_t, UErrorCode &)`,
     * and `findDestinationIndex(int32_t, UErrorCode &)` methods.
     * Calling any of these methods mutates the iterator to make it point to the corresponding edit.
     *
     * For more information, see the documentation for {@link Edits}.
     *
     * @see getCoarseIterator
     * @see getFineIterator
     * @stable ICU 59
     */
    struct U_COMMON_API Iterator U_FINAL : public UMemory {
        /**
         * Default constructor, empty iterator.
         * @stable 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.
         * @stable ICU 59
         */
        Iterator(const Iterator &other) = default;
        /**
         * Assignment operator.
         * @stable ICU 59
         */
        Iterator &operator=(const Iterator &other) = default;

/**
         * Advances the iterator 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
         * @stable ICU 59
         */
        UBool next(UErrorCode &errorCode) { return next(onlyChanges_, errorCode); }

/**
         * Moves the iterator to the edit that contains the source index.
         * The source index may be found in a no-change edit
         * even if normal iteration would skip no-change edits.
         * 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
         * @stable ICU 59
         */
        UBool findSourceIndex(int32_t i, UErrorCode &errorCode) {
            return findIndex(i, true, errorCode) == 0;
        }

/**
         * Moves the iterator to the edit that contains the destination index.
         * The destination index may be found in a no-change edit
         * even if normal iteration would skip no-change edits.
         * 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
         * @stable ICU 60
         */
        UBool findDestinationIndex(int32_t i, UErrorCode &errorCode) {
            return findIndex(i, false, errorCode) == 0;
        }

/**
         * Computes 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
         * @stable ICU 60
         */
        int32_t destinationIndexFromSourceIndex(int32_t i, UErrorCode &errorCode);

/**
         * Computes 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
         * @stable ICU 60
         */
        int32_t sourceIndexFromDestinationIndex(int32_t i, UErrorCode &errorCode);

/**
         * Returns whether the edit currently represented by the iterator is a change edit.
         *
         * @return true if this edit replaces oldLength() units with newLength() different ones.
         *         false if oldLength units remain unchanged.
         * @stable ICU 59
         */
        UBool hasChange() const { return changed; }

/**
         * The length of the current span in the source string, which starts at {@link #sourceIndex}.
         *
         * @return the number of units in the original string which are replaced or remain unchanged.
         * @stable ICU 59
         */
        int32_t oldLength() const { return oldLength_; }

/**
         * The length of the current span in the destination string, which starts at
         * {@link #destinationIndex}, or in the replacement string, which starts at
         * {@link #replacementIndex}.
         *
         * @return the number of units in the modified string, if hasChange() is true.
         *         Same as oldLength if hasChange() is false.
         * @stable ICU 59
         */
        int32_t newLength() const { return newLength_; }

/**
         * The start index of the current span in the source string; the span has length
         * {@link #oldLength}.
         *
         * @return the current index into the source string
         * @stable ICU 59
         */
        int32_t sourceIndex() const { return srcIndex; }

/**
         * The start index of the current span in the replacement string; the span has length
         * {@link #newLength}. Well-defined only if the current edit is a change edit.
         *
         * The *replacement string* is the concatenation of all substrings of the destination
         * string corresponding to change edits.
         *
         * This method is intended to be used together with operations that write only replacement
         * characters (e.g. operations specifying the \ref U_OMIT_UNCHANGED_TEXT option).
         * The source string can then be modified in-place.
         *
         * @return the current index into the replacement-characters-only string,
         *         not counting unchanged spans
         * @stable ICU 59
         */
        int32_t replacementIndex() const {
            // TODO: Throw an exception if we aren't in a change edit?
            return replIndex;
        }

/**
         * The start index of the current span in the destination string; the span has length
         * {@link #newLength}.
         *
         * @return the current index into the full destination string
         * @stable ICU 59
         */
        int32_t destinationIndex() const { return destIndex; }

#ifndef U_HIDE_INTERNAL_API
        /**
         * A string representation of the current edit represented by the iterator for debugging. You
         * should not depend on the contents of the return string.
         * @internal
         */
        UnicodeString& toString(UnicodeString& appendTo) const;
#endif  // U_HIDE_INTERNAL_API

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 change edits
     * (adjacent change edits are treated as one).
     * Can be used to perform simple string updates.
     * Skips no-change edits.
     * @return an Iterator that merges adjacent changes.
     * @stable ICU 59
     */
    Iterator getCoarseChangesIterator() const {
        return Iterator(array, length, true, true);
    }

/**
     * Returns an Iterator for coarse-grained change and no-change edits
     * (adjacent change edits are treated as one).
     * Can be used to perform simple string updates.
     * Adjacent change edits are treated as one edit.
     * @return an Iterator that merges adjacent changes.
     * @stable ICU 59
     */
    Iterator getCoarseIterator() const {
        return Iterator(array, length, false, true);
    }

/**
     * Returns an Iterator for fine-grained change edits
     * (full granularity of change edits is retained).
     * Can be used for modifying styled text.
     * Skips no-change edits.
     * @return an Iterator that separates adjacent changes.
     * @stable ICU 59
     */
    Iterator getFineChangesIterator() const {
        return Iterator(array, length, true, false);
    }

/**
     * Returns an Iterator for fine-grained change and no-change edits
     * (full granularity of change edits is retained).
     * Can be used for modifying styled text.
     * @return an Iterator that separates adjacent changes.
     * @stable 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. 
 * Edits ab reflect how substrings of input string a
 * map to substrings of intermediate string b. 
 * Edits bc reflect how substrings of intermediate string b
 * map to substrings of output string c. 
 * 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
 * @stable ICU 60
 */
 Edits &mergeAndAppend(const Edits &ab, const Edits &bc, UErrorCode &errorCode);

private:
    void releaseArray() U_NOEXCEPT;
    Edits &copyArray(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];
};

U_NAMESPACE_END

#endif /* U_SHOW_CPLUSPLUS_API */

#endif  // __EDITS_H__

cmd: