File Manager

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

#endif

X7ROOT File Manager

Editing: sortkey.h

Upload File

Create Folder