/usr/include/CGAL/Cartesian_matrix.h is in libcgal-dev 4.11-2build1.
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 | // Copyright (c) 1998-2003 ETH Zurich (Switzerland).
// 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) : Michael Hoffmann <hoffmann@inf.ethz.ch>
#ifndef CGAL_CARTESIAN_MATRIX_H
#define CGAL_CARTESIAN_MATRIX_H 1
#include <CGAL/license/Matrix_search.h>
#include <CGAL/basic.h>
#include <CGAL/Optimisation/assertions.h>
namespace CGAL {
template < class Operation,
class RandomAccessIC_row,
class RandomAccessIC_column >
class Cartesian_matrix {
public:
typedef typename Operation::result_type Value;
Cartesian_matrix(RandomAccessIC_row r_f,
RandomAccessIC_row r_l,
RandomAccessIC_column c_f,
RandomAccessIC_column c_l)
: row_vec(r_f),
column_vec(c_f),
n_rows(static_cast<int>(r_l - r_f)),
n_columns(static_cast<int>(c_l - c_f))
{}
Cartesian_matrix(RandomAccessIC_row r_f,
RandomAccessIC_row r_l,
RandomAccessIC_column c_f,
RandomAccessIC_column c_l,
const Operation& o)
: row_vec(r_f),
column_vec(c_f),
n_rows(static_cast<int>(r_l - r_f)),
n_columns(static_cast<int>(c_l - c_f)),
op(o)
{}
int
number_of_rows() const
{ return n_rows; }
int
number_of_columns() const
{ return n_columns; }
Value
operator()(int r, int c) const
{
CGAL_optimisation_precondition(r >= 0 && r < number_of_rows());
CGAL_optimisation_precondition(c >= 0 && c < number_of_columns());
return op(row_vec[r], column_vec[c]);
}
protected:
RandomAccessIC_row row_vec;
RandomAccessIC_column column_vec;
int n_rows;
int n_columns;
Operation op;
}; // class Cartesian_matrix< ... >
template < class Operation,
class RandomAccessIC_row,
class RandomAccessIC_column >
inline
Cartesian_matrix< Operation,
RandomAccessIC_row,
RandomAccessIC_column >
cartesian_matrix( RandomAccessIC_row r_f,
RandomAccessIC_row r_l,
RandomAccessIC_column c_f,
RandomAccessIC_column c_l,
const Operation& o)
{
return
Cartesian_matrix< Operation,
RandomAccessIC_row,
RandomAccessIC_column >
( r_f, r_l, c_f, c_l, o);
}
} //namespace CGAL
#endif // ! (CGAL_CARTESIAN_MATRIX_H)
// ----------------------------------------------------------------------------
// ** EOF
// ----------------------------------------------------------------------------
|