本文整理汇总了C++中DeBruijnNode::getUpstreamSequence方法的典型用法代码示例。如果您正苦于以下问题：C++ DeBruijnNode::getUpstreamSequence方法的具体用法？C++ DeBruijnNode::getUpstreamSequence怎么用？C++ DeBruijnNode::getUpstreamSequence使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类DeBruijnNode的用法示例。
在下文中一共展示了DeBruijnNode::getUpstreamSequence方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: getUpstreamSequence
QByteArray DeBruijnNode::getUpstreamSequence(int upstreamSequenceLength) const
{
std::vector<DeBruijnNode*> upstreamNodes = getUpstreamNodes();
QByteArray bestUpstreamNodeSequence;
for (size_t i = 0; i < upstreamNodes.size(); ++i)
{
DeBruijnNode * upstreamNode = upstreamNodes[i];
QByteArray upstreamNodeFullSequence = upstreamNode->getSequence();
QByteArray upstreamNodeSequence;
//If the upstream node has enough sequence, great!
if (upstreamNodeFullSequence.length() >= upstreamSequenceLength)
upstreamNodeSequence = upstreamNodeFullSequence.right(upstreamSequenceLength);
//If the upstream node does not have enough sequence, then we need to
//look even further upstream.
else
upstreamNodeSequence = upstreamNode->getUpstreamSequence(upstreamSequenceLength - upstreamNodeFullSequence.length()) + upstreamNodeFullSequence;
//If we now have enough sequence, then we can return it.
if (upstreamNodeSequence.length() == upstreamSequenceLength)
return upstreamNodeSequence;
//If we don't have enough sequence, then we need to try the next
//upstream node. If our current one is the best so far, save that in
//case no complete sequence is found.
if (upstreamNodeSequence.length() > bestUpstreamNodeSequence.length())
bestUpstreamNodeSequence = upstreamNodeSequence;
}
//If the code got here, that means that not enough upstream sequence was
//found in any path! Return what we have managed to get so far.
return bestUpstreamNodeSequence;
}