File Manager

X7ROOT File Manager

Current Path: /opt/alt/alt-nodejs22/root/usr/include/unicode

opt / alt / alt-nodejs22 / root / usr / include / unicode /

?? ..
?? alphaindex.h(26.54 KB)
?? appendable.h(8.54 KB)
?? basictz.h(9.99 KB)
?? brkiter.h(27.84 KB)
?? bytestream.h(10.77 KB)
?? bytestrie.h(20.83 KB)
?? bytestriebuilder.h(7.48 KB)
?? calendar.h(107.54 KB)
?? caniter.h(7.53 KB)
?? casemap.h(25.42 KB)
?? char16ptr.h(10.79 KB)
?? chariter.h(23.79 KB)
?? choicfmt.h(23.99 KB)
?? coleitr.h(13.78 KB)
?? coll.h(59.6 KB)
?? compactdecimalformat.h(6.88 KB)
?? curramt.h(3.67 KB)
?? currpinf.h(7.3 KB)
?? currunit.h(4.02 KB)
?? datefmt.h(40.7 KB)
?? dbbi.h(1.19 KB)
?? dcfmtsym.h(20.96 KB)
?? decimfmt.h(87.46 KB)
?? displayoptions.h(7.08 KB)
?? docmain.h(7.6 KB)
?? dtfmtsym.h(38.22 KB)
?? dtintrv.h(3.84 KB)
?? dtitvfmt.h(48.87 KB)
?? dtitvinf.h(18.63 KB)
?? dtptngen.h(28.05 KB)
?? dtrule.h(8.66 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.37 KB)
?? format.h(12.51 KB)
?? formattednumber.h(6.28 KB)
?? formattedvalue.h(9.75 KB)
?? fpositer.h(3.03 KB)
?? gender.h(3.35 KB)
?? gregocal.h(30.32 KB)
?? icudataver.h(1.02 KB)
?? icuplug.h(12.1 KB)
?? idna.h(12.93 KB)
?? listformatter.h(8.59 KB)
?? localebuilder.h(11.08 KB)
?? localematcher.h(26.86 KB)
?? localpointer.h(19.55 KB)
?? locdspnm.h(7.12 KB)
?? locid.h(48.62 KB)
?? measfmt.h(11.41 KB)
?? measunit.h(111.44 KB)
?? measure.h(4.63 KB)
?? messageformat2.h(21.05 KB)
?? messageformat2_arguments.h(4.49 KB)
?? messageformat2_data_model.h(101.89 KB)
?? messageformat2_data_model_names.h(784 B)
?? messageformat2_formattable.h(38.36 KB)
?? messageformat2_function_registry.h(18.07 KB)
?? messagepattern.h(33.79 KB)
?? msgfmt.h(44.2 KB)
?? normalizer2.h(34.68 KB)
?? normlzr.h(30.79 KB)
?? nounit.h(2.24 KB)
?? numberformatter.h(90.69 KB)
?? numberrangeformatter.h(26 KB)
?? numfmt.h(50.16 KB)
?? numsys.h(7.22 KB)
?? parseerr.h(3.08 KB)
?? parsepos.h(5.56 KB)
?? platform.h(27.18 KB)
?? plurfmt.h(25.07 KB)
?? plurrule.h(20.63 KB)
?? ptypes.h(2.16 KB)
?? putil.h(6.32 KB)
?? rbbi.h(32.04 KB)
?? rbnf.h(56.16 KB)
?? rbtz.h(15.75 KB)
?? regex.h(84.45 KB)
?? region.h(9.2 KB)
?? reldatefmt.h(22.48 KB)
?? rep.h(9.38 KB)
?? resbund.h(18.02 KB)
?? schriter.h(6.09 KB)
?? scientificnumberformatter.h(6.44 KB)
?? search.h(22.21 KB)
?? selfmt.h(14.35 KB)
?? simpleformatter.h(12.6 KB)
?? simplenumberformatter.h(8.87 KB)
?? simpletz.h(45.62 KB)
?? smpdtfmt.h(57.06 KB)
?? sortkey.h(11.13 KB)
?? std_string.h(1.05 KB)
?? strenum.h(9.96 KB)
?? stringoptions.h(5.79 KB)
?? stringpiece.h(10.28 KB)
?? stringtriebuilder.h(15.53 KB)
?? stsearch.h(21.43 KB)
?? symtable.h(4.28 KB)
?? tblcoll.h(36.96 KB)
?? timezone.h(45.59 KB)
?? tmunit.h(3.4 KB)
?? tmutamt.h(4.9 KB)
?? tmutfmt.h(7.42 KB)
?? translit.h(65.81 KB)
?? tzfmt.h(42.95 KB)
?? tznames.h(16.85 KB)
?? tzrule.h(34.81 KB)
?? tztrans.h(6.11 KB)
?? ubidi.h(89.61 KB)
?? ubiditransform.h(12.71 KB)
?? ubrk.h(24.43 KB)
?? ucal.h(63.96 KB)
?? ucasemap.h(15.27 KB)
?? ucat.h(5.35 KB)
?? uchar.h(151.74 KB)
?? ucharstrie.h(22.59 KB)
?? ucharstriebuilder.h(7.48 KB)
?? uchriter.h(13.24 KB)
?? uclean.h(11.21 KB)
?? ucnv.h(83.34 KB)
?? ucnv_cb.h(6.58 KB)
?? ucnv_err.h(20.98 KB)
?? ucnvsel.h(6.24 KB)
?? ucol.h(67.28 KB)
?? ucoleitr.h(9.82 KB)
?? uconfig.h(12.56 KB)
?? ucpmap.h(5.54 KB)
?? ucptrie.h(22.51 KB)
?? ucsdet.h(14.69 KB)
?? ucurr.h(16.72 KB)
?? udat.h(62.36 KB)
?? udata.h(15.63 KB)
?? udateintervalformat.h(11.93 KB)
?? udatpg.h(30.13 KB)
?? udisplaycontext.h(5.94 KB)
?? udisplayoptions.h(8.86 KB)
?? uenum.h(7.79 KB)
?? ufieldpositer.h(4.41 KB)
?? uformattable.h(10.97 KB)
?? uformattednumber.h(8.09 KB)
?? uformattedvalue.h(12.25 KB)
?? ugender.h(2.06 KB)
?? uidna.h(34.12 KB)
?? uiter.h(22.75 KB)
?? uldnames.h(10.48 KB)
?? ulistformatter.h(10.78 KB)
?? uloc.h(55.38 KB)
?? ulocale.h(6.31 KB)
?? ulocbuilder.h(16.69 KB)
?? ulocdata.h(11.3 KB)
?? umachine.h(14.59 KB)
?? umisc.h(1.34 KB)
?? umsg.h(24.25 KB)
?? umutablecptrie.h(8.3 KB)
?? unifilt.h(4 KB)
?? unifunct.h(4.05 KB)
?? unimatch.h(6.1 KB)
?? unirepl.h(3.38 KB)
?? uniset.h(70.4 KB)
?? unistr.h(182.08 KB)
?? unorm.h(20.55 KB)
?? unorm2.h(25.66 KB)
?? unum.h(55.16 KB)
?? unumberformatter.h(19.68 KB)
?? unumberoptions.h(5.23 KB)
?? unumberrangeformatter.h(15.35 KB)
?? unumsys.h(7.26 KB)
?? uobject.h(10.66 KB)
?? upluralrules.h(8.79 KB)
?? uregex.h(71.99 KB)
?? uregion.h(9.81 KB)
?? ureldatefmt.h(16.98 KB)
?? urename.h(141.99 KB)
?? urep.h(5.38 KB)
?? ures.h(36.65 KB)
?? uscript.h(28.51 KB)
?? usearch.h(39.21 KB)
?? uset.h(63.08 KB)
?? usetiter.h(9.63 KB)
?? ushape.h(18 KB)
?? usimplenumberformatter.h(7.31 KB)
?? uspoof.h(80 KB)
?? usprep.h(8.19 KB)
?? ustdio.h(38.58 KB)
?? ustream.h(1.89 KB)
?? ustring.h(72.16 KB)
?? ustringtrie.h(3.15 KB)
?? utext.h(58.1 KB)
?? utf.h(7.87 KB)
?? utf16.h(23.35 KB)
?? utf32.h(763 B)
?? utf8.h(30.83 KB)
?? utf_old.h(45.8 KB)
?? utmscale.h(13.78 KB)
?? utrace.h(17.18 KB)
?? utrans.h(25.54 KB)
?? utypes.h(34.48 KB)
?? uvernum.h(6.33 KB)
?? uversion.h(8.21 KB)
?? vtzone.h(20.68 KB)

Editing: 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"

#if U_SHOW_CPLUSPLUS_API

/**
 * \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
    */
    bool                    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
    */
    bool                    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() 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() const;

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

/**
     * 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 nullptr 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 ? static_cast<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();
    /**
    * Resets this CollationKey to an empty state
    * @return this CollationKey
    */
    CollationKey& reset();

/**
    * 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 bool
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 /* U_SHOW_CPLUSPLUS_API */

#endif

X7ROOT File Manager

Editing: sortkey.h

Upload File

Create Folder