/usr/include/linbox/blackbox/factory.h is in liblinbox-dev 1.4.2-5build1.
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 | /* linbox/blackbox/factory.h
* Copyright (C) 2002 LinBox
*
* Written by Bradford Hovinen <bghovine@math.uwaterloo.ca>
*
* ------------------------------------
*
*
* ========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_blackbox_factory_H
#define __LINBOX_blackbox_factory_H
#include "linbox/util/error.h"
#include "linbox/vector/vector-traits.h"
namespace LinBox
{
/** @brief A tool for computations with integer and rational matrices.
*
* The blackbox factory provides a facility for performing integer or rational
* computations by reducing modulo one or more primes and recovering the
* solution with Chinese Remaindering, lifting, or rational reconstruction. It
* is an interface that provides one method which, given a field, produces a
* black box representing a particular matrix over that field. The factory
* object may be passed to various procedures, such as rank, det, and solve,
* which will perform the required modular reductions to find integer or
* rational solutions.
*
* In the typical case, the user provides an object whose class inherits from
* BlackboxFactory and implements the method makeBlackbox. The object represents
* the original integer or rational version of the black box, whose data might
* require some modification (e.g. modular reduction) to produce a true black
* box. Alternatively, the resulting black box might merely be a
* reinterpretation of the data in the original object, as is the case where
* matrix entries are all nonnegative and smaller than the modulus.
*/
template <class Field, class Blackbox>
class BlackboxFactory {
public:
/// Virtual destructor
virtual ~BlackboxFactory () {}
/** Given a field and vector type, construct a black box for the matrix
* over that field and using that vector type. This should be
* implemented by the user
* @param F Field over which to construct the black box
*/
virtual Blackbox *makeBlackbox (const Field &F) = 0;
/** Compute and return the max-norm of the matrix.
*
* @param res Place to store result
*/
virtual integer &maxNorm (integer &res) = 0;
/** Compute and return the hadamard bound of the matrxi.
*/
virtual integer &hadamardBound (integer &res) const = 0;
/** Give the row dimension of the matrix
*/
virtual size_t rowdim () = 0;
/** Give the column dimension of the matrix
*/
virtual size_t coldim () = 0;
}; // BlackboxFactory
} // namespace LinBox
#endif // __LINBOX_blackbox_factory_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:
|