|
NT | abs (const NT &x) |
|
result_type | compare (const NT &x, const NT &y) |
|
result_type | div (const NT1 &x, const NT2 &y) |
|
void | div_mod (const NT1 &x, const NT2 &y, result_type &q, result_type &r) |
|
result_type | gcd (const NT1 &x, const NT2 &y) |
|
result_type | integral_division (const NT1 &x, const NT2 &y) |
|
NT | inverse (const NT &x) |
|
result_type | is_negative (const NT &x) |
|
result_type | is_one (const NT &x) |
|
result_type | is_positive (const NT &x) |
|
result_type | is_square (const NT &x) |
|
result_type | is_square (const NT &x, NT &y) |
|
result_type | is_zero (const NT &x) |
|
NT | kth_root (int k, const NT &x) |
|
result_type | mod (const NT1 &x, const NT2 &y) |
|
NT | root_of (int k, InputIterator begin, InputIterator end) |
|
result_type | sign (const NT &x) |
|
void | simplify (const NT &x) |
|
NT | sqrt (const NT &x) |
|
NT | square (const NT &x) |
|
double | to_double (const NT &x) |
|
std::pair< double, double > | to_interval (const NT &x) |
|
NT | unit_part (const NT &x) |
|
void | Assert_circulator (const C &c) |
|
void | Assert_iterator (const I &i) |
|
void | Assert_circulator_or_iterator (const IC &i) |
|
void | Assert_input_category (const I &i) |
|
void | Assert_output_category (const I &i) |
|
void | Assert_forward_category (const IC &ic) |
|
void | Assert_bidirectional_category (const IC &ic) |
|
void | Assert_random_access_category (const IC &ic) |
|
C::difference_type | circulator_distance (C c, C d) |
|
C::size_type | circulator_size (C c) |
|
bool | is_empty_range (const IC &i, const IC &j) |
|
iterator_traits< IC >
::difference_type | iterator_distance (IC ic1, IC ic2) |
|
Iterator_tag | query_circulator_or_iterator (const I &i) |
|
Circulator_tag | query_circulator_or_iterator (const C &c) |
|
Mode | get_mode (std::ios &s) |
|
Mode | set_ascii_mode (std::ios &s) |
|
Mode | set_binary_mode (std::ios &s) |
|
Mode | set_mode (std::ios &s, IO::Mode m) |
|
Mode | set_pretty_mode (std::ios &s) |
|
bool | is_ascii (std::ios &s) |
|
bool | is_binary (std::ios &s) |
|
bool | is_pretty (std::ios &s) |
|
Output_rep< T > | oformat (const T &t) |
|
Input_rep< T > | iformat (const T &t) |
|
Output_rep< T, F > | oformat (const T &t, F) |
|
ostream & | operator<< (ostream &os, Class c) |
|
istream & | operator>> (istream &is, Class c) |
|
template<class ForwardIterator , class OutputIterator , class Traits > |
OutputIterator | ch_akl_toussaint (ForwardIterator first, ForwardIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits()) |
| generates the counterclockwise sequence of extreme points of the points in the range [first ,beyond ). More...
|
|
template<class InputIterator , class OutputIterator , class Traits > |
OutputIterator | ch_bykat (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
| generates the counterclockwise sequence of extreme points of the points in the range [first ,beyond ). More...
|
|
template<class InputIterator , class OutputIterator , class Traits > |
OutputIterator | ch_eddy (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
| generates the counterclockwise sequence of extreme points of the points in the range [first ,beyond ). More...
|
|
template<class InputIterator , class OutputIterator , class Traits > |
OutputIterator | ch_graham_andrew (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
| generates the counterclockwise sequence of extreme points of the points in the range [first ,beyond ). More...
|
|
template<class BidirectionalIterator , class OutputIterator , class Traits > |
OutputIterator | ch_graham_andrew_scan (BidirectionalIterator first, BidirectionalIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
| The function ch_graham_andrew_scan() generates the counterclockwise sequence of extreme points from a given set of input points that are not left of the line defined by the first and last points in this sequence. More...
|
|
template<class InputIterator , class OutputIterator , class Traits > |
OutputIterator | ch_jarvis (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
| generates the counterclockwise sequence of extreme points of the points in the range [first ,beyond ). More...
|
|
template<class ForwardIterator , class OutputIterator , class Traits > |
OutputIterator | ch_jarvis_march (ForwardIterator first, ForwardIterator beyond, const Traits::Point_2 &start_p, const Traits::Point_2 &stop_p, OutputIterator result, const Traits &ch_traits=Default_traits) |
| The function ch_jarvis_march generates the counterclockwise sequence of extreme points from a given set of input points that line between two input points. More...
|
|
template<class InputIterator , class OutputIterator > |
OutputIterator | ch_melkman (InputIterator first, InputIterator last, OutputIterator result, const Traits &ch_traits=Default_traits) |
| generates the counterclockwise sequence of extreme points of the points in the range [first , beyond ). More...
|
|
template<class ForwardIterator > |
void | ch_e_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &e, const Traits &ch_traits=Default_traits) |
| The function ch_e_point() finds a point of a given set of input points with maximal \( x\) coordinate. More...
|
|
template<class ForwardIterator > |
void | ch_n_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, const Traits &ch_traits=Default_traits) |
| The function ch_n_point() finds a point in a given set of input points with maximal \( y\) coordinate. More...
|
|
template<class ForwardIterator > |
void | ch_ns_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, ForwardIterator &s, const Traits &ch_traits=Default_traits) |
| The function ch_ns_point() finds the points of a given set of input points with minimal and maximal \( x\) coordinates. More...
|
|
template<class ForwardIterator > |
void | ch_nswe_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &n, ForwardIterator &s, ForwardIterator &w, ForwardIterator &e, const Traits &ch_traits=Default_traits) |
| The function ch_nswe_point() finds the four extreme points of a given set of input points using a linear scan of the input points. More...
|
|
template<class ForwardIterator > |
void | ch_s_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &s, const Traits &ch_traits=Default_traits) |
| The function ch_s_point() finds a points in a given set of input points with minimal \( y\) coordinates. More...
|
|
template<class ForwardIterator > |
void | ch_we_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &w, ForwardIterator &e, const Traits &ch_traits=Default_traits) |
| The function ch_we_point() finds two points of a given set of input points with minimal and maximal \( x\) coordinates. More...
|
|
template<class ForwardIterator > |
void | ch_w_point (ForwardIterator first, ForwardIterator beyond, ForwardIterator &w, const Traits &ch_traits=Default_traits) |
| The function ch_w_point() finds a point in a given set of input points with minimal \( x\) coordinate. More...
|
|
template<class InputIterator , class OutputIterator , class Traits > |
OutputIterator | convex_hull_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits) |
| generates the counterclockwise sequence of extreme points of the points in the range [first ,beyond ) with a user provided traits class. More...
|
|
template<class InputIterator , class OutputIterator > |
OutputIterator | convex_hull_2 (InputIterator first, InputIterator beyond, OutputIterator result) |
| generates the counterclockwise sequence of extreme points of the points in the range [first ,beyond ) using as traits class the kernel in which the point type is defined. More...
|
|
template<class InputIterator , class OutputIterator > |
OutputIterator | lower_hull_points_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
| The function lower_hull_points_2() generates the counterclockwise sequence of extreme points on the lower hull of a given set of input points. More...
|
|
template<class InputIterator , class OutputIterator > |
OutputIterator | upper_hull_points_2 (InputIterator first, InputIterator beyond, OutputIterator result, const Traits &ch_traits=Default_traits) |
| The function upper_hull_points_2() generates the counterclockwise sequence of extreme points on the upper hull of a given set of input points. More...
|
|
template<class ForwardIterator , class Traits > |
bool | is_ccw_strongly_convex_2 (ForwardIterator first, ForwardIterator beyond, const Traits &ch_traits=Default_traits) |
| The function is_ccw_strongly_convex_2() determines if a given sequence of points defines a counterclockwise-oriented, strongly convex polygon. More...
|
|
template<class ForwardIterator , class Traits > |
bool | is_cw_strongly_convex_2 (ForwardIterator first, ForwardIterator beyond, const Traits &ch_traits=Default_traits) |
| The function is_cw_strongly_convex_2() determines if a given sequence of points defines a clockwise-oriented, strongly convex polygon. More...
|
|