/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | QP_functions.h | 57 Tag_true /*is_linear*/, Tag_true /*is_nonnegative*/) in print_solution_function() argument 63 Tag_false /*is_linear*/, Tag_true /*is_nonnegative*/) in print_solution_function() argument 69 Tag_true /*is_linear*/, Tag_false /*is_nonnegative*/) in print_solution_function() argument
|
H A D | HalfedgeDS_items_decorator.h | 259 Tag_true) const { in set_vertex_in_vertex_loop() argument 280 Tag_true) const { in set_face_in_face_loop() argument 336 get_vertex_halfedge( Vertex_handle v, Tag_true) const { in get_vertex_halfedge() argument 407 get_vertex( Halfedge_const_handle h, Tag_true) const { in get_vertex() argument 416 get_prev( Halfedge_const_handle h, Tag_true) const { in get_prev() argument 421 find_prev( Halfedge_const_handle h, Tag_true) const { in find_prev() argument 449 get_face( Halfedge_const_handle h, Tag_true) const { in get_face() argument 470 Tag_true) const { in set_vertex_halfedge() argument 479 Tag_true) const { in set_vertex_halfedge() argument 503 Tag_true) const { in set_face_halfedge() argument [all …]
|
H A D | HalfedgeDS_decorator.h | 561 void make_hole( Halfedge_handle h, Tag_true) { in make_hole() argument 569 void fill_hole( Halfedge_handle h, Tag_true) { in fill_hole() argument 649 void erase_face( Halfedge_handle h, Tag_true) { in erase_face() argument 854 Face_handle faces_push_back( const Face& f, Tag_true) { in faces_push_back() argument 870 void vertices_erase( Vertex_handle v, Tag_true) { in vertices_erase() argument 880 void vertices_pop_front( Tag_true) { in vertices_pop_front() argument 885 void vertices_pop_back( Tag_true) { in vertices_pop_back() argument 890 void faces_erase( Face_handle f, Tag_true) { in faces_erase() argument 900 void faces_pop_front( Tag_true) { in faces_pop_front() argument 905 void faces_pop_back( Tag_true) { in faces_pop_back() argument [all …]
|
H A D | tags.h | 43 typedef Boolean_tag<true> Tag_true; typedef 47 inline bool check_tag( Tag_true) {return true;} in check_tag() argument
|
H A D | Mesh_facet_criteria_3.h | 110 void init_radius(const Sizing_field& radius_bound, Tag_true) in init_radius() argument 124 void init_distance(const Sizing_field& distance_bound, Tag_true) in init_distance() argument
|
H A D | QP_solution.h | 730 Tag_true /*has_gcd*/, in normalize() argument 743 Tag_true /*has_gcd*/, in normalize() argument 752 Tag_true /*has_exact_division*/) const in normalize() argument
|
H A D | K_neighbor_search.h | 145 void search_nearest_in_leaf(typename Tree::Leaf_node_const_handle node, Tag_true) in search_nearest_in_leaf() argument 217 void search_furthest_in_leaf(typename Tree::Leaf_node_const_handle node, Tag_true) in search_furthest_in_leaf() argument
|
/dports/math/cgal/CGAL-5.3/include/CGAL/QP_solver/ |
H A D | Initialization.h | 62 set_D(const Q& /*qp*/, Tag_true /*is_linear*/) in set_D() argument 158 set_explicit_bounds(const Q& /*qp*/, Tag_true) { in set_explicit_bounds() argument 429 init_basis__slack_variables( int, Tag_true) in init_basis__slack_variables() argument 461 init_basis__constraints( int, Tag_true) in init_basis__constraints() argument 510 init_r_C(Tag_true) in init_r_C() argument 526 init_r_S_B(Tag_true) in init_r_S_B() argument 541 init_solution__b_C(Tag_true) in init_solution__b_C() argument
|
H A D | QP__filtered_base.h | 192 set( int l, Tag_true) in set() argument 208 init( Tag_true) in init() argument 228 init_NT( Tag_true) in init_NT() argument 236 mu_j_NT( int j, Tag_true) const // standard form in mu_j_NT() argument 243 mu_j_NT( int j, Tag_false, Tag_true) const // variable bounds, LP case in mu_j_NT() argument 270 transition( int, Tag_true) in transition() argument 277 set_q(int c, int b, Tag_true) in set_q() argument
|
H A D | QP_solver_impl.h | 1832 enter_variable_original_upd_w_r(Tag_true ) in enter_variable_original_upd_w_r() argument 1861 enter_variable_slack_upd_w_r(Tag_true ) in enter_variable_slack_upd_w_r() argument 1964 leave_variable_original_upd_w_r(Tag_true ) in leave_variable_original_upd_w_r() argument 1995 leave_variable_slack_upd_w_r(Tag_true ) in leave_variable_slack_upd_w_r() argument 2038 z_replace_variable( Tag_true) in z_replace_variable() argument 2560 compute_solution(Tag_true) in compute_solution() argument 2643 check_r_C(Tag_true) const in check_r_C() argument 2674 check_r_S_B(Tag_true) const in check_r_S_B() argument 2733 check_r_B_O(Tag_true) const in check_r_B_O() argument 2764 check_w(Tag_true) const in check_w() argument [all …]
|
H A D | QP_solution_impl.h | 126 Tag_true /*is_nonnegative*/) in is_feasible() argument 239 Tag_true /*is_linear*/, Tag_true /*is_nonnegative*/) in is_optimal_3() argument 260 Tag_false /*is_linear*/, Tag_true /*is_nonnegative*/) in is_optimal_3() argument 282 Tag_true /*is_linear*/, Tag_false /*is_nonnegative*/) in is_optimal_3() argument 351 (const Program& p, std::vector<ET>& /*q*/, Tag_true /*is_linear*/) in is_value_correct() argument 402 Tag_true /*is_nonnegative*/) in is_infeasible_2() argument 443 Tag_true /*is_nonnegative*/) in is_infeasible_3() argument 525 (const Program& p, Tag_true /*is_nonnegative*/) in is_unbounded_2() argument 562 (const Program& p, Tag_true /*is_linear*/) in is_unbounded_3() argument
|
H A D | QP__filtered_base_impl.h | 253 update_maxima( Tag_true) in update_maxima() argument 270 certify_mu_j_NT( int j, Tag_true) const // standard form in certify_mu_j_NT() argument
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Mesh_3/ |
H A D | Image_to_labeled_function_wrapper.h | 90 CGAL::Tag_true /*trilinear*/, in eval() 103 CGAL::Tag_true /*trilinear*/, in eval()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Segment_Delaunay_graph_2/ |
H A D | Construct_storage_site_2.h | 43 const Point_handle& h4, const Tag_true&) const { in construct() 53 const Point_handle& h6, const Tag_true&) const { in construct() 62 bool is_first_exact, const Tag_true&) const { in construct() 269 const Tag_true&) const in construct_first_subsegment() 291 const Tag_true&) const in construct_second_subsegment()
|
H A D | Cartesian_converter.h | 46 K2_Site_2 convert_site(const K1_Site_2& t, const Tag_true&) const in convert_site()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Min_sphere_of_spheres_d/ |
H A D | Min_sphere_of_spheres_d_impl.h | 86 int& i,const Tag_true /* use_sqrt */, in find_farthest() 119 int& i, const Tag_true /* use_sqrt */, in find_farthest() 190 const Tag_true /* is_exact */) { in find_farthest() 249 is_valid(const Tag_true /* is_exact */) { in is_valid()
|
H A D | Min_sphere_of_spheres_d_configure.h | 54 struct Tag_true {}; struct
|
H A D | Min_sphere_of_spheres_d_pivot_impl.h | 32 bool is_better(const FT&,const FT&,const Tag_true /* is_exact */) { in is_better()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Arr_geometry_traits/ |
H A D | Segment_assertions.h | 35 Tag_true /* tag */) in _assert_is_point_on() argument 50 Tag_true /* tag */) in _assert_is_point_on() argument
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Polynomial/ |
H A D | polynomial_gcd.h | 145 ::CGAL::Tag_true) in gcd_utcf_is_fraction_() 205 ::CGAL::Tag_true, in gcd_utcf_modularizable_algebra_() 213 ::CGAL::Tag_true, in gcd_utcf_modularizable_algebra_() 223 ::CGAL::Tag_true, in gcd_utcf_modularizable_algebra_() 231 ::CGAL::Tag_true, in gcd_utcf_modularizable_algebra_() 241 ::CGAL::Tag_true, in gcd_utcf_modularizable_algebra_() 353 ::CGAL::Tag_true in gcdex_()
|
H A D | modular_filter.h | 35 ::CGAL::Tag_true){ in may_have_common_factor_() 123 bool may_have_multiple_factor_(const Polynomial<NT>& P, CGAL::Tag_true ){ in may_have_multiple_factor_()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Polygon_2/ |
H A D | Polygon_2_edge_iterator.h | 82 Segment_2 make_value_type (const Tag_true&) const { in make_value_type() 190 value_type(const Polygon_2_edge_iterator<Traits_,Container_,Tag_true>&) in value_type() argument
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Approximate_min_ellipsoid_d/ |
H A D | Khachiyan_approximation.h | 32 struct Tag_true {}; struct
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Polygon_mesh_processing/internal/ |
H A D | AABB_traversal_traits_with_transformation.h | 41 /*SUPPORTS_ROTATION*/ Tag_true) const in compute_transformed_bbox_impl() argument 124 void register_transformation(CGAL::Tag_true) in register_transformation() 237 void register_transformation(CGAL::Tag_true) in register_transformation()
|
/dports/math/cgal/CGAL-5.3/examples/Algebraic_foundations/ |
H A D | implicit_interoperable_dispatch.cpp | 19 binary_function_(const A& a , const B& b, CGAL::Tag_true){ in binary_function_()
|