Home
last modified time | relevance | path

Searched defs:Tag_false (Results 1 – 25 of 80) sorted by relevance

1234

/dports/math/cgal/CGAL-5.3/include/CGAL/
H A DQP_functions.h63 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
75 Tag_false /*is_linear*/, Tag_false /*is_nonnegative*/) in print_solution_function() argument
H A DHalfedgeDS_items_decorator.h257 Tag_false) const {} in set_vertex_in_vertex_loop() argument
278 Tag_false) const {} in set_face_in_face_loop() argument
332 get_vertex_halfedge( Vertex_handle , Tag_false) const { in get_vertex_halfedge() argument
403 get_vertex( Halfedge_const_handle , Tag_false) const { in get_vertex() argument
412 get_prev( Halfedge_const_handle , Tag_false) const { in get_prev() argument
425 find_prev( Halfedge_const_handle h, Tag_false) const { in find_prev() argument
445 get_face( Halfedge_const_handle , Tag_false) const { in get_face() argument
467 Tag_false) const {} in set_vertex_halfedge() argument
476 Tag_false) const {} in set_vertex_halfedge() argument
500 Tag_false) const {} in set_face_halfedge() argument
[all …]
H A DHalfedgeDS_decorator.h557 void make_hole( Halfedge_handle, Tag_false) {} in make_hole() argument
558 void fill_hole( Halfedge_handle, Tag_false) {} in fill_hole() argument
648 void erase_face( Halfedge_handle, Tag_false) {} in erase_face() argument
851 Face_handle faces_push_back( const Face& , Tag_false) { in faces_push_back() argument
869 void vertices_erase( Vertex_handle , Tag_false) {} in vertices_erase() argument
879 void vertices_pop_front( Tag_false) {} in vertices_pop_front() argument
884 void vertices_pop_back( Tag_false) {} in vertices_pop_back() argument
889 void faces_erase( Face_handle , Tag_false) {} in faces_erase() argument
899 void faces_pop_front( Tag_false) {} in faces_pop_front() argument
904 void faces_pop_back( Tag_false) {} in faces_pop_back() argument
[all …]
H A Dtags.h44 typedef Boolean_tag<false> Tag_false; typedef
48 inline bool check_tag( Tag_false) {return false;} in check_tag() argument
H A DMesh_facet_criteria_3.h102 void init_radius(const FT& radius_bound, Tag_false) in init_radius() argument
116 void init_distance(const FT& distance_bound, Tag_false) in init_distance() argument
H A DPolyhedron_incremental_builder_3.h97 void initialize_vertex_to_edge_map( size_type n, bool mode, Tag_false){ in initialize_vertex_to_edge_map() argument
127 void push_back_vertex_to_edge_map( Halfedge_handle h, Tag_false) { in push_back_vertex_to_edge_map() argument
138 Halfedge_handle get_vertex_to_edge_map( size_type i, Tag_false) { in get_vertex_to_edge_map() argument
150 void set_vertex_to_edge_map( size_type i, Halfedge_handle h, Tag_false) { in set_vertex_to_edge_map() argument
338 bool remove_unconnected_vertices( Tag_false) { in remove_unconnected_vertices() argument
H A DQP_solution.h744 Tag_false /*has_exact_division*/) const in normalize() argument
751 Tag_false /*has_gcd*/, in normalize() argument
759 Tag_false /*has_gcd*/, in normalize() argument
H A DK_neighbor_search.h184 void search_nearest_in_leaf(typename Tree::Leaf_node_const_handle node, Tag_false) in search_nearest_in_leaf() argument
237 void search_furthest_in_leaf(typename Tree::Leaf_node_const_handle node, Tag_false) in search_furthest_in_leaf() argument
/dports/math/cgal/CGAL-5.3/include/CGAL/QP_solver/
H A DInitialization.h70 set_D(const Q& qp, Tag_false /*is_linear*/) in set_D() argument
168 set_explicit_bounds(const Q& qp, Tag_false) { in set_explicit_bounds() argument
436 init_basis__slack_variables(int s_i, Tag_false) // Note: s_i-th inequality is in init_basis__slack_variables() argument
476 init_basis__constraints(int s_i, Tag_false) // Note: s_i-th inequality is the in init_basis__constraints() argument
517 init_r_C(Tag_false) in init_r_C() argument
533 init_r_S_B(Tag_false) in init_r_S_B() argument
550 init_solution__b_C(Tag_false) in init_solution__b_C() argument
H A DQP__filtered_base.h185 set( int l, Tag_false) in set() argument
200 init( Tag_false) in init() argument
216 init_NT( Tag_false) in init_NT() argument
243 mu_j_NT( int j, Tag_false, Tag_true) const // variable bounds, LP case in mu_j_NT() argument
250 mu_j_NT( int j, Tag_false, Tag_false) const // variable bounds, QP case in mu_j_NT() argument
262 transition( int n, Tag_false) in transition() argument
284 set_q(int c, int b, Tag_false) in set_q() argument
H A DQP_solver_impl.h971 ratio_test_2( Tag_false) in ratio_test_2() argument
1202 update_2( Tag_false) in update_2() argument
1869 enter_variable_slack_upd_w_r(Tag_false ) in enter_variable_slack_upd_w_r() argument
2003 leave_variable_slack_upd_w_r(Tag_false ) in leave_variable_slack_upd_w_r() argument
2048 z_replace_variable( Tag_false) in z_replace_variable() argument
2574 compute_solution(Tag_false) in compute_solution() argument
2651 check_r_C(Tag_false) const in check_r_C() argument
2682 check_r_S_B(Tag_false) const in check_r_S_B() argument
2741 check_r_B_O(Tag_false) const in check_r_B_O() argument
2772 check_w(Tag_false) const in check_w() argument
[all …]
H A DQP_solution_impl.h147 Tag_false /*is_nonnegative*/) in is_feasible() 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
317 Tag_false /*is_linear*/, Tag_false /*is_nonnegative*/) in is_optimal_3() argument
375 (const Program& p, std::vector<ET>& q, Tag_false /*is_linear*/) in is_value_correct() argument
419 Tag_false /*is_nonnegative*/) in is_infeasible_2() argument
464 Tag_false /*is_nonnegative*/) in is_infeasible_3() argument
540 (const Program& p, Tag_false /*is_nonnegative*/) in is_unbounded_2() argument
581 (const Program& p, Tag_false /*is_linear*/) in is_unbounded_3() argument
H A DQP__filtered_base_impl.h215 update_maxima( Tag_false) in update_maxima() argument
308 certify_mu_j_NT( int j, Tag_false) const // case with bounds in certify_mu_j_NT() argument
/dports/math/cgal/CGAL-5.3/include/CGAL/Segment_Delaunay_graph_2/
H A DConstruct_storage_site_2.h71 const Point_handle&, const Tag_false&) const { in construct()
82 const Point_handle&, const Tag_false&) const { in construct()
92 bool /* is_first_exact */, const Tag_false&) const { in construct()
313 const Tag_false&) const in construct_first_subsegment()
322 const Tag_false&) const in construct_second_subsegment()
H A DCartesian_converter.h92 K2_Site_2 convert_site(const K1_Site_2& t, const Tag_false&) const in convert_site()
/dports/math/cgal/CGAL-5.3/include/CGAL/Min_sphere_of_spheres_d/
H A DMin_sphere_of_spheres_d_impl.h87 const Tag_false /* is_exact */) { in find_farthest()
158 int& i, const Tag_false /* use_sqrt */, in find_farthest()
189 int& i,const Tag_false /* use_sqrt */, in find_farthest()
243 is_valid(const Tag_false /* is_exact */) { in is_valid()
H A DMin_sphere_of_spheres_d_configure.h55 struct Tag_false {}; struct
H A DMin_sphere_of_spheres_d_pivot_impl.h27 bool is_better(const FT& old,const FT& now,const Tag_false /* is_exact */) { in is_better()
/dports/math/cgal/CGAL-5.3/include/CGAL/Arr_geometry_traits/
H A DSegment_assertions.h43 Tag_false /* tag */) in _assert_is_point_on() argument
58 Tag_false /* tag */) in _assert_is_point_on() argument
/dports/math/cgal/CGAL-5.3/include/CGAL/Mesh_3/
H A DImage_to_labeled_function_wrapper.h104 CGAL::Tag_false /*labeled*/) const in eval()
117 CGAL::Tag_false /*trilinear*/, in eval()
/dports/math/cgal/CGAL-5.3/include/CGAL/Approximate_min_ellipsoid_d/
H A DKhachiyan_approximation.h33 struct Tag_false {}; struct
/dports/math/cgal/CGAL-5.3/include/CGAL/Polynomial/
H A Dpolynomial_gcd.h165 ::CGAL::Tag_false) in gcd_utcf_is_fraction_()
179 ::CGAL::Tag_false, in gcd_utcf_modularizable_algebra_()
187 ::CGAL::Tag_false, in gcd_utcf_modularizable_algebra_()
195 ::CGAL::Tag_false, in gcd_utcf_modularizable_algebra_()
265 ::CGAL::Tag_false in gcdex_()
H A Dmodular_filter.h83 ::CGAL::Tag_false) {return true;} in may_have_common_factor_()
157 bool may_have_multiple_factor_( const Polynomial<NT>&, CGAL::Tag_false ) { in may_have_multiple_factor_()
/dports/math/cgal/CGAL-5.3/include/CGAL/Polygon_mesh_processing/internal/
H A DAABB_traversal_traits_with_transformation.h76 /*SUPPORTS_ROTATION*/ Tag_false) const in compute_transformed_bbox_impl() argument
129 void register_transformation(CGAL::Tag_false) in register_transformation()
242 void register_transformation(CGAL::Tag_false) in register_transformation()
/dports/math/cgal/CGAL-5.3/examples/Algebraic_foundations/
H A Dimplicit_interoperable_dispatch.cpp9 binary_function_(const A& a , const B& b, CGAL::Tag_false){ in binary_function_()

1234