本文整理汇总了C++中ContigPath::assign方法的典型用法代码示例。如果您正苦于以下问题：C++ ContigPath::assign方法的具体用法？C++ ContigPath::assign怎么用？C++ ContigPath::assign使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类ContigPath的用法示例。
在下文中一共展示了ContigPath::assign方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: align
/** Find an equivalent region of the two specified paths, starting the
* alignment at pivot1 of path1 and pivot2 of path2.
* @param[out] orientation the orientation of the alignment
* @return the consensus sequence
*/
static ContigPath align(const Lengths& lengths,
const ContigPath& p1, const ContigPath& p2,
ContigPath::const_iterator pivot1,
ContigPath::const_iterator pivot2,
dir_type& orientation)
{
assert(*pivot1 == *pivot2);
ContigPath::const_reverse_iterator
rit1 = ContigPath::const_reverse_iterator(pivot1+1),
rit2 = ContigPath::const_reverse_iterator(pivot2+1);
ContigPath alignmentr(p1.rend() - rit1 + p2.rend() - rit2);
ContigPath::iterator rout = alignmentr.begin();
dir_type alignedr = align(lengths,
rit1, p1.rend(), rit2, p2.rend(), rout);
alignmentr.erase(rout, alignmentr.end());
ContigPath::const_iterator it1 = pivot1, it2 = pivot2;
ContigPath alignmentf(p1.end() - it1 + p2.end() - it2);
ContigPath::iterator fout = alignmentf.begin();
dir_type alignedf = align(lengths,
it1, p1.end(), it2, p2.end(), fout);
alignmentf.erase(fout, alignmentf.end());
ContigPath consensus;
if (alignedr != DIR_X && alignedf != DIR_X) {
// Found an alignment.
assert(!alignmentf.empty());
assert(!alignmentr.empty());
consensus.reserve(alignmentr.size()-1 + alignmentf.size());
consensus.assign(alignmentr.rbegin(), alignmentr.rend()-1);
consensus.insert(consensus.end(),
alignmentf.begin(), alignmentf.end());
// Determine the orientation of the alignment.
unsigned dirs = alignedr << 2 | alignedf;
static const dir_type DIRS[16] = {
DIR_X, // 0000 XX impossible
DIR_X, // 0001 XF impossible
DIR_X, // 0010 XR impossible
DIR_X, // 0011 XB impossible
DIR_X, // 0100 FX impossible
DIR_B, // 0101 FF u is subsumed in v
DIR_R, // 0110 FR v->u
DIR_R, // 0111 FB v->u
DIR_X, // 1000 RX impossible
DIR_F, // 1001 RF u->v
DIR_B, // 1010 RR v is subsumed in u
DIR_F, // 1011 RB u->v
DIR_X, // 1100 BX impossible
DIR_F, // 1101 BF u->v
DIR_R, // 1110 BR v->u
DIR_B, // 1111 BB u and v are equal
};
assert(dirs < 16);
orientation = DIRS[dirs];
assert(orientation != DIR_X);
}
return consensus;
}