Lines Matching defs:StringTrieBuilder

27     return icu::StringTrieBuilder::hashNode(key.pointer);
32 return icu::StringTrieBuilder::equalNodes(key1.pointer, key2.pointer);
39 StringTrieBuilder::StringTrieBuilder() : nodes(NULL) {}
41 StringTrieBuilder::~StringTrieBuilder() {
46 StringTrieBuilder::createCompactBuilder(int32_t sizeGuess, UErrorCode &errorCode) {
62 StringTrieBuilder::deleteCompactBuilder() {
68 StringTrieBuilder::build(UStringTrieBuildOption buildOption, int32_t elementsLength,
87 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) {
135 StringTrieBuilder::writeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, int32_t length) {
207 StringTrieBuilder::Node *
208 StringTrieBuilder::makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) {
259 StringTrieBuilder::Node *
260 StringTrieBuilder::makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex,
318 StringTrieBuilder::Node *
319 StringTrieBuilder::registerNode(Node *newNode, UErrorCode &errorCode) {
347 StringTrieBuilder::Node *
348 StringTrieBuilder::registerFinalValue(int32_t value, UErrorCode &errorCode) {
377 StringTrieBuilder::hashNode(const void *node) {
382 StringTrieBuilder::equalNodes(const void *left, const void *right) {
387 StringTrieBuilder::Node::operator==(const Node &other) const {
392 StringTrieBuilder::Node::markRightEdgesFirst(int32_t edgeNumber) {
400 StringTrieBuilder::FinalValueNode::operator==(const Node &other) const {
412 StringTrieBuilder::FinalValueNode::write(StringTrieBuilder &builder) {
417 StringTrieBuilder::ValueNode::operator==(const Node &other) const {
429 StringTrieBuilder::IntermediateValueNode::operator==(const Node &other) const {
441 StringTrieBuilder::IntermediateValueNode::markRightEdgesFirst(int32_t edgeNumber) {
449 StringTrieBuilder::IntermediateValueNode::write(StringTrieBuilder &builder) {
455 StringTrieBuilder::LinearMatchNode::operator==(const Node &other) const {
467 StringTrieBuilder::LinearMatchNode::markRightEdgesFirst(int32_t edgeNumber) {
475 StringTrieBuilder::ListBranchNode::operator==(const Node &other) const {
492 StringTrieBuilder::ListBranchNode::markRightEdgesFirst(int32_t edgeNumber) {
511 StringTrieBuilder::ListBranchNode::write(StringTrieBuilder &builder) {
554 StringTrieBuilder::SplitBranchNode::operator==(const Node &other) const {
566 StringTrieBuilder::SplitBranchNode::markRightEdgesFirst(int32_t edgeNumber) {
576 StringTrieBuilder::SplitBranchNode::write(StringTrieBuilder &builder) {
588 StringTrieBuilder::BranchHeadNode::operator==(const Node &other) const {
600 StringTrieBuilder::BranchHeadNode::markRightEdgesFirst(int32_t edgeNumber) {
608 StringTrieBuilder::BranchHeadNode::write(StringTrieBuilder &builder) {