Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
_point() const | geometry::two_d::Point< T > | [inline] |
cross(const Point< T > &b) const | geometry::two_d::Point< T > | [inline] |
dot(const Point< T > &b) const | geometry::two_d::Point< T > | [inline] |
operator Point< long double >() const | geometry::two_d::Point< T > | [inline] |
operator=(const Point< T > &b) | geometry::two_d::Point< T > | [inline] |
Point() | geometry::two_d::Point< T > | |
Point(T x, T y) | geometry::two_d::Point< T > | |
Point(std::complex< T >) | geometry::two_d::Point< T > | |
point | geometry::two_d::Point< T > | [private] |
swap() | geometry::two_d::Point< T > | [inline] |
x() const | geometry::two_d::Point< T > | [inline] |
y() const | geometry::two_d::Point< T > | [inline] |