FM / unicode

/opt/alt/libicu/usr/include/unicode

Name	Size	Mode	Actions
alphaindex.h	27056	0644	edit dl rm
appendable.h	8632	0644	edit dl rm
basictz.h	9055	0644	edit dl rm
brkiter.h	28195	0644	edit dl rm
bytestream.h	9767	0644	edit dl rm
bytestrie.h	19718	0644	edit dl rm
bytestriebuilder.h	7186	0644	edit dl rm
calendar.h	107581	0644	edit dl rm
caniter.h	7550	0644	edit dl rm
casemap.h	25871	0644	edit dl rm
char16ptr.h	7331	0644	edit dl rm
chariter.h	24573	0644	edit dl rm
choicfmt.h	24418	0644	edit dl rm
coleitr.h	14033	0644	edit dl rm
coll.h	56928	0644	edit dl rm
compactdecimalformat.h	6971	0644	edit dl rm
curramt.h	3782	0644	edit dl rm
currpinf.h	7412	0644	edit dl rm
currunit.h	3606	0644	edit dl rm
datefmt.h	41334	0644	edit dl rm
dbbi.h	1133	0644	edit dl rm
dcfmtsym.h	20584	0644	edit dl rm
decimfmt.h	88478	0644	edit dl rm
docmain.h	6878	0644	edit dl rm
dtfmtsym.h	38548	0644	edit dl rm
dtintrv.h	3848	0644	edit dl rm
dtitvfmt.h	43898	0644	edit dl rm
dtitvinf.h	18903	0644	edit dl rm
dtptngen.h	25626	0644	edit dl rm
dtrule.h	8831	0644	edit dl rm
edits.h	21169	0644	edit dl rm
enumset.h	2130	0644	edit dl rm
errorcode.h	4894	0644	edit dl rm
fieldpos.h	8838	0644	edit dl rm
filteredbrk.h	5364	0644	edit dl rm
fmtable.h	24946	0644	edit dl rm
format.h	12741	0644	edit dl rm
fpositer.h	3047	0644	edit dl rm
gender.h	3347	0644	edit dl rm
gregocal.h	32331	0644	edit dl rm
icudataver.h	1051	0644	edit dl rm
icuplug.h	12166	0644	edit dl rm
idna.h	12938	0644	edit dl rm
listformatter.h	6331	0644	edit dl rm
localpointer.h	17284	0644	edit dl rm
locdspnm.h	7224	0644	edit dl rm
locid.h	46001	0644	edit dl rm
measfmt.h	12298	0644	edit dl rm
measunit.h	39427	0644	edit dl rm
measure.h	4361	0644	edit dl rm
messagepattern.h	34460	0644	edit dl rm
msgfmt.h	44398	0644	edit dl rm
normalizer2.h	34789	0644	edit dl rm
normlzr.h	31476	0644	edit dl rm
nounit.h	2693	0644	edit dl rm
numberformatter.h	89164	0644	edit dl rm
numberrangeformatter.h	29430	0644	edit dl rm
numfmt.h	50322	0644	edit dl rm
numsys.h	6895	0644	edit dl rm
parseerr.h	3155	0644	edit dl rm
parsepos.h	5581	0644	edit dl rm
platform.h	27754	0644	edit dl rm
plurfmt.h	25786	0644	edit dl rm
plurrule.h	17834	0644	edit dl rm
ptypes.h	3577	0644	edit dl rm
putil.h	6487	0644	edit dl rm
rbbi.h	27047	0644	edit dl rm
rbnf.h	50984	0644	edit dl rm
rbtz.h	15838	0644	edit dl rm
regex.h	86943	0644	edit dl rm
region.h	9342	0644	edit dl rm
reldatefmt.h	14812	0644	edit dl rm
rep.h	9726	0644	edit dl rm
resbund.h	18440	0644	edit dl rm
schriter.h	6410	0644	edit dl rm
scientificnumberformatter.h	6474	0644	edit dl rm
search.h	22742	0644	edit dl rm
selfmt.h	14579	0644	edit dl rm
simpleformatter.h	11701	0644	edit dl rm
simpletz.h	46389	0644	edit dl rm
smpdtfmt.h	72442	0644	edit dl rm
sortkey.h	11383	0644	edit dl rm
std_string.h	1015	0644	edit dl rm
strenum.h	10279	0644	edit dl rm
stringoptions.h	5926	0644	edit dl rm
stringpiece.h	6610	0644	edit dl rm
stringtriebuilder.h	15636	0644	edit dl rm
stsearch.h	21801	0644	edit dl rm
symtable.h	4312	0644	edit dl rm
tblcoll.h	37272	0644	edit dl rm
timezone.h	41862	0644	edit dl rm
tmunit.h	3371	0644	edit dl rm
tmutamt.h	4918	0644	edit dl rm
tmutfmt.h	7977	0644	edit dl rm
translit.h	67339	0644	edit dl rm
tzfmt.h	43846	0644	edit dl rm
tznames.h	17190	0644	edit dl rm
tzrule.h	36170	0644	edit dl rm
tztrans.h	6214	0644	edit dl rm
ubidi.h	91711	0644	edit dl rm
ubiditransform.h	12950	0644	edit dl rm
ubrk.h	24547	0644	edit dl rm
ucal.h	56526	0644	edit dl rm
ucasemap.h	15546	0644	edit dl rm
ucat.h	5484	0644	edit dl rm
uchar.h	143314	0644	edit dl rm
ucharstrie.h	21569	0644	edit dl rm
ucharstriebuilder.h	7316	0644	edit dl rm
uchriter.h	13457	0644	edit dl rm
uclean.h	11474	0644	edit dl rm
ucnv.h	85085	0644	edit dl rm
ucnvsel.h	6283	0644	edit dl rm
ucnv_cb.h	6748	0644	edit dl rm
ucnv_err.h	21492	0644	edit dl rm
ucol.h	62864	0644	edit dl rm
ucoleitr.h	9684	0644	edit dl rm
uconfig.h	11949	0644	edit dl rm
ucpmap.h	5709	0644	edit dl rm
ucptrie.h	22824	0644	edit dl rm
ucsdet.h	15018	0644	edit dl rm
ucurr.h	15947	0644	edit dl rm
udat.h	61572	0644	edit dl rm
udata.h	15905	0644	edit dl rm
udateintervalformat.h	6950	0644	edit dl rm
udatpg.h	26664	0644	edit dl rm
udisplaycontext.h	6029	0644	edit dl rm
uenum.h	7970	0644	edit dl rm
ufieldpositer.h	4461	0644	edit dl rm
uformattable.h	11198	0644	edit dl rm
ugender.h	2052	0644	edit dl rm
uidna.h	34169	0644	edit dl rm
uiter.h	23319	0644	edit dl rm
uldnames.h	10702	0644	edit dl rm
ulistformatter.h	5148	0644	edit dl rm
uloc.h	51971	0644	edit dl rm
ulocdata.h	11533	0644	edit dl rm
umachine.h	13509	0644	edit dl rm
umisc.h	1365	0644	edit dl rm
umsg.h	24812	0644	edit dl rm
umutablecptrie.h	8477	0644	edit dl rm
unifilt.h	3716	0644	edit dl rm
unifunct.h	4079	0644	edit dl rm
unimatch.h	6184	0644	edit dl rm
unirepl.h	3403	0644	edit dl rm
uniset.h	65796	0644	edit dl rm
unistr.h	178587	0644	edit dl rm
unorm.h	20938	0644	edit dl rm
unorm2.h	25254	0644	edit dl rm
unum.h	54666	0644	edit dl rm
unumberformatter.h	24335	0644	edit dl rm
unumsys.h	7314	0644	edit dl rm
uobject.h	10958	0644	edit dl rm
upluralrules.h	6880	0644	edit dl rm
uregex.h	73784	0644	edit dl rm
uregion.h	10073	0644	edit dl rm
ureldatefmt.h	12518	0644	edit dl rm
urename.h	130791	0644	edit dl rm
urep.h	5507	0644	edit dl rm
ures.h	37404	0644	edit dl rm
uscript.h	27153	0644	edit dl rm
usearch.h	39038	0644	edit dl rm
uset.h	40958	0644	edit dl rm
usetiter.h	9719	0644	edit dl rm
ushape.h	18432	0644	edit dl rm
uspoof.h	67613	0644	edit dl rm
usprep.h	8331	0644	edit dl rm
ustdio.h	39469	0644	edit dl rm
ustream.h	1844	0644	edit dl rm
ustring.h	74211	0644	edit dl rm
ustringtrie.h	3224	0644	edit dl rm
utext.h	59503	0644	edit dl rm
utf.h	8046	0644	edit dl rm
utf8.h	30734	0644	edit dl rm
utf16.h	22866	0644	edit dl rm
utf32.h	763	0644	edit dl rm
utf_old.h	44827	0644	edit dl rm
utmscale.h	14113	0644	edit dl rm
utrace.h	14219	0644	edit dl rm
utrans.h	26157	0644	edit dl rm
utypes.h	31212	0644	edit dl rm
uvernum.h	6206	0644	edit dl rm
uversion.h	6865	0644	edit dl rm
vtzone.h	20651	0644	edit dl rm

Edit: /opt/alt/libicu/usr/include/unicode/edits.h (21169B)

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

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);

/**
     * 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  // __EDITS_H__

cmd: