RetroSearch Browse

Showing content from https://github.com/marbl/canu/commit/2b70735e256a35e7f697d96dc80e1f40bcf50ae4 below:

File tree Expand file treeCollapse file tree 2 files changed

-4

lines changed

Filter options

Expand file treeCollapse file tree 2 files changed

-4

lines changed Original file line number Diff line number Diff line change


 @@ -124,7 +124,7 @@ placeRead_fromOverlaps(TigVector &tigs,

124 124


 if (ovl[oo].b_hang > 0)

125 125


 bposlen -= ovl[oo].b_hang;

126 126 127

-
 if (bposlen < 0) {

127

+
 if (bposlen <= 0) {

128 128


 writeLog("WARNING: read %u overlap to read %u in tig %u at %d-%d - hangs %d %d to large for placement, ignoring overlap\n",

129 129


 ovl[oo].a_iid,

130 130


 ovl[oo].b_iid,

Original file line number Diff line number Diff line change


 @@ -390,9 +390,10 @@ Unitig::overlapConsistentWithTig(double deviations,

390 390


 int32 nBelow = 0;

391 391


 int32 nAbove = 0;

392 392 393

-
 assert(bgn < end);

394

-
 assert(bgn < getLength());

395

-
 assert(end <= getLength());

393

+
 if ((bgn >= end) || // If the read placement is garbage,

394

+
 (bgn >= getLength()) || // the placement is not consistent!

395

+
 (end > getLength())) // (used to just assert on these,

396

+
 return(1.0); // and they almost never occur)

396 397 397 398


 // If this is a singleton tig - we should only be here when finding graph edges to repeats -

398 399


 // we've got nothing to go on, so default to 'consistent'.

You can’t perform that action at this time.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4