/dports/math/cgal/CGAL-5.3/include/CGAL/RS/ |
H A D | ak_1.h | 31 typedef Polynomial_ Polynomial_1; typedef 32 typedef typename Polynomial_1::NT Coefficient; 38 typedef CGAL::RS_AK1::Signat_1<Polynomial_1,Bound> 40 typedef CGAL::RS_AK1::Simple_comparator_1<Polynomial_1, 47 typedef CGAL::RS_AK1::Algebraic_1<Polynomial_1, 69 typedef CGAL::RS_AK1::Compute_polynomial_1<Polynomial_1, 72 typedef CGAL::RS_AK1::Isolate_1<Polynomial_1, 84 typedef CGAL::RS_AK1::Is_coprime_1<Polynomial_1,Ptraits> 88 typedef CGAL::RS_AK1::Solve_1<Polynomial_1, 98 typedef CGAL::RS_AK1::Sign_at_1<Polynomial_1, [all …]
|
H A D | ak_z_1.h | 40 typedef ExtPolynomial_ Polynomial_1; typedef 43 typedef typename Polynomial_1::NT Coefficient; 59 typedef CGAL::RS_AK1::Algebraic_z_1<Polynomial_1, 85 typedef CGAL::RS_AK1::Compute_polynomial_z_1<Polynomial_1, 88 typedef CGAL::RS_AK1::Isolate_z_1<Polynomial_1, 102 typedef CGAL::RS_AK1::Is_coprime_z_1<Polynomial_1,Ptraits> 104 typedef CGAL::RS_AK1::Make_coprime_z_1<Polynomial_1,Ptraits> 106 typedef CGAL::RS_AK1::Solve_z_1<Polynomial_1, 116 typedef CGAL::RS_AK1::Number_of_solutions_z_1<Polynomial_1, 122 typedef CGAL::RS_AK1::Sign_at_z_1<Polynomial_1, [all …]
|
H A D | functors_1.h | 113 OutputIterator operator()(const Polynomial_1 &p, in operator() 118 Polynomial_1 sfp=Sfpart()(p); in operator() 151 OutputIterator operator()(const Polynomial_1 &p, in operator() 163 OutputIterator operator()(const Polynomial_1 &p, in operator() 221 OutputIterator operator()(const Polynomial_1 &p, in operator() 310 Polynomial_1 sfpp=Sfpart()(p); in operator() 324 Polynomial_1 dsfpp=Deriv()(sfpp); in operator() 395 Polynomial_1 sfpp=Sfpart()(p); in operator() 409 Polynomial_1 dsfpp=Deriv()(sfpp); in operator() 438 size_t operator()(const Polynomial_1 &p)const{ in operator() [all …]
|
H A D | functors_z_1.h | 132 OutputIterator operator()(const Polynomial_1 &p, in operator() 138 Polynomial_1 sfp=Sfpart()(p); in operator() 173 OutputIterator operator()(const Polynomial_1 &p, in operator() 187 OutputIterator operator()(const Polynomial_1 &p, in operator() 246 OutputIterator operator()(const Polynomial_1 &p, in operator() 341 Polynomial_1 sfpp=Sfpart()(p); in operator() 355 Polynomial_1 dsfpp=Deriv()(sfpp); in operator() 432 Polynomial_1 sfpp=Sfpart()(p); in operator() 446 Polynomial_1 dsfpp=Deriv()(sfpp); in operator() 480 size_t operator()(const Polynomial_1 &p)const{ in operator() [all …]
|
/dports/math/cgal/CGAL-5.3/examples/Arrangement_on_surface_2/ |
H A D | unbounded_rational_functions.cpp | 25 typedef Traits_2::Polynomial_1 Polynomial_1; typedef 42 Polynomial_1 x = CGAL::shift(Polynomial_1(1),1); in main() 49 Polynomial_1 P1(1); in main() 50 Polynomial_1 minusP1(-P1); in main() 51 Polynomial_1 Q1 = x; in main() 57 Polynomial_1 P2 = -4*x*x+3; in main() 58 Polynomial_1 minusP2 = -P2; in main() 68 Polynomial_1 P3(1); in main() 69 Polynomial_1 minusP3(-P3); in main() 70 Polynomial_1 Q3 = 2*x; in main()
|
H A D | rational_functions.cpp | 25 typedef Traits_2::Polynomial_1 Polynomial_1; typedef 35 Polynomial_1 x = CGAL::shift(Polynomial_1(1),1); in main() 47 Polynomial_1 P1 = x*x*x*x - 6*x*x + 8; in main() 54 Polynomial_1 P2 = x; in main() 55 Polynomial_1 Q2 = 1+x*x; in main() 61 Polynomial_1 P3 = 8 - x*x; in main() 66 Polynomial_1 P4 = -2*x; in main()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Algebraic_kernel_d_1.h | 51 typedef typename Algebraic_real_1::Polynomial_1 Polynomial_1; typedef 227 const Polynomial_1& p, in operator() 236 const Polynomial_1& p, in operator() 259 const Polynomial_1& p, in operator() 389 : public CGAL::cpp98::binary_function< Polynomial_1, Polynomial_1, bool > { 390 bool operator()( const Polynomial_1& p1, const Polynomial_1& p2 ) const { in operator() 399 : public CGAL::cpp98::unary_function< Polynomial_1, Polynomial_1 > { 400 Polynomial_1 operator()( const Polynomial_1& p ) const { in operator() 414 const Polynomial_1& p2, in operator() 415 Polynomial_1& g, // ggT utcf in operator() [all …]
|
H A D | Arr_rational_function_traits_2.h | 72 typedef typename Base_rational_arc_ds_1::Polynomial_1 Polynomial_1; typedef 172 typedef typename Base_rational_arc_ds_1::Polynomial_1 Polynomial_1; typedef 243 X_monotone_curve_2 operator()(const Polynomial_1& P, const Polynomial_1& Q, in operator() 310 typedef typename Base_rational_arc_ds_1::Polynomial_1 Polynomial_1; typedef 320 Curve_2 operator()(const Polynomial_1& P) const in operator() 332 Curve_2 operator()(const Polynomial_1& P, in operator() 346 Curve_2 operator()(const Polynomial_1& P, in operator() 362 Curve_2 operator()(const Polynomial_1& P, const Polynomial_1& Q) const in operator() 376 Curve_2 operator()(const Polynomial_1& P, const Polynomial_1& Q, in operator() 393 Curve_2 operator()(const Polynomial_1& P, const Polynomial_1& Q, in operator() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Arr_rat_arc/ |
H A D | Rational_function.h | 32 typedef typename Base::Polynomial_1 Polynomial_1; typedef 88 const Polynomial_1& numer() const in numer() 93 const Polynomial_1& denom() const in denom() 178 Polynomial_1 _numer; 179 Polynomial_1 _denom; 200 typedef typename Rep::Polynomial_1 Polynomial_1; typedef 209 CGAL_STATIC_THREAD_LOCAL_VARIABLE_3(Self, x, Polynomial_1(0), Polynomial_1(1), &kernel); in get_default_instance() 213 Rational_function(const Polynomial_1& numer, in Rational_function() 214 const Polynomial_1& denom, in Rational_function() 245 const Polynomial_1& numer () const in numer() [all …]
|
H A D | Rational_arc_d_1.h | 78 typedef typename Base_rational_arc_ds_1::Polynomial_1 Polynomial_1; typedef 440 Polynomial_1 P; in _init() 441 Polynomial_1 Q; in _init() 518 void _init(const Polynomial_1& P_, const Polynomial_1& Q_, in _init() 524 Polynomial_1 P; in _init() 525 Polynomial_1 Q; in _init() 623 void _init(const Polynomial_1& P_, const Polynomial_1& Q_, in _init() 1456 void _canonicalize(const Polynomial_1& P,const Polynomial_1& Q, in _canonicalize() 1457 Polynomial_1& P_new ,Polynomial_1& Q_new) in _canonicalize() 2502 Rational_arc_d_1(const Polynomial_1& P,const Polynomial_1& Q, in Rational_arc_d_1() [all …]
|
H A D | Base_rational_arc_ds_1.h | 51 typedef typename Algebraic_kernel::Polynomial_1 Polynomial_1; typedef 52 typedef Polynomial_traits_d<Polynomial_1> Polynomial_traits_1; 56 typedef Algebraic_structure_traits<Polynomial_1> AT_poly; 67 CGAL_static_assertion((boost::is_same<Polynomial_1, 76 const Polynomial_1& poly, in print_polynomial()
|
H A D | Cache.h | 38 typedef typename Base::Polynomial_1 Polynomial_1; typedef 52 typedef std::pair<Polynomial_1,Polynomial_1> Rational_function_key; 156 const Rational_function& get_rational_function(const Polynomial_1& numer, in get_rational_function() 157 const Polynomial_1& denom) const in get_rational_function() 187 Polynomial_1 numer_poly = in get_rational_function() 189 Polynomial_1 denom_poly = in get_rational_function() 231 Rational_function_key get_key(const Polynomial_1& numer, in get_key() 232 const Polynomial_1& denom) const in get_key()
|
H A D | Algebraic_point_2.h | 58 typedef typename Base::Polynomial_1 Polynomial_1; typedef 131 const Polynomial_1& numerator() const { return _rational_function.numer(); } in numerator() 132 const Polynomial_1& denominator() const { return _rational_function.denom(); } in denominator() 137 typedef CGAL::Polynomial<Polynomial_1> Polynomial_2; in y() 148 Polynomial_1 r(CGAL::resultant(f,g)); in y() 313 double evaluate_at(const Polynomial_1& poly, const double x) const in evaluate_at() 348 typedef typename Rep::Polynomial_1 Polynomial_1; typedef 354 typedef typename Rational_function::Polynomial_1 Poly; in get_default_instance() 385 const Polynomial_1& numerator() const { return this->ptr()->numerator(); } in numerator() 386 const Polynomial_1& denominator() const { return this->ptr()->denominator(); } in denominator()
|
/dports/math/cgal/CGAL-5.3/examples/Algebraic_kernel_d/ |
H A D | Sign_at_1.cpp | 11 typedef AK::Polynomial_1 Polynomial_1; typedef 24 Polynomial_1 x = CGAL::shift(AK::Polynomial_1(1),1); // the monomial x in main() 25 Polynomial_1 p = x*x-5; in main() 27 Polynomial_1 q = x-2; in main()
|
H A D | Isolate_1.cpp | 11 typedef AK::Polynomial_1 Polynomial_1; typedef 28 Polynomial_1 pol=compute_polynomial_1(frominteger); in main() 32 Polynomial_1 x = CGAL::shift(AK::Polynomial_1(1),1); // the monomial x in main()
|
H A D | Construct_algebraic_real_1.cpp | 12 typedef AK::Polynomial_1 Polynomial_1; typedef 26 Polynomial_1 x = CGAL::shift(AK::Polynomial_1(1),1); // the monomial x in main()
|
H A D | Compare_1.cpp | 12 typedef AK::Polynomial_1 Polynomial_1; typedef 21 Polynomial_1 x = CGAL::shift(AK::Polynomial_1(1),1); // the monomial x in main()
|
H A D | Solve_1.cpp | 11 typedef AK::Polynomial_1 Polynomial_1; typedef 19 Polynomial_1 x = CGAL::shift(AK::Polynomial_1(1),1); // the monomial x in main()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Algebraic_kernel_d/ |
H A D | Interval_evaluate_1.h | 32 template<typename Polynomial_1, typename Bound> 34 <Polynomial_1,std::pair<Bound,Bound>, 36 CGAL::Polynomial_traits_d<Polynomial_1>::Coefficient_type,Bound>::Type, 38 CGAL::Polynomial_traits_d<Polynomial_1>::Coefficient_type,Bound>::Type> > { 40 typedef CGAL::Polynomial_traits_d< Polynomial_1 > PT_1; 50 result_type operator()(const Polynomial_1& p, in operator() 55 result_type operator()(const Polynomial_1& p, in operator()
|
H A D | algebraic_curve_kernel_2_tools.h | 223 template<typename Poly_coer_1,typename Polynomial_1> 224 void cast_back_utcf(const Poly_coer_1& p,Polynomial_1& q) { in cast_back_utcf() 231 typedef CGAL::Coercion_traits<Numerator,Polynomial_1> Num_coercion; in cast_back_utcf() 233 <Polynomial_1, in cast_back_utcf() 259 const typename AlgebraicCurveKernel_2::Polynomial_1& p, in zero_test_bivariate() 260 const typename AlgebraicCurveKernel_2::Polynomial_1& q) { in zero_test_bivariate() 263 typedef typename AlgebraicCurveKernel_2::Polynomial_1 Polynomial_1; in zero_test_bivariate() typedef 380 Polynomial_1 h_0_utcf; in zero_test_bivariate() 404 Polynomial_1 h_0=CGAL::evaluate_homogeneous(h,p,q); in zero_test_bivariate()
|
H A D | Bitstream_coefficient_kernel_at_alpha.h | 38 typedef typename Algebraic_kernel_d_1::Polynomial_1 Polynomial_1; typedef 75 typedef typename Algebraic_kernel_d_1::Polynomial_1 Polynomial_1; typedef 77 typedef Polynomial_1 Coefficient;
|
H A D | Interval_evaluate_2.h | 64 typedef typename PT_2::Coefficient_type Polynomial_1; in operator() typedef 66 CGAL::internal::Interval_evaluate_1< Polynomial_1,Bound > in operator() 69 typedef typename CGAL::internal::Interval_evaluate_1< Polynomial_1,Bound >:: in operator()
|
H A D | Curve_analysis_2.h | 239 mutable boost::optional<Polynomial_1> 244 mutable boost::optional<Polynomial_1> 1365 Polynomial_1 content() const { 1472 return Polynomial_1(0); 1493 return Polynomial_1(0); 1624 = Polynomial_1(1); 1671 = Polynomial_1(1); 1676 Polynomial_1 content_yx 2162 Polynomial_1 poly_at_beta 2185 Polynomial_1 curve_at_left_end [all …]
|
H A D | macros.h | 38 typedef typename Algebraic_kernel_with_analysis_2::Polynomial_1 Polynomial_1; \
|
/dports/math/cgal/CGAL-5.3/demo/Arrangement_on_surface_2/Utils/ |
H A D | ConstructSegment.cpp | 76 Polynomial_1 x = CGAL::shift(Polynomial_1(1), 1, 0); in operator ()() 77 Polynomial_1 poly_num; in operator ()() 78 Polynomial_1 poly_den; in operator ()() 91 poly_den = Polynomial_1{b * f}; in operator ()()
|