C++ (Cpp) TrieNode::getValue示例

示例#1

文件： ImplementTrie(Prefix Tree).hpp 项目： congnima/Leetcode

	TrieNode* findCh(char ch)
	{
		TrieNode* p = firstChild;

		while (nullptr != p)
		{
			if (ch == p->getValue())
				return p;
			else
				p = p->nextBrother;
		}

		return nullptr;
	}

示例#2

文件： Symtab.cpp 项目： isabelle-utp/utp-main

Symtab::index_t Symtab::operator[](const string& symbol) {
  TrieNode<index_t>* node = &root;
  for(char c : symbol) {
    node = (*node)[c];
  }
  if (!node->hasValue()) {
    /* Assert that an overflow will not occured. */
    assert(counter != 0);
    node->setValue(counter);
    /* Perhaps this is not the most efficient approach! */
    symbols.push_back(symbol);
    counter++;
  }
  /*debug << symbol << " = " << node->getValue() << std::endl;*/
  return node->getValue();
}