Effective implementation of algorithms (Master Thesis)
Effective and error-free implementation of algorithms
geometry::two_d::Point< T > Class Template Reference

#include <point.h>

List of all members.

Public Member Functions

 Point ()
 Point (T x, T y)
 Point (std::complex< T >)
void operator= (const Point< T > &b)
dot (const Point< T > &b) const
cross (const Point< T > &b) const
x () const
y () const
void swap ()
std::complex< T > _point () const
 operator Point< long double > () const

Private Attributes

std::complex< T > point

template<typename T>
class geometry::two_d::Point< T >


Constructor & Destructor Documentation

template<typename T >
geometry::two_d::Point< T >::Point ( )
template<typename T >
geometry::two_d::Point< T >::Point ( x,
y 
)
template<typename T >
geometry::two_d::Point< T >::Point ( std::complex< T >  p)

Member Function Documentation

template<typename T>
std::complex<T> geometry::two_d::Point< T >::_point ( ) const [inline]
template<typename T>
T geometry::two_d::Point< T >::cross ( const Point< T > &  b) const [inline]
template<typename T>
T geometry::two_d::Point< T >::dot ( const Point< T > &  b) const [inline]
template<typename T>
geometry::two_d::Point< T >::operator Point< long double > ( ) const [inline]
template<typename T>
void geometry::two_d::Point< T >::operator= ( const Point< T > &  b) [inline]
template<typename T>
void geometry::two_d::Point< T >::swap ( ) [inline]
template<typename T>
T geometry::two_d::Point< T >::x ( ) const [inline]
template<typename T>
T geometry::two_d::Point< T >::y ( ) const [inline]

Member Data Documentation

template<typename T>
std::complex<T> geometry::two_d::Point< T >::point [private]

The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines