I am trying to implement a simple multi-dimensional Point class with templates (learning). I need two specializations Point2D and Point3D – here is what I have got so far to allow for constructors to initialize the Point directly like Point p (1, 2). Although this code compiles and works fine, what I don’t like is the code repetition part in the specialization – I must be doing something wrong.
I am new to C++ / templates – any help is appreciated.
#ifndef POINT_H_
#define POINT_H_
template< typename T, int Dimensions = 2 >
class Point
{
public:
typedef typename T value_type;
Point() { std::fill(elements_, elements_+Dimensions, 0); }
Point(const Point<T, Dimensions>& rhs) : elements_(rhs.elements_) {}
~Point() {}
Point & operator=(const Point<T, Dimensions>& rhs) { return *this; }
const Point operator+(const Point<T, Dimensions>& p)
{
Point<T, Dimensions> ret;
for(int i = 0; i < Dimensions; i++)
{
ret[i] += elements_[i] + p[i];
}
return ret;
}
Point & operator+=( const Point<T, Dimensions>& p)
{
for(int i = 0; i < Dimensions; i++)
{
elements_[i] += p[i];
}
return *this;
}
Point & operator-=( const Point<T, Dimensions> & p)
{
for(int i = 0; i < Dimensions; i++)
{
elements_[i] -= p[i];
}
return *this;
}
T & operator[](const size_t index)
{
return elements_[index];
}
private:
T elements_[Dimensions];
};
template<typename T>
class Point< T, 2 >
{
public:
Point(const T x, const T y)
{
elements_[0] = x;
elements_[1] = y;
}
typedef typename T value_type;
Point() { std::fill(elements_, elements_+Dimensions, 0); }
Point(const Point<T, 2>& rhs) : elements_(rhs.elements_) {}
~Point() {}
Point & operator=(const Point<T, 2>& rhs) { return *this; }
const Point operator+(const Point<T, 2>& p)
{
Point<T, 2> ret;
for(int i = 0; i < 2; i++)
{
ret[i] += elements_[i] + p[i];
}
return ret;
}
Point & operator+=( const Point<T, 2>& p)
{
for(int i = 0; i < 2; i++)
{
elements_[i] += p[i];
}
return *this;
}
Point & operator-=( const Point<T, 2> & p)
{
for(int i = 0; i < 2; i++)
{
elements_[i] -= p[i];
}
return *this;
}
T & operator[](const size_t index)
{
return elements_[index];
}
private:
T elements_[2];
};
template< typename T>
class Point< T, 3 >
{
public:
Point(const T x, const T y, const T z)
{
elements_[0] = x;
elements_[1] = y;
elements_[2] = z;
}
typedef typename T value_type;
Point() { std::fill(elements_, elements_+3, 0); }
Point(const Point<T, 3>& rhs) : elements_(rhs.elements_) {}
~Point() {}
Point & operator=(const Point<T, 3>& rhs) { return *this; }
const Point operator+(const Point<T, 3>& p)
{
Point<T, 3> ret;
for(int i = 0; i < 3; i++)
{
ret[i] += elements_[i] + p[i];
}
return ret;
}
Point & operator+=( const Point<T, 3>& p)
{
for(int i = 0; i < 3; i++)
{
elements_[i] += p[i];
}
return *this;
}
Point & operator-=( const Point<T, 3> & p)
{
for(int i = 0; i < 3; i++)
{
elements_[i] -= p[i];
}
return *this;
}
T & operator[](const size_t index)
{
return elements_[index];
}
private:
T elements_[3];
};
typedef Point< int, 2 > Point2Di;
typedef Point< int, 3 > Point3Di;
#endif //POINT_H_
You can just – simply – provide both a 2D and a 3D constructor in the main template.
There is no need to dally with base classes and other Rube Goldberg solutions here, because there is no problem to be solved: we’re in template-land, where anything unused is simply unused.
Example: