Gecko [ www.finalhopeacademy.com ]

Name	Size	Permission
alphaindex.h	25.29 KB	-rw-r--r--
appendable.h	8.38 KB	-rw-r--r--
basictz.h	8.77 KB	-rw-r--r--
bms.h	8.68 KB	-rw-r--r--
bmsearch.h	7.33 KB	-rw-r--r--
brkiter.h	24.24 KB	-rw-r--r--
bytestream.h	9.16 KB	-rw-r--r--
bytestrie.h	19.19 KB	-rw-r--r--
bytestriebuilder.h	6.73 KB	-rw-r--r--
calendar.h	102.76 KB	-rw-r--r--
caniter.h	7.23 KB	-rw-r--r--
chariter.h	23.71 KB	-rw-r--r--
choicfmt.h	27.82 KB	-rw-r--r--
coleitr.h	12.69 KB	-rw-r--r--
coll.h	53.44 KB	-rw-r--r--
colldata.h	12.42 KB	-rw-r--r--
curramt.h	3.57 KB	-rw-r--r--
currpinf.h	6.93 KB	-rw-r--r--
currunit.h	2.99 KB	-rw-r--r--
datefmt.h	33.67 KB	-rw-r--r--
dbbi.h	966 B	-rw-r--r--
dcfmtsym.h	14.91 KB	-rw-r--r--
decimfmt.h	97.38 KB	-rw-r--r--
docmain.h	6.28 KB	-rw-r--r--
dtfmtsym.h	30.27 KB	-rw-r--r--
dtintrv.h	3.65 KB	-rw-r--r--
dtitvfmt.h	39.24 KB	-rw-r--r--
dtitvinf.h	18.56 KB	-rw-r--r--
dtptngen.h	19.54 KB	-rw-r--r--
dtrule.h	8.51 KB	-rw-r--r--
enumset.h	1.8 KB	-rw-r--r--
errorcode.h	4.67 KB	-rw-r--r--
fieldpos.h	8.51 KB	-rw-r--r--
fmtable.h	22.09 KB	-rw-r--r--
format.h	12.33 KB	-rw-r--r--
fpositer.h	2.97 KB	-rw-r--r--
gender.h	3.02 KB	-rw-r--r--
gregocal.h	33.28 KB	-rw-r--r--
icudataver.h	990 B	-rw-r--r--
icuplug.h	11.49 KB	-rw-r--r--
idna.h	12.68 KB	-rw-r--r--
listformatter.h	3.97 KB	-rw-r--r--
localpointer.h	9.13 KB	-rw-r--r--
locdspnm.h	7.14 KB	-rw-r--r--
locid.h	30.48 KB	-rw-r--r--
measfmt.h	1.94 KB	-rw-r--r--
measunit.h	1.6 KB	-rw-r--r--
measure.h	3.24 KB	-rw-r--r--
messagepattern.h	33.6 KB	-rw-r--r--
msgfmt.h	43.59 KB	-rw-r--r--
normalizer2.h	28.34 KB	-rw-r--r--
normlzr.h	29.26 KB	-rw-r--r--
numfmt.h	43.59 KB	-rw-r--r--
numsys.h	5.37 KB	-rw-r--r--
parseerr.h	2.97 KB	-rw-r--r--
parsepos.h	5.34 KB	-rw-r--r--
platform.h	24.23 KB	-rw-r--r--
plurfmt.h	24.58 KB	-rw-r--r--
plurrule.h	14.56 KB	-rw-r--r--
ptypes.h	3.36 KB	-rw-r--r--
putil.h	5.61 KB	-rw-r--r--
rbbi.h	29.15 KB	-rw-r--r--
rbnf.h	45.32 KB	-rw-r--r--
rbtz.h	15.33 KB	-rw-r--r--
regex.h	83.1 KB	-rw-r--r--
rep.h	9.33 KB	-rw-r--r--
resbund.h	17.89 KB	-rw-r--r--
schriter.h	6.15 KB	-rw-r--r--
search.h	22.1 KB	-rw-r--r--
selfmt.h	14.13 KB	-rw-r--r--
simpletz.h	45.1 KB	-rw-r--r--
smpdtfmt.h	57.58 KB	-rw-r--r--
sortkey.h	10.98 KB	-rw-r--r--
std_string.h	783 B	-rw-r--r--
strenum.h	9.92 KB	-rw-r--r--
stringpiece.h	6.38 KB	-rw-r--r--
stringtriebuilder.h	14.75 KB	-rw-r--r--
stsearch.h	21.76 KB	-rw-r--r--
symtable.h	4.1 KB	-rw-r--r--
tblcoll.h	34.23 KB	-rw-r--r--
timezone.h	37.28 KB	-rw-r--r--
tmunit.h	3.39 KB	-rw-r--r--
tmutamt.h	4.69 KB	-rw-r--r--
tmutfmt.h	8.51 KB	-rw-r--r--
translit.h	53.76 KB	-rw-r--r--
tzfmt.h	32.06 KB	-rw-r--r--
tznames.h	14.83 KB	-rw-r--r--
tzrule.h	35.21 KB	-rw-r--r--
tztrans.h	5.96 KB	-rw-r--r--
ubidi.h	88.57 KB	-rw-r--r--
ubrk.h	19.13 KB	-rw-r--r--
ucal.h	50.49 KB	-rw-r--r--
ucasemap.h	16.45 KB	-rw-r--r--
ucat.h	5.25 KB	-rw-r--r--
uchar.h	115.43 KB	-rw-r--r--
ucharstrie.h	20.8 KB	-rw-r--r--
ucharstriebuilder.h	6.83 KB	-rw-r--r--
uchriter.h	12.82 KB	-rw-r--r--
uclean.h	10.38 KB	-rw-r--r--
ucnv.h	82.6 KB	-rw-r--r--
ucnv_cb.h	6.48 KB	-rw-r--r--
ucnv_err.h	20.87 KB	-rw-r--r--
ucnvsel.h	6.03 KB	-rw-r--r--
ucol.h	57.93 KB	-rw-r--r--
ucoleitr.h	12.25 KB	-rw-r--r--
uconfig.h	10.79 KB	-rw-r--r--
ucsdet.h	12.6 KB	-rw-r--r--
ucurr.h	12.96 KB	-rw-r--r--
udat.h	46.47 KB	-rw-r--r--
udata.h	14.81 KB	-rw-r--r--
udateintervalformat.h	6.5 KB	-rw-r--r--
udatpg.h	23.24 KB	-rw-r--r--
udisplaycontext.h	4.34 KB	-rw-r--r--
uenum.h	7.79 KB	-rw-r--r--
ugender.h	1.85 KB	-rw-r--r--
uidna.h	32.81 KB	-rw-r--r--
uiter.h	22.67 KB	-rw-r--r--
uldnames.h	10.5 KB	-rw-r--r--
uloc.h	44.07 KB	-rw-r--r--
ulocdata.h	10.37 KB	-rw-r--r--
umachine.h	10.23 KB	-rw-r--r--
umisc.h	1.23 KB	-rw-r--r--
umsg.h	24.12 KB	-rw-r--r--
unifilt.h	3.52 KB	-rw-r--r--
unifunct.h	3.87 KB	-rw-r--r--
unimatch.h	5.93 KB	-rw-r--r--
unirepl.h	3.21 KB	-rw-r--r--
uniset.h	63.07 KB	-rw-r--r--
unistr.h	164.33 KB	-rw-r--r--
unorm.h	22.89 KB	-rw-r--r--
unorm2.h	21.91 KB	-rw-r--r--
unum.h	39.21 KB	-rw-r--r--
uobject.h	12.21 KB	-rw-r--r--
upluralrules.h	4.47 KB	-rw-r--r--
uregex.h	71.47 KB	-rw-r--r--
urename.h	120.88 KB	-rw-r--r--
urep.h	5.27 KB	-rw-r--r--
ures.h	35.92 KB	-rw-r--r--
uscript.h	20.46 KB	-rw-r--r--
usearch.h	36.09 KB	-rw-r--r--
uset.h	39.45 KB	-rw-r--r--
usetiter.h	9.38 KB	-rw-r--r--
ushape.h	17.89 KB	-rw-r--r--
uspoof.h	38.91 KB	-rw-r--r--
usprep.h	8.02 KB	-rw-r--r--
ustdio.h	37.05 KB	-rw-r--r--
ustream.h	1.6 KB	-rw-r--r--
ustring.h	73.01 KB	-rw-r--r--
ustringtrie.h	3.04 KB	-rw-r--r--
utext.h	57.97 KB	-rw-r--r--
utf.h	7.64 KB	-rw-r--r--
utf16.h	18.24 KB	-rw-r--r--
utf32.h	653 B	-rw-r--r--
utf8.h	23.02 KB	-rw-r--r--
utf_old.h	42.5 KB	-rw-r--r--
utmscale.h	13.37 KB	-rw-r--r--
utrace.h	13.09 KB	-rw-r--r--
utrans.h	23.08 KB	-rw-r--r--
utypes.h	30.72 KB	-rw-r--r--
uvernum.h	5.53 KB	-rw-r--r--
uversion.h	6.29 KB	-rw-r--r--
vtzone.h	20.09 KB	-rw-r--r--

Code Editor : sortkey.h

/*
 *****************************************************************************
 * Copyright (C) 1996-2012, 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
#ifndef U_HIDE_DEPRECATED_API

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

U_NAMESPACE_BEGIN

/* forward declaration */
class RuleBasedCollator;

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

/**
    * 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;

/**
    * 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  /* U_HIDE_DEPRECATED_API */
#endif /* #if !UCONFIG_NO_COLLATION */

#endif

${this.title}

Code Editor : sortkey.h