Method findall

src/python/handler/py_utils.cpp:1175–1245

}

py::UniqueObj PhraserObject::findall(PyObject* words) const
{
	py::UniqueObj ret{ PyList_New(0) };
	size_t c_found = 0, stack_size = 0, cur_pos = 0;
	auto* node = trie_nodes.data();
	py::foreach<string>(words, [&](const string& w)
	{
		auto wid = vocabs.toWid(w);

		if (wid != tomoto::non_vocab_id)
		{
			auto* nnode = node->getNext(wid);
			if (!nnode)
			{
				if (c_found)
				{
					auto& info = cand_info[c_found - 1];
					if (stack_size >= info.second)
					{
						assert(cur_pos - stack_size < PyObject_Length(words));
						assert(cur_pos - stack_size + info.second <= PyObject_Length(words));
						PyList_Append(ret.get(), py::buildPyTuple(info.first, py::buildPyTuple(cur_pos - stack_size, cur_pos - stack_size + info.second)).get());
						stack_size -= info.second;

						size_t targetDepth = node->depth - info.second;
						while (node->depth > targetDepth)
						{
							node = node->getFail();
						}
						nnode = node->getNext(wid);
					}
					c_found = 0;
				}

				while (!nnode)
				{
					size_t curDepth = node->depth;
					node = node->getFail();
					stack_size -= curDepth - (node ? node->depth : 0);
					if (node) nnode = node->getNext(wid);
					else break;
				}
			}

			if (nnode)
			{
				node = nnode;
				if (nnode->val && nnode->val != (size_t)-1)
				{
					c_found = nnode->val;
				}
				stack_size++;
				cur_pos++;
				return;
			}
		}
		stack_size = 0;
		node = trie_nodes.data();