/* Copyright 2008 Intel Corporation Use, modification and distribution are subject to the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt). */ #ifndef BOOST_POLYGON_POLYGON_DATA_HPP #define BOOST_POLYGON_POLYGON_DATA_HPP namespace boost { namespace polygon{ struct polygon_concept; template class polygon_data { public: typedef polygon_concept geometry_type; typedef T coordinate_type; typedef typename std::vector >::const_iterator iterator_type; typedef typename coordinate_traits::coordinate_distance area_type; typedef point_data point_type; inline polygon_data() : coords_() {} //do nothing default constructor template inline polygon_data(iT input_begin, iT input_end) : coords_(input_begin, input_end) {} template inline polygon_data& set(iT input_begin, iT input_end) { coords_.clear(); //just in case there was some old data there coords_.insert(coords_.end(), input_begin, input_end); return *this; } // copy constructor (since we have dynamic memory) inline polygon_data(const polygon_data& that) : coords_(that.coords_) {} // assignment operator (since we have dynamic memory do a deep copy) inline polygon_data& operator=(const polygon_data& that) { coords_ = that.coords_; return *this; } template inline polygon_data& operator=(const T2& rvalue); inline bool operator==(const polygon_data& that) const { if(coords_.size() != that.coords_.size()) return false; for(std::size_t i = 0; i < coords_.size(); ++i) { if(coords_[i] != that.coords_[i]) return false; } return true; } inline bool operator!=(const polygon_data& that) const { return !((*this) == that); } // get begin iterator, returns a pointer to a const Unit inline iterator_type begin() const { return coords_.begin(); } // get end iterator, returns a pointer to a const Unit inline iterator_type end() const { return coords_.end(); } inline std::size_t size() const { return coords_.size(); } public: std::vector > coords_; }; } } #endif