This file is indexed.

/usr/include/linbox/vector/sparse.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
/* linbox/solutions/minpoly.h
 * Copyright (C) 2000, 2010 Jean-Guillaume Dumas
 *
 * Written by Jean-Guillaume Dumas <Jean-Guillaume.Dumas@imag.fr>
 *
 * ========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========
 */

// =======================================================================
// Sparse Vector      : vector< Pair<T> > and an additional actual size
// =======================================================================
#ifndef __LINBOX_sparse_vector_H
#define __LINBOX_sparse_vector_H
#include <iostream>

#include "linbox/vector/vector-traits.h"

// ---------------------------------------------------
//
/// Default container for sparse vectors is LightContainer
#ifndef _IBB_VECTOR_
// #include <vector>
// #define _IBB_VECTOR_ std::vector
#include "linbox/vector/light_container.h"
#define _IBB_VECTOR_ LightContainer
#endif // _IBB_VECTOR_
#ifndef _IBB_PAIR_
#include <utility>
#define _IBB_PAIR_ std::pair
// #include "linbox/vector/pair.h"
// #define _IBB_PAIR_ Pair
#endif // _IBB_PAIR_



namespace LinBox
{
	// ---------------------------------------------------
	//
	/** \brief vector< Pair<T,I> > and actualsize
	  \ingroup vector
	  */
	template<class T, class I = unsigned int>
	class Sparse_Vector : public _IBB_VECTOR_< _IBB_PAIR_<I, T> > {
	public:
		typedef _IBB_PAIR_<I, T>       Element;
		typedef T                      Type_t;
		typedef Sparse_Vector<T, I>    Self_t;

		// Dan Roche 6-30-04
		typedef VectorCategories::SparseSequenceVectorTag VectorCategory;


		Sparse_Vector() {};
		Sparse_Vector(size_t n) :
			_IBB_VECTOR_< _IBB_PAIR_<I, T> >(n), _rsize(0)
		{};
		Sparse_Vector(size_t n, size_t rn) :
			_IBB_VECTOR_< _IBB_PAIR_<I, T> >(n), _rsize(rn)
		{};
		~Sparse_Vector() {};



		/// Actual dimension of the vector, 0 for infinite or unknown
		inline size_t actualsize() const { return _rsize; };
		inline size_t reactualsize( const size_t s ) { return _rsize = s; };
		template<class XX> inline size_t reactualsize( const XX s )
		{
			return _rsize = (size_t)s;
		}

		friend inline std::ostream& operator<< (std::ostream& o, const Sparse_Vector<T, I> v)
		{
			if (v.size())
				for(long i=0;i<v.size();i++)
					o << v[i] << std::endl;
			return o;
		}


	private:
		size_t _rsize;
	};

} //end of namespace LinBox

#endif // __LINBOX_sparse_vector_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: