X7ROOT File Manager
Current Path:
/opt/alt/libicu65/usr/include/unicode
opt
/
alt
/
libicu65
/
usr
/
include
/
unicode
/
??
..
??
alphaindex.h
(26.48 KB)
??
appendable.h
(8.49 KB)
??
basictz.h
(9.15 KB)
??
brkiter.h
(27.8 KB)
??
bytestream.h
(9.6 KB)
??
bytestrie.h
(20.77 KB)
??
bytestriebuilder.h
(7.08 KB)
??
calendar.h
(105.74 KB)
??
caniter.h
(7.43 KB)
??
casemap.h
(25.33 KB)
??
char16ptr.h
(7.22 KB)
??
chariter.h
(24.05 KB)
??
choicfmt.h
(23.91 KB)
??
coleitr.h
(13.76 KB)
??
coll.h
(56.23 KB)
??
compactdecimalformat.h
(6.88 KB)
??
curramt.h
(3.76 KB)
??
currpinf.h
(7.3 KB)
??
currunit.h
(4.05 KB)
??
datefmt.h
(40.67 KB)
??
dbbi.h
(1.19 KB)
??
dcfmtsym.h
(20.13 KB)
??
decimfmt.h
(87.38 KB)
??
docmain.h
(6.97 KB)
??
dtfmtsym.h
(37.7 KB)
??
dtintrv.h
(3.84 KB)
??
dtitvfmt.h
(46.63 KB)
??
dtitvinf.h
(18.51 KB)
??
dtptngen.h
(25.08 KB)
??
dtrule.h
(8.68 KB)
??
edits.h
(20.74 KB)
??
enumset.h
(2.08 KB)
??
errorcode.h
(4.84 KB)
??
fieldpos.h
(8.69 KB)
??
filteredbrk.h
(5.37 KB)
??
fmtable.h
(24.42 KB)
??
format.h
(12.5 KB)
??
formattedvalue.h
(10.27 KB)
??
fpositer.h
(3.04 KB)
??
gender.h
(3.33 KB)
??
gregocal.h
(31.71 KB)
??
icudataver.h
(1.03 KB)
??
icuplug.h
(11.88 KB)
??
idna.h
(12.7 KB)
??
listformatter.h
(9.47 KB)
??
localebuilder.h
(11.27 KB)
??
localematcher.h
(22.5 KB)
??
localpointer.h
(19.69 KB)
??
locdspnm.h
(7.12 KB)
??
locid.h
(47.4 KB)
??
measfmt.h
(11.33 KB)
??
measunit.h
(93.31 KB)
??
measure.h
(4.32 KB)
??
messagepattern.h
(33.71 KB)
??
msgfmt.h
(44.11 KB)
??
normalizer2.h
(34.03 KB)
??
normlzr.h
(30.94 KB)
??
nounit.h
(2.69 KB)
??
numberformatter.h
(86.31 KB)
??
numberrangeformatter.h
(30.14 KB)
??
numfmt.h
(49.81 KB)
??
numsys.h
(7.19 KB)
??
parseerr.h
(3.08 KB)
??
parsepos.h
(5.56 KB)
??
platform.h
(28.08 KB)
??
plurfmt.h
(25.2 KB)
??
plurrule.h
(18.39 KB)
??
ptypes.h
(3.49 KB)
??
putil.h
(6.33 KB)
??
rbbi.h
(26.58 KB)
??
rbnf.h
(48.73 KB)
??
rbtz.h
(15.6 KB)
??
regex.h
(84.36 KB)
??
region.h
(9.18 KB)
??
reldatefmt.h
(22.62 KB)
??
rep.h
(9.37 KB)
??
resbund.h
(18.07 KB)
??
schriter.h
(6.32 KB)
??
scientificnumberformatter.h
(6.4 KB)
??
search.h
(22.22 KB)
??
selfmt.h
(14.3 KB)
??
simpleformatter.h
(12.59 KB)
??
simpletz.h
(45.44 KB)
??
smpdtfmt.h
(70.97 KB)
??
sortkey.h
(11.18 KB)
??
std_string.h
(1.05 KB)
??
strenum.h
(9.92 KB)
??
stringoptions.h
(5.79 KB)
??
stringpiece.h
(7.38 KB)
??
stringtriebuilder.h
(15.33 KB)
??
stsearch.h
(21.3 KB)
??
symtable.h
(4.27 KB)
??
tblcoll.h
(36.61 KB)
??
timezone.h
(41.02 KB)
??
tmunit.h
(3.38 KB)
??
tmutamt.h
(4.9 KB)
??
tmutfmt.h
(7.85 KB)
??
translit.h
(65.82 KB)
??
tzfmt.h
(42.89 KB)
??
tznames.h
(16.85 KB)
??
tzrule.h
(35.37 KB)
??
tztrans.h
(6.12 KB)
??
ubidi.h
(89.56 KB)
??
ubiditransform.h
(12.65 KB)
??
ubrk.h
(23.97 KB)
??
ucal.h
(56.9 KB)
??
ucasemap.h
(15.18 KB)
??
ucat.h
(5.36 KB)
??
uchar.h
(140.56 KB)
??
ucharstrie.h
(22.58 KB)
??
ucharstriebuilder.h
(7.21 KB)
??
uchriter.h
(13.2 KB)
??
uclean.h
(11.21 KB)
??
ucnv.h
(83.09 KB)
??
ucnv_cb.h
(6.59 KB)
??
ucnv_err.h
(20.99 KB)
??
ucnvsel.h
(6.14 KB)
??
ucol.h
(61.46 KB)
??
ucoleitr.h
(9.46 KB)
??
uconfig.h
(12.07 KB)
??
ucpmap.h
(5.53 KB)
??
ucptrie.h
(22.46 KB)
??
ucsdet.h
(14.67 KB)
??
ucurr.h
(16.12 KB)
??
udat.h
(60.88 KB)
??
udata.h
(15.56 KB)
??
udateintervalformat.h
(10.03 KB)
??
udatpg.h
(26.01 KB)
??
udisplaycontext.h
(5.89 KB)
??
uenum.h
(7.78 KB)
??
ufieldpositer.h
(4.36 KB)
??
uformattable.h
(10.94 KB)
??
uformattedvalue.h
(12.14 KB)
??
ugender.h
(2 KB)
??
uidna.h
(33.37 KB)
??
uiter.h
(22.77 KB)
??
uldnames.h
(10.45 KB)
??
ulistformatter.h
(8.83 KB)
??
uloc.h
(52.54 KB)
??
ulocdata.h
(11.26 KB)
??
umachine.h
(14.53 KB)
??
umisc.h
(1.33 KB)
??
umsg.h
(24.23 KB)
??
umutablecptrie.h
(8.24 KB)
??
unifilt.h
(3.96 KB)
??
unifunct.h
(4.04 KB)
??
unimatch.h
(6.1 KB)
??
unirepl.h
(3.38 KB)
??
uniset.h
(64.9 KB)
??
unistr.h
(170.43 KB)
??
unorm.h
(20.52 KB)
??
unorm2.h
(24.66 KB)
??
unum.h
(53.62 KB)
??
unumberformatter.h
(25.36 KB)
??
unumsys.h
(7.21 KB)
??
uobject.h
(10.68 KB)
??
upluralrules.h
(7.88 KB)
??
uregex.h
(72.05 KB)
??
uregion.h
(9.84 KB)
??
ureldatefmt.h
(17.26 KB)
??
urename.h
(130.97 KB)
??
urep.h
(5.38 KB)
??
ures.h
(36.54 KB)
??
uscript.h
(26.87 KB)
??
usearch.h
(38.12 KB)
??
uset.h
(40 KB)
??
usetiter.h
(9.55 KB)
??
ushape.h
(18 KB)
??
uspoof.h
(65.9 KB)
??
usprep.h
(8.14 KB)
??
ustdio.h
(38.54 KB)
??
ustream.h
(1.89 KB)
??
ustring.h
(72.47 KB)
??
ustringtrie.h
(3.15 KB)
??
utext.h
(58.13 KB)
??
utf.h
(7.86 KB)
??
utf16.h
(23.32 KB)
??
utf32.h
(763 B)
??
utf8.h
(30.96 KB)
??
utf_old.h
(45.83 KB)
??
utmscale.h
(13.78 KB)
??
utrace.h
(15.73 KB)
??
utrans.h
(25.52 KB)
??
utypes.h
(30.74 KB)
??
uvernum.h
(6.67 KB)
??
uversion.h
(6 KB)
??
vtzone.h
(20.3 KB)
Editing: caniter.h
// © 2016 and later: Unicode, Inc. and others. // License & terms of use: http://www.unicode.org/copyright.html /* ******************************************************************************* * Copyright (C) 1996-2014, International Business Machines Corporation and * others. All Rights Reserved. ******************************************************************************* */ #ifndef CANITER_H #define CANITER_H #include "unicode/utypes.h" #if U_SHOW_CPLUSPLUS_API #if !UCONFIG_NO_NORMALIZATION #include "unicode/uobject.h" #include "unicode/unistr.h" /** * \file * \brief C++ API: Canonical Iterator */ /** Should permutation skip characters with combining class zero * Should be either TRUE or FALSE. This is a compile time option * @stable ICU 2.4 */ #ifndef CANITER_SKIP_ZEROES #define CANITER_SKIP_ZEROES TRUE #endif U_NAMESPACE_BEGIN class Hashtable; class Normalizer2; class Normalizer2Impl; /** * This class allows one to iterate through all the strings that are canonically equivalent to a given * string. For example, here are some sample results: Results for: {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D}{COMBINING DOT ABOVE}{COMBINING CEDILLA} 1: \\u0041\\u030A\\u0064\\u0307\\u0327 = {LATIN CAPITAL LETTER A}{COMBINING RING ABOVE}{LATIN SMALL LETTER D}{COMBINING DOT ABOVE}{COMBINING CEDILLA} 2: \\u0041\\u030A\\u0064\\u0327\\u0307 = {LATIN CAPITAL LETTER A}{COMBINING RING ABOVE}{LATIN SMALL LETTER D}{COMBINING CEDILLA}{COMBINING DOT ABOVE} 3: \\u0041\\u030A\\u1E0B\\u0327 = {LATIN CAPITAL LETTER A}{COMBINING RING ABOVE}{LATIN SMALL LETTER D WITH DOT ABOVE}{COMBINING CEDILLA} 4: \\u0041\\u030A\\u1E11\\u0307 = {LATIN CAPITAL LETTER A}{COMBINING RING ABOVE}{LATIN SMALL LETTER D WITH CEDILLA}{COMBINING DOT ABOVE} 5: \\u00C5\\u0064\\u0307\\u0327 = {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D}{COMBINING DOT ABOVE}{COMBINING CEDILLA} 6: \\u00C5\\u0064\\u0327\\u0307 = {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D}{COMBINING CEDILLA}{COMBINING DOT ABOVE} 7: \\u00C5\\u1E0B\\u0327 = {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D WITH DOT ABOVE}{COMBINING CEDILLA} 8: \\u00C5\\u1E11\\u0307 = {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D WITH CEDILLA}{COMBINING DOT ABOVE} 9: \\u212B\\u0064\\u0307\\u0327 = {ANGSTROM SIGN}{LATIN SMALL LETTER D}{COMBINING DOT ABOVE}{COMBINING CEDILLA} 10: \\u212B\\u0064\\u0327\\u0307 = {ANGSTROM SIGN}{LATIN SMALL LETTER D}{COMBINING CEDILLA}{COMBINING DOT ABOVE} 11: \\u212B\\u1E0B\\u0327 = {ANGSTROM SIGN}{LATIN SMALL LETTER D WITH DOT ABOVE}{COMBINING CEDILLA} 12: \\u212B\\u1E11\\u0307 = {ANGSTROM SIGN}{LATIN SMALL LETTER D WITH CEDILLA}{COMBINING DOT ABOVE} *<br>Note: the code is intended for use with small strings, and is not suitable for larger ones, * since it has not been optimized for that situation. * Note, CanonicalIterator is not intended to be subclassed. * @author M. Davis * @author C++ port by V. Weinstein * @stable ICU 2.4 */ class U_COMMON_API CanonicalIterator U_FINAL : public UObject { public: /** * Construct a CanonicalIterator object * @param source string to get results for * @param status Fill-in parameter which receives the status of this operation. * @stable ICU 2.4 */ CanonicalIterator(const UnicodeString &source, UErrorCode &status); /** Destructor * Cleans pieces * @stable ICU 2.4 */ virtual ~CanonicalIterator(); /** * Gets the NFD form of the current source we are iterating over. * @return gets the source: NOTE: it is the NFD form of source * @stable ICU 2.4 */ UnicodeString getSource(); /** * Resets the iterator so that one can start again from the beginning. * @stable ICU 2.4 */ void reset(); /** * Get the next canonically equivalent string. * <br><b>Warning: The strings are not guaranteed to be in any particular order.</b> * @return the next string that is canonically equivalent. A bogus string is returned when * the iteration is done. * @stable ICU 2.4 */ UnicodeString next(); /** * Set a new source for this iterator. Allows object reuse. * @param newSource the source string to iterate against. This allows the same iterator to be used * while changing the source string, saving object creation. * @param status Fill-in parameter which receives the status of this operation. * @stable ICU 2.4 */ void setSource(const UnicodeString &newSource, UErrorCode &status); #ifndef U_HIDE_INTERNAL_API /** * Dumb recursive implementation of permutation. * TODO: optimize * @param source the string to find permutations for * @param skipZeros determine if skip zeros * @param result the results in a set. * @param status Fill-in parameter which receives the status of this operation. * @internal */ static void U_EXPORT2 permute(UnicodeString &source, UBool skipZeros, Hashtable *result, UErrorCode &status); #endif /* U_HIDE_INTERNAL_API */ /** * ICU "poor man's RTTI", returns a UClassID for this class. * * @stable ICU 2.2 */ static UClassID U_EXPORT2 getStaticClassID(); /** * ICU "poor man's RTTI", returns a UClassID for the actual class. * * @stable ICU 2.2 */ virtual UClassID getDynamicClassID() const; private: // ===================== PRIVATES ============================== // private default constructor CanonicalIterator(); /** * Copy constructor. Private for now. * @internal (private) */ CanonicalIterator(const CanonicalIterator& other); /** * Assignment operator. Private for now. * @internal (private) */ CanonicalIterator& operator=(const CanonicalIterator& other); // fields UnicodeString source; UBool done; // 2 dimensional array holds the pieces of the string with // their different canonically equivalent representations UnicodeString **pieces; int32_t pieces_length; int32_t *pieces_lengths; // current is used in iterating to combine pieces int32_t *current; int32_t current_length; // transient fields UnicodeString buffer; const Normalizer2 &nfd; const Normalizer2Impl &nfcImpl; // we have a segment, in NFD. Find all the strings that are canonically equivalent to it. UnicodeString *getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status); //private String[] getEquivalents(String segment) //Set getEquivalents2(String segment); Hashtable *getEquivalents2(Hashtable *fillinResult, const char16_t *segment, int32_t segLen, UErrorCode &status); //Hashtable *getEquivalents2(const UnicodeString &segment, int32_t segLen, UErrorCode &status); /** * See if the decomposition of cp2 is at segment starting at segmentPos * (with canonical rearrangment!) * If so, take the remainder, and return the equivalents */ //Set extract(int comp, String segment, int segmentPos, StringBuffer buffer); Hashtable *extract(Hashtable *fillinResult, UChar32 comp, const char16_t *segment, int32_t segLen, int32_t segmentPos, UErrorCode &status); //Hashtable *extract(UChar32 comp, const UnicodeString &segment, int32_t segLen, int32_t segmentPos, UErrorCode &status); void cleanPieces(); }; U_NAMESPACE_END #endif /* #if !UCONFIG_NO_NORMALIZATION */ #endif /* U_SHOW_CPLUSPLUS_API */ #endif
Upload File
Create Folder