Gecko [ www.ap.oishifashion.com ]

Name	Size	Permission	Date
alphaindex.h	26.54 KB	-rw-r--r--	2024-06-13 15:35
appendable.h	8.54 KB	-rw-r--r--	2024-06-13 15:35
basictz.h	9.99 KB	-rw-r--r--	2024-06-13 15:35
brkiter.h	27.83 KB	-rw-r--r--	2024-06-13 15:35
bytestream.h	10.75 KB	-rw-r--r--	2024-06-13 15:35
bytestrie.h	20.8 KB	-rw-r--r--	2024-06-13 15:35
bytestriebuilder.h	7.48 KB	-rw-r--r--	2024-06-13 15:35
calendar.h	107.68 KB	-rw-r--r--	2024-06-13 15:35
caniter.h	7.53 KB	-rw-r--r--	2024-06-13 15:35
casemap.h	25.42 KB	-rw-r--r--	2024-06-13 15:35
char16ptr.h	7.22 KB	-rw-r--r--	2024-06-13 15:35
chariter.h	23.79 KB	-rw-r--r--	2024-06-13 15:35
choicfmt.h	23.99 KB	-rw-r--r--	2024-06-13 15:35
coleitr.h	13.77 KB	-rw-r--r--	2024-06-13 15:35
coll.h	56.28 KB	-rw-r--r--	2024-06-13 15:35
compactdecimalformat.h	6.88 KB	-rw-r--r--	2024-06-13 15:35
curramt.h	3.67 KB	-rw-r--r--	2024-06-13 15:35
currpinf.h	7.3 KB	-rw-r--r--	2024-06-13 15:35
currunit.h	4.02 KB	-rw-r--r--	2024-06-13 15:35
datefmt.h	40.7 KB	-rw-r--r--	2024-06-13 15:35
dbbi.h	1.19 KB	-rw-r--r--	2024-06-13 15:35
dcfmtsym.h	20.93 KB	-rw-r--r--	2024-06-13 15:35
decimfmt.h	87.46 KB	-rw-r--r--	2024-06-13 15:35
displayoptions.h	7.08 KB	-rw-r--r--	2024-06-13 15:35
docmain.h	7.46 KB	-rw-r--r--	2024-06-13 15:35
dtfmtsym.h	38.21 KB	-rw-r--r--	2024-06-13 15:35
dtintrv.h	3.84 KB	-rw-r--r--	2024-06-13 15:35
dtitvfmt.h	48.87 KB	-rw-r--r--	2024-06-13 15:35
dtitvinf.h	18.63 KB	-rw-r--r--	2024-06-13 15:35
dtptngen.h	28.05 KB	-rw-r--r--	2024-06-13 15:35
dtrule.h	8.66 KB	-rw-r--r--	2024-06-13 15:35
edits.h	20.73 KB	-rw-r--r--	2024-06-13 15:35
enumset.h	2.08 KB	-rw-r--r--	2024-06-13 15:35
errorcode.h	4.84 KB	-rw-r--r--	2024-06-13 15:35
fieldpos.h	8.69 KB	-rw-r--r--	2024-06-13 15:35
filteredbrk.h	5.37 KB	-rw-r--r--	2024-06-13 15:35
fmtable.h	24.36 KB	-rw-r--r--	2024-06-13 15:35
format.h	12.5 KB	-rw-r--r--	2024-06-13 15:35
formattednumber.h	6.28 KB	-rw-r--r--	2024-06-13 15:35
formattedvalue.h	9.75 KB	-rw-r--r--	2024-06-13 15:35
fpositer.h	3.03 KB	-rw-r--r--	2024-06-13 15:35
gender.h	3.35 KB	-rw-r--r--	2024-06-13 15:35
gregocal.h	30.3 KB	-rw-r--r--	2024-06-13 15:35
icudataver.h	1.02 KB	-rw-r--r--	2024-06-13 15:35
icuplug.h	12.1 KB	-rw-r--r--	2024-06-13 15:35
idna.h	12.71 KB	-rw-r--r--	2024-06-13 15:35
listformatter.h	8.59 KB	-rw-r--r--	2024-06-13 15:35
localebuilder.h	11.08 KB	-rw-r--r--	2024-06-13 15:35
localematcher.h	26.86 KB	-rw-r--r--	2024-06-13 15:35
localpointer.h	19.55 KB	-rw-r--r--	2024-06-13 15:35
locdspnm.h	7.12 KB	-rw-r--r--	2024-06-13 15:35
locid.h	48.31 KB	-rw-r--r--	2024-06-13 15:35
measfmt.h	11.41 KB	-rw-r--r--	2024-06-13 15:35
measunit.h	108.23 KB	-rw-r--r--	2024-06-13 15:35
measure.h	4.68 KB	-rw-r--r--	2024-06-13 15:35
messageformat2.h	18.13 KB	-rw-r--r--	2024-06-13 15:35
messageformat2_arguments.h	4.3 KB	-rw-r--r--	2024-06-13 15:35
messageformat2_data_model.h	123 KB	-rw-r--r--	2024-06-13 15:35
messageformat2_data_model_names.h	784 B	-rw-r--r--	2024-06-13 15:35
messageformat2_formattable.h	38.29 KB	-rw-r--r--	2024-06-13 15:35
messageformat2_function_registry.h	18 KB	-rw-r--r--	2024-06-13 15:35
messagepattern.h	33.72 KB	-rw-r--r--	2024-06-13 15:35
msgfmt.h	44.2 KB	-rw-r--r--	2024-06-13 15:35
normalizer2.h	34.73 KB	-rw-r--r--	2024-06-13 15:35
normlzr.h	30.79 KB	-rw-r--r--	2024-06-13 15:35
nounit.h	2.24 KB	-rw-r--r--	2024-06-13 15:35
numberformatter.h	90.74 KB	-rw-r--r--	2024-06-13 15:35
numberrangeformatter.h	26.05 KB	-rw-r--r--	2024-06-13 15:35
numfmt.h	50.16 KB	-rw-r--r--	2024-06-13 15:35
numsys.h	7.22 KB	-rw-r--r--	2024-06-13 15:35
parseerr.h	3.08 KB	-rw-r--r--	2024-06-13 15:35
parsepos.h	5.56 KB	-rw-r--r--	2024-06-13 15:35
platform.h	26.66 KB	-rw-r--r--	2024-06-13 15:35
plurfmt.h	25.07 KB	-rw-r--r--	2024-06-13 15:35
plurrule.h	20.63 KB	-rw-r--r--	2024-06-13 15:35
ptypes.h	2.16 KB	-rw-r--r--	2024-06-13 15:35
putil.h	6.32 KB	-rw-r--r--	2024-06-13 15:35
rbbi.h	32.04 KB	-rw-r--r--	2024-06-13 15:35
rbnf.h	50.53 KB	-rw-r--r--	2024-06-13 15:35
rbtz.h	15.75 KB	-rw-r--r--	2024-06-13 15:35
regex.h	84.45 KB	-rw-r--r--	2024-06-13 15:35
region.h	9.2 KB	-rw-r--r--	2024-06-13 15:35
reldatefmt.h	22.36 KB	-rw-r--r--	2024-06-13 15:35
rep.h	9.38 KB	-rw-r--r--	2024-06-13 15:35
resbund.h	18.03 KB	-rw-r--r--	2024-06-13 15:35
schriter.h	6.09 KB	-rw-r--r--	2024-06-13 15:35
scientificnumberformatter.h	6.44 KB	-rw-r--r--	2024-06-13 15:35
search.h	22.21 KB	-rw-r--r--	2024-06-13 15:35
selfmt.h	14.35 KB	-rw-r--r--	2024-06-13 15:35
simpleformatter.h	12.58 KB	-rw-r--r--	2024-06-13 15:35
simplenumberformatter.h	9.18 KB	-rw-r--r--	2024-06-13 15:35
simpletz.h	45.62 KB	-rw-r--r--	2024-06-13 15:35
smpdtfmt.h	57.06 KB	-rw-r--r--	2024-06-13 15:35
sortkey.h	11.12 KB	-rw-r--r--	2024-06-13 15:35
std_string.h	1.05 KB	-rw-r--r--	2024-06-13 15:35
strenum.h	9.96 KB	-rw-r--r--	2024-06-13 15:35
stringoptions.h	5.79 KB	-rw-r--r--	2024-06-13 15:35
stringpiece.h	10.02 KB	-rw-r--r--	2024-06-13 15:35
stringtriebuilder.h	15.5 KB	-rw-r--r--	2024-06-13 15:35
stsearch.h	21.43 KB	-rw-r--r--	2024-06-13 15:35
symtable.h	4.28 KB	-rw-r--r--	2024-06-13 15:35
tblcoll.h	36.93 KB	-rw-r--r--	2024-06-13 15:35
timezone.h	45.64 KB	-rw-r--r--	2024-06-13 15:35
tmunit.h	3.4 KB	-rw-r--r--	2024-06-13 15:35
tmutamt.h	4.9 KB	-rw-r--r--	2024-06-13 15:35
tmutfmt.h	7.42 KB	-rw-r--r--	2024-06-13 15:35
translit.h	65.8 KB	-rw-r--r--	2024-06-13 15:35
tzfmt.h	42.95 KB	-rw-r--r--	2024-06-13 15:35
tznames.h	16.85 KB	-rw-r--r--	2024-06-13 15:35
tzrule.h	34.81 KB	-rw-r--r--	2024-06-13 15:35
tztrans.h	6.11 KB	-rw-r--r--	2024-06-13 15:35
ubidi.h	89.61 KB	-rw-r--r--	2024-06-13 15:35
ubiditransform.h	12.71 KB	-rw-r--r--	2024-06-13 15:35
ubrk.h	24.43 KB	-rw-r--r--	2024-06-13 15:35
ucal.h	64.01 KB	-rw-r--r--	2024-06-13 15:35
ucasemap.h	15.21 KB	-rw-r--r--	2024-06-13 15:35
ucat.h	5.35 KB	-rw-r--r--	2024-06-13 15:35
uchar.h	150.13 KB	-rw-r--r--	2024-06-13 15:35
ucharstrie.h	22.56 KB	-rw-r--r--	2024-06-13 15:35
ucharstriebuilder.h	7.48 KB	-rw-r--r--	2024-06-13 15:35
uchriter.h	13.24 KB	-rw-r--r--	2024-06-13 15:35
uclean.h	11.21 KB	-rw-r--r--	2024-06-13 15:35
ucnv.h	83.34 KB	-rw-r--r--	2024-06-13 15:35
ucnv_cb.h	6.58 KB	-rw-r--r--	2024-06-13 15:35
ucnv_err.h	20.98 KB	-rw-r--r--	2024-06-13 15:35
ucnvsel.h	6.24 KB	-rw-r--r--	2024-06-13 15:35
ucol.h	62.7 KB	-rw-r--r--	2024-06-13 15:35
ucoleitr.h	9.82 KB	-rw-r--r--	2024-06-13 15:35
uconfig.h	12.56 KB	-rw-r--r--	2024-06-13 15:35
ucpmap.h	5.54 KB	-rw-r--r--	2024-06-13 15:35
ucptrie.h	22.51 KB	-rw-r--r--	2024-06-13 15:35
ucsdet.h	14.69 KB	-rw-r--r--	2024-06-13 15:35
ucurr.h	16.72 KB	-rw-r--r--	2024-06-13 15:35
udat.h	62.36 KB	-rw-r--r--	2024-06-13 15:35
udata.h	15.63 KB	-rw-r--r--	2024-06-13 15:35
udateintervalformat.h	11.93 KB	-rw-r--r--	2024-06-13 15:35
udatpg.h	30.13 KB	-rw-r--r--	2024-06-13 15:35
udisplaycontext.h	5.94 KB	-rw-r--r--	2024-06-13 15:35
udisplayoptions.h	8.86 KB	-rw-r--r--	2024-06-13 15:35
uenum.h	7.79 KB	-rw-r--r--	2024-06-13 15:35
ufieldpositer.h	4.41 KB	-rw-r--r--	2024-06-13 15:35
uformattable.h	10.97 KB	-rw-r--r--	2024-06-13 15:35
uformattednumber.h	8.09 KB	-rw-r--r--	2024-06-13 15:35
uformattedvalue.h	12.25 KB	-rw-r--r--	2024-06-13 15:35
ugender.h	2.06 KB	-rw-r--r--	2024-06-13 15:35
uidna.h	33.43 KB	-rw-r--r--	2024-06-13 15:35
uiter.h	22.75 KB	-rw-r--r--	2024-06-13 15:35
uldnames.h	10.48 KB	-rw-r--r--	2024-06-13 15:35
ulistformatter.h	10.78 KB	-rw-r--r--	2024-06-13 15:35
uloc.h	55.38 KB	-rw-r--r--	2024-06-13 15:35
ulocale.h	6.35 KB	-rw-r--r--	2024-06-13 15:35
ulocbuilder.h	16.73 KB	-rw-r--r--	2024-06-13 15:35
ulocdata.h	11.3 KB	-rw-r--r--	2024-06-13 15:35
umachine.h	14.59 KB	-rw-r--r--	2024-06-13 15:35
umisc.h	1.34 KB	-rw-r--r--	2024-06-13 15:35
umsg.h	24.25 KB	-rw-r--r--	2024-06-13 15:35
umutablecptrie.h	8.3 KB	-rw-r--r--	2024-06-13 15:35
unifilt.h	4 KB	-rw-r--r--	2024-06-13 15:35
unifunct.h	4.05 KB	-rw-r--r--	2024-06-13 15:35
unimatch.h	6.1 KB	-rw-r--r--	2024-06-13 15:35
unirepl.h	3.38 KB	-rw-r--r--	2024-06-13 15:35
uniset.h	66.82 KB	-rw-r--r--	2024-06-13 15:35
unistr.h	171.33 KB	-rw-r--r--	2024-06-13 15:35
unorm.h	20.55 KB	-rw-r--r--	2024-06-13 15:35
unorm2.h	25.71 KB	-rw-r--r--	2024-06-13 15:35
unum.h	55.16 KB	-rw-r--r--	2024-06-13 15:35
unumberformatter.h	19.68 KB	-rw-r--r--	2024-06-13 15:35
unumberoptions.h	5.23 KB	-rw-r--r--	2024-06-13 15:35
unumberrangeformatter.h	15.35 KB	-rw-r--r--	2024-06-13 15:35
unumsys.h	7.26 KB	-rw-r--r--	2024-06-13 15:35
uobject.h	10.66 KB	-rw-r--r--	2024-06-13 15:35
upluralrules.h	8.79 KB	-rw-r--r--	2024-06-13 15:35
uregex.h	71.99 KB	-rw-r--r--	2024-06-13 15:35
uregion.h	9.81 KB	-rw-r--r--	2024-06-13 15:35
ureldatefmt.h	16.98 KB	-rw-r--r--	2024-06-13 15:35
urename.h	141.31 KB	-rw-r--r--	2024-06-13 15:35
urep.h	5.38 KB	-rw-r--r--	2024-06-13 15:35
ures.h	36.65 KB	-rw-r--r--	2024-06-13 15:35
uscript.h	27.89 KB	-rw-r--r--	2024-06-13 15:35
usearch.h	39.21 KB	-rw-r--r--	2024-06-13 15:35
uset.h	45.56 KB	-rw-r--r--	2024-06-13 15:35
usetiter.h	9.63 KB	-rw-r--r--	2024-06-13 15:35
ushape.h	18 KB	-rw-r--r--	2024-06-13 15:35
usimplenumberformatter.h	7.63 KB	-rw-r--r--	2024-06-13 15:35
uspoof.h	80.32 KB	-rw-r--r--	2024-06-13 15:35
usprep.h	8.19 KB	-rw-r--r--	2024-06-13 15:35
ustdio.h	38.56 KB	-rw-r--r--	2024-06-13 15:35
ustream.h	1.89 KB	-rw-r--r--	2024-06-13 15:35
ustring.h	72.13 KB	-rw-r--r--	2024-06-13 15:35
ustringtrie.h	3.15 KB	-rw-r--r--	2024-06-13 15:35
utext.h	58.1 KB	-rw-r--r--	2024-06-13 15:35
utf.h	7.87 KB	-rw-r--r--	2024-06-13 15:35
utf16.h	23.35 KB	-rw-r--r--	2024-06-13 15:35
utf32.h	763 B	-rw-r--r--	2024-06-13 15:35
utf8.h	30.83 KB	-rw-r--r--	2024-06-13 15:35
utf_old.h	45.8 KB	-rw-r--r--	2024-06-13 15:35
utmscale.h	13.78 KB	-rw-r--r--	2024-06-13 15:35
utrace.h	17.18 KB	-rw-r--r--	2024-06-13 15:35
utrans.h	25.54 KB	-rw-r--r--	2024-06-13 15:35
utypes.h	33.71 KB	-rw-r--r--	2024-06-13 15:35
uvernum.h	6.33 KB	-rw-r--r--	2024-06-13 15:35
uversion.h	5.99 KB	-rw-r--r--	2024-06-13 15:35
vtzone.h	20.68 KB	-rw-r--r--	2024-06-13 15:35

Rename

// © 2016 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
/*
*******************************************************************************
*   Copyright (C) 2010-2012, International Business Machines
*   Corporation and others.  All Rights Reserved.
*******************************************************************************
*   file name:  ucharstrie.h
*   encoding:   UTF-8
*   tab size:   8 (not used)
*   indentation:4
*
*   created on: 2010nov14
*   created by: Markus W. Scherer
*/

#ifndef __UCHARSTRIE_H__
#define __UCHARSTRIE_H__

/**
 * \file
 * \brief C++ API: Trie for mapping Unicode strings (or 16-bit-unit sequences)
 *                 to integer values.
 */

#include "unicode/utypes.h"

#if U_SHOW_CPLUSPLUS_API

#include "unicode/unistr.h"
#include "unicode/uobject.h"
#include "unicode/ustringtrie.h"

U_NAMESPACE_BEGIN

class Appendable;
class UCharsTrieBuilder;
class UVector32;

/**
 * Light-weight, non-const reader class for a UCharsTrie.
 * Traverses a char16_t-serialized data structure with minimal state,
 * for mapping strings (16-bit-unit sequences) to non-negative integer values.
 *
 * This class owns the serialized trie data only if it was constructed by
 * the builder's build() method.
 * The public constructor and the copy constructor only alias the data (only copy the pointer).
 * There is no assignment operator.
 *
 * This class is not intended for public subclassing.
 * @stable ICU 4.8
 */
class U_COMMON_API UCharsTrie : public UMemory {
public:
    /**
     * Constructs a UCharsTrie reader instance.
     *
     * The trieUChars must contain a copy of a char16_t sequence from the UCharsTrieBuilder,
     * starting with the first char16_t of that sequence.
     * The UCharsTrie object will not read more char16_ts than
     * the UCharsTrieBuilder generated in the corresponding build() call.
     *
     * The array is not copied/cloned and must not be modified while
     * the UCharsTrie object is in use.
     *
     * @param trieUChars The char16_t array that contains the serialized trie.
     * @stable ICU 4.8
     */
    UCharsTrie(ConstChar16Ptr trieUChars)
            : ownedArray_(nullptr), uchars_(trieUChars),
              pos_(uchars_), remainingMatchLength_(-1) {}

/**
     * Destructor.
     * @stable ICU 4.8
     */
    ~UCharsTrie();

/**
     * Copy constructor, copies the other trie reader object and its state,
     * but not the char16_t array which will be shared. (Shallow copy.)
     * @param other Another UCharsTrie object.
     * @stable ICU 4.8
     */
    UCharsTrie(const UCharsTrie &other)
            : ownedArray_(nullptr), uchars_(other.uchars_),
              pos_(other.pos_), remainingMatchLength_(other.remainingMatchLength_) {}

/**
     * Resets this trie to its initial state.
     * @return *this
     * @stable ICU 4.8
     */
    UCharsTrie &reset() {
        pos_=uchars_;
        remainingMatchLength_=-1;
        return *this;
    }

/**
     * Returns the state of this trie as a 64-bit integer.
     * The state value is never 0.
     *
     * @return opaque state value
     * @see resetToState64
     * @stable ICU 65
     */
    uint64_t getState64() const {
        return (static_cast<uint64_t>(remainingMatchLength_ + 2) << kState64RemainingShift) |
            (uint64_t)(pos_ - uchars_);
    }

/**
     * Resets this trie to the saved state.
     * Unlike resetToState(State), the 64-bit state value
     * must be from getState64() from the same trie object or
     * from one initialized the exact same way.
     * Because of no validation, this method is faster.
     *
     * @param state The opaque trie state value from getState64().
     * @return *this
     * @see getState64
     * @see resetToState
     * @see reset
     * @stable ICU 65
     */
    UCharsTrie &resetToState64(uint64_t state) {
        remainingMatchLength_ = static_cast<int32_t>(state >> kState64RemainingShift) - 2;
        pos_ = uchars_ + (state & kState64PosMask);
        return *this;
    }

/**
     * UCharsTrie state object, for saving a trie's current state
     * and resetting the trie back to this state later.
     * @stable ICU 4.8
     */
    class State : public UMemory {
    public:
        /**
         * Constructs an empty State.
         * @stable ICU 4.8
         */
        State() { uchars=nullptr; }
    private:
        friend class UCharsTrie;

const char16_t *uchars;
        const char16_t *pos;
        int32_t remainingMatchLength;
    };

/**
     * Saves the state of this trie.
     * @param state The State object to hold the trie's state.
     * @return *this
     * @see resetToState
     * @stable ICU 4.8
     */
    const UCharsTrie &saveState(State &state) const {
        state.uchars=uchars_;
        state.pos=pos_;
        state.remainingMatchLength=remainingMatchLength_;
        return *this;
    }

/**
     * Resets this trie to the saved state.
     * If the state object contains no state, or the state of a different trie,
     * then this trie remains unchanged.
     * @param state The State object which holds a saved trie state.
     * @return *this
     * @see saveState
     * @see reset
     * @stable ICU 4.8
     */
    UCharsTrie &resetToState(const State &state) {
        if(uchars_==state.uchars && uchars_!=nullptr) {
            pos_=state.pos;
            remainingMatchLength_=state.remainingMatchLength;
        }
        return *this;
    }

/**
     * Determines whether the string so far matches, whether it has a value,
     * and whether another input char16_t can continue a matching string.
     * @return The match/value Result.
     * @stable ICU 4.8
     */
    UStringTrieResult current() const;

/**
     * Traverses the trie from the initial state for this input char16_t.
     * Equivalent to reset().next(uchar).
     * @param uchar Input char value. Values below 0 and above 0xffff will never match.
     * @return The match/value Result.
     * @stable ICU 4.8
     */
    inline UStringTrieResult first(int32_t uchar) {
        remainingMatchLength_=-1;
        return nextImpl(uchars_, uchar);
    }

/**
     * Traverses the trie from the initial state for the
     * one or two UTF-16 code units for this input code point.
     * Equivalent to reset().nextForCodePoint(cp).
     * @param cp A Unicode code point 0..0x10ffff.
     * @return The match/value Result.
     * @stable ICU 4.8
     */
    UStringTrieResult firstForCodePoint(UChar32 cp);

/**
     * Traverses the trie from the current state for this input char16_t.
     * @param uchar Input char value. Values below 0 and above 0xffff will never match.
     * @return The match/value Result.
     * @stable ICU 4.8
     */
    UStringTrieResult next(int32_t uchar);

/**
     * Traverses the trie from the current state for the
     * one or two UTF-16 code units for this input code point.
     * @param cp A Unicode code point 0..0x10ffff.
     * @return The match/value Result.
     * @stable ICU 4.8
     */
    UStringTrieResult nextForCodePoint(UChar32 cp);

/**
     * Traverses the trie from the current state for this string.
     * Equivalent to
     * \code
     * Result result=current();
     * for(each c in s)
     *   if(!USTRINGTRIE_HAS_NEXT(result)) return USTRINGTRIE_NO_MATCH;
     *   result=next(c);
     * return result;
     * \endcode
     * @param s A string. Can be nullptr if length is 0.
     * @param length The length of the string. Can be -1 if NUL-terminated.
     * @return The match/value Result.
     * @stable ICU 4.8
     */
    UStringTrieResult next(ConstChar16Ptr s, int32_t length);

/**
     * Returns a matching string's value if called immediately after
     * current()/first()/next() returned USTRINGTRIE_INTERMEDIATE_VALUE or USTRINGTRIE_FINAL_VALUE.
     * getValue() can be called multiple times.
     *
     * Do not call getValue() after USTRINGTRIE_NO_MATCH or USTRINGTRIE_NO_VALUE!
     * @return The value for the string so far.
     * @stable ICU 4.8
     */
    inline int32_t getValue() const {
        const char16_t *pos=pos_;
        int32_t leadUnit=*pos++;
        // U_ASSERT(leadUnit>=kMinValueLead);
        return leadUnit&kValueIsFinal ?
            readValue(pos, leadUnit&0x7fff) : readNodeValue(pos, leadUnit);
    }

/**
     * Determines whether all strings reachable from the current state
     * map to the same value.
     * @param uniqueValue Receives the unique value, if this function returns true.
     *                    (output-only)
     * @return true if all strings reachable from the current state
     *         map to the same value.
     * @stable ICU 4.8
     */
    inline UBool hasUniqueValue(int32_t &uniqueValue) const {
        const char16_t *pos=pos_;
        // Skip the rest of a pending linear-match node.
        return pos!=nullptr && findUniqueValue(pos+remainingMatchLength_+1, false, uniqueValue);
    }

/**
     * Finds each char16_t which continues the string from the current state.
     * That is, each char16_t c for which it would be next(c)!=USTRINGTRIE_NO_MATCH now.
     * @param out Each next char16_t is appended to this object.
     * @return the number of char16_ts which continue the string from here
     * @stable ICU 4.8
     */
    int32_t getNextUChars(Appendable &out) const;

/**
     * Iterator for all of the (string, value) pairs in a UCharsTrie.
     * @stable ICU 4.8
     */
    class U_COMMON_API Iterator : public UMemory {
    public:
        /**
         * Iterates from the root of a char16_t-serialized UCharsTrie.
         * @param trieUChars The trie char16_ts.
         * @param maxStringLength If 0, the iterator returns full strings.
         *                        Otherwise, the iterator returns strings with this maximum length.
         * @param errorCode Standard 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.)
         * @stable ICU 4.8
         */
        Iterator(ConstChar16Ptr trieUChars, int32_t maxStringLength, UErrorCode &errorCode);

/**
         * Iterates from the current state of the specified UCharsTrie.
         * @param trie The trie whose state will be copied for iteration.
         * @param maxStringLength If 0, the iterator returns full strings.
         *                        Otherwise, the iterator returns strings with this maximum length.
         * @param errorCode Standard 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.)
         * @stable ICU 4.8
         */
        Iterator(const UCharsTrie &trie, int32_t maxStringLength, UErrorCode &errorCode);

/**
         * Destructor.
         * @stable ICU 4.8
         */
        ~Iterator();

/**
         * Resets this iterator to its initial state.
         * @return *this
         * @stable ICU 4.8
         */
        Iterator &reset();

/**
         * @return true if there are more elements.
         * @stable ICU 4.8
         */
        UBool hasNext() const;

/**
         * Finds the next (string, value) pair if there is one.
         *
         * If the string is truncated to the maximum length and does not
         * have a real value, then the value is set to -1.
         * In this case, this "not a real value" is indistinguishable from
         * a real value of -1.
         * @param errorCode Standard 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 element.
         * @stable ICU 4.8
         */
        UBool next(UErrorCode &errorCode);

/**
         * @return The string for the last successful next().
         * @stable ICU 4.8
         */
        const UnicodeString &getString() const { return str_; }
        /**
         * @return The value for the last successful next().
         * @stable ICU 4.8
         */
        int32_t getValue() const { return value_; }

private:
        UBool truncateAndStop() {
            pos_=nullptr;
            value_=-1;  // no real value for str
            return true;
        }

const char16_t *branchNext(const char16_t *pos, int32_t length, UErrorCode &errorCode);

const char16_t *uchars_;
        const char16_t *pos_;
        const char16_t *initialPos_;
        int32_t remainingMatchLength_;
        int32_t initialRemainingMatchLength_;
        UBool skipValue_;  // Skip intermediate value which was already delivered.

UnicodeString str_;
        int32_t maxLength_;
        int32_t value_;

// The stack stores pairs of integers for backtracking to another
        // outbound edge of a branch node.
        // The first integer is an offset from uchars_.
        // The second integer has the str_.length() from before the node in bits 15..0,
        // and the remaining branch length in bits 31..16.
        // (We could store the remaining branch length minus 1 in bits 30..16 and not use the sign bit,
        // but the code looks more confusing that way.)
        UVector32 *stack_;
    };

private:
    friend class UCharsTrieBuilder;

/**
     * Constructs a UCharsTrie reader instance.
     * Unlike the public constructor which just aliases an array,
     * this constructor adopts the builder's array.
     * This constructor is only called by the builder.
     */
    UCharsTrie(char16_t *adoptUChars, const char16_t *trieUChars)
            : ownedArray_(adoptUChars), uchars_(trieUChars),
              pos_(uchars_), remainingMatchLength_(-1) {}

// No assignment operator.
    UCharsTrie &operator=(const UCharsTrie &other) = delete;

inline void stop() {
        pos_=nullptr;
    }

// Reads a compact 32-bit integer.
    // pos is already after the leadUnit, and the lead unit has bit 15 reset.
    static inline int32_t readValue(const char16_t *pos, int32_t leadUnit) {
        int32_t value;
        if(leadUnit<kMinTwoUnitValueLead) {
            value=leadUnit;
        } else if(leadUnit<kThreeUnitValueLead) {
            value=((leadUnit-kMinTwoUnitValueLead)<<16)|*pos;
        } else {
            value=(pos[0]<<16)|pos[1];
        }
        return value;
    }
    static inline const char16_t *skipValue(const char16_t *pos, int32_t leadUnit) {
        if(leadUnit>=kMinTwoUnitValueLead) {
            if(leadUnit<kThreeUnitValueLead) {
                ++pos;
            } else {
                pos+=2;
            }
        }
        return pos;
    }
    static inline const char16_t *skipValue(const char16_t *pos) {
        int32_t leadUnit=*pos++;
        return skipValue(pos, leadUnit&0x7fff);
    }

static inline int32_t readNodeValue(const char16_t *pos, int32_t leadUnit) {
        // U_ASSERT(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal);
        int32_t value;
        if(leadUnit<kMinTwoUnitNodeValueLead) {
            value=(leadUnit>>6)-1;
        } else if(leadUnit<kThreeUnitNodeValueLead) {
            value=(((leadUnit&0x7fc0)-kMinTwoUnitNodeValueLead)<<10)|*pos;
        } else {
            value=(pos[0]<<16)|pos[1];
        }
        return value;
    }
    static inline const char16_t *skipNodeValue(const char16_t *pos, int32_t leadUnit) {
        // U_ASSERT(kMinValueLead<=leadUnit && leadUnit<kValueIsFinal);
        if(leadUnit>=kMinTwoUnitNodeValueLead) {
            if(leadUnit<kThreeUnitNodeValueLead) {
                ++pos;
            } else {
                pos+=2;
            }
        }
        return pos;
    }

static inline const char16_t *jumpByDelta(const char16_t *pos) {
        int32_t delta=*pos++;
        if(delta>=kMinTwoUnitDeltaLead) {
            if(delta==kThreeUnitDeltaLead) {
                delta=(pos[0]<<16)|pos[1];
                pos+=2;
            } else {
                delta=((delta-kMinTwoUnitDeltaLead)<<16)|*pos++;
            }
        }
        return pos+delta;
    }

static const char16_t *skipDelta(const char16_t *pos) {
        int32_t delta=*pos++;
        if(delta>=kMinTwoUnitDeltaLead) {
            if(delta==kThreeUnitDeltaLead) {
                pos+=2;
            } else {
                ++pos;
            }
        }
        return pos;
    }

static inline UStringTrieResult valueResult(int32_t node) {
        return (UStringTrieResult)(USTRINGTRIE_INTERMEDIATE_VALUE-(node>>15));
    }

// Handles a branch node for both next(uchar) and next(string).
    UStringTrieResult branchNext(const char16_t *pos, int32_t length, int32_t uchar);

// Requires remainingLength_<0.
    UStringTrieResult nextImpl(const char16_t *pos, int32_t uchar);

// Helper functions for hasUniqueValue().
    // Recursively finds a unique value (or whether there is not a unique one)
    // from a branch.
    static const char16_t *findUniqueValueFromBranch(const char16_t *pos, int32_t length,
                                                  UBool haveUniqueValue, int32_t &uniqueValue);
    // Recursively finds a unique value (or whether there is not a unique one)
    // starting from a position on a node lead unit.
    static UBool findUniqueValue(const char16_t *pos, UBool haveUniqueValue, int32_t &uniqueValue);

// Helper functions for getNextUChars().
    // getNextUChars() when pos is on a branch node.
    static void getNextBranchUChars(const char16_t *pos, int32_t length, Appendable &out);

// UCharsTrie data structure
    //
    // The trie consists of a series of char16_t-serialized nodes for incremental
    // Unicode string/char16_t sequence matching. (char16_t=16-bit unsigned integer)
    // The root node is at the beginning of the trie data.
    //
    // Types of nodes are distinguished by their node lead unit ranges.
    // After each node, except a final-value node, another node follows to
    // encode match values or continue matching further units.
    //
    // Node types:
    //  - Final-value node: Stores a 32-bit integer in a compact, variable-length format.
    //    The value is for the string/char16_t sequence so far.
    //  - Match node, optionally with an intermediate value in a different compact format.
    //    The value, if present, is for the string/char16_t sequence so far.
    //
    //  Aside from the value, which uses the node lead unit's high bits:
    //
    //  - Linear-match node: Matches a number of units.
    //  - Branch node: Branches to other nodes according to the current input unit.
    //    The node unit is the length of the branch (number of units to select from)
    //    minus 1. It is followed by a sub-node:
    //    - If the length is at most kMaxBranchLinearSubNodeLength, then
    //      there are length-1 (key, value) pairs and then one more comparison unit.
    //      If one of the key units matches, then the value is either a final value for
    //      the string so far, or a "jump" delta to the next node.
    //      If the last unit matches, then matching continues with the next node.
    //      (Values have the same encoding as final-value nodes.)
    //    - If the length is greater than kMaxBranchLinearSubNodeLength, then
    //      there is one unit and one "jump" delta.
    //      If the input unit is less than the sub-node unit, then "jump" by delta to
    //      the next sub-node which will have a length of length/2.
    //      (The delta has its own compact encoding.)
    //      Otherwise, skip the "jump" delta to the next sub-node
    //      which will have a length of length-length/2.

// Match-node lead unit values, after masking off intermediate-value bits:

// 0000..002f: Branch node. If node!=0 then the length is node+1, otherwise
    // the length is one more than the next unit.

// For a branch sub-node with at most this many entries, we drop down
    // to a linear search.
    static const int32_t kMaxBranchLinearSubNodeLength=5;

// 0030..003f: Linear-match node, match 1..16 units and continue reading the next node.
    static const int32_t kMinLinearMatch=0x30;
    static const int32_t kMaxLinearMatchLength=0x10;

// Match-node lead unit bits 14..6 for the optional intermediate value.
    // If these bits are 0, then there is no intermediate value.
    // Otherwise, see the *NodeValue* constants below.
    static const int32_t kMinValueLead=kMinLinearMatch+kMaxLinearMatchLength;  // 0x0040
    static const int32_t kNodeTypeMask=kMinValueLead-1;  // 0x003f

// A final-value node has bit 15 set.
    static const int32_t kValueIsFinal=0x8000;

// Compact value: After testing and masking off bit 15, use the following thresholds.
    static const int32_t kMaxOneUnitValue=0x3fff;

static const int32_t kMinTwoUnitValueLead=kMaxOneUnitValue+1;  // 0x4000
    static const int32_t kThreeUnitValueLead=0x7fff;

static const int32_t kMaxTwoUnitValue=((kThreeUnitValueLead-kMinTwoUnitValueLead)<<16)-1;  // 0x3ffeffff

// Compact intermediate-value integer, lead unit shared with a branch or linear-match node.
    static const int32_t kMaxOneUnitNodeValue=0xff;
    static const int32_t kMinTwoUnitNodeValueLead=kMinValueLead+((kMaxOneUnitNodeValue+1)<<6);  // 0x4040
    static const int32_t kThreeUnitNodeValueLead=0x7fc0;

static const int32_t kMaxTwoUnitNodeValue=
        ((kThreeUnitNodeValueLead-kMinTwoUnitNodeValueLead)<<10)-1;  // 0xfdffff

// Compact delta integers.
    static const int32_t kMaxOneUnitDelta=0xfbff;
    static const int32_t kMinTwoUnitDeltaLead=kMaxOneUnitDelta+1;  // 0xfc00
    static const int32_t kThreeUnitDeltaLead=0xffff;

static const int32_t kMaxTwoUnitDelta=((kThreeUnitDeltaLead-kMinTwoUnitDeltaLead)<<16)-1;  // 0x03feffff

// For getState64():
    // The remainingMatchLength_ is -1..14=(kMaxLinearMatchLength=0x10)-2
    // so we need at least 5 bits for that.
    // We add 2 to store it as a positive value 1..16=kMaxLinearMatchLength.
    static constexpr int32_t kState64RemainingShift = 59;
    static constexpr uint64_t kState64PosMask = (UINT64_C(1) << kState64RemainingShift) - 1;

char16_t *ownedArray_;

// Fixed value referencing the UCharsTrie words.
    const char16_t *uchars_;

// Iterator variables.

// Pointer to next trie unit to read. nullptr if no more matches.
    const char16_t *pos_;
    // Remaining length of a linear-match node, minus 1. Negative if not in such a node.
    int32_t remainingMatchLength_;
};

U_NAMESPACE_END

#endif /* U_SHOW_CPLUSPLUS_API */

#endif  // __UCHARSTRIE_H__