/usr/include/linbox/blackbox/permutation.h is in liblinbox-dev 1.3.2-1.1build2.
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 | /* linbox/blackbox/permutation.h
* Copyright (C) 2001 Bradford Hovinen
*
* Written by Bradford Hovinen <hovinen@cis.udel.edu>
*
* ========LICENCE========
* This file is part of the library LinBox.
*
* LinBox is free software: 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 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
* ========LICENCE========
*/
#ifndef __LINBOX_bb_permutation_H
#define __LINBOX_bb_permutation_H
#include <utility>
#ifndef __LINBOX_PERMUTATION_STORAGE
// #include "linbox/vector/light_container.h"
// #define __LINBOX_PERMUTATION_STORAGE LightContainer< long >
#include <vector>
#define __LINBOX_PERMUTATION_STORAGE std::vector< long >
#endif
#include "linbox/util/debug.h"
#include "linbox/linbox-config.h"
#include "linbox/blackbox/blackbox-interface.h"
#ifdef __LINBOX_XMLENABLED
#include "linbox/util/xml/linbox-reader.h"
#include "linbox/util/xml/linbox-writer.h"
#include <iostream>
#include <string>
#endif //__LINBOX_XMLENABLED
// Namespace in which all LinBox library code resides
namespace LinBox
{
/** \brief size is n.
\ingroup blackbox
* @param Storage \ref LinBox dense or sparse vector of field elements
*/
template<class _Field, class _Storage = __LINBOX_PERMUTATION_STORAGE >
class Permutation : public BlackboxInterface {
const _Field& _field;
public:
typedef Permutation<_Field, _Storage> Self_t;
typedef _Storage Storage;
typedef _Field Field;
typedef typename Field::Element Element;
/** Constructor from a vector of indices.
* This constructor creates a permutation matrix based on a vector of indices
* @param F
* @param indices Vector of indices representing the permutation
*/
Permutation (Storage & indices, const Field& F = Field()) :
_field(F), _indices (indices)
{}
/** Constructor from a dimension.
* This constructor creates an n x n permutation matrix, initialized to be the identity
* @param n The dimension of hte matrix to create
* @param F
*/
Permutation (int n, const Field& F = Field()) :
_field(F)
{
identity(n);
}
void identity(int n)
{
this->_indices.resize (n);
for (typename Storage::value_type i=0; i < n; ++i)
_indices[i] = i;
}
/* Copy constructor.
* Creates new black box objects in dynamic memory.
* @param M constant reference to compose black box matrix
*/
Permutation (const Permutation &Mat) :
_field(Mat._field),_indices (Mat._indices)
{}
#ifdef __LINBOX_XMLENABLED
Permutation(LinBox::Reader &R)
{
if(!R.expectTagName("MatrixOver")) return;
if(!R.expectChildTag()) return;
R.traverseChild();
if(!R.expectTagName("permutation") || !R.expectTagNumVector(_indices)) return;
R.upToParent();
return;
}
#endif
// Destructor
~Permutation (void) {}
/** Application of BlackBox permutation matrix.
\f$y \leftarrow Px\f$.
* Requires one vector conforming to the \ref LinBox
* vector @link Archetypes archetype@endlink.
* Required by abstract base class.
* @return reference to vector y containing output.
* @param x constant reference to vector to contain input
* @param y
*/
template<class OutVector, class InVector>
inline OutVector &apply (OutVector &y, const InVector &x) const
{
size_t i;
linbox_check (x.size () == _indices.size ());
// resizing y is now forbidden - bds //y.resize (x.size ());
linbox_check (y.size () == _indices.size ());
for (i = 0; i < x.size(); ++i)
_field.assign(y[i], x[_indices[i]]);
return y;
}
/** Application of BlackBox permutation matrix transpose.
* <code>y= transpose(P)*x</code>, equivalently <code>y= P^-1*x</code>
* Requires one vector conforming to the \ref LinBox
* vector @link Archetypes archetype@endlink.
* Required by abstract base class.
* @return reference to vector y containing output.
* @param x constant reference to vector to contain input
* @param y
*/
/// \f$y^T \leftarrow x^T P\f$.
template<class OutVector, class InVector>
inline OutVector &applyTranspose (OutVector &y, const InVector &x) const
{
size_t i;
linbox_check (x.size () == _indices.size ());
// resizing y is now forbidden - bds //y.resize (x.size ());
linbox_check (y.size () == _indices.size ());
for (i = 0; i < _indices.size (); ++i)
_field.assign(y[_indices[i]], x[i]);
return y;
}
template<typename _Tp1>
struct rebind {
typedef Permutation<_Tp1, Storage> other;
void operator() (other & Ap, const Self_t& A, const _Tp1& F) {
Ap->setStorage( A.getStorage() );
}
};
/* Retreive row dimensions of BlackBox matrix.
* This may be needed for applying preconditioners.
* Required by abstract base class.
* @return integer number of rows of black box matrix.
*/
/// rowdim
size_t rowdim (void) const
{
return _indices.size ();
}
/* Retreive column dimensions of BlackBox matrix.
* Required by abstract base class.
* @return integer number of columns of black box matrix.
*/
/// coldim
size_t coldim (void) const
{
return _indices.size ();
}
/**
* Add a transposition to the matrix
*/
void permute (size_t row1, size_t row2)
{
linbox_check (/* row1 >= 0 &&*/ row1 < _indices.size ());
linbox_check (/* row2 >= 0 &&*/ row2 < _indices.size ());
std::swap (_indices[row1], _indices[row2]);
}
const Field& field() { return _field; }
#ifdef __LINBOX_XMLENABLED
std::ostream &write(std::ostream &out) const
{
LinBox::Writer W;
if( toTag(W) )
W.write(out);
return out;
}
bool toTag(LinBox::Writer &W) const
{
std::string s;
W.setTagName("MatrixOver");
W.setAttribute("rows", LinBox::Writer::numToString(s, _indices.size()));
W.setAttribute("cols", LinBox::Writer::numToString(s, _indices.size()));
W.setAttribute("implDetail", "permutation");
W.addTagChild();
W.setTagName("permutation");
W.addNumericalList(_indices);
W.upToParent();
return true;
}
#else
std::ostream &write(std::ostream &os, FileFormatTag format = FORMAT_MAPLE) const
{
// for (typename Storage::const_iterator it=_indices.begin(); it!=_indices.end(); ++it)
// std::cerr << *it << ' ';
typename Field::Element one, zero; _field.init(one,1UL);_field.init(zero,0UL);
os << "[";
bool firstrow=true;
long nmu = _indices.size()-1;
for (typename Storage::const_iterator it=_indices.begin(); it!=_indices.end(); ++it) {
if (firstrow) {
os << "[";
firstrow =false;
}
else
os << ", [";
long i=0;
for( ; i< *it ; ++i) {
_field.write(os, zero);
if (i < nmu) os << ',';
}
_field.write(os, one);
if (i < nmu) os << ',';
for(++i ; i< static_cast<long>(_indices.size()) ; ++i) {
_field.write(os, zero);
if (i < nmu) os << ',';
}
os << " ]";
}
return os << "]";
}
#endif
Storage& setStorage(const Storage& s) { return _indices=s; }
const Storage& getStorage() const { return _indices; }
private:
// Vector of indices
Storage _indices;
}; // template <Vector> class Permutation
} // namespace LinBox
#endif // __LINBOX_bb_permutation_H
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,:0,t0,+0,=s
// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
|