golden hour

/opt/alt/libicu/usr/include/unicode

File/Folder	Size	Actions
alphaindex.h	26.42 KB
appendable.h	8.43 KB
basictz.h	8.84 KB
brkiter.h	27.53 KB
bytestream.h	9.54 KB
bytestrie.h	19.26 KB
bytestriebuilder.h	7.02 KB
calendar.h	105.06 KB
caniter.h	7.37 KB
casemap.h	25.26 KB
char16ptr.h	7.16 KB
chariter.h	24 KB
choicfmt.h	23.85 KB
coleitr.h	13.7 KB
coll.h	55.59 KB
compactdecimalformat.h	6.81 KB
curramt.h	3.69 KB
currpinf.h	7.24 KB
currunit.h	3.52 KB
datefmt.h	40.37 KB
dbbi.h	1.11 KB
dcfmtsym.h	20.1 KB
decimfmt.h	86.4 KB
docmain.h	6.72 KB
dtfmtsym.h	37.64 KB
dtintrv.h	3.76 KB
dtitvfmt.h	42.87 KB
dtitvinf.h	18.46 KB
dtptngen.h	25.03 KB
dtrule.h	8.62 KB
edits.h	20.67 KB
enumset.h	2.08 KB
errorcode.h	4.78 KB
fieldpos.h	8.63 KB
filteredbrk.h	5.24 KB
fmtable.h	24.36 KB
format.h	12.44 KB
fpositer.h	2.98 KB
gender.h	3.27 KB
gregocal.h	31.57 KB
icudataver.h	1.03 KB
icuplug.h	11.88 KB
idna.h	12.63 KB
listformatter.h	6.18 KB
localpointer.h	16.88 KB
locdspnm.h	7.05 KB
locid.h	44.92 KB
measfmt.h	12.01 KB
measunit.h	38.5 KB
measure.h	4.26 KB
messagepattern.h	33.65 KB
msgfmt.h	43.36 KB
normalizer2.h	33.97 KB
normlzr.h	30.74 KB
nounit.h	2.63 KB
numberformatter.h	87.07 KB
numberrangeformatter.h	28.74 KB
numfmt.h	49.14 KB
numsys.h	6.73 KB
parseerr.h	3.08 KB
parsepos.h	5.45 KB
platform.h	27.1 KB
plurfmt.h	25.18 KB
plurrule.h	17.42 KB
ptypes.h	3.49 KB
putil.h	6.33 KB
rbbi.h	26.41 KB
rbnf.h	49.79 KB
rbtz.h	15.47 KB
regex.h	84.91 KB
region.h	9.12 KB
reldatefmt.h	14.46 KB
rep.h	9.5 KB
resbund.h	18.01 KB
schriter.h	6.26 KB
scientificnumberformatter.h	6.32 KB
search.h	22.21 KB
selfmt.h	14.24 KB
simpleformatter.h	11.43 KB
simpletz.h	45.3 KB
smpdtfmt.h	70.74 KB
sortkey.h	11.12 KB
std_string.h	1015 B
strenum.h	10.04 KB
stringoptions.h	5.79 KB
stringpiece.h	6.46 KB
stringtriebuilder.h	15.27 KB
stsearch.h	21.29 KB
symtable.h	4.21 KB
tblcoll.h	36.4 KB
timezone.h	40.88 KB
tmunit.h	3.29 KB
tmutamt.h	4.8 KB
tmutfmt.h	7.79 KB
translit.h	65.76 KB
tzfmt.h	42.82 KB
tznames.h	16.79 KB
tzrule.h	35.32 KB
tztrans.h	6.07 KB
ubidi.h	89.56 KB
ubiditransform.h	12.65 KB
ubrk.h	23.97 KB
ucal.h	55.2 KB
ucasemap.h	15.18 KB
ucat.h	5.36 KB
uchar.h	139.96 KB
ucharstrie.h	21.06 KB
ucharstriebuilder.h	7.14 KB
uchriter.h	13.14 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.39 KB
ucoleitr.h	9.46 KB
uconfig.h	11.67 KB
ucpmap.h	5.58 KB
ucptrie.h	22.29 KB
ucsdet.h	14.67 KB
ucurr.h	15.57 KB
udat.h	60.13 KB
udata.h	15.53 KB
udateintervalformat.h	6.79 KB
udatpg.h	26.04 KB
udisplaycontext.h	5.89 KB
uenum.h	7.78 KB
ufieldpositer.h	4.36 KB
uformattable.h	10.94 KB
ugender.h	2 KB
uidna.h	33.37 KB
uiter.h	22.77 KB
uldnames.h	10.45 KB
ulistformatter.h	5.03 KB
uloc.h	50.75 KB
ulocdata.h	11.26 KB
umachine.h	13.19 KB
umisc.h	1.33 KB
umsg.h	24.23 KB
umutablecptrie.h	8.28 KB
unifilt.h	3.63 KB
unifunct.h	3.98 KB
unimatch.h	6.04 KB
unirepl.h	3.32 KB
uniset.h	64.25 KB
unistr.h	174.4 KB
unorm.h	20.45 KB
unorm2.h	24.66 KB
unum.h	53.38 KB
unumberformatter.h	23.76 KB
unumsys.h	7.14 KB
uobject.h	10.7 KB
upluralrules.h	6.72 KB
uregex.h	72.05 KB
uregion.h	9.84 KB
ureldatefmt.h	12.22 KB
urename.h	127.73 KB
urep.h	5.38 KB
ures.h	36.53 KB
uscript.h	26.52 KB
usearch.h	38.12 KB
uset.h	40 KB
usetiter.h	9.49 KB
ushape.h	18 KB
uspoof.h	66.03 KB
usprep.h	8.14 KB
ustdio.h	38.54 KB
ustream.h	1.8 KB
ustring.h	72.47 KB
ustringtrie.h	3.15 KB
utext.h	58.11 KB
utf.h	7.86 KB
utf16.h	22.33 KB
utf32.h	763 B
utf8.h	30.01 KB
utf_old.h	43.78 KB
utmscale.h	13.78 KB
utrace.h	13.89 KB
utrans.h	25.54 KB
utypes.h	30.48 KB
uvernum.h	6.06 KB
uversion.h	6.7 KB
vtzone.h	20.17 KB

Edit: 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