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
|
// Copyright (c) 1998-2003 ETH Zurich (Switzerland).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under
// the terms of the Q Public License version 1.0.
// See the file LICENSE.QPL distributed with CGAL.
//
// 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: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.2-branch/Matrix_search/include/CGAL/Cartesian_matrix.h $
// $Id: Cartesian_matrix.h 28567 2006-02-16 14:30:13Z lsaboret $
//
//
// Author(s) : Michael Hoffmann <hoffmann@inf.ethz.ch>
#if ! (CGAL_CARTESIAN_MATRIX_H)
#define CGAL_CARTESIAN_MATRIX_H 1
#include <CGAL/basic.h>
#include <CGAL/Optimisation/assertions.h>
CGAL_BEGIN_NAMESPACE
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(r_l - r_f),
n_columns(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(r_l - r_f),
n_columns(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);
}
CGAL_END_NAMESPACE
#endif // ! (CGAL_CARTESIAN_MATRIX_H)
// ----------------------------------------------------------------------------
// ** EOF
// ----------------------------------------------------------------------------
|
