/usr/include/CGAL/IO/Scanner_OFF.h is in libcgal-dev 4.7-4.
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 | // Copyright (c) 1997,2005
// Utrecht University (The Netherlands),
// ETH Zurich (Switzerland),
// INRIA Sophia-Antipolis (France),
// Max-Planck-Institute Saarbruecken (Germany),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 3 of the License,
// or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
//
//
// Author(s) : Lutz Kettner <kettner@mpi-sb.mpg.de>
// Ralf Osbild <osbild@mpi-sb.mpg.de>
#ifndef CGAL_IO_SCANNER_OFF_H
#define CGAL_IO_SCANNER_OFF_H 1
#include <CGAL/basic.h>
#include <iterator>
#include <vector>
#include <utility>
#include <limits>
#include <CGAL/IO/File_scanner_OFF.h>
namespace CGAL {
// The Facet_iterator's value type is vector<std::size_t>
// that contains the vertex indices.
template <class Pt>
class I_Scanner_OFF_vertex_iterator
{
public:
typedef std::input_iterator_tag iterator_category;
typedef Pt value_type;
typedef std::ptrdiff_t difference_type;
typedef const Pt* pointer;
typedef const Pt& reference;
private:
File_scanner_OFF* m_scan;
std::size_t m_cnt;
Pt m_point;
void next_vertex() {
CGAL_assertion( m_scan != NULL);
if ( m_cnt < m_scan->size_of_vertices()) {
file_scan_vertex( *m_scan, m_point);
m_scan->skip_to_next_vertex( m_cnt);
++m_cnt;
} else
m_cnt = m_scan->size_of_vertices() + 1;
}
public:
typedef Pt Point;
typedef File_scanner_OFF Scanner;
typedef I_Scanner_OFF_vertex_iterator<Pt> Self;
I_Scanner_OFF_vertex_iterator(std::size_t cnt) : m_scan(0), m_cnt(cnt+1) {}
I_Scanner_OFF_vertex_iterator( Scanner& s, int cnt)
: m_scan(&s), m_cnt(cnt)
{
next_vertex();
}
std::size_t count() const { return m_cnt; }
bool operator==( const Self& i) const { return m_cnt == i.m_cnt; }
bool operator!=( const Self& i) const { return m_cnt != i.m_cnt; }
Self& operator++() {
next_vertex();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++(*this);
return tmp;
}
const Point& operator*() const {
CGAL_assertion( m_scan != NULL);
return m_point;
}
const Point* operator->() const { return & operator*(); }
};
template <class Pt, class Nrm>
class I_Scanner_OFF_vertex_and_normals_iterator
{
public:
typedef Pt Point;
typedef Nrm Normal;
typedef File_scanner_OFF Scanner;
typedef I_Scanner_OFF_vertex_and_normals_iterator<Pt,Nrm> Self;
typedef std::input_iterator_tag iterator_category;
typedef std::pair<Point,Normal> value_type;
typedef std::ptrdiff_t difference_type;
typedef const value_type* pointer;
typedef const value_type& reference;
private:
File_scanner_OFF* m_scan;
std::size_t m_cnt;
value_type m_current;
void next() {
CGAL_assertion( m_scan != NULL);
if ( m_cnt < m_scan->size_of_vertices()) {
file_scan_vertex( *m_scan, m_current.first);
if ( m_scan->has_normals())
file_scan_normal( *m_scan, m_current.second);
m_scan->skip_to_next_vertex( m_cnt);
++m_cnt;
} else
m_cnt = m_scan->size_of_vertices() + 1;
}
public:
I_Scanner_OFF_vertex_and_normals_iterator( int cnt)
: m_scan(0), m_cnt(cnt+1) {}
I_Scanner_OFF_vertex_and_normals_iterator( Scanner& s, int cnt)
: m_scan(&s), m_cnt(cnt)
{
next();
}
std::size_t count() const { return m_cnt; }
bool operator==( const Self& i) const { return m_cnt == i.m_cnt; }
bool operator!=( const Self& i) const { return m_cnt != i.m_cnt; }
Self& operator++() {
next();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++(*this);
return tmp;
}
reference operator*() const {
CGAL_assertion( m_scan != NULL);
return m_current;
}
pointer operator->() const { return & operator*(); }
};
class I_Scanner_OFF_facet_iterator
{
public:
typedef std::input_iterator_tag iterator_category;
typedef std::vector<std::size_t> value_type;
typedef std::ptrdiff_t difference_type;
typedef value_type* pointer;
typedef value_type& reference;
private:
File_scanner_OFF* m_scan;
std::size_t m_cnt;
value_type m_indices;
void next_facet() {
CGAL_assertion( m_scan != NULL);
if ( m_cnt < m_scan->size_of_facets()) {
m_indices.erase( m_indices.begin(), m_indices.end());
std::size_t no;
m_scan->scan_facet( no, m_cnt);
m_indices.reserve( no);
std::size_t index = (std::numeric_limits<std::size_t>::max)();
// A huge value helps to detect a potential
// error in the function scan_facet_vertex_index
for (std::size_t i = 0; i < no; ++i) {
m_scan->scan_facet_vertex_index( index, m_cnt);
m_indices.push_back( index);
}
m_scan->skip_to_next_facet( m_cnt);
++ m_cnt;
} else
m_cnt = m_scan->size_of_facets() + 1;
}
public:
value_type::size_type size_of_indices () const // RO
{ return m_indices.size(); }
typedef value_type::size_type indices_size_type; // RO
public:
typedef File_scanner_OFF Scanner;
typedef I_Scanner_OFF_facet_iterator Self;
typedef value_type::iterator iterator;
I_Scanner_OFF_facet_iterator( std::size_t cnt) : m_scan(0), m_cnt(cnt+1) {}
I_Scanner_OFF_facet_iterator( Scanner& s, std::size_t cnt)
: m_scan(&s), m_cnt(cnt)
{
next_facet();
}
std::size_t count() const { return m_cnt; }
bool operator==( const Self& i) const { return m_cnt == i.m_cnt; }
bool operator!=( const Self& i) const { return m_cnt != i.m_cnt; }
Self& operator++() {
next_facet();
return *this;
}
Self operator++(int) {
Self tmp = *this;
++(*this);
return tmp;
}
value_type& operator*() {
CGAL_assertion( m_scan != NULL);
return m_indices;
}
const value_type& operator*() const {
CGAL_assertion( m_scan != NULL);
return m_indices;
}
value_type* operator->() { return & operator*(); }
const value_type* operator->() const { return & operator*(); }
};
// The distance function is implemented to work in
// constant time for both iterators.
template <class Pt, class Distance> inline
void distance( const I_Scanner_OFF_vertex_iterator<Pt>& first,
const I_Scanner_OFF_vertex_iterator<Pt>& last,
Distance& n) {
n = Distance( last.count() - first.count());
}
template <class Distance> inline
void distance( const I_Scanner_OFF_facet_iterator& first,
const I_Scanner_OFF_facet_iterator& last,
Distance& n) {
n = Distance( last.count() - first.count());
}
template <class Pt> inline
std::ptrdiff_t distance( const I_Scanner_OFF_vertex_iterator<Pt>& first,
const I_Scanner_OFF_vertex_iterator<Pt>& last) {
return last.count() - first.count();
}
inline
std::ptrdiff_t distance( const I_Scanner_OFF_facet_iterator& first,
const I_Scanner_OFF_facet_iterator& last) {
return last.count() - first.count();
}
template <class Kernel>
class Scanner_OFF {
File_scanner_OFF m_scan;
public:
typedef typename Kernel::Point_3 Point;
typedef Point Pt;
typedef typename Kernel::Vector_3 Normal;
typedef Scanner_OFF<Kernel> Self;
typedef I_Scanner_OFF_vertex_iterator<Pt> Vertex_iterator;
typedef I_Scanner_OFF_vertex_and_normals_iterator<Pt,Normal>
Vertex_and_normals_iterator;
typedef I_Scanner_OFF_facet_iterator Facet_iterator;
typedef I_Scanner_OFF_facet_iterator::iterator Index_iterator;
Scanner_OFF( std::istream& in, bool verbose = false)
: m_scan( in, verbose) {}
Scanner_OFF( std::istream& in, const File_header_OFF& header)
: m_scan( in, header) {}
std::size_t size_of_vertices() const { return m_scan.size_of_vertices(); }
std::size_t size_of_halfedges() const { return m_scan.size_of_halfedges();}
std::size_t size_of_facets() const { return m_scan.size_of_facets(); }
bool verbose() const { return m_scan.verbose(); }
bool skel() const { return m_scan.skel(); }
bool off() const { return m_scan.off(); }
bool binary() const { return m_scan.binary(); }
bool ascii() const { return m_scan.ascii(); }
bool has_colors() const { return m_scan.has_colors(); }
bool has_normals() const { return m_scan.has_normals(); }
File_header_OFF& header() { return m_scan; }
const File_header_OFF&
header() const { return m_scan; }
Vertex_iterator vertices_begin(){ return Vertex_iterator( m_scan,0);}
Vertex_iterator vertices_end() {
return Vertex_iterator( size_of_vertices());
}
Facet_iterator facets_begin() { return Facet_iterator( m_scan,0); }
Facet_iterator facets_end() {
return Facet_iterator( size_of_facets());
}
Vertex_and_normals_iterator vertices_and_normals_begin(){
return Vertex_and_normals_iterator( m_scan,0);
}
Vertex_and_normals_iterator vertices_and_normals_end() {
return Vertex_and_normals_iterator( size_of_vertices());
}
};
} //namespace CGAL
#endif // CGAL_IO_SCANNER_OFF_H //
// EOF //
|