/usr/include/linbox/field/field-traits.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 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 | /* linbox/field/field-traits.h
* Copyright (C) June 2004 Dan Roche
* ========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_field_traits_H
#define __LINBOX_field_traits_H
#include "linbox/integer.h"
#include <givaro/givcaster.h>
#include <givaro/givinteger.h>
#include <givaro/givrational.h>
#include <givaro/zring.h>
// Namespace in which all LinBox library code resides
namespace LinBox {
/*! \brief some basic information about each field or ring.
\ingroup field
* It will try
* to take the information from the field when possible, and use defaults
* otherwise.
* maxModulus returns the greatest modulus that is usable for a given field, -1
* for infinite. goodModulus returns takes an integer and returns true if that
* integer is a valid modulus for the given field.
* maxExponent and goodExponent do the same for the prime power.
*/
namespace RingCategories {
//! generic ring.
struct GenericTag{};
//! If it is isomorphic to Z/mZ, for some m or its extensions.
struct ModularTag : public virtual GenericTag{};
//! Galois Field GF(p^e)
struct GaloisTag : public virtual GenericTag {};
//! If it is isomorphic to Z
struct IntegerTag : public virtual GenericTag{};
//! If it is isomorphic to Q
struct RationalTag : public virtual GenericTag{};
}
/*! Default ring category.
*/
template <class Field>
struct ClassifyRing {
typedef RingCategories::GenericTag categoryTag;
};
using Givaro::Caster;
template<>
struct ClassifyRing<Givaro::QField<Givaro::Rational>> {
typedef RingCategories::RationalTag categoryTag;
};
template<>
struct ClassifyRing<Givaro::ZRing<Givaro::Integer>> {
typedef RingCategories::IntegerTag categoryTag;
};
template<>
struct ClassifyRing<Givaro::IntegerDom> {
typedef RingCategories::IntegerTag categoryTag;
};
/*! FieldTrait.
*/
template <class Field>
struct FieldTraits {
typedef typename ClassifyRing<Field>::categoryTag categoryTag;
static integer& maxModulus( integer& i )
{
return Caster(i, Field::maxCardinality());
}
static uint64_t & maxModulus( uint64_t& i )
{
return Caster(i, Field::maxCardinality());
// return i = static_cast<uint64_t>(Field::maxCardinality());
}
static uint32_t & maxModulus( uint32_t& i )
{
return Caster(i, Field::maxCardinality());
// return i = static_cast<uint32_t>(Field::maxCardinality());
}
template<class T>
static T & maxModulus( T & i )
{
return i = static_cast<T>(Field::maxCardinality());
}
static integer maxModulus()
{
integer maxm;
return Caster(maxm, Field::maxCardinality());
// return static_cast<integer>(Field::maxCardinality());
}
static bool goodModulus( const integer& i )
{
integer max;
maxModulus( max );
if( max == -1 )
return ( i >= 2 );
else if( max == 0 )
return ( i == 0 );
else
return ( i >= 2 && i <= max );
}
static integer& maxExponent( integer& i )
{
return i = 1;
}
static bool goodExponent( const integer& i )
{
integer max;
maxExponent( max );
if( max == -1 )
return ( i >= 1 );
else
return ( i >= 1 && i <= max );
}
};
} // Namespace LinBox
namespace LinBox { /* areFieldEqual */
template<class _Field1, class _Field2>
bool areFieldEqual (const _Field1 &F, const _Field2 &G)
{
return false ;
}
template<class _Field, class _Category>
bool areFieldEqualSpecialised(const _Field &F, const _Field &G,
const _Category & m)
{
return true ;
}
template<class _Field>
bool areFieldEqualSpecialised(const _Field &F, const _Field &G,
const RingCategories::ModularTag & m)
{
return ( F.characteristic() == G.characteristic() ) ;
}
template<class _Field>
bool areFieldEqual (const _Field &F, const _Field &G)
{
return areFieldEqualSpecialised( F,G,typename FieldTraits<_Field>::categoryTag() ) ;
}
} // Namespace LinBox
#endif // __LINBOX_field_traits_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
|