#pragma once

#include "geometry/point2d.hpp"
#include "geometry/rect2d.hpp"
#include "geometry/distance.hpp"

#include "base/internal/message.hpp"

#include "std/initializer_list.hpp"
#include "std/vector.hpp"

namespace m2
{

template <typename T>
class PolylineT
{
  vector<Point<T> > m_points;

public:
  PolylineT() {}
  PolylineT(initializer_list<Point<T> > points) : m_points(points)
  {
    ASSERT_GREATER(m_points.size(), 1, ());
  }
  explicit PolylineT(vector<Point<T> > const & points) : m_points(points)
  {
    ASSERT_GREATER(m_points.size(), 1, ());
  }
  template <class IterT> PolylineT(IterT beg, IterT end) : m_points(beg, end)
  {
    ASSERT_GREATER(m_points.size(), 1, ());
  }

  double GetLength() const
  {
    // @todo add cached value and lazy init
    double dist = 0;
    for (size_t i = 1; i < m_points.size(); ++i)
      dist += m_points[i-1].Length(m_points[i]);
    return dist;
  }

  double GetShortestSquareDistance(m2::Point<T> const & point) const
  {
    double res = numeric_limits<double>::max();
    m2::DistanceToLineSquare<m2::Point<T> > d;

    TIter i = Begin();
    for (TIter j = i + 1; j != End(); ++i, ++j)
    {
      d.SetBounds(*i, *j);
      res = min(res, d(point));
    }

    return res;
  }

  Rect<T> GetLimitRect() const
  {
    // @todo add cached value and lazy init
    m2::Rect<T> rect;
    for (size_t i = 0; i < m_points.size(); ++i)
      rect.Add(m_points[i]);
    return rect;
  }

  void Clear() { m_points.clear(); }
  void Add(Point<T> const & pt) { m_points.push_back(pt); }
  void Swap(PolylineT & rhs)
  {
    m_points.swap(rhs.m_points);
  }

  size_t GetSize() const { return m_points.size(); }

  bool operator==(PolylineT<T> const & rhs) const { return m_points == rhs.m_points; }

  typedef vector<Point<T> > TContainer;
  typedef typename TContainer::const_iterator TIter;
  TIter Begin() const { return m_points.begin(); }
  TIter End() const { return m_points.end(); }
  Point<T> const & Front() const { return m_points.front(); }
  Point<T> const & Back() const { return m_points.back(); }

  Point<T> const & GetPoint(size_t idx) const
  {
    ASSERT_LESS(idx, m_points.size(), ());
    return m_points[idx];
  }

  vector<Point<T> > const & GetPoints() const { return m_points; }

  friend string DebugPrint(PolylineT<T> const & p)
  {
    return ::DebugPrint(p.m_points);
  }
};

typedef PolylineT<double> PolylineD;

}