This file is indexed.

/usr/include/linbox/blackbox/companion.h is in liblinbox-dev 1.4.2-3.

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
/* linbox/blackbox/companion.h
 * Copyright(c) LinBox
 *
 * Written by David Saunders <saunders@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_companion_H
#define __LINBOX_companion_H

#include "linbox/blackbox/blackbox-interface.h"
// #include "linbox/blackbox/triplesbb.h"
#include "linbox/matrix/sparse-matrix.h"
#include <vector>

namespace LinBox
{

	/** \ingroup blackbox
	 *  \brief %Companion matrix of a monic polynomial.
	 *
	 * @warning companion would be faster if built direct, using one axpy per entry: y_i = x_i-1 + p_i*x_n
	 */
	template<class Field_>
	struct Companion: public SparseMatrix<Field_,SparseMatrixFormat::CSR> {
		typedef Field_ Field;
		typedef SparseMatrix<Field,SparseMatrixFormat::CSR> Father_t;

		/// This is the n by n companion matrix of a given polynomial of degree n.
		template<class Polynomial>
		Companion(const Field& F , const Polynomial& P ) :
			Father_t(F, P.size()-1, P.size()-1)
		{
			size_t n = P.size() - 1;
			for (size_t i = 1; i < n; ++i)
				this->setEntry(i, i-1, F.one);
			for (size_t i = 0; i < n; ++i) {
				typename Field::Element x;
				F.neg(x, P[i]);
				this->setEntry(i, n-1, x);
			}
		}// Companion cstor

		/// zero matrix
		Companion(const Field& F) :
			Father_t(F)
		{}


		/**
		 * \brief This constructs a random companion matrix.
		 *
		 * Builds n by n matrix from degree n monic poly with other coefficients random.
		 *
		 * @warning should it be a constructor ?
		 */
		Companion(const Field& F, size_t n,
			  typename Field::RandIter r ) :
			Father_t(F, n, n)
		{
			std::vector<typename Field::Element> p(n+1);
			for (typename std::vector<typename Field::Element>::iterator i = p.begin(); i != p.end(); ++i)
				r.random(*i); // we'll pretend p[n] == 1, ok?

			for (size_t i = 1; i < n; ++i) this->setEntry(i, i-1, F.one);
			for (size_t i = 0; i < n; ++i)
			{	typename Field::Element x;
				F.neg(x, p[i]);
				this->setEntry(i, n-1, x);
			}

		}

		/**
		 * \brief This constructs a random companion matrix.
		 *
		 * Builds n by n matrix from degree n monic poly with other coefficients random.
		 *
		 * @warning should it be a constructor ?
		 */
		Companion(const Field& F, size_t n) :
			Father_t(F,n,n)
		{
			typename Field::RandIter r(F);
			std::vector<typename Field::Element> p(n+1);
			for (typename std::vector<typename Field::Element>::iterator i = p.begin(); i != p.end(); ++i)
				r.random(*i); // we'll pretend p[n] == 1, ok?

			// const size_t indexbase = 1;
			for (size_t i = 1; i < n; ++i)
				this->setEntry(i, i-1, F.one);
			for (size_t i = 0; i < n; ++i)
			{	typename Field::Element x;
				F.neg(x, p[i]);
				this->setEntry(i, n-1, x);
			}

		}

		template<typename _Tp1>
		struct rebind {
			typedef Companion<_Tp1> other;
		};


		using Father_t::write;




	}; //Companion class

} //LinBox

#endif //__LINBOX_companion_H



// Local Variables:
// mode: C++
// tab-width: 8
// indent-tabs-mode: nil
// c-basic-offset: 8
// End:
// vim:sts=8:sw=8:ts=8:noet:sr:cino=>s,f0,{0,g0,(0,\:0,t0,+0,=s