Home
last modified time | relevance | path

Searched refs:bgn (Results 1 – 25 of 757) sorted by relevance

12345678910>>...31

/dports/biology/canu/canu-2.2/src/bogart/
H A DAS_BAT_PlaceReadUsingOverlaps.C192 assert(op.position.bgn <= op.verified.bgn); in placeRead_fromOverlaps()
196 assert(op.verified.bgn <= op.position.bgn); in placeRead_fromOverlaps()
382 op.covered.bgn = std::min(op.covered.bgn, ovlPlace[oo].covered.bgn); in placeRead_computePlacement()
400 bgnVer2 = op.position.bgn + op.covered.bgn; in placeRead_computePlacement()
403 bgnVer2 = op.position.bgn - op.covered.bgn; in placeRead_computePlacement()
441 if (op.verified.bgn < op.position.bgn) op.verified.bgn = op.position.bgn; in placeRead_computePlacement()
444 if (op.verified.bgn > op.position.bgn) op.verified.bgn = op.position.bgn; in placeRead_computePlacement()
455 assert(op.position.bgn <= op.verified.bgn); in placeRead_computePlacement()
459 assert(op.verified.bgn <= op.position.bgn); in placeRead_computePlacement()
484 op.covered.bgn = std::min(op.covered.bgn, ovlPlace[oo].covered.bgn); in placeRead_computeCoverage()
[all …]
H A DAS_BAT_Unitig.C39 frg->position.bgn = getLength() - frg->position.bgn; in reverseComplement()
414 while ((bgn < errorProfile[pb].bgn) || in overlapConsistentWithTig()
417 if (bgn < errorProfile[pb].bgn) in overlapConsistentWithTig()
430 uint32 pbi = bgn / 1000; in overlapConsistentWithTig()
436 while ((0 < pbi) && (errorProfile[errorProfileIndex[pbi]].bgn > bgn)) { in overlapConsistentWithTig()
459 while ((0 < pb) && (bgn < errorProfile[pb].bgn)) in overlapConsistentWithTig()
466 if ((errorProfile[pb].bgn > bgn) || in overlapConsistentWithTig()
469 bgn, end, pb, errorProfile[pb].bgn, errorProfile[pb].end); in overlapConsistentWithTig()
470 assert(errorProfile[pb].bgn <= bgn); in overlapConsistentWithTig()
492 uint32 bb = bgn - errorProfile[pb].bgn; in overlapConsistentWithTig()
[all …]
H A DAS_BAT_Unitig.H41 bgn = 0; in SeqInterval()
55 return(((bgn == that.bgn) && (end == that.end)) ||
56 ((bgn == that.end) && (end == that.bgn)));
60 return(((bgn != that.bgn) || (end != that.end)) &&
61 ((bgn != that.end) || (end != that.bgn)));
143 position.bgn = bgn;
180 int32 abgn = (position.bgn < position.end) ? position.bgn : position.end;
181 int32 aend = (position.bgn < position.end) ? position.end : position.bgn;
285 bgn = b; in epValue()
292 bgn = b; in epValue()
[all …]
H A DAS_BAT_Unitig_AddRead.C30 node.position.bgn += offset; in addRead()
39 int32 frgEnd = std::max(node.position.bgn, node.position.end); in addRead()
45 if ((report) || (node.position.bgn < 0) || (node.position.end < 0)) { in addRead()
47 …oslen = (node.position.end > node.position.bgn) ? (node.position.end - node.position.bgn) : (node.… in addRead()
51 node.ident, trulen, _id, node.position.bgn, node.position.end, in addRead()
57 node.ident, trulen, _id, node.position.bgn, node.position.end, in addRead()
65 assert(node.position.bgn >= 0); in addRead()
79 uint32 lastbgn = min(last.position.bgn, last.position.end);
82 (lastbgn < min(ufpath[previd].position.bgn, ufpath[previd].position.end))) {
/dports/biology/canu/canu-2.2/src/utility/src/tests/
H A DintervalsTest.C35 (t1.bgn(0) != 7) || (t1.end(0) != 11) || in boringTest()
36 (t1.bgn(1) != 0) || (t1.end(1) != 10) || in boringTest()
37 (t1.bgn(2) != 8) || (t1.end(2) != 20)); in boringTest()
48 (t1.bgn(0) != 0) || (t1.end(0) != 20)); in boringTest()
78 (t2.bgn(1) != -20) || (t2.end(1) != -5) || in invertTest()
127 uint32 end = bgn + len; in expensiveTest()
130 il.add_span(bgn, len); in expensiveTest()
132 il.add_position(bgn, end); in expensiveTest()
134 for (uint32 xx=bgn; xx<end; xx++) in expensiveTest()
147 uint32 bgn = de.bgn(xx); in expensiveTest() local
[all …]
/dports/converters/ytnef/ytnef-1.9.3/ytnef/
H A Dutility.c88 char *bgn = *str; in ConsumeHyperlink() local
90 bgn = strchr(bgn, '"'); in ConsumeHyperlink()
91 bgn++; in ConsumeHyperlink()
92 end = strchr(bgn, '"'); in ConsumeHyperlink()
95 strncpy(link, bgn, size); in ConsumeHyperlink()
100 bgn++; in ConsumeHyperlink()
101 if (*bgn == '\\') { in ConsumeHyperlink()
104 } else if (*bgn == ' ') { in ConsumeHyperlink()
117 if (*bgn != '}') { in ConsumeHyperlink()
118 end = strchr(bgn, '}'); in ConsumeHyperlink()
[all …]
/dports/biology/canu/canu-2.2/src/utility/src/utility/
H A Dkmers-lookup.H171 uint64 bgn = _suffixBgn[prefix]; in exists() local
179 while (bgn + 8 < end) { in exists()
180 mid = bgn + (end - bgn) / 2; in exists()
191 bgn = mid + 1; in exists()
196 for (mid=bgn; mid < end; mid++) { in exists()
225 while (bgn + 8 < end) { in exists()
226 mid = bgn + (end - bgn) / 2; in exists()
242 bgn = mid + 1; in exists()
280 while (bgn + 8 < end) { in value()
281 mid = bgn + (end - bgn) / 2; in value()
[all …]
H A Dintervals.H57 iNum bgn (uint32 idx) const { return(_list[idx]._bgn); }; in bgn() function
65 iNum &bgn (uint32 idx) { return(_list[idx]._bgn); }; in bgn() function
90 void add_position(iNum bgn, iNum end);
91 void add_span (iNum bgn, iNum len) { in add_span() argument
93 add_position(bgn+len, bgn); in add_span()
95 add_position(bgn, bgn+len); in add_span()
151 void setToUnion (iNum bgn, iNum end, intervals<iNum> const &A);
152 void setToIntersection(iNum bgn, iNum end, intervals<iNum> const &A);
159 void setToInversion1(iNum bgn, iNum end, intervals<iNum> const &A);
160 void setToInversion2(iNum bgn, iNum end, intervals<iNum> const &A);
[all …]
/dports/audio/julius/julius-4.1.2/libsent/src/anlz/
H A Dstrip.c44 int bgn,mode,j; in strip_zero() local
47 bgn = 0; in strip_zero()
53 bgn = src; in strip_zero()
60 if ((src - bgn) < WINDOWLEN) { in strip_zero()
61 for(j=bgn;j<src;j++) { in strip_zero()
66 jlog("Warning: strip: sample %d-%d has zero value, stripped\n", bgn, src-1); in strip_zero()
75 if ((src - bgn) < WINDOWLEN) { in strip_zero()
77 for(j=bgn;j<src;j++) { in strip_zero()
82 jlog("Warning: strip: sample %d-%d is invalid, stripped\n", bgn, src-1); in strip_zero()
/dports/lang/clover/mesa-21.3.6/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/libosmesa/mesa-21.3.6/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/libosmesa-gallium/mesa-21.3.6/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/mesa-libs/mesa-21.3.6/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/mesa-gallium-xa/mesa-21.3.6/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/mesa-dri-gallium/mesa-21.3.6/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/mesa-gallium-va/mesa-21.3.6/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/mesa-dri-classic/mesa-20.2.3/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/graphics/mesa-dri/mesa-21.3.6/src/gallium/frontends/nine/
H A Dnine_helpers.c53 nine_range_pool_get(struct nine_range_pool *pool, int16_t bgn, int16_t end) in nine_range_pool_get() argument
60 r->bgn = bgn; in nine_range_pool_get()
70 while (r->next && r->end >= r->next->bgn) { in nine_ranges_coalesce()
79 nine_ranges_insert(struct nine_range **head, int16_t bgn, int16_t end, in nine_ranges_insert() argument
84 for (r = *head; r && bgn > r->end; pn = &r->next, r = r->next); in nine_ranges_insert()
86 if (!r || end < r->bgn) { in nine_ranges_insert()
87 *pn = nine_range_pool_get(pool, bgn, end); in nine_ranges_insert()
90 if (bgn < r->bgn) { in nine_ranges_insert()
91 r->bgn = bgn; in nine_ranges_insert()
/dports/databases/grass7/grass-7.8.6/lib/ogsf/
H A Dgsdrape.c158 if (!((end[Y] - bgn[Y]) / (end[X] - bgn[X]) == yres / xres)) { in _gsdrape_get_segments()
249 replace = bgn; in seg_intersect_vregion()
259 (bgn[X], bgn[Y], end[X], end[Y], xl, yb, xl, yt, &xi, &yi)) { in seg_intersect_vregion()
263 (bgn[X], bgn[Y], end[X], end[Y], xr, yb, xr, yt, &xi, &yi)) { in seg_intersect_vregion()
267 (bgn[X], bgn[Y], end[X], end[Y], xl, yb, xr, yb, &xi, &yi)) { in seg_intersect_vregion()
271 (bgn[X], bgn[Y], end[X], end[Y], xl, yt, xr, yt, &xi, &yi)) { in seg_intersect_vregion()
301 (bgn[X], bgn[Y], end[X], end[Y], xl, yb, xr, yb, &xi, &yi)) { in seg_intersect_vregion()
311 (bgn[X], bgn[Y], end[X], end[Y], xl, yt, xr, yt, &xi, &yi)) { in seg_intersect_vregion()
323 if (GS_P2distance(bgn, pt1) < GS_P2distance(bgn, pt2)) { in seg_intersect_vregion()
373 if (bgn[X] == end[X] && bgn[Y] == end[Y]) { in gsdrape_get_segments()
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/webrtc/modules/audio_coding/neteq/
H A Dnormal_unittest.cc48 BackgroundNoise bgn(channels); in TEST() local
53 Normal normal(fs, &db, bgn, &expand); in TEST()
61 BackgroundNoise bgn(channels); in TEST() local
65 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, fs, in TEST()
67 Normal normal(fs, &db, bgn, &expand); in TEST()
96 BackgroundNoise bgn(channels); in TEST() local
100 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, fs, in TEST()
102 Normal normal(fs, &db, bgn, &expand); in TEST()
121 BackgroundNoise bgn(kChannels); in TEST() local
125 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, kFs, in TEST()
[all …]
/dports/net-im/tg_owt/tg_owt-d578c76/src/modules/audio_coding/neteq/
H A Dnormal_unittest.cc48 BackgroundNoise bgn(channels); in TEST() local
53 Normal normal(fs, &db, bgn, &expand, &statistics); in TEST()
61 BackgroundNoise bgn(channels); in TEST() local
65 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, fs, in TEST()
67 Normal normal(fs, &db, bgn, &expand, &statistics); in TEST()
96 BackgroundNoise bgn(channels); in TEST() local
100 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, fs, in TEST()
102 Normal normal(fs, &db, bgn, &expand, &statistics); in TEST()
121 BackgroundNoise bgn(kChannels); in TEST() local
125 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, kFs, in TEST()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/webrtc/modules/audio_coding/neteq/
H A Dnormal_unittest.cc48 BackgroundNoise bgn(channels); in TEST() local
53 Normal normal(fs, &db, bgn, &expand); in TEST()
61 BackgroundNoise bgn(channels); in TEST() local
65 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, fs, in TEST()
67 Normal normal(fs, &db, bgn, &expand); in TEST()
96 BackgroundNoise bgn(channels); in TEST() local
100 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, fs, in TEST()
102 Normal normal(fs, &db, bgn, &expand); in TEST()
121 BackgroundNoise bgn(kChannels); in TEST() local
125 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, kFs, in TEST()
[all …]
/dports/www/firefox/firefox-99.0/third_party/libwebrtc/modules/audio_coding/neteq/
H A Dnormal_unittest.cc48 BackgroundNoise bgn(channels); in TEST() local
53 Normal normal(fs, &db, bgn, &expand); in TEST()
61 BackgroundNoise bgn(channels); in TEST() local
65 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, fs, in TEST()
67 Normal normal(fs, &db, bgn, &expand); in TEST()
96 BackgroundNoise bgn(channels); in TEST() local
100 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, fs, in TEST()
102 Normal normal(fs, &db, bgn, &expand); in TEST()
121 BackgroundNoise bgn(kChannels); in TEST() local
125 MockExpand expand(&bgn, &sync_buffer, &random_vector, &statistics, kFs, in TEST()
[all …]

12345678910>>...31