| /dports/math/py-libpoly/libpoly-0.1.11/src/interval/ |
| H A D | interval.c | 94 I->is_point = 1; in lp_rational_interval_construct_point()
101 I->is_point = 1; in lp_dyadic_interval_construct_point()
108 I->is_point = 1; in lp_interval_construct_point()
114 I->is_point = 1; in lp_rational_interval_construct_zero()
121 I->is_point = 1; in lp_dyadic_interval_construct_zero()
138 I->is_point = from->is_point; in lp_rational_interval_construct_copy()
148 I->is_point = from->is_point; in lp_dyadic_interval_construct_copy()
158 I->is_point = from->is_point; in lp_interval_construct_copy()
205 I->is_point = from->is_point; in lp_rational_interval_construct_from_dyadic_interval()
880 if (I1->is_point && !I2->is_point) { in lp_dyadic_interval_equals()
[all …]
|
| H A D | arithmetic.c | 57 if (I1->is_point && I2->is_point) { in rational_interval_add()
63 S->is_point = 1; in rational_interval_add()
67 if (I2->is_point) { in rational_interval_add()
97 if (I1->is_point && I2->is_point) { in dyadic_interval_add()
103 S->is_point = 1; in dyadic_interval_add()
148 int is_point = 1; in lp_value_add_approx() local
205 if (v1->value.a.I.is_point && v2->value.a.I.is_point) { in lp_value_add_approx()
331 return is_point; in lp_value_add_approx()
339 if (I1->is_point && I2->is_point) { in lp_interval_add()
716 if (v1->value.a.I.is_point && v2->value.a.I.is_point) { in lp_value_mul_approx()
[all …]
|
| /dports/math/libpoly/libpoly-0.1.11/src/interval/ |
| H A D | interval.c | 94 I->is_point = 1; in lp_rational_interval_construct_point()
101 I->is_point = 1; in lp_dyadic_interval_construct_point()
108 I->is_point = 1; in lp_interval_construct_point()
114 I->is_point = 1; in lp_rational_interval_construct_zero()
121 I->is_point = 1; in lp_dyadic_interval_construct_zero()
138 I->is_point = from->is_point; in lp_rational_interval_construct_copy()
148 I->is_point = from->is_point; in lp_dyadic_interval_construct_copy()
158 I->is_point = from->is_point; in lp_interval_construct_copy()
205 I->is_point = from->is_point; in lp_rational_interval_construct_from_dyadic_interval()
880 if (I1->is_point && !I2->is_point) { in lp_dyadic_interval_equals()
[all …]
|
| H A D | arithmetic.c | 57 if (I1->is_point && I2->is_point) { in rational_interval_add()
63 S->is_point = 1; in rational_interval_add()
67 if (I2->is_point) { in rational_interval_add()
97 if (I1->is_point && I2->is_point) { in dyadic_interval_add()
103 S->is_point = 1; in dyadic_interval_add()
148 int is_point = 1; in lp_value_add_approx() local
205 if (v1->value.a.I.is_point && v2->value.a.I.is_point) { in lp_value_add_approx()
331 return is_point; in lp_value_add_approx()
339 if (I1->is_point && I2->is_point) { in lp_interval_add()
716 if (v1->value.a.I.is_point && v2->value.a.I.is_point) { in lp_value_mul_approx()
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Segment_Delaunay_graph_Linf_2/ |
| H A D | Finite_edge_interior_conflict_C2.h | 116 if ( p.is_point() && q.is_point() ) { in is_interior_in_conflict_both()
142 CGAL_precondition( sp.is_point() && sq.is_point() ); in is_interior_in_conflict_both_pp()
452 if (r.is_point() && s.is_point()) { in is_interior_in_conflict_touch()
467 if (r.is_point() && s.is_point()) { in is_interior_in_conflict_touch()
489 if ( (p.is_point() && q.is_point()) || in is_interior_in_conflict_touch()
523 if ( p.is_point() && q.is_point() ) { in is_interior_in_conflict_none()
544 CGAL_precondition( p.is_point() && q.is_point() && t.is_point() ); in is_interior_in_conflict_none_pp()
558 CGAL_precondition( sp.is_point() && sq.is_segment() && st.is_point() ); in is_interior_in_conflict_none_ps()
764 if (t.is_point() && p.is_point() && q.is_point()) { in operator()
856 CGAL_assertion( p.is_point() || q.is_point() ); in operator()
[all …]
|
| H A D | Constructions_C2.h | 185 if ( p.is_point() && q.is_point() ) { in operator()
263 if ( (p.is_point() && q.is_segment()) in operator()
269 Site_2 sitep = (p.is_point()) ? p : q; in operator()
294 if (q.is_point()) { in operator()
465 if ( p.is_point() && q.is_point() ) { in operator()
551 if ( (p.is_point() && q.is_segment()) in operator()
584 if (q.is_point()) { in operator()
703 if (p.is_point()) { in operator()
824 if ( p.is_point() && q.is_point() ) { in pcsbis()
933 if ( ( p.is_point() && in pcsbis()
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Segment_Delaunay_graph_2/ |
| H A D | Voronoi_vertex_sqrt_field_new_C2.h | 122 CGAL_precondition( sp.is_point() && sq.is_point() && in compute_vv()
155 CGAL_precondition( sp.is_point() && sq.is_point() && in compute_vv()
1188 if ( p.is_point() ) { in incircle_p()
1220 if ( p.is_point() ) { in incircle_s()
1247 if ( p_.is_point() ) { in is_degenerate_Voronoi_circle()
1308 if ( t.is_point() ) { in incircle()
1318 if ( t.is_point() ) { in operator()
1366 if ( p.is_point() ) { in incircle_p_no_easy()
1403 if ( p.is_point() ) { in incircle_s_no_easy()
1423 if ( t.is_point() ) { in incircle_no_easy()
[all …]
|
| H A D | Finite_edge_interior_conflict_C2.h | 93 if ( p.is_point() && q.is_point() ) { in is_interior_in_conflict_both()
119 CGAL_precondition( sp.is_point() && sq.is_point() ); in is_interior_in_conflict_both_pp()
201 if ( t.is_point() ) { in is_interior_in_conflict_both_ps()
214 CGAL_precondition( t.is_point() ); in is_interior_in_conflict_both_ps_p()
417 if ( !(r.is_point() && s.is_point() && r.point()==s.point() ) && in is_interior_in_conflict_touch()
435 if ( (p.is_point() && q.is_point()) || in is_interior_in_conflict_touch()
467 if ( p.is_point() && q.is_point() ) { in is_interior_in_conflict_none()
491 CGAL_precondition( p.is_point() && q.is_point() && t.is_point() ); in is_interior_in_conflict_none_pp()
502 CGAL_precondition( sp.is_point() && sq.is_segment() && st.is_point() ); in is_interior_in_conflict_none_ps()
684 if ( t.is_point() ) { in operator()
[all …]
|
| H A D | Voronoi_vertex_sqrt_field_C2.h | 77 CGAL_precondition( sp.is_point() && sq.is_point() && in compute_ppp()
258 CGAL_precondition( p.is_point() && q.is_point() && in compute_pps()
851 if ( p_.is_point() && q_.is_point() && in incircle_s()
856 if ( p_.is_point() && r_.is_point() && in incircle_s()
861 if ( q_.is_point() && r_.is_point() && in incircle_s()
891 if(p_.is_point()){ in incircle_s()
893 if(q_.is_point()){ in incircle_s()
1100 if ( p_.is_point() ) { in is_degenerate_Voronoi_circle()
1129 if ( p_.is_point() ) { in p_ref()
1224 if ( t.is_point() ) { in incircle()
[all …]
|
| H A D | Oriented_side_C2.h | 65 CGAL_precondition(s1.is_point() || s2.is_point()); in operator()
68 return this->operator()((s1.is_point()? s1: s2), s, p); in operator()
78 CGAL_precondition( q.is_point() ); in operator()
79 CGAL_precondition( s.is_segment() && p.is_point() ); in operator()
95 CGAL_precondition( s.is_segment() && p.is_point() ); in operator()
|
| H A D | Vertex_conflict_C2.h | 226 CGAL_precondition( t.is_point() ); in incircle_p()
228 if ( p.is_point() && q.is_point() ) { in incircle_p()
315 CGAL_assertion( p.is_point() || q.is_point() ); in incircle_p()
318 if ( p.is_point() && q.is_segment() ) { in incircle_p()
336 CGAL_precondition( p.is_point() && q.is_point() ); in incircle_pps()
435 if ( p.is_point() && q.is_point() ) { in incircle_s()
458 if ( p.is_point() ) ++np; in operator()
459 if ( q.is_point() ) ++np; in operator()
460 if ( r.is_point() ) ++np; in operator()
537 if ( p.is_point() && q.is_segment() ) { in operator()
[all …]
|
| H A D | Voronoi_vertex_ring_C2.h | 84 CGAL_precondition( sp.is_point() && sq.is_point() && in compute_ppp()
304 CGAL_precondition( p.is_point() && q.is_point() && in compute_pps()
643 if ( s1.is_point() && s2.is_point() && s3.is_point() ) { in compute_vertex()
646 } else if ( s1.is_segment() && s2.is_point() && s3.is_point() ) { in compute_vertex()
650 } else if ( s1.is_point() && s2.is_segment() && s3.is_point() ) { in compute_vertex()
654 } else if ( s1.is_point() && s2.is_point() && s3.is_segment() ) { in compute_vertex()
1096 if ( p_.is_point() && q_.is_point() && in incircle_s()
1101 if ( p_.is_point() && r_.is_point() && in incircle_s()
1106 if ( q_.is_point() && r_.is_point() && in incircle_s()
1444 if ( t.is_point() ) { in incircle()
[all …]
|
| /dports/devel/ppl/ppl-1.2/tests/Polyhedron/ |
| H A D | max_min1.cc | 48 && g.is_point() in test01()
64 && g.is_point() in test01()
100 && g.is_point() in test02()
118 && g.is_point() in test02()
147 && g.is_point() in test03()
162 && g.is_point() in test03()
188 && g.is_point() in test04()
192 && g.is_point() in test04()
|
| /dports/devel/ppl/ppl-1.2/tests/Powerset/ |
| H A D | maxmin1.cc | 42 && g.is_point() in test01()
53 && g.is_point() in test01()
144 && g.is_point() in test03()
166 && g.is_point() in test03()
193 && g.is_point() in test04()
202 && g.is_point() in test04()
222 && g.is_point() in test05()
233 && g.is_point() in test05()
325 && g.is_point() in test07()
347 && g.is_point() in test07()
[all …]
|
| /dports/graphics/mesa-dri-classic/mesa-20.2.3/bin/ |
| H A D | gen_release_notes_test.py | 33 def test_next_version(current: str, is_point: bool, expected: str) -> None:
34 assert calculate_next_version(current, is_point) == expected
43 def test_previous_version(current: str, is_point: bool, expected: str) -> None:
44 assert calculate_previous_version(current, is_point) == expected
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/ |
| H A D | Segment_Delaunay_graph_simple_storage_site_2.h | 96 bool is_point() const { return type_ == 1; } in is_point() function
104 CGAL_precondition( is_point() && is_input() ); in point()
122 CGAL_precondition( is_point() && !is_input() ); in source_of_supporting_site()
127 CGAL_precondition( is_point() && !is_input() ); in target_of_supporting_site()
144 if ( is_point() ) { in site()
170 CGAL_precondition( is_point() && !is_input() && i < 2 ); in supporting_site()
|
| H A D | Segment_Delaunay_graph_simple_site_2.h | 102 bool is_point() const { return type_ == 1; } in is_point() function
108 CGAL_precondition ( is_point() ); in point()
126 CGAL_precondition( is_point() && !is_input() ); in source_of_supporting_site()
131 CGAL_precondition( is_point() && !is_input() ); in target_of_supporting_site()
183 CGAL_precondition( is_point() && i < 2 ); in supporting_site()
223 if (s.is_point())
256 if ( t.is_point() ) {
|
| /dports/lang/clover/mesa-21.3.6/bin/ |
| H A D | gen_release_notes_test.py | 44 def test_next_version(current: str, is_point: bool, expected: str) -> None:
45 assert calculate_next_version(current, is_point) == expected
54 def test_previous_version(current: str, is_point: bool, expected: str) -> None:
55 assert calculate_previous_version(current, is_point) == expected
|
| /dports/graphics/libosmesa-gallium/mesa-21.3.6/bin/ |
| H A D | gen_release_notes_test.py | 44 def test_next_version(current: str, is_point: bool, expected: str) -> None:
45 assert calculate_next_version(current, is_point) == expected
54 def test_previous_version(current: str, is_point: bool, expected: str) -> None:
55 assert calculate_previous_version(current, is_point) == expected
|
| /dports/graphics/mesa-gallium-va/mesa-21.3.6/bin/ |
| H A D | gen_release_notes_test.py | 44 def test_next_version(current: str, is_point: bool, expected: str) -> None:
45 assert calculate_next_version(current, is_point) == expected
54 def test_previous_version(current: str, is_point: bool, expected: str) -> None:
55 assert calculate_previous_version(current, is_point) == expected
|
| /dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/bin/ |
| H A D | gen_release_notes_test.py | 44 def test_next_version(current: str, is_point: bool, expected: str) -> None:
45 assert calculate_next_version(current, is_point) == expected
54 def test_previous_version(current: str, is_point: bool, expected: str) -> None:
55 assert calculate_previous_version(current, is_point) == expected
|
| /dports/graphics/mesa-dri-gallium/mesa-21.3.6/bin/ |
| H A D | gen_release_notes_test.py | 44 def test_next_version(current: str, is_point: bool, expected: str) -> None:
45 assert calculate_next_version(current, is_point) == expected
54 def test_previous_version(current: str, is_point: bool, expected: str) -> None:
55 assert calculate_previous_version(current, is_point) == expected
|
| /dports/graphics/mesa-gallium-xa/mesa-21.3.6/bin/ |
| H A D | gen_release_notes_test.py | 44 def test_next_version(current: str, is_point: bool, expected: str) -> None:
45 assert calculate_next_version(current, is_point) == expected
54 def test_previous_version(current: str, is_point: bool, expected: str) -> None:
55 assert calculate_previous_version(current, is_point) == expected
|
| /dports/graphics/mesa-libs/mesa-21.3.6/bin/ |
| H A D | gen_release_notes_test.py | 44 def test_next_version(current: str, is_point: bool, expected: str) -> None:
45 assert calculate_next_version(current, is_point) == expected
54 def test_previous_version(current: str, is_point: bool, expected: str) -> None:
55 assert calculate_previous_version(current, is_point) == expected
|
| /dports/graphics/libosmesa/mesa-21.3.6/bin/ |
| H A D | gen_release_notes_test.py | 44 def test_next_version(current: str, is_point: bool, expected: str) -> None:
45 assert calculate_next_version(current, is_point) == expected
54 def test_previous_version(current: str, is_point: bool, expected: str) -> None:
55 assert calculate_previous_version(current, is_point) == expected
|