Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
|
#include <complex>
Go to the source code of this file.
Classes | |
class | geometry::two_d::Point< T > |
Namespaces | |
namespace | geometry |
namespace | geometry::two_d |
Functions | |
template<typename T > | |
bool | geometry::two_d::operator== (const Point< T > &a, const Point< T > &b) |
template<typename T > | |
bool | geometry::two_d::operator!= (const Point< T > &a, const Point< T > &b) |
template<typename T > | |
Point< T > | geometry::two_d::operator+ (const Point< T > &a, const Point< T > &b) |
template<typename T > | |
Point< T > | geometry::two_d::operator- (const Point< T > &a, const Point< T > &b) |
template<typename T > | |
Point< T > | geometry::two_d::operator- (const Point< T > &a) |
template<typename T > | |
Point< T > | geometry::two_d::operator* (const Point< T > &a, T scalar) |
template<typename T > | |
Point< T > | geometry::two_d::operator/ (const Point< T > &a, T scalar) |