Lines Matching defs:StringTrieBuilder
6 * file name: stringtriebuilder.cpp
17 #include "unicode/stringtriebuilder.h"
25 return U_NAMESPACE_QUALIFIER StringTrieBuilder::hashNode(key.pointer);
30 return U_NAMESPACE_QUALIFIER StringTrieBuilder::equalNodes(key1.pointer, key2.pointer);
37 StringTrieBuilder::StringTrieBuilder() : nodes(NULL) {}
39 StringTrieBuilder::~StringTrieBuilder() {
44 StringTrieBuilder::createCompactBuilder(int32_t sizeGuess, UErrorCode &errorCode) {
59 StringTrieBuilder::deleteCompactBuilder() {
65 StringTrieBuilder::build(UStringTrieBuildOption buildOption, int32_t elementsLength,
84 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) {
132 StringTrieBuilder::writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length) {
204 StringTrieBuilder::Node *
205 StringTrieBuilder::makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) {
256 StringTrieBuilder::Node *
257 StringTrieBuilder::makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
315 StringTrieBuilder::Node *
316 StringTrieBuilder::registerNode(Node *newNode, UErrorCode &errorCode) {
344 StringTrieBuilder::Node *
345 StringTrieBuilder::registerFinalValue(int32_t value, UErrorCode &errorCode) {
374 StringTrieBuilder::hashNode(const void *node) {
379 StringTrieBuilder::equalNodes(const void *left, const void *right) {
383 UOBJECT_DEFINE_NO_RTTI_IMPLEMENTATION(StringTrieBuilder)
386 StringTrieBuilder::Node::operator==(const Node &other) const {
391 StringTrieBuilder::Node::markRightEdgesFirst(int32_t edgeNumber) {
398 UOBJECT_DEFINE_NO_RTTI_IMPLEMENTATION(StringTrieBuilder::Node)
401 StringTrieBuilder::FinalValueNode::operator==(const Node &other) const {
413 StringTrieBuilder::FinalValueNode::write(StringTrieBuilder &builder) {
418 StringTrieBuilder::ValueNode::operator==(const Node &other) const {
430 StringTrieBuilder::IntermediateValueNode::operator==(const Node &other) const {
442 StringTrieBuilder::IntermediateValueNode::markRightEdgesFirst(int32_t edgeNumber) {
450 StringTrieBuilder::IntermediateValueNode::write(StringTrieBuilder &builder) {
456 StringTrieBuilder::LinearMatchNode::operator==(const Node &other) const {
468 StringTrieBuilder::LinearMatchNode::markRightEdgesFirst(int32_t edgeNumber) {
476 StringTrieBuilder::ListBranchNode::operator==(const Node &other) const {
493 StringTrieBuilder::ListBranchNode::markRightEdgesFirst(int32_t edgeNumber) {
512 StringTrieBuilder::ListBranchNode::write(StringTrieBuilder &builder) {
555 StringTrieBuilder::SplitBranchNode::operator==(const Node &other) const {
567 StringTrieBuilder::SplitBranchNode::markRightEdgesFirst(int32_t edgeNumber) {
577 StringTrieBuilder::SplitBranchNode::write(StringTrieBuilder &builder) {
589 StringTrieBuilder::BranchHeadNode::operator==(const Node &other) const {
601 StringTrieBuilder::BranchHeadNode::markRightEdgesFirst(int32_t edgeNumber) {
609 StringTrieBuilder::BranchHeadNode::write(StringTrieBuilder &builder) {
