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
|
// 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: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/next/Matrix_search/include/CGAL/Dynamic_matrix.h $
// $Id: Dynamic_matrix.h 67117 2012-01-13 18:14:48Z lrineau $
//
//
// Author(s) : Michael Hoffmann <hoffmann@inf.ethz.ch>
#ifndef CGAL_DYNAMIC_MATRIX_H
#define CGAL_DYNAMIC_MATRIX_H 1
#include <vector>
#include <utility>
#include <CGAL/Optimisation/assertions.h>
namespace CGAL {
template < class Matrix >
class Dynamic_matrix
// adaptor for a matrix class
// to allow replacement of columns in constant time
// and extraction of all even rows in linear time
{
public:
typedef std::vector< int > CoordContainer;
typedef Dynamic_matrix< Matrix > ThisMatrixClass;
typedef typename Matrix::Value Value;
Dynamic_matrix( const Matrix& m, int r_p = 0)
: matrix( &m),
column_indices( m.number_of_columns()),
row_power( r_p),
row_offset( (1 << r_p) - 1)
{
for ( unsigned int i( 0); i < column_indices.size(); ++i)
column_indices[i] = i;
}
int
number_of_rows() const
{
return ( matrix->number_of_rows() + row_offset) >> row_power;
}
int
number_of_columns() const
{ return column_indices.size(); }
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 (*matrix)( r << row_power, column_indices[c]);
}
Value
operator()( std::pair< int, int > p) const
{
return (*this)( p.first, p.second);
}
void
replace_column( int o, int n)
{
CGAL_optimisation_precondition( o >= 0 && o < number_of_columns());
CGAL_optimisation_precondition( n >= 0 && n < number_of_columns());
column_indices[o] = column_indices[n];
}
void
shrink_to_quadratic_size()
{
CGAL_optimisation_precondition( number_of_columns() >= number_of_rows());
column_indices.erase( column_indices.begin() + number_of_rows(),
column_indices.end());
CGAL_optimisation_postcondition( number_of_columns() == number_of_rows());
}
private:
Dynamic_matrix( const Matrix* m, const CoordContainer& c_i, int r_p)
: matrix( m),
column_indices( c_i),
row_power( r_p),
row_offset( (1 << r_p) - 1)
{}
public:
ThisMatrixClass*
extract_all_even_rows() const
{
return new ThisMatrixClass( matrix, column_indices, row_power + 1);
}
private:
const Matrix* matrix;
CoordContainer column_indices;
int row_power;
int row_offset;
};
template < class Matrix >
inline
Dynamic_matrix< Matrix >
dynamic_matrix( const Matrix& m)
{ return Dynamic_matrix< Matrix >( m); }
} //namespace CGAL
#endif // ! (CGAL_DYNAMIC_MATRIX_H)
// ----------------------------------------------------------------------------
// ** EOF
// ----------------------------------------------------------------------------
|
