superwords() [1/2]

auto SuffixTree::superwords	(	const Word &	w,
		std::vector< std::pair< int, int > > &	output,
		bool	onlyFirst ) const->bool

Definition at line 567 of file SuffixTree.cpp.

{
  auto clType = contractedLocus(mRoot,w);
  auto y = std::get<0>(clType);
  auto f = std::get<1>(clType);
  auto pre = std::get<2>(clType);
 
  if (!concatenatesTo(Word(y->label()),pre,w)) return false;
  else if (f == nullptr)
    {
      auto leaves = std::vector<SuffixTreeNode*> {};
      allLeaves(y,leaves);
      for (auto g : leaves)
        {
          output.push_back(std::make_pair(g->getPatternNumber(),mMonomials[g->getPatternNumber()].size() - g->label().size() + 1));
          if (onlyFirst) return true;
        }
    }
  else if (f->isLeaf() && f->label().size() == w.size() + 1)
    {
      output.push_back(std::make_pair(f->getPatternNumber(),mMonomials[f->getPatternNumber()].size() - f->label().size() + 1));
      return true;
    }
  return false;
}

References allLeaves(), concatenatesTo(), contractedLocus(), mMonomials, and mRoot.