This file is indexed.

/usr/include/linbox/field/givaro-montg.h is in liblinbox-dev 1.1.6~rc0-4.1.

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
/* -*- mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */

/* linbox/field/givaro-gfq.h
 * Copyright (C) 2004 Jean-Guillaume Dumas
 *
 * Written by Jean-Guillaume Dumas <Jean-Guillaume.Dumas@imag.fr>
 *
 * ------------------------------------
 *
 * See COPYING for license information.
 */

/* WARNING this wrapper works only with an improved version of Givaro.
 * This version of givaro won't be available for public yet.
 * But it is available on my web page.
 * You can send me a mail to get it or for others details.
 */

#ifndef __FIELD_GIVARO_MONTGOMERY
#define __FIELD_GIVARO_MONTGOMERY


#include <linbox/integer.h>
#include <linbox/field/field-interface.h>
#include <linbox/util/debug.h>
#include "linbox/linbox-config.h"
#include <linbox/field/field-traits.h>

//------------------------------------
// Files of Givaro library


#include <givaro/givmontg32.h>
#include <givaro/giv_randiter.h>
//------------------------------------

// Namespace in which all LinBox code resides
namespace LinBox 
{ 


	template <class Ring>
	struct ClassifyRing;

	class GivaroMontg;

	template<>
	struct ClassifyRing<GivaroMontg> {
		typedef RingCategories::ModularTag categoryTag;
	};
	/** 
	 \brief wrapper of Givaro's Montgomery<Std32>.
	 \ingroup field

	 *  This class is a modular representation with a Montgomery reduction
	 */   
	class GivaroMontg : public Montgomery<Std32>, public FieldInterface
	{
 
	public:

		/** Element type.
		 *  This type is inherited from the Givaro class Montgomery<Std32>
		 */
		typedef  Montgomery<Std32>::Rep Element;
    
		/** RandIter type
		 *  This type is inherited from the Givaro class Montgomery<Std32>
		 */	
		typedef GIV_randIter< Montgomery<Std32>, LinBox::integer >  RandIter;

		/** Constructor from an integer
		 *  this constructor use the ZpzDom<TAG> constructor
		 */
		GivaroMontg(const integer& p) :
			Montgomery<Std32>(static_cast<uint32>(long(p))) { }

		/** Constructor from an integer (takes degree of extension as 2nd parameter, must be 1)
		 *  this constructor use the ZpzDom<TAG> constructor
		 */
	  	GivaroMontg(const integer& p, const integer& k) :
			Montgomery<Std32>(static_cast<uint32>(long(p))) { 
			
			if (k!=1)
				throw PreconditionFailed(__FUNCTION__,__LINE__,"exponent must be 1");
		}
    
		/** Characteristic.
		 * Return integer representing characteristic of the domain.
		 * Returns a positive integer to all domains with finite characteristic,
		 * and returns 0 to signify a domain of infinite characteristic.
		 * @return integer representing characteristic of the domain.
		 */
		integer& characteristic(integer& c) const
		{return c=integer(static_cast<long>(Montgomery<Std32>::characteristic()));}

		long characteristic() const
		{return static_cast<long>(Montgomery<Std32>::characteristic());}
    
      
		/** Cardinality. 
		 * Return integer representing cardinality of the domain.
		 * Returns a non-negative integer for all domains with finite
		 * cardinality, and returns -1 to signify a domain of infinite
		 * cardinality.
		 * @return integer representing cardinality of the domain
		 */
		integer& cardinality(integer& c) const
		{ return c=integer(static_cast<long>(Montgomery<Std32>::size()));}
 

		/** Initialization of field base Element from an integer.
		 * Behaves like C++ allocator construct.
		 * This function assumes the output field base Element x has already been
		 * constructed, but that it is not already initialized.
		 * We assume that the type of Element is short int.
		 * this methos is just a simple cast.
		 * @return reference to field base Element.
		 * @param x field base Element to contain output (reference returned).
		 * @param y integer.
		 */  
		Element& init(Element& x , const integer& y=0) const
		{ 			
			return Montgomery<Std32>::init( x,long(y % (integer)_p));
		}
      
		Element& init(Element& x , const double y) const
		{ return Montgomery<Std32>::init( x, y);}

		/** Conversion of field base element to an integer.
		 * This function assumes the output field base element x has already been
		 * constructed, but that it is not already initialized.
		 * @return reference to an integer.
		 * @param x integer to contain output (reference returned).
		 * @param y constant field base element.
		 */
		integer& convert(integer& x, const Element& y) const
		{
			long tmp;	
			//	return x = *(new integer(Montgomery<Std32>::convert(tmp,y)));
			return x = integer(Montgomery<Std32>::convert(tmp,y));
		}
		double& convert(double& x, const Element& y) const
		{
			return Montgomery<Std32>::convert( x, y);
		}

		//bool isZero(const Element& x) const { return Montgomery<Std32>::isZero(x); }


		static inline int getMaxModulus() { return 40504; }

	}; // class GivaroMontg
 


} // namespace LinBox

#endif // __FIELD_GIVARO_MONTGOMERY