| /dports/biology/bwa/bwa-0.7.17/ |
| H A D | rope.c | 66 rope->root->is_bottom = 1; in rope_init()
103 q->is_bottom = p->is_bottom; in split_node()
134 } while (!u->is_bottom); in rope_insert_run()
174 } while (!u->is_bottom); in rope_count_to_leaf()
227 if (p->is_bottom) { in rope_print_node()
256 uint8_t is_bottom = p->is_bottom; in rope_dump_node() local
259 if (is_bottom) { in rope_dump_node()
279 uint8_t is_bottom, a; in rope_restore_node() local
282 fread(&is_bottom, 1, 1, fp); in rope_restore_node()
285 p->is_bottom = is_bottom, p->n = n; in rope_restore_node()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/chrome/browser/page_load_metrics/observers/ad_metrics/ |
| H A D | page_ad_density_tracker.cc | 136 bool is_bottom, in RectEvent() argument
138 : rect_id(id), is_bottom(is_bottom), rect(rect) {} in RectEvent()
222 DCHECK(rect_event.is_bottom); in CalculateDensity()
227 rect_event.is_bottom ? rect_event.rect.bottom() : rect_event.rect.y(); in CalculateDensity()
231 rect_event.is_bottom ? rect_event.rect.bottom() : rect_event.rect.y(); in CalculateDensity()
253 if (rect_event.is_bottom) { in CalculateDensity()
284 int lhs_y = is_bottom ? rect.bottom() : rect.y(); in operator <()
285 int rhs_y = rhs.is_bottom ? rhs.rect.bottom() : rhs.rect.y(); in operator <()
290 return is_bottom == rhs.is_bottom; in operator <()
|
| H A D | page_ad_density_tracker.h | 52 RectEvent(int id, bool is_bottom, const gfx::Rect& rect);
58 bool is_bottom; member
|
| /dports/devel/ppl/ppl-1.2/src/ |
| H A D | Powerset_templates.hh | 71 if (xi->is_bottom()) { in omega_reduce()
141 if (xv.is_bottom()) { in check_omega_reduced()
171 PPL_ASSERT_HEAVY(!d.is_bottom()); in add_non_bottom_disjunct_preserve_reduction()
248 if (!zi.is_bottom()) { in pairwise_apply_assign()
281 if (x.is_bottom()) { in operator <<()
323 if (disallow_bottom && xi->is_bottom()) { in OK()
|
| /dports/devel/ppl/ppl-1.2/tests/Powerset/ |
| H A D | membytes1.cc | 35 bool ok = c_ps.is_bottom(); in test01()
52 bool ok = pps_box.is_bottom(); in test02()
|
| /dports/x11-toolkits/gtk40/gtk-4.4.1/gtk/ |
| H A D | gtkoverlaylayout.c | 346 gboolean is_left, is_right, is_top, is_bottom; in gtk_overlay_child_update_style_classes() local
354 is_left = is_right = is_top = is_bottom = FALSE; in gtk_overlay_child_update_style_classes()
372 is_bottom = (child_allocation->y + child_allocation->height == height); in gtk_overlay_child_update_style_classes()
389 if (has_bottom && !is_bottom) in gtk_overlay_child_update_style_classes()
391 else if (!has_bottom && is_bottom) in gtk_overlay_child_update_style_classes()
|
| /dports/cad/yosys/yosys-yosys-0.12/passes/techmap/ |
| H A D | flowmap.cc | 240 bool is_bottom; member
243 node(node), is_bottom(is_bottom) {} in NodePrime()
247 return node == other.node && is_bottom == other.is_bottom; in operator ==()
270 log_assert(is_bottom); in as_top()
276 log_assert(!is_bottom); in as_bottom()
294 if (!node_prime.is_bottom) // vt in find_augmenting_path()
350 log_assert(prev_prime.is_bottom ^ node_prime.is_bottom); in find_augmenting_path()
354 if (!prev_prime.is_bottom && node_prime.is_bottom) in find_augmenting_path()
367 if (prev_prime.is_bottom && !node_prime.is_bottom) in find_augmenting_path()
410 if (!node_prime.is_bottom) in edge_cut()
[all …]
|
| /dports/databases/percona56-client/percona-server-5.6.51-91.0/sql/ |
| H A D | gcalc_slicescan.cc | 450 if (sp1->is_bottom() && !sp0->is_bottom() && in intersection_found()
545 if (sp1->is_bottom()) in normal_scan()
562 else if (!sp0->is_bottom()) in normal_scan()
642 while (sp0->is_bottom()) in find_intersections()
659 unsigned int bottom_points_count= sp1->is_bottom() ? 1:0; in find_intersections()
666 if (sp1->is_bottom()) in find_intersections()
801 while(next_s0->is_bottom()); /* We always find nonbottom point here*/ in intersection_scan()
824 if (!sp0->is_bottom()) in intersection_scan()
|
| H A D | gcalc_slicescan.h | 138 inline bool is_bottom() const { return !left; } in is_bottom() function
339 inline bool is_bottom() const { return pi->is_bottom(); } in is_bottom() function
458 while ((result= result->c_get_next())->is_bottom()) in rb()
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/sql/ |
| H A D | gcalc_slicescan.cc | 450 if (sp1->is_bottom() && !sp0->is_bottom() && in intersection_found()
545 if (sp1->is_bottom()) in normal_scan()
562 else if (!sp0->is_bottom()) in normal_scan()
642 while (sp0->is_bottom()) in find_intersections()
659 unsigned int bottom_points_count= sp1->is_bottom() ? 1:0; in find_intersections()
666 if (sp1->is_bottom()) in find_intersections()
801 while(next_s0->is_bottom()); /* We always find nonbottom point here*/ in intersection_scan()
824 if (!sp0->is_bottom()) in intersection_scan()
|
| H A D | gcalc_slicescan.h | 138 inline bool is_bottom() const { return !left; } in is_bottom() function
339 inline bool is_bottom() const { return pi->is_bottom(); } in is_bottom() function
458 while ((result= result->c_get_next())->is_bottom()) in rb()
|
| /dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/sql/ |
| H A D | gcalc_slicescan.cc | 450 if (sp1->is_bottom() && !sp0->is_bottom() && in intersection_found()
545 if (sp1->is_bottom()) in normal_scan()
562 else if (!sp0->is_bottom()) in normal_scan()
642 while (sp0->is_bottom()) in find_intersections()
659 unsigned int bottom_points_count= sp1->is_bottom() ? 1:0; in find_intersections()
666 if (sp1->is_bottom()) in find_intersections()
801 while(next_s0->is_bottom()); /* We always find nonbottom point here*/ in intersection_scan()
824 if (!sp0->is_bottom()) in intersection_scan()
|
| H A D | gcalc_slicescan.h | 138 inline bool is_bottom() const { return !left; } in is_bottom() function
339 inline bool is_bottom() const { return pi->is_bottom(); } in is_bottom() function
458 while ((result= result->c_get_next())->is_bottom()) in rb()
|
| /dports/databases/percona56-server/percona-server-5.6.51-91.0/sql/ |
| H A D | gcalc_slicescan.cc | 450 if (sp1->is_bottom() && !sp0->is_bottom() && in intersection_found()
545 if (sp1->is_bottom()) in normal_scan()
562 else if (!sp0->is_bottom()) in normal_scan()
642 while (sp0->is_bottom()) in find_intersections()
659 unsigned int bottom_points_count= sp1->is_bottom() ? 1:0; in find_intersections()
666 if (sp1->is_bottom()) in find_intersections()
801 while(next_s0->is_bottom()); /* We always find nonbottom point here*/ in intersection_scan()
824 if (!sp0->is_bottom()) in intersection_scan()
|
| H A D | gcalc_slicescan.h | 138 inline bool is_bottom() const { return !left; } in is_bottom() function
339 inline bool is_bottom() const { return pi->is_bottom(); } in is_bottom() function
458 while ((result= result->c_get_next())->is_bottom()) in rb()
|
| /dports/databases/mysql56-client/mysql-5.6.51/sql/ |
| H A D | gcalc_slicescan.cc | 450 if (sp1->is_bottom() && !sp0->is_bottom() && in intersection_found()
545 if (sp1->is_bottom()) in normal_scan()
562 else if (!sp0->is_bottom()) in normal_scan()
642 while (sp0->is_bottom()) in find_intersections()
659 unsigned int bottom_points_count= sp1->is_bottom() ? 1:0; in find_intersections()
666 if (sp1->is_bottom()) in find_intersections()
801 while(next_s0->is_bottom()); /* We always find nonbottom point here*/ in intersection_scan()
824 if (!sp0->is_bottom()) in intersection_scan()
|
| H A D | gcalc_slicescan.h | 138 inline bool is_bottom() const { return !left; } in is_bottom() function
339 inline bool is_bottom() const { return pi->is_bottom(); } in is_bottom() function
458 while ((result= result->c_get_next())->is_bottom()) in rb()
|
| /dports/x11-toolkits/gtk40/gtk-4.4.1/demos/gtk-demo/ |
| H A D | bluroverlay.c | 132 gboolean is_left, is_right, is_top, is_bottom; in blur_overlay_child_update_style_classes() local
140 is_left = is_right = is_top = is_bottom = FALSE; in blur_overlay_child_update_style_classes()
158 is_bottom = (child_allocation->y + child_allocation->height == height); in blur_overlay_child_update_style_classes()
175 if (has_bottom && !is_bottom) in blur_overlay_child_update_style_classes()
177 else if (!has_bottom && is_bottom) in blur_overlay_child_update_style_classes()
|
| /dports/lang/mono/mono-5.10.1.57/mcs/class/Mono.CodeContracts/Mono.CodeContracts.Static.DataFlowAnalysis/ |
| H A D | ForwardAnalysis.cs | 45 private readonly Func<APC, AbstractState, bool> is_bottom; field in Mono.CodeContracts.Static.DataFlowAnalysis.ForwardAnalysis
66 this.is_bottom = isBottom; in ForwardAnalysis()
131 return this.is_bottom (pc, state); in IsBottom()
|
| /dports/x11-wm/wayfire/wayfire-0.7.0/plugins/single_plugins/ |
| H A D | move.cpp | 332 bool is_bottom = g.x + g.height - point.y < threshold; in calc_slot() local
346 } else if ((is_right && is_far_bottom) || (is_far_right && is_bottom)) in calc_slot()
349 } else if ((is_left && is_far_bottom) || (is_far_left && is_bottom)) in calc_slot()
362 } else if (is_bottom) in calc_slot()
|
| /dports/lang/mono/mono-5.10.1.57/mcs/class/Mono.CodeContracts/Mono.CodeContracts.Static.Analysis.Numerical/ |
| H A D | Interval.cs | 47 readonly bool is_bottom; field in Mono.CodeContracts.Static.Analysis.Numerical.Interval
61 is_bottom = LowerBound > UpperBound; in Interval()
89 public override bool IsBottom { get { return is_bottom; } }
265 if (intv.is_bottom) in ApplyConversion()
|
| /dports/security/zeronet/ZeroNet-0.7.1/plugins/Sidebar/media/ |
| H A D | Console.coffee | 42 @text.is_bottom = true
58 …@text.is_bottom = Math.round(@text_elem.scrollTop + @text_elem.clientHeight) >= @text_elem.scrollH…
92 if @text.is_bottom and animate
|
| /dports/devel/csmith/csmith-2.3.0/src/ |
| H A D | FactUnion.cpp | 76 if (is_top() || is_bottom()) return NULL; in get_last_written_type()
263 if (is_bottom()) return true; // bottom implies every node in imply()
265 if (fu.is_bottom()) return false; in imply()
|
| /dports/databases/mariadb105-client/mariadb-10.5.15/sql/ |
| H A D | gcalc_slicescan.h | 212 bool is_bottom() const in is_bottom() function
217 { return is_bottom() && is_top(); } in is_single_node()
392 inline bool is_bottom() const { return !next_pi; } in is_bottom() function
566 while ((result= result->c_get_next())->is_bottom()) in rb()
|
| /dports/databases/mariadb103-server/mariadb-10.3.34/sql/ |
| H A D | gcalc_slicescan.h | 212 bool is_bottom() const in is_bottom() function
217 { return is_bottom() && is_top(); } in is_single_node()
392 inline bool is_bottom() const { return !next_pi; } in is_bottom() function
566 while ((result= result->c_get_next())->is_bottom()) in rb()
|