Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <point.h>
Public Member Functions | |
Point () | |
Point (T x, T y) | |
Point (std::complex< T >) | |
void | operator= (const Point< T > &b) |
T | dot (const Point< T > &b) const |
T | cross (const Point< T > &b) const |
T | x () const |
T | y () const |
void | swap () |
std::complex< T > | _point () const |
operator Point< long double > () const | |
Private Attributes | |
std::complex< T > | point |
geometry::two_d::Point< T >::Point | ( | ) |
geometry::two_d::Point< T >::Point | ( | T | x, |
T | y | ||
) |
geometry::two_d::Point< T >::Point | ( | std::complex< T > | p | ) |
std::complex<T> geometry::two_d::Point< T >::_point | ( | ) | const [inline] |
T geometry::two_d::Point< T >::cross | ( | const Point< T > & | b | ) | const [inline] |
T geometry::two_d::Point< T >::dot | ( | const Point< T > & | b | ) | const [inline] |
geometry::two_d::Point< T >::operator Point< long double > | ( | ) | const [inline] |
void geometry::two_d::Point< T >::operator= | ( | const Point< T > & | b | ) | [inline] |
void geometry::two_d::Point< T >::swap | ( | ) | [inline] |
T geometry::two_d::Point< T >::x | ( | ) | const [inline] |
T geometry::two_d::Point< T >::y | ( | ) | const [inline] |
std::complex<T> geometry::two_d::Point< T >::point [private] |