aDriv4 website!

Linux bois.o2switch.net 4.18.0-553.33.1.lve.el8.x86_64 #1 SMP Tue Dec 24 22:25:00 UTC 2024 x86_64
Apache
109.234.165.180

sortkey.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.
 *****************************************************************************
 *
 * File sortkey.h
 *
 * Created by: Helena Shih
 *
 * Modification History:
 *
 *  Date         Name          Description
 *
 *  6/20/97     helena      Java class name change.
 *  8/18/97     helena      Added internal API documentation.
 *  6/26/98     erm         Changed to use byte arrays and memcmp.
 *****************************************************************************
 */

#ifndef SORTKEY_H
#define SORTKEY_H

#include "unicode/utypes.h"

/**
 * \file 
 * \brief C++ API: Keys for comparing strings multiple times. 
 */
 
#if !UCONFIG_NO_COLLATION

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

U_NAMESPACE_BEGIN

/* forward declaration */
class RuleBasedCollator;
class CollationKeyByteSink;

/**
 *
 * Collation keys are generated by the Collator class. Use the CollationKey objects
 * instead of Collator to compare strings multiple times. A CollationKey
 * preprocesses the comparison information from the Collator object to
 * make the comparison faster. If you are not going to comparing strings
 * multiple times, then using the Collator object is generally faster,
 * since it only processes as much of the string as needed to make a
 * comparison.
 * For example (with strength == tertiary)
 * When comparing "Abernathy" to "Baggins-Smythworthy", Collator
 * only needs to process a couple of characters, while a comparison
 * with CollationKeys will process all of the characters. On the other hand,
 * if you are doing a sort of a number of fields, it is much faster to use
 * CollationKeys, since you will be comparing strings multiple times.
 * Typical use of CollationKeys are in databases, where you store a CollationKey
 * in a hidden field, and use it for sorting or indexing.
 *
 * Example of use:
 * <pre>
 * \code
 * UErrorCode success = U_ZERO_ERROR;
 * Collator* myCollator = Collator::createInstance(success);
 * CollationKey* keys = new CollationKey [3];
 * myCollator->getCollationKey("Tom", keys[0], success );
 * myCollator->getCollationKey("Dick", keys[1], success );
 * myCollator->getCollationKey("Harry", keys[2], success );
 *
 * // Inside body of sort routine, compare keys this way:
 * CollationKey tmp;
 * if(keys[0].compareTo( keys[1] ) > 0 ) {
 * tmp = keys[0]; keys[0] = keys[1]; keys[1] = tmp;
 * }
 * //...
 * \endcode
 * </pre>
 * Because Collator::compare()'s algorithm is complex, it is faster to sort
 * long lists of words by retrieving collation keys with Collator::getCollationKey().
 * You can then cache the collation keys and compare them using CollationKey::compareTo().
 * 
 * Note: <code>Collator</code>s with different Locale,
 * CollationStrength and DecompositionMode settings will return different
 * CollationKeys for the same set of strings. Locales have specific
 * collation rules, and the way in which secondary and tertiary differences
 * are taken into account, for example, will result in different CollationKeys
 * for same strings.
 *

* @see          Collator
 * @see          RuleBasedCollator
 * @version      1.3 12/18/96
 * @author       Helena Shih
 * @stable ICU 2.0
 */
class U_I18N_API CollationKey : public UObject {
public:
    /**
    * This creates an empty collation key based on the null string.  An empty
    * collation key contains no sorting information.  When comparing two empty
    * collation keys, the result is Collator::EQUAL.  Comparing empty collation key
    * with non-empty collation key is always Collator::LESS.
    * @stable ICU 2.0
    */
    CollationKey();

/**
    * Creates a collation key based on the collation key values.
    * @param values the collation key values
    * @param count number of collation key values, including trailing nulls.
    * @stable ICU 2.0
    */
    CollationKey(const  uint8_t*    values,
                int32_t     count);

/**
    * Copy constructor.
    * @param other    the object to be copied.
    * @stable ICU 2.0
    */
    CollationKey(const CollationKey& other);

/**
    * Sort key destructor.
    * @stable ICU 2.0
    */
    virtual ~CollationKey();

/**
    * Assignment operator
    * @param other    the object to be copied.
    * @stable ICU 2.0
    */
    const   CollationKey&   operator=(const CollationKey& other);

/**
    * Compare if two collation keys are the same.
    * @param source the collation key to compare to.
    * @return Returns true if two collation keys are equal, false otherwise.
    * @stable ICU 2.0
    */
    UBool                   operator==(const CollationKey& source) const;

/**
    * Compare if two collation keys are not the same.
    * @param source the collation key to compare to.
    * @return Returns TRUE if two collation keys are different, FALSE otherwise.
    * @stable ICU 2.0
    */
    UBool                   operator!=(const CollationKey& source) const;

/**
    * Test to see if the key is in an invalid state. The key will be in an
    * invalid state if it couldn't allocate memory for some operation.
    * @return Returns TRUE if the key is in an invalid, FALSE otherwise.
    * @stable ICU 2.0
    */
    UBool                   isBogus(void) const;

/**
    * Returns a pointer to the collation key values. The storage is owned
    * by the collation key and the pointer will become invalid if the key
    * is deleted.
    * @param count the output parameter of number of collation key values,
    * including any trailing nulls.
    * @return a pointer to the collation key values.
    * @stable ICU 2.0
    */
    const    uint8_t*       getByteArray(int32_t& count) const;

#ifdef U_USE_COLLATION_KEY_DEPRECATES
    /**
    * Extracts the collation key values into a new array. The caller owns
    * this storage and should free it.
    * @param count the output parameter of number of collation key values,
    * including any trailing nulls.
    * @obsolete ICU 2.6. Use getByteArray instead since this API will be removed in that release.
    */
    uint8_t*                toByteArray(int32_t& count) const;
#endif

#ifndef U_HIDE_DEPRECATED_API 
    /**
    * Convenience method which does a string(bit-wise) comparison of the
    * two collation keys.
    * @param target target collation key to be compared with
    * @return Returns Collator::LESS if sourceKey &lt; targetKey,
    * Collator::GREATER if sourceKey > targetKey and Collator::EQUAL
    * otherwise.
    * @deprecated ICU 2.6 use the overload with error code
    */
    Collator::EComparisonResult compareTo(const CollationKey& target) const;
#endif  /* U_HIDE_DEPRECATED_API */

/**
    * Convenience method which does a string(bit-wise) comparison of the
    * two collation keys.
    * @param target target collation key to be compared with
    * @param status error code
    * @return Returns UCOL_LESS if sourceKey &lt; targetKey,
    * UCOL_GREATER if sourceKey > targetKey and UCOL_EQUAL
    * otherwise.
    * @stable ICU 2.6
    */
    UCollationResult compareTo(const CollationKey& target, UErrorCode &status) const;

/**
 * Creates an integer that is unique to the collation key. NOTE: this
 * is not the same as String.hashCode.
 * Example of use:
 * <pre>
 * . UErrorCode status = U_ZERO_ERROR;
 * . Collator *myCollation = Collator::createInstance(Locale::US, status);
 * . if (U_FAILURE(status)) return;
 * . CollationKey key1, key2;
 * . UErrorCode status1 = U_ZERO_ERROR, status2 = U_ZERO_ERROR;
 * . myCollation->getCollationKey("abc", key1, status1);
 * . if (U_FAILURE(status1)) { delete myCollation; return; }
 * . myCollation->getCollationKey("ABC", key2, status2);
 * . if (U_FAILURE(status2)) { delete myCollation; return; }
 * . // key1.hashCode() != key2.hashCode()
 * </pre>
 * @return the hash value based on the string's collation order.
 * @see UnicodeString#hashCode
 * @stable ICU 2.0
 */
 int32_t hashCode(void) const;

/**
     * ICU "poor man's RTTI", returns a UClassID for the actual class.
     * @stable ICU 2.2
     */
    virtual UClassID getDynamicClassID() const;

/**
     * ICU "poor man's RTTI", returns a UClassID for this class.
     * @stable ICU 2.2
     */
    static UClassID U_EXPORT2 getStaticClassID();

private:
    /**
     * Replaces the current bytes buffer with a new one of newCapacity
     * and copies length bytes from the old buffer to the new one.
     * @return the new buffer, or NULL if the allocation failed
     */
    uint8_t *reallocate(int32_t newCapacity, int32_t length);
    /**
     * Set a new length for a new sort key in the existing fBytes.
     */
    void setLength(int32_t newLength);

uint8_t *getBytes() {
        return (fFlagAndLength >= 0) ? fUnion.fStackBuffer : fUnion.fFields.fBytes;
    }
    const uint8_t *getBytes() const {
        return (fFlagAndLength >= 0) ? fUnion.fStackBuffer : fUnion.fFields.fBytes;
    }
    int32_t getCapacity() const {
        return (fFlagAndLength >= 0) ? (int32_t)sizeof(fUnion) : fUnion.fFields.fCapacity;
    }
    int32_t getLength() const { return fFlagAndLength & 0x7fffffff; }

/**
    * Set the CollationKey to a "bogus" or invalid state
    * @return this CollationKey
    */
    CollationKey&           setToBogus(void);
    /**
    * Resets this CollationKey to an empty state
    * @return this CollationKey
    */
    CollationKey&           reset(void);

/**
    * Allow private access to RuleBasedCollator
    */
    friend  class           RuleBasedCollator;
    friend  class           CollationKeyByteSink;

// Class fields. sizeof(CollationKey) is intended to be 48 bytes
    // on a machine with 64-bit pointers.
    // We use a union to maximize the size of the internal buffer,
    // similar to UnicodeString but not as tight and complex.

// (implicit) *vtable;
    /**
     * Sort key length and flag.
     * Bit 31 is set if the buffer is heap-allocated.
     * Bits 30..0 contain the sort key length.
     */
    int32_t fFlagAndLength;
    /**
    * Unique hash value of this CollationKey.
    * Special value 2 if the key is bogus.
    */
    mutable int32_t fHashCode;
    /**
     * fUnion provides 32 bytes for the internal buffer or for
     * pointer+capacity.
     */
    union StackBufferOrFields {
        /** fStackBuffer is used iff fFlagAndLength>=0, else fFields is used */
        uint8_t fStackBuffer[32];
        struct {
            uint8_t *fBytes;
            int32_t fCapacity;
        } fFields;
    } fUnion;
};

inline UBool
CollationKey::operator!=(const CollationKey& other) const
{
    return !(*this == other);
}

inline UBool
CollationKey::isBogus() const
{
    return fHashCode == 2;  // kBogusHashCode
}

inline const uint8_t*
CollationKey::getByteArray(int32_t &count) const
{
    count = getLength();
    return getBytes();
}

U_NAMESPACE_END

#endif /* #if !UCONFIG_NO_COLLATION */

#endif

Name	Type	Size	Owner/Group	Permission	Last Modified	Actions
.	dir	-	0/0	0755	2024-07-15 04:16:15
..	dir	-	0/0	0755	2024-07-15 04:16:15
alphaindex.h	text/x-c++	26.27 KB	0/0	0644	2019-12-13 01:11:18
appendable.h	text/x-c++	8.43 KB	0/0	0644	2019-12-13 01:11:18
basictz.h	text/x-c++	8.84 KB	0/0	0644	2019-12-13 01:11:18
brkiter.h	text/x-c++	27.54 KB	0/0	0644	2019-12-13 01:11:18
bytestream.h	text/x-c++	9.59 KB	0/0	0644	2019-12-13 01:11:18
bytestrie.h	text/x-c++	19.26 KB	0/0	0644	2019-12-13 01:11:18
bytestriebuilder.h	text/x-c++	7.1 KB	0/0	0644	2019-12-13 01:11:18
calendar.h	text/x-c	105.35 KB	0/0	0644	2019-12-13 01:11:18
caniter.h	text/x-c++	7.35 KB	0/0	0644	2019-12-13 01:11:18
casemap.h	text/x-c++	25.31 KB	0/0	0644	2019-12-13 01:11:18
char16ptr.h	text/x-c++	7.29 KB	0/0	0644	2019-12-13 01:11:18
chariter.h	text/x-c++	24 KB	0/0	0644	2019-12-13 01:11:18
choicfmt.h	text/x-c++	23.85 KB	0/0	0644	2019-12-13 01:11:18
coleitr.h	text/x-c++	13.7 KB	0/0	0644	2019-12-13 01:11:18
coll.h	text/x-c++	55.61 KB	0/0	0644	2019-12-13 01:11:18
compactdecimalformat.h	text/x-c++	16.58 KB	0/0	0644	2019-12-13 01:11:18
curramt.h	text/x-c++	3.69 KB	0/0	0644	2019-12-13 01:11:18
currpinf.h	text/x-c++	7.08 KB	0/0	0644	2019-12-13 01:11:18
currunit.h	text/x-c++	3.49 KB	0/0	0644	2019-12-13 01:11:18
datefmt.h	text/x-c++	40.18 KB	0/0	0644	2019-12-13 01:11:18
dbbi.h	text/x-c	1.11 KB	0/0	0644	2019-12-13 01:11:18
dcfmtsym.h	text/x-c++	17.66 KB	0/0	0644	2019-12-13 01:11:18
decimfmt.h	text/x-c	89.73 KB	0/0	0644	2019-12-13 01:11:18
docmain.h	text/x-tex	6.56 KB	0/0	0644	2019-12-13 01:11:18
dtfmtsym.h	text/x-c++	37.64 KB	0/0	0644	2019-12-13 01:11:18
dtintrv.h	text/x-c++	3.76 KB	0/0	0644	2019-12-13 01:11:18
dtitvfmt.h	text/x-c	42.87 KB	0/0	0644	2019-12-13 01:11:18
dtitvinf.h	text/x-c++	18.46 KB	0/0	0644	2019-12-13 01:11:18
dtptngen.h	text/x-c++	23.72 KB	0/0	0644	2019-12-13 01:11:18
dtrule.h	text/x-c++	8.62 KB	0/0	0644	2019-12-13 01:11:18
edits.h	text/x-c++	15.54 KB	0/0	0644	2019-12-13 01:11:18
enumset.h	text/x-c++	2.05 KB	0/0	0644	2019-12-13 01:11:18
errorcode.h	text/x-c++	4.78 KB	0/0	0644	2019-12-13 01:11:18
fieldpos.h	text/x-c++	8.63 KB	0/0	0644	2019-12-13 01:11:18
filteredbrk.h	text/x-c++	5.46 KB	0/0	0644	2019-12-13 01:11:18
fmtable.h	text/x-c++	24.39 KB	0/0	0644	2019-12-13 01:11:18
format.h	text/x-c++	12.44 KB	0/0	0644	2019-12-13 01:11:18
fpositer.h	text/x-c++	3.14 KB	0/0	0644	2019-12-13 01:11:18
gender.h	text/x-c++	3.18 KB	0/0	0644	2019-12-13 01:11:18
gregocal.h	text/x-c++	31.57 KB	0/0	0644	2019-12-13 01:11:18
icudataver.h	text/x-c	1.03 KB	0/0	0644	2019-12-13 01:11:18
icuplug.h	text/x-c	11.86 KB	0/0	0644	2019-12-13 01:11:18
idna.h	text/x-c++	12.63 KB	0/0	0644	2019-12-13 01:11:18
listformatter.h	text/x-c++	4.98 KB	0/0	0644	2019-12-13 01:11:18
localpointer.h	text/x-c++	16.88 KB	0/0	0644	2019-12-13 01:11:18
locdspnm.h	text/x-c++	7.05 KB	0/0	0644	2019-12-13 01:11:18
locid.h	text/x-c++	31.4 KB	0/0	0644	2019-12-13 01:11:18
measfmt.h	text/x-c++	11.25 KB	0/0	0644	2019-12-13 01:11:18
measunit.h	text/x-c++	37.74 KB	0/0	0644	2019-12-13 01:11:18
measure.h	text/x-c++	4.26 KB	0/0	0644	2019-12-13 01:11:18
messagepattern.h	text/x-c	33.64 KB	0/0	0644	2019-12-13 01:11:18
msgfmt.h	text/x-c	43.16 KB	0/0	0644	2019-12-13 01:11:18
normalizer2.h	text/x-c++	33.97 KB	0/0	0644	2019-12-13 01:11:18
normlzr.h	text/x-c++	30.74 KB	0/0	0644	2019-12-13 01:11:18
nounit.h	text/x-c++	2.6 KB	0/0	0644	2019-12-13 01:11:18
numberformatter.h	text/html	64.98 KB	0/0	0644	2019-12-13 01:11:18
numfmt.h	text/x-c++	47.76 KB	0/0	0644	2019-12-13 01:11:18
numsys.h	text/x-c++	6.73 KB	0/0	0644	2019-12-13 01:11:18
parseerr.h	text/x-c	3.08 KB	0/0	0644	2019-12-13 01:11:18
parsepos.h	text/x-c++	5.45 KB	0/0	0644	2019-12-13 01:11:18
platform.h	text/x-c	27.19 KB	0/0	0644	2019-12-13 01:11:18
plurfmt.h	text/x-c++	25.66 KB	0/0	0644	2019-12-13 01:11:18
plurrule.h	text/x-c++	18.34 KB	0/0	0644	2019-12-13 01:11:18
ptypes.h	text/x-c	3.47 KB	0/0	0644	2019-12-13 01:11:18
putil.h	text/x-c	6.34 KB	0/0	0644	2019-12-13 01:11:18
rbbi.h	text/x-c++	27.09 KB	0/0	0644	2019-12-13 01:11:18
rbnf.h	text/x-c	49.76 KB	0/0	0644	2019-12-13 01:11:18
rbtz.h	text/x-c++	15.47 KB	0/0	0644	2019-12-13 01:11:18
regex.h	text/x-c++	84.91 KB	0/0	0644	2019-12-13 01:11:18
region.h	text/x-c++	9.12 KB	0/0	0644	2019-12-13 01:11:18
reldatefmt.h	text/x-c++	14.3 KB	0/0	0644	2019-12-13 01:11:18
rep.h	text/x-c++	9.5 KB	0/0	0644	2019-12-13 01:11:18
resbund.h	text/x-c++	18.01 KB	0/0	0644	2019-12-13 01:11:18
schriter.h	text/x-c++	6.26 KB	0/0	0644	2019-12-13 01:11:18
scientificnumberformatter.h	text/x-c++	6.59 KB	0/0	0644	2019-12-13 01:11:18
search.h	text/x-c++	22.21 KB	0/0	0644	2019-12-13 01:11:18
selfmt.h	text/x-c++	14.24 KB	0/0	0644	2019-12-13 01:11:18
simpleformatter.h	text/x-c++	11.43 KB	0/0	0644	2019-12-13 01:11:18
simpletz.h	text/x-c++	45.24 KB	0/0	0644	2019-12-13 01:11:18
smpdtfmt.h	text/html	70.09 KB	0/0	0644	2019-12-13 01:11:18
sortkey.h	text/x-c++	11.12 KB	0/0	0644	2019-12-13 01:11:18
std_string.h	text/x-c++	1015 B	0/0	0644	2019-12-13 01:11:18
strenum.h	text/x-c++	10.04 KB	0/0	0644	2019-12-13 01:11:18
stringoptions.h	text/x-c	5.89 KB	0/0	0644	2019-12-13 01:11:18
stringpiece.h	text/x-c++	6.46 KB	0/0	0644	2019-12-13 01:11:18
stringtriebuilder.h	text/x-c++	15.2 KB	0/0	0644	2019-12-13 01:11:18
stsearch.h	text/x-c++	21.29 KB	0/0	0644	2019-12-13 01:11:18
symtable.h	text/x-c++	4.21 KB	0/0	0644	2019-12-13 01:11:18
tblcoll.h	text/x-c++	36.4 KB	0/0	0644	2019-12-13 01:11:18
timezone.h	text/x-c++	40.83 KB	0/0	0644	2019-12-13 01:11:18
tmunit.h	text/x-c++	3.29 KB	0/0	0644	2019-12-13 01:11:18
tmutamt.h	text/x-c++	4.8 KB	0/0	0644	2019-12-13 01:11:18
tmutfmt.h	text/x-c++	7.79 KB	0/0	0644	2019-12-13 01:11:18
translit.h	text/x-c	54.53 KB	0/0	0644	2019-12-13 01:11:18
tzfmt.h	text/x-c	42.81 KB	0/0	0644	2019-12-13 01:11:18
tznames.h	text/x-c++	16.79 KB	0/0	0644	2019-12-13 01:11:18
tzrule.h	text/x-c++	35.32 KB	0/0	0644	2019-12-13 01:11:18
tztrans.h	text/x-c++	6.07 KB	0/0	0644	2019-12-13 01:11:18
ubidi.h	text/html	89.28 KB	0/0	0644	2019-12-13 01:11:18
ubiditransform.h	text/x-c	12.71 KB	0/0	0644	2019-12-13 01:11:18
ubrk.h	text/x-c	24.08 KB	0/0	0644	2019-12-13 01:11:18
ucal.h	text/x-c	54.56 KB	0/0	0644	2019-12-13 01:11:18
ucasemap.h	text/x-c	15.18 KB	0/0	0644	2019-12-13 01:11:18
ucat.h	text/x-c	5.36 KB	0/0	0644	2019-12-13 01:11:18
uchar.h	text/x-c	131.61 KB	0/0	0644	2019-12-13 01:11:18
ucharstrie.h	text/x-c++	21.06 KB	0/0	0644	2019-12-13 01:11:18
ucharstriebuilder.h	text/x-c++	7.14 KB	0/0	0644	2019-12-13 01:11:18
uchriter.h	text/x-c++	13.14 KB	0/0	0644	2019-12-13 01:11:18
uclean.h	text/x-c	11.24 KB	0/0	0644	2019-12-13 01:11:18
ucnv.h	text/html	83.06 KB	0/0	0644	2019-12-13 01:11:18
ucnv_cb.h	text/x-c	6.59 KB	0/0	0644	2019-12-13 01:11:18
ucnv_err.h	text/x-c	20.98 KB	0/0	0644	2019-12-13 01:11:18
ucnvsel.h	text/x-c	6.14 KB	0/0	0644	2019-12-13 01:11:18
ucol.h	text/html	61.36 KB	0/0	0644	2019-12-13 01:11:18
ucoleitr.h	text/x-c	9.46 KB	0/0	0644	2019-12-13 01:11:18
uconfig.h	text/x-c	11.91 KB	0/0	0644	2019-12-13 01:11:18
ucsdet.h	text/x-c	14.67 KB	0/0	0644	2019-12-13 01:11:18
ucurr.h	text/x-c	15.15 KB	0/0	0644	2019-12-13 01:11:18
udat.h	text/x-c	60.13 KB	0/0	0644	2019-12-13 01:11:18
udata.h	text/x-c	15.53 KB	0/0	0644	2019-12-13 01:11:18
udateintervalformat.h	text/x-c	6.79 KB	0/0	0644	2019-12-13 01:11:18
udatpg.h	text/x-c	24.11 KB	0/0	0644	2019-12-13 01:11:18
udisplaycontext.h	text/x-c	5.89 KB	0/0	0644	2019-12-13 01:11:18
uenum.h	text/x-c	7.9 KB	0/0	0644	2019-12-13 01:11:18
ufieldpositer.h	text/x-c	4.36 KB	0/0	0644	2019-12-13 01:11:18
uformattable.h	text/x-c	10.94 KB	0/0	0644	2019-12-13 01:11:18
ugender.h	text/x-c	2 KB	0/0	0644	2019-12-13 01:11:18
uidna.h	text/x-c	33.37 KB	0/0	0644	2019-12-13 01:11:18
uiter.h	text/x-c	22.77 KB	0/0	0644	2019-12-13 01:11:18
uldnames.h	text/x-c	10.45 KB	0/0	0644	2019-12-13 01:11:18
ulistformatter.h	text/x-c	4.54 KB	0/0	0644	2019-12-13 01:11:18
uloc.h	text/html	50.75 KB	0/0	0644	2019-12-13 01:11:18
ulocdata.h	text/x-c	11.26 KB	0/0	0644	2019-12-13 01:11:18
umachine.h	text/x-c	13.1 KB	0/0	0644	2019-12-13 01:11:18
umisc.h	text/x-c	1.33 KB	0/0	0644	2019-12-13 01:11:18
umsg.h	text/x-c	24.23 KB	0/0	0644	2019-12-13 01:11:18
unifilt.h	text/x-c++	3.63 KB	0/0	0644	2019-12-13 01:11:18
unifunct.h	text/x-c++	3.98 KB	0/0	0644	2019-12-13 01:11:18
unimatch.h	text/x-c++	6.04 KB	0/0	0644	2019-12-13 01:11:18
unirepl.h	text/x-c++	3.32 KB	0/0	0644	2019-12-13 01:11:18
uniset.h	text/x-c	63.98 KB	0/0	0644	2019-12-13 01:11:18
unistr.h	text/x-c	175.58 KB	0/0	0644	2019-12-13 01:11:18
unorm.h	text/html	20.45 KB	0/0	0644	2019-12-13 01:11:18
unorm2.h	text/x-c	24.66 KB	0/0	0644	2019-12-13 01:11:18
unum.h	text/x-c	52.49 KB	0/0	0644	2019-12-13 01:11:18
unumsys.h	text/x-c	7.14 KB	0/0	0644	2019-12-13 01:11:18
uobject.h	text/x-c++	10.72 KB	0/0	0644	2019-12-13 01:11:18
upluralrules.h	text/x-c	6.77 KB	0/0	0644	2019-12-13 01:11:18
uregex.h	text/x-c	72.05 KB	0/0	0644	2019-12-13 01:11:18
uregion.h	text/x-c	9.84 KB	0/0	0644	2019-12-13 01:11:18
ureldatefmt.h	text/x-c	12.22 KB	0/0	0644	2019-12-13 01:11:18
urename.h	text/x-c	124.49 KB	0/0	0644	2019-12-13 01:11:18
urep.h	text/x-c	5.38 KB	0/0	0644	2019-12-13 01:11:18
ures.h	text/html	36.52 KB	0/0	0644	2019-12-13 01:11:18
uscript.h	text/x-c	25.91 KB	0/0	0644	2019-12-13 01:11:18
usearch.h	text/html	38.14 KB	0/0	0644	2019-12-13 01:11:18
uset.h	text/x-c	39.91 KB	0/0	0644	2019-12-13 01:11:18
usetiter.h	text/x-c++	9.49 KB	0/0	0644	2019-12-13 01:11:18
ushape.h	text/x-c	18 KB	0/0	0644	2019-12-13 01:11:18
uspoof.h	text/html	64.9 KB	0/0	0644	2019-12-13 01:11:18
usprep.h	text/x-c	8.13 KB	0/0	0644	2019-12-13 01:11:18
ustdio.h	text/x-c	38.54 KB	0/0	0644	2019-12-13 01:11:18
ustream.h	text/x-c++	1.8 KB	0/0	0644	2019-12-13 01:11:18
ustring.h	text/x-c	72.52 KB	0/0	0644	2019-12-13 01:11:18
ustringtrie.h	text/x-c	3.15 KB	0/0	0644	2019-12-13 01:11:18
utext.h	text/x-c	58.11 KB	0/0	0644	2019-12-13 01:11:18
utf.h	text/x-c	7.86 KB	0/0	0644	2019-12-13 01:11:18
utf16.h	text/x-c	22.49 KB	0/0	0644	2019-12-13 01:11:18
utf32.h	text/plain	763 B	0/0	0644	2019-12-13 01:11:18
utf8.h	text/x-c	28.16 KB	0/0	0644	2019-12-13 01:11:18
utf_old.h	text/x-c	43.78 KB	0/0	0644	2019-12-13 01:11:18
utmscale.h	text/x-c	13.78 KB	0/0	0644	2019-12-13 01:11:18
utrace.h	text/x-c	13.89 KB	0/0	0644	2019-12-13 01:11:18
utrans.h	text/x-c	25.53 KB	0/0	0644	2019-12-13 01:11:18
utypes.h	text/x-c	29.92 KB	0/0	0644	2019-12-13 01:11:18
uvernum.h	text/x-c	5.69 KB	0/0	0644	2019-12-13 01:11:18
uversion.h	text/x-c	6.4 KB	0/0	0644	2019-12-13 01:11:18
vtzone.h	text/x-c++	20.17 KB	0/0	0644	2019-12-13 01:11:18

For more Private tool come to me!

https://t.me/aDriv4vz