/usr/include/CGAL/Triangulation_face.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 | // Copyright (c) 2009-2014 INRIA Sophia-Antipolis (France).
// 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
// 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) : Samuel Hornus
#ifndef CGAL_TRIANGULATION_FACE_H
#define CGAL_TRIANGULATION_FACE_H
#include <CGAL/basic.h>
#include <CGAL/internal/Static_or_dynamic_array.h>
namespace CGAL {
template< typename TDS >
class Triangulation_face
{
typedef typename internal::Dimen_plus_one<typename TDS::Maximal_dimension>::type Dimen_plus;
public:
typedef TDS Triangulation_data_structure;
typedef typename TDS::Full_cell_handle Full_cell_handle; /* Concept */
typedef typename TDS::Vertex_handle Vertex_handle; /* Concept */
typedef internal::S_or_D_array<int, Dimen_plus> Indices;
protected:
Full_cell_handle full_cell_;
Indices indices_;
public:
explicit Triangulation_face(Full_cell_handle s) /* Concept */
: full_cell_(s), indices_(s->maximal_dimension()+2)
{
CGAL_assertion( Full_cell_handle() != s );
clear();
}
explicit Triangulation_face(const int maximal_dim) /* Concept */
: full_cell_(), indices_(maximal_dim+2)
{
clear();
}
Triangulation_face(const Triangulation_face & f) /* Concept */
: full_cell_(f.full_cell_), indices_(f.indices_)
{}
int face_dimension() const /* Concept */
{
int i(0);
while( -1 != indices_[i] ) ++i;
return (i-1);
}
Full_cell_handle full_cell() const /* Concept */
{
return full_cell_;
}
int index(const int i) const /* Concept */
{
CGAL_precondition( (0 <= i) && (i <= face_dimension()) );
return indices_[i];
}
Vertex_handle vertex(const int i) const /* Concept */
{
int j = index(i);
if( j == -1 )
return Vertex_handle();
return full_cell()->vertex(j);
}
// - - - - - - - - - - - - - - - - - - UPDATE FUNCTIONS
void clear() /* Concept */
{
const std::size_t d = indices_.size();
for(std::size_t i = 0; i < d; ++i )
indices_[i] = -1;
}
void set_full_cell(Full_cell_handle s) /* Concept */
{
CGAL_precondition( Full_cell_handle() != s );
full_cell_ = s;
}
void set_index(const int i, const int idx) /* Concept */
{
CGAL_precondition( (0 <= i) && ((size_t)i+1 < indices_.size()) );
CGAL_precondition( (0 <= idx) && ((size_t)idx < indices_.size()) );
indices_[i] = idx;
}
};
} //namespace CGAL
#endif // CGAL_TRIANGULATION_FACE_H
|