Graybyt3 Was Here

Linux business121.web-hosting.com 4.18.0-513.11.1.lve.el8.x86_64 #1 SMP Thu Jan 18 16:21:02 UTC 2024 x86_64
LiteSpeed
192.64.117.91

stringtriebuilder.h

// © 2016 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
/*
*******************************************************************************
*   Copyright (C) 2010-2012,2014, International Business Machines
*   Corporation and others.  All Rights Reserved.
*******************************************************************************
*   file name:  stringtriebuilder.h
*   encoding:   UTF-8
*   tab size:   8 (not used)
*   indentation:4
*
*   created on: 2010dec24
*   created by: Markus W. Scherer
*/

#ifndef __STRINGTRIEBUILDER_H__
#define __STRINGTRIEBUILDER_H__

#include "unicode/utypes.h"

#if U_SHOW_CPLUSPLUS_API

#include "unicode/uobject.h"

/**
 * \file
 * \brief C++ API: Builder API for trie builders
 */

// Forward declaration.
/// \cond
struct UHashtable;
typedef struct UHashtable UHashtable;
/// \endcond

/**
 * Build options for BytesTrieBuilder and CharsTrieBuilder.
 * @stable ICU 4.8
 */
enum UStringTrieBuildOption {
    /**
     * Builds a trie quickly.
     * @stable ICU 4.8
     */
    USTRINGTRIE_BUILD_FAST,
    /**
     * Builds a trie more slowly, attempting to generate
     * a shorter but equivalent serialization.
     * This build option also uses more memory.
     *
     * This option can be effective when many integer values are the same
     * and string/byte sequence suffixes can be shared.
     * Runtime speed is not expected to improve.
     * @stable ICU 4.8
     */
    USTRINGTRIE_BUILD_SMALL
};

U_NAMESPACE_BEGIN

/**
 * Base class for string trie builder classes.
 *
 * This class is not intended for public subclassing.
 * @stable ICU 4.8
 */
class U_COMMON_API StringTrieBuilder : public UObject {
public:
#ifndef U_HIDE_INTERNAL_API
    /** @internal */
    static int32_t hashNode(const void *node);
    /** @internal */
    static UBool equalNodes(const void *left, const void *right);
#endif  /* U_HIDE_INTERNAL_API */

protected:
    // Do not enclose the protected default constructor with #ifndef U_HIDE_INTERNAL_API
    // or else the compiler will create a public default constructor.
    /** @internal */
    StringTrieBuilder();
    /** @internal */
    virtual ~StringTrieBuilder();

#ifndef U_HIDE_INTERNAL_API
    /** @internal */
    void createCompactBuilder(int32_t sizeGuess, UErrorCode &errorCode);
    /** @internal */
    void deleteCompactBuilder();

/** @internal */
    void build(UStringTrieBuildOption buildOption, int32_t elementsLength, UErrorCode &errorCode);

/** @internal */
    int32_t writeNode(int32_t start, int32_t limit, int32_t unitIndex);
    /** @internal */
    int32_t writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length);
#endif  /* U_HIDE_INTERNAL_API */

class Node;

#ifndef U_HIDE_INTERNAL_API
    /** @internal */
    Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode);
    /** @internal */
    Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
                            int32_t length, UErrorCode &errorCode);
#endif  /* U_HIDE_INTERNAL_API */

/** @internal */
    virtual int32_t getElementStringLength(int32_t i) const = 0;
    /** @internal */
    virtual char16_t getElementUnit(int32_t i, int32_t unitIndex) const = 0;
    /** @internal */
    virtual int32_t getElementValue(int32_t i) const = 0;

// Finds the first unit index after this one where
    // the first and last element have different units again.
    /** @internal */
    virtual int32_t getLimitOfLinearMatch(int32_t first, int32_t last, int32_t unitIndex) const = 0;

// Number of different units at unitIndex.
    /** @internal */
    virtual int32_t countElementUnits(int32_t start, int32_t limit, int32_t unitIndex) const = 0;
    /** @internal */
    virtual int32_t skipElementsBySomeUnits(int32_t i, int32_t unitIndex, int32_t count) const = 0;
    /** @internal */
    virtual int32_t indexOfElementWithNextUnit(int32_t i, int32_t unitIndex, char16_t unit) const = 0;

/** @internal */
    virtual UBool matchNodesCanHaveValues() const = 0;

/** @internal */
    virtual int32_t getMaxBranchLinearSubNodeLength() const = 0;
    /** @internal */
    virtual int32_t getMinLinearMatch() const = 0;
    /** @internal */
    virtual int32_t getMaxLinearMatchLength() const = 0;

#ifndef U_HIDE_INTERNAL_API
    // max(BytesTrie::kMaxBranchLinearSubNodeLength, UCharsTrie::kMaxBranchLinearSubNodeLength).
    /** @internal */
    static const int32_t kMaxBranchLinearSubNodeLength=5;

// Maximum number of nested split-branch levels for a branch on all 2^16 possible char16_t units.
    // log2(2^16/kMaxBranchLinearSubNodeLength) rounded up.
    /** @internal */
    static const int32_t kMaxSplitBranchLevels=14;

/**
     * Makes sure that there is only one unique node registered that is
     * equivalent to newNode.
     * @param newNode Input node. The builder takes ownership.
     * @param errorCode ICU in/out UErrorCode.
                        Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==NULL.
     * @return newNode if it is the first of its kind, or
     *         an equivalent node if newNode is a duplicate.
     * @internal
     */
    Node *registerNode(Node *newNode, UErrorCode &errorCode);
    /**
     * Makes sure that there is only one unique FinalValueNode registered
     * with this value.
     * Avoids creating a node if the value is a duplicate.
     * @param value A final value.
     * @param errorCode ICU in/out UErrorCode.
                        Set to U_MEMORY_ALLOCATION_ERROR if it was success but newNode==NULL.
     * @return A FinalValueNode with the given value.
     * @internal
     */
    Node *registerFinalValue(int32_t value, UErrorCode &errorCode);
#endif  /* U_HIDE_INTERNAL_API */

/*
     * C++ note:
     * registerNode() and registerFinalValue() take ownership of their input nodes,
     * and only return owned nodes.
     * If they see a failure UErrorCode, they will delete the input node.
     * If they get a NULL pointer, they will record a U_MEMORY_ALLOCATION_ERROR.
     * If there is a failure, they return NULL.
     *
     * NULL Node pointers can be safely passed into other Nodes because
     * they call the static Node::hashCode() which checks for a NULL pointer first.
     *
     * Therefore, as long as builder functions register a new node,
     * they need to check for failures only before explicitly dereferencing
     * a Node pointer, or before setting a new UErrorCode.
     */

// Hash set of nodes, maps from nodes to integer 1.
    /** @internal */
    UHashtable *nodes;

// Do not conditionalize the following with #ifndef U_HIDE_INTERNAL_API,
    // it is needed for layout of other objects.
    /**
     * @internal
     * \cond
     */
    class Node : public UObject {
    public:
        Node(int32_t initialHash) : hash(initialHash), offset(0) {}
        inline int32_t hashCode() const { return hash; }
        // Handles node==NULL.
        static inline int32_t hashCode(const Node *node) { return node==NULL ? 0 : node->hashCode(); }
        // Base class operator==() compares the actual class types.
        virtual bool operator==(const Node &other) const;
        inline bool operator!=(const Node &other) const { return !operator==(other); }
        /**
         * Traverses the Node graph and numbers branch edges, with rightmost edges first.
         * This is to avoid writing a duplicate node twice.
         *
         * Branch nodes in this trie data structure are not symmetric.
         * Most branch edges "jump" to other nodes but the rightmost branch edges
         * just continue without a jump.
         * Therefore, write() must write the rightmost branch edge last
         * (trie units are written backwards), and must write it at that point even if
         * it is a duplicate of a node previously written elsewhere.
         *
         * This function visits and marks right branch edges first.
         * Edges are numbered with increasingly negative values because we share the
         * offset field which gets positive values when nodes are written.
         * A branch edge also remembers the first number for any of its edges.
         *
         * When a further-left branch edge has a number in the range of the rightmost
         * edge's numbers, then it will be written as part of the required right edge
         * and we can avoid writing it first.
         *
         * After root.markRightEdgesFirst(-1) the offsets of all nodes are negative
         * edge numbers.
         *
         * @param edgeNumber The first edge number for this node and its sub-nodes.
         * @return An edge number that is at least the maximum-negative
         *         of the input edge number and the numbers of this node and all of its sub-nodes.
         */
        virtual int32_t markRightEdgesFirst(int32_t edgeNumber);
        // write() must set the offset to a positive value.
        virtual void write(StringTrieBuilder &builder) = 0;
        // See markRightEdgesFirst.
        inline void writeUnlessInsideRightEdge(int32_t firstRight, int32_t lastRight,
                                               StringTrieBuilder &builder) {
            // Note: Edge numbers are negative, lastRight<=firstRight.
            // If offset>0 then this node and its sub-nodes have been written already
            // and we need not write them again.
            // If this node is part of the unwritten right branch edge,
            // then we wait until that is written.
            if(offset<0 && (offset<lastRight || firstRight<offset)) {
                write(builder);
            }
        }
        inline int32_t getOffset() const { return offset; }
    protected:
        int32_t hash;
        int32_t offset;
    };

#ifndef U_HIDE_INTERNAL_API
    // This class should not be overridden because
    // registerFinalValue() compares a stack-allocated FinalValueNode
    // (stack-allocated so that we don't unnecessarily create lots of duplicate nodes)
    // with the input node, and the
    // !Node::operator==(other) used inside FinalValueNode::operator==(other)
    // will be false if the typeid's are different.
    /** @internal */
    class FinalValueNode : public Node {
    public:
        FinalValueNode(int32_t v) : Node(0x111111u*37u+v), value(v) {}
        virtual bool operator==(const Node &other) const override;
        virtual void write(StringTrieBuilder &builder) override;
    protected:
        int32_t value;
    };
#endif  /* U_HIDE_INTERNAL_API */

// Do not conditionalize the following with #ifndef U_HIDE_INTERNAL_API,
    // it is needed for layout of other objects.
    /**
     * @internal 
     */
    class ValueNode : public Node {
    public:
        ValueNode(int32_t initialHash) : Node(initialHash), hasValue(false), value(0) {}
        virtual bool operator==(const Node &other) const override;
        void setValue(int32_t v) {
            hasValue=true;
            value=v;
            hash=hash*37u+v;
        }
    protected:
        UBool hasValue;
        int32_t value;
    };

#ifndef U_HIDE_INTERNAL_API
    /** 
     * @internal 
     */
    class IntermediateValueNode : public ValueNode {
    public:
        IntermediateValueNode(int32_t v, Node *nextNode)
                : ValueNode(0x222222u*37u+hashCode(nextNode)), next(nextNode) { setValue(v); }
        virtual bool operator==(const Node &other) const override;
        virtual int32_t markRightEdgesFirst(int32_t edgeNumber) override;
        virtual void write(StringTrieBuilder &builder) override;
    protected:
        Node *next;
    };
#endif  /* U_HIDE_INTERNAL_API */

// Do not conditionalize the following with #ifndef U_HIDE_INTERNAL_API,
    // it is needed for layout of other objects.
    /**
     * @internal 
     */
    class LinearMatchNode : public ValueNode {
    public:
        LinearMatchNode(int32_t len, Node *nextNode)
                : ValueNode((0x333333u*37u+len)*37u+hashCode(nextNode)),
                  length(len), next(nextNode) {}
        virtual bool operator==(const Node &other) const override;
        virtual int32_t markRightEdgesFirst(int32_t edgeNumber) override;
    protected:
        int32_t length;
        Node *next;
    };

#ifndef U_HIDE_INTERNAL_API
    /**
     * @internal 
     */
    class BranchNode : public Node {
    public:
        BranchNode(int32_t initialHash) : Node(initialHash) {}
    protected:
        int32_t firstEdgeNumber;
    };

/**
     * @internal 
     */
    class ListBranchNode : public BranchNode {
    public:
        ListBranchNode() : BranchNode(0x444444), length(0) {}
        virtual bool operator==(const Node &other) const override;
        virtual int32_t markRightEdgesFirst(int32_t edgeNumber) override;
        virtual void write(StringTrieBuilder &builder) override;
        // Adds a unit with a final value.
        void add(int32_t c, int32_t value) {
            units[length]=(char16_t)c;
            equal[length]=NULL;
            values[length]=value;
            ++length;
            hash=(hash*37u+c)*37u+value;
        }
        // Adds a unit which leads to another match node.
        void add(int32_t c, Node *node) {
            units[length]=(char16_t)c;
            equal[length]=node;
            values[length]=0;
            ++length;
            hash=(hash*37u+c)*37u+hashCode(node);
        }
    protected:
        Node *equal[kMaxBranchLinearSubNodeLength];  // NULL means "has final value".
        int32_t length;
        int32_t values[kMaxBranchLinearSubNodeLength];
        char16_t units[kMaxBranchLinearSubNodeLength];
    };

/**
     * @internal 
     */
    class SplitBranchNode : public BranchNode {
    public:
        SplitBranchNode(char16_t middleUnit, Node *lessThanNode, Node *greaterOrEqualNode)
                : BranchNode(((0x555555u*37u+middleUnit)*37u+
                              hashCode(lessThanNode))*37u+hashCode(greaterOrEqualNode)),
                  unit(middleUnit), lessThan(lessThanNode), greaterOrEqual(greaterOrEqualNode) {}
        virtual bool operator==(const Node &other) const override;
        virtual int32_t markRightEdgesFirst(int32_t edgeNumber) override;
        virtual void write(StringTrieBuilder &builder) override;
    protected:
        char16_t unit;
        Node *lessThan;
        Node *greaterOrEqual;
    };

// Branch head node, for writing the actual node lead unit.
    /** @internal */
    class BranchHeadNode : public ValueNode {
    public:
        BranchHeadNode(int32_t len, Node *subNode)
                : ValueNode((0x666666u*37u+len)*37u+hashCode(subNode)),
                  length(len), next(subNode) {}
        virtual bool operator==(const Node &other) const override;
        virtual int32_t markRightEdgesFirst(int32_t edgeNumber) override;
        virtual void write(StringTrieBuilder &builder) override;
    protected:
        int32_t length;
        Node *next;  // A branch sub-node.
    };

#endif  /* U_HIDE_INTERNAL_API */
    /// \endcond

/** @internal */
    virtual Node *createLinearMatchNode(int32_t i, int32_t unitIndex, int32_t length,
                                        Node *nextNode) const = 0;

/** @internal */
    virtual int32_t write(int32_t unit) = 0;
    /** @internal */
    virtual int32_t writeElementUnits(int32_t i, int32_t unitIndex, int32_t length) = 0;
    /** @internal */
    virtual int32_t writeValueAndFinal(int32_t i, UBool isFinal) = 0;
    /** @internal */
    virtual int32_t writeValueAndType(UBool hasValue, int32_t value, int32_t node) = 0;
    /** @internal */
    virtual int32_t writeDeltaTo(int32_t jumpTarget) = 0;
};

U_NAMESPACE_END

#endif /* U_SHOW_CPLUSPLUS_API */

#endif  // __STRINGTRIEBUILDER_H__

System Information
*ReClick For Close
File : BlackDragon /simple/function.php

Name	Type	Size	Owner/Group	Permission	Last Modified	Actions
.	dir	-	root/root	0755	2024-03-03 10:41:03
..	dir	-	root/root	0755	2024-03-03 10:41:03
alphaindex.h	text/x-c++	26.53 KB	root/root	0644	2023-02-22 10:03:44
appendable.h	text/x-c++	8.53 KB	root/root	0644	2023-02-22 10:03:43
basictz.h	text/x-c++	9.98 KB	root/root	0644	2023-02-22 10:03:44
brkiter.h	text/x-c++	27.81 KB	root/root	0644	2023-02-22 10:03:43
bytestream.h	text/x-c++	10.75 KB	root/root	0644	2023-02-22 10:03:43
bytestrie.h	text/x-c++	20.78 KB	root/root	0644	2023-02-22 10:03:43
bytestriebuilder.h	text/x-c++	7.48 KB	root/root	0644	2023-02-22 10:03:43
calendar.h	text/x-c	102.25 KB	root/root	0644	2023-02-22 10:03:44
caniter.h	text/x-c++	7.47 KB	root/root	0644	2023-02-22 10:03:43
casemap.h	text/x-c++	25.33 KB	root/root	0644	2023-02-22 10:03:43
char16ptr.h	text/x-c++	7.22 KB	root/root	0644	2023-02-22 10:03:43
chariter.h	text/x-c++	24.06 KB	root/root	0644	2023-02-22 10:03:43
choicfmt.h	text/x-c++	23.98 KB	root/root	0644	2023-02-22 10:03:44
coleitr.h	text/x-c++	13.78 KB	root/root	0644	2023-02-22 10:03:44
coll.h	text/x-c++	56.27 KB	root/root	0644	2023-02-22 10:03:44
compactdecimalformat.h	text/x-c++	6.88 KB	root/root	0644	2023-02-22 10:03:44
curramt.h	text/x-c++	3.78 KB	root/root	0644	2023-02-22 10:03:44
currpinf.h	text/x-c++	7.3 KB	root/root	0644	2023-02-22 10:03:44
currunit.h	text/x-c++	4.02 KB	root/root	0644	2023-02-22 10:03:44
datefmt.h	text/x-c++	40.71 KB	root/root	0644	2023-02-22 10:03:44
dbbi.h	text/x-c	1.19 KB	root/root	0644	2023-02-22 10:03:43
dcfmtsym.h	text/x-c++	20.61 KB	root/root	0644	2023-02-22 10:03:44
decimfmt.h	text/x-c++	87.57 KB	root/root	0644	2023-02-22 10:03:44
displayoptions.h	text/x-c++	7.11 KB	root/root	0644	2023-02-22 10:03:44
docmain.h	text/x-tex	7.21 KB	root/root	0644	2023-02-22 10:03:43
dtfmtsym.h	text/x-c++	38.22 KB	root/root	0644	2023-02-22 10:03:44
dtintrv.h	text/x-c++	3.85 KB	root/root	0644	2023-02-22 10:03:43
dtitvfmt.h	text/x-c++	49.27 KB	root/root	0644	2023-02-22 10:03:44
dtitvinf.h	text/x-c++	18.63 KB	root/root	0644	2023-02-22 10:03:44
dtptngen.h	text/x-c++	28.69 KB	root/root	0644	2023-02-22 10:03:44
dtrule.h	text/x-c++	8.69 KB	root/root	0644	2023-02-22 10:03:44
edits.h	text/x-c++	20.74 KB	root/root	0644	2023-02-22 10:03:43
enumset.h	text/x-c++	2.08 KB	root/root	0644	2023-02-22 10:03:43
errorcode.h	text/x-c++	4.84 KB	root/root	0644	2023-02-22 10:03:43
fieldpos.h	text/x-c++	8.7 KB	root/root	0644	2023-02-22 10:03:44
filteredbrk.h	text/x-c++	5.37 KB	root/root	0644	2023-02-22 10:03:43
fmtable.h	text/x-c++	24.43 KB	root/root	0644	2023-02-22 10:03:44
format.h	text/x-c++	12.5 KB	root/root	0644	2023-02-22 10:03:44
formattedvalue.h	text/x-c++	9.75 KB	root/root	0644	2023-02-22 10:03:44
fpositer.h	text/x-c++	3.03 KB	root/root	0644	2023-02-22 10:03:44
gender.h	text/x-c++	3.35 KB	root/root	0644	2023-02-22 10:03:44
gregocal.h	text/x-c++	31.04 KB	root/root	0644	2023-02-22 10:03:44
icudataver.h	text/x-c	1.02 KB	root/root	0644	2023-02-22 10:03:43
icuplug.h	text/x-c	11.83 KB	root/root	0644	2023-02-22 10:03:43
idna.h	text/x-c++	12.71 KB	root/root	0644	2023-02-22 10:03:43
listformatter.h	text/x-c++	8.61 KB	root/root	0644	2023-02-22 10:03:44
localebuilder.h	text/x-c++	11.08 KB	root/root	0644	2023-02-22 10:03:43
localematcher.h	text/x-c++	26.84 KB	root/root	0644	2023-02-22 10:03:43
localpointer.h	text/x-c++	19.36 KB	root/root	0644	2023-02-22 10:03:43
locdspnm.h	text/x-c++	7.12 KB	root/root	0644	2023-02-22 10:03:43
locid.h	text/x-c	47.66 KB	root/root	0644	2023-02-22 10:03:43
measfmt.h	text/x-c++	11.42 KB	root/root	0644	2023-02-22 10:03:44
measunit.h	text/x-c++	106.33 KB	root/root	0644	2023-02-22 10:03:44
measure.h	text/x-c++	4.33 KB	root/root	0644	2023-02-22 10:03:44
messagepattern.h	text/x-c	33.71 KB	root/root	0644	2023-02-22 10:03:43
msgfmt.h	text/x-c	44.17 KB	root/root	0644	2023-02-22 10:03:44
normalizer2.h	text/x-c++	33.66 KB	root/root	0644	2023-02-22 10:03:43
normlzr.h	text/x-c++	30.96 KB	root/root	0644	2023-02-22 10:03:43
nounit.h	text/x-c++	2.25 KB	root/root	0644	2023-02-22 10:03:44
numberformatter.h	text/x-c++	94.82 KB	root/root	0644	2023-02-22 10:03:44
numberrangeformatter.h	text/x-c++	25.02 KB	root/root	0644	2023-02-22 10:03:44
numfmt.h	text/x-c++	49.84 KB	root/root	0644	2023-02-22 10:03:44
numsys.h	text/x-c++	7.22 KB	root/root	0644	2023-02-22 10:03:44
parseerr.h	text/x-c	3.08 KB	root/root	0644	2023-02-22 10:03:43
parsepos.h	text/x-c++	5.57 KB	root/root	0644	2023-02-22 10:03:43
platform.h	text/x-c	28.55 KB	root/root	0644	2023-02-22 10:03:43
plurfmt.h	text/x-c++	25.25 KB	root/root	0644	2023-02-22 10:03:44
plurrule.h	text/x-c++	20.62 KB	root/root	0644	2023-02-22 10:03:44
ptypes.h	text/x-c	3.49 KB	root/root	0644	2023-02-22 10:03:43
putil.h	text/x-c	6.32 KB	root/root	0644	2023-02-22 10:03:43
rbbi.h	text/x-c++	28.46 KB	root/root	0644	2023-02-22 10:03:43
rbnf.h	text/x-c	49.82 KB	root/root	0644	2023-02-22 10:03:44
rbtz.h	text/x-c++	15.77 KB	root/root	0644	2023-02-22 10:03:44
regex.h	text/x-c++	84.41 KB	root/root	0644	2023-02-22 10:03:44
region.h	text/x-c++	9.18 KB	root/root	0644	2023-02-22 10:03:44
reldatefmt.h	text/x-c++	22.22 KB	root/root	0644	2023-02-22 10:03:44
rep.h	text/x-c++	9.37 KB	root/root	0644	2023-02-22 10:03:43
resbund.h	text/x-c++	18.09 KB	root/root	0644	2023-02-22 10:03:43
schriter.h	text/x-c++	6.1 KB	root/root	0644	2023-02-22 10:03:43
scientificnumberformatter.h	text/x-c++	6.44 KB	root/root	0644	2023-02-22 10:03:44
search.h	text/x-c++	22.22 KB	root/root	0644	2023-02-22 10:03:44
selfmt.h	text/x-c++	14.35 KB	root/root	0644	2023-02-22 10:03:44
simpleformatter.h	text/x-c++	12.59 KB	root/root	0644	2023-02-22 10:03:43
simpletz.h	text/x-c++	45.65 KB	root/root	0644	2023-02-22 10:03:44
smpdtfmt.h	text/x-c++	71.93 KB	root/root	0644	2023-02-22 10:03:44
sortkey.h	text/x-c++	11.18 KB	root/root	0644	2023-02-22 10:03:44
std_string.h	text/x-c++	1.05 KB	root/root	0644	2023-02-22 10:03:43
strenum.h	text/x-c++	9.92 KB	root/root	0644	2023-02-22 10:03:43
stringoptions.h	text/x-c	5.79 KB	root/root	0644	2023-02-22 10:03:43
stringpiece.h	text/x-c++	10.05 KB	root/root	0644	2023-02-22 10:03:43
stringtriebuilder.h	text/x-c++	15.47 KB	root/root	0644	2023-02-22 10:03:43
stsearch.h	text/x-c++	21.42 KB	root/root	0644	2023-02-22 10:03:44
symtable.h	text/x-c++	4.27 KB	root/root	0644	2023-02-22 10:03:43
tblcoll.h	text/x-c++	36.92 KB	root/root	0644	2023-02-22 10:03:44
timezone.h	text/x-c++	43.81 KB	root/root	0644	2023-02-22 10:03:44
tmunit.h	text/x-c++	3.4 KB	root/root	0644	2023-02-22 10:03:44
tmutamt.h	text/x-c++	4.91 KB	root/root	0644	2023-02-22 10:03:44
tmutfmt.h	text/x-c++	7.42 KB	root/root	0644	2023-02-22 10:03:44
translit.h	text/x-c	65.82 KB	root/root	0644	2023-02-22 10:03:44
tzfmt.h	text/x-c	42.93 KB	root/root	0644	2023-02-22 10:03:44
tznames.h	text/x-c++	16.85 KB	root/root	0644	2023-02-22 10:03:44
tzrule.h	text/x-c++	34.86 KB	root/root	0644	2023-02-22 10:03:44
tztrans.h	text/x-c++	6.13 KB	root/root	0644	2023-02-22 10:03:44
ubidi.h	text/x-c	89.61 KB	root/root	0644	2023-02-22 10:03:43
ubiditransform.h	text/x-c	12.71 KB	root/root	0644	2023-02-22 10:03:43
ubrk.h	text/x-c	24.43 KB	root/root	0644	2023-02-22 10:03:43
ucal.h	text/x-c	60.68 KB	root/root	0644	2023-02-22 10:03:44
ucasemap.h	text/x-c	15.21 KB	root/root	0644	2023-02-22 10:03:43
ucat.h	text/x-c	5.35 KB	root/root	0644	2023-02-22 10:03:43
uchar.h	text/x-c	145.09 KB	root/root	0644	2023-02-22 10:03:43
ucharstrie.h	text/x-c++	22.53 KB	root/root	0644	2023-02-22 10:03:43
ucharstriebuilder.h	text/x-c++	7.48 KB	root/root	0644	2023-02-22 10:03:43
uchriter.h	text/x-c++	13.42 KB	root/root	0644	2023-02-22 10:03:43
uclean.h	text/x-c	11.2 KB	root/root	0644	2023-02-22 10:03:43
ucnv.h	text/x-c	83.46 KB	root/root	0644	2023-02-22 10:03:43
ucnv_cb.h	text/x-c	6.58 KB	root/root	0644	2023-02-22 10:03:43
ucnv_err.h	text/x-c	20.98 KB	root/root	0644	2023-02-22 10:03:43
ucnvsel.h	text/x-c	6.24 KB	root/root	0644	2023-02-22 10:03:43
ucol.h	text/x-c	61.95 KB	root/root	0644	2023-02-22 10:03:44
ucoleitr.h	text/x-c	9.82 KB	root/root	0644	2023-02-22 10:03:44
uconfig.h	text/x-c	12.07 KB	root/root	0644	2023-02-22 10:03:43
ucpmap.h	text/x-c	5.54 KB	root/root	0644	2023-02-22 10:03:43
ucptrie.h	text/x-c	22.51 KB	root/root	0644	2023-02-22 10:03:43
ucsdet.h	text/x-c	14.69 KB	root/root	0644	2023-02-22 10:03:44
ucurr.h	text/x-c	16.72 KB	root/root	0644	2023-02-22 10:03:43
udat.h	text/x-c	62.36 KB	root/root	0644	2023-02-22 10:03:44
udata.h	text/x-c	15.63 KB	root/root	0644	2023-02-22 10:03:43
udateintervalformat.h	text/x-c	11.93 KB	root/root	0644	2023-02-22 10:03:44
udatpg.h	text/x-c	30.18 KB	root/root	0644	2023-02-22 10:03:44
udisplaycontext.h	text/x-c	5.94 KB	root/root	0644	2023-02-22 10:03:43
udisplayoptions.h	text/x-c	8.8 KB	root/root	0644	2023-02-22 10:03:44
uenum.h	text/x-c	7.79 KB	root/root	0644	2023-02-22 10:03:43
ufieldpositer.h	text/x-c	4.41 KB	root/root	0644	2023-02-22 10:03:44
uformattable.h	text/x-c	10.97 KB	root/root	0644	2023-02-22 10:03:44
uformattedvalue.h	text/x-c	12.25 KB	root/root	0644	2023-02-22 10:03:44
ugender.h	text/x-c	2.06 KB	root/root	0644	2023-02-22 10:03:44
uidna.h	text/x-c	33.43 KB	root/root	0644	2023-02-22 10:03:43
uiter.h	text/x-c	22.75 KB	root/root	0644	2023-02-22 10:03:43
uldnames.h	text/x-c	10.48 KB	root/root	0644	2023-02-22 10:03:43
ulistformatter.h	text/x-c	10.78 KB	root/root	0644	2023-02-22 10:03:44
uloc.h	text/x-c	54.66 KB	root/root	0644	2023-02-22 10:03:43
ulocdata.h	text/x-c	11.3 KB	root/root	0644	2023-02-22 10:03:44
umachine.h	text/x-c	15.73 KB	root/root	0644	2023-02-22 10:03:43
umisc.h	text/x-c	1.34 KB	root/root	0644	2023-02-22 10:03:43
umsg.h	text/x-c	24.25 KB	root/root	0644	2023-02-22 10:03:44
umutablecptrie.h	text/x-c	8.3 KB	root/root	0644	2023-02-22 10:03:43
unifilt.h	text/x-c++	4 KB	root/root	0644	2023-02-22 10:03:43
unifunct.h	text/x-c++	4.05 KB	root/root	0644	2023-02-22 10:03:43
unimatch.h	text/x-c++	6.1 KB	root/root	0644	2023-02-22 10:03:43
unirepl.h	text/x-c++	3.38 KB	root/root	0644	2023-02-22 10:03:44
uniset.h	text/x-c	66.12 KB	root/root	0644	2023-02-22 10:03:43
unistr.h	text/x-c	170.53 KB	root/root	0644	2023-02-22 10:03:43
unorm.h	text/x-c	20.55 KB	root/root	0644	2023-02-22 10:03:43
unorm2.h	text/x-c	24.68 KB	root/root	0644	2023-02-22 10:03:43
unum.h	text/x-c	56.6 KB	root/root	0644	2023-02-22 10:03:44
unumberformatter.h	text/x-c	30.26 KB	root/root	0644	2023-02-22 10:03:44
unumberrangeformatter.h	text/x-c	15.35 KB	root/root	0644	2023-02-22 10:03:44
unumsys.h	text/x-c	7.26 KB	root/root	0644	2023-02-22 10:03:44
uobject.h	text/x-c++	10.68 KB	root/root	0644	2023-02-22 10:03:43
upluralrules.h	text/x-c	8.79 KB	root/root	0644	2023-02-22 10:03:44
uregex.h	text/x-c	71.99 KB	root/root	0644	2023-02-22 10:03:44
uregion.h	text/x-c	9.81 KB	root/root	0644	2023-02-22 10:03:44
ureldatefmt.h	text/x-c	17.04 KB	root/root	0644	2023-02-22 10:03:44
urename.h	text/x-c	135.69 KB	root/root	0644	2023-02-22 10:03:43
urep.h	text/x-c	5.38 KB	root/root	0644	2023-02-22 10:03:43
ures.h	text/x-c	36.54 KB	root/root	0644	2023-02-22 10:03:43
uscript.h	text/x-c	27.8 KB	root/root	0644	2023-02-22 10:03:43
usearch.h	text/x-c	39.21 KB	root/root	0644	2023-02-22 10:03:44
uset.h	text/x-c	44.19 KB	root/root	0644	2023-02-22 10:03:43
usetiter.h	text/x-c++	9.63 KB	root/root	0644	2023-02-22 10:03:43
ushape.h	text/x-c	18 KB	root/root	0644	2023-02-22 10:03:43
uspoof.h	text/x-c	65.84 KB	root/root	0644	2023-02-22 10:03:44
usprep.h	text/x-c	8.19 KB	root/root	0644	2023-02-22 10:03:43
ustdio.h	text/x-c	38.56 KB	root/root	0644	2023-02-22 10:03:47
ustream.h	text/x-c++	1.89 KB	root/root	0644	2023-02-22 10:03:47
ustring.h	text/x-c	72.36 KB	root/root	0644	2023-02-22 10:03:43
ustringtrie.h	text/x-c	3.15 KB	root/root	0644	2023-02-22 10:03:43
utext.h	text/x-c	58.08 KB	root/root	0644	2023-02-22 10:03:43
utf.h	text/x-c	7.87 KB	root/root	0644	2023-02-22 10:03:43
utf16.h	text/x-c	23.35 KB	root/root	0644	2023-02-22 10:03:43
utf32.h	text/plain	763 B	root/root	0644	2023-02-22 10:03:43
utf8.h	text/x-c	30.83 KB	root/root	0644	2023-02-22 10:03:43
utf_old.h	text/x-c	45.8 KB	root/root	0644	2023-02-22 10:03:43
utmscale.h	text/x-c	13.78 KB	root/root	0644	2023-02-22 10:03:44
utrace.h	text/x-c	17.18 KB	root/root	0644	2023-02-22 10:03:43
utrans.h	text/x-c	25.54 KB	root/root	0644	2023-02-22 10:03:44
utypes.h	text/x-c	31.06 KB	root/root	0644	2023-02-22 10:03:43
uvernum.h	text/x-c	6.33 KB	root/root	0644	2023-02-22 10:03:43
uversion.h	text/x-c	5.99 KB	root/root	0644	2023-02-22 10:03:43
vtzone.h	text/x-c++	20.68 KB	root/root	0644	2023-02-22 10:03:44