/usr/include/SFCGAL/LineString.h is in libsfcgal-dev 1.2.2-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 | /**
* SFCGAL
*
* Copyright (C) 2012-2013 Oslandia <infos@oslandia.com>
* Copyright (C) 2012-2013 IGN (http://www.ign.fr)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
* You should have received a copy of the GNU Library General Public
* License along with this library; if not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _SFCGAL_LINESTRING_H_
#define _SFCGAL_LINESTRING_H_
#include <vector>
#include <boost/assert.hpp>
#include <boost/ptr_container/ptr_vector.hpp>
#include <boost/serialization/base_object.hpp>
#include <boost/ptr_container/serialize_ptr_vector.hpp>
#include <SFCGAL/Point.h>
#include <CGAL/Polygon_2.h>
namespace SFCGAL {
/**
* A LineString in SFA
* @ingroup public_api
*/
class SFCGAL_API LineString : public Geometry {
public:
typedef boost::ptr_vector< Point >::iterator iterator ;
typedef boost::ptr_vector< Point >::const_iterator const_iterator ;
/**
* Empty LineString constructor
*/
LineString() ;
/**
* Constructor with a point vector
*/
LineString( const std::vector< Point >& points ) ;
/**
* LineString constructor
*/
LineString( const Point& startPoint, const Point& endPoint ) ;
/**
* Copy constructor
*/
LineString( LineString const& other ) ;
/**
* assign operator
*/
LineString& operator = ( LineString other ) ;
/**
* destructor
*/
~LineString() ;
//-- SFCGAL::Geometry
virtual LineString* clone() const ;
//-- SFCGAL::Geometry
virtual std::string geometryType() const ;
//-- SFCGAL::Geometry
virtual GeometryType geometryTypeId() const ;
//-- SFCGAL::Geometry
virtual int dimension() const ;
//-- SFCGAL::Geometry
virtual int coordinateDimension() const ;
//-- SFCGAL::Geometry
virtual bool isEmpty() const ;
//-- SFCGAL::Geometry
virtual bool is3D() const ;
//-- SFCGAL::Geometry
virtual bool isMeasured() const ;
/**
* remove all points from the LineString
*/
void clear() ;
/**
* reverse LineString orientation
*/
void reverse() ;
/**
* [SFA/OGC]Returns the number of points
*/
inline size_t numPoints() const {
return _points.size();
}
/**
* Returns the number of segments
* @warning not standard, returns zero if LineString contains only one point
*/
size_t numSegments() const ;
/**
* [SFA/OGC]Returns the n-th point
*/
inline const Point& pointN( size_t const& n ) const {
BOOST_ASSERT( n < numPoints() ) ;
return _points[n];
}
/**
* [SFA/OGC]Returns the n-th point
*/
inline Point& pointN( size_t const& n ) {
BOOST_ASSERT( n < numPoints() ) ;
return _points[n];
}
/**
* [SFA/OGC]Returns the first point
*/
inline const Point& startPoint() const {
return _points.front();
}
/**
* [SFA/OGC]Returns the first point
*/
inline Point& startPoint() {
return _points.front();
}
/**
* [SFA/OGC]Returns the first point
*/
inline const Point& endPoint() const {
return _points.back();
}
/**
* [SFA/OGC]Returns the first point
*/
inline Point& endPoint() {
return _points.back();
}
/**
* append a Point to the LineString
*/
inline void addPoint( const Point& p ) {
_points.push_back( p.clone() ) ;
}
/**
* append a Point to the LineString and takes ownership
*/
inline void addPoint( Point* p ) {
_points.push_back( p ) ;
}
//-- methods
/**
* test if the LineString is closed
*/
bool isClosed() const ;
//-- iterators
inline iterator begin() {
return _points.begin() ;
}
inline const_iterator begin() const {
return _points.begin() ;
}
inline iterator end() {
return _points.end() ;
}
inline const_iterator end() const {
return _points.end() ;
}
//-- optimization
void reserve( const size_t& n ) ;
/**
* Const iterator to 2D points
* TODO: replace by boost::tranform_iterator ?
*/
class Point_2_const_iterator :
public boost::iterator_facade<
Point_2_const_iterator,
Kernel::Point_2 const,
boost::bidirectional_traversal_tag > {
public:
Point_2_const_iterator() {}
explicit Point_2_const_iterator( const_iterator it ) : it_( it ) {}
//Point_2_const_iterator( const Point_2_const_iterator<K>& other ) : it_(other.it_) {}
private:
friend class boost::iterator_core_access;
void increment() {
it_++;
}
void decrement() {
it_--;
}
bool equal( const Point_2_const_iterator& other ) const {
return this->it_ == other.it_;
}
const Kernel::Point_2& dereference() const {
p_ = it_->toPoint_2();
return p_;
}
mutable Kernel::Point_2 p_;
const_iterator it_;
};
Point_2_const_iterator points_2_begin() const {
return Point_2_const_iterator( begin() );
}
Point_2_const_iterator points_2_end() const {
return Point_2_const_iterator( end() );
}
std::pair< Point_2_const_iterator, Point_2_const_iterator > points_2() const {
return std::make_pair( points_2_begin(), points_2_end() );
}
/**
* Const iterator to 3D points
* TODO: replace by boost::tranform_iterator ?
*/
class Point_3_const_iterator :
public boost::iterator_facade<
Point_3_const_iterator,
Kernel::Point_3 const,
boost::bidirectional_traversal_tag > {
public:
Point_3_const_iterator() {}
explicit Point_3_const_iterator( const_iterator it ) : it_( it ) {}
Point_3_const_iterator( const Point_3_const_iterator& other ) : it_( other.it_ ) {}
private:
friend class boost::iterator_core_access;
void increment() {
it_++;
}
void decrement() {
it_--;
}
bool equal( const Point_3_const_iterator& other ) const {
return this->it_ == other.it_;
}
const Kernel::Point_3& dereference() const {
p_ = it_->toPoint_3();
return p_;
}
mutable Kernel::Point_3 p_;
const_iterator it_;
};
Point_3_const_iterator points_3_begin() const {
return Point_3_const_iterator( begin() );
}
Point_3_const_iterator points_3_end() const {
return Point_3_const_iterator( end() );
}
std::pair< Point_3_const_iterator, Point_3_const_iterator > points_3() const {
return std::make_pair( points_3_begin(), points_3_end() );
}
/*
* @brief Convert to CGAL::Polygon_2
* @param forceCounterClocksize force exterior ring orientation (counter clocksize)
*/
CGAL::Polygon_2< Kernel > toPolygon_2( bool fixOrientation = true ) const;
//-- visitors
//-- SFCGAL::Geometry
virtual void accept( GeometryVisitor& visitor ) ;
//-- SFCGAL::Geometry
virtual void accept( ConstGeometryVisitor& visitor ) const ;
/**
* Serializer
*/
template <class Archive>
void serialize( Archive& ar, const unsigned int /*version*/ ) {
ar& boost::serialization::base_object<Geometry>( *this );
ar& _points;
}
private:
boost::ptr_vector< Point > _points ;
void swap( LineString& other ) {
std::swap( _points, other._points );
}
};
}
#endif
|