|
struct | __giv_map_less_ith |
| Map opcode on all Elements less or requal that ith. More...
|
|
struct | __giv_map_less_ith< T, UNARYOP, 0 > |
|
struct | __giv_map_less_ith< T, UNARYOP, ith > |
|
struct | __givdom_trait_name |
| give a name for /read/write More...
|
|
struct | __givdom_trait_name< char > |
|
struct | __givdom_trait_name< double > |
|
struct | __givdom_trait_name< float > |
|
struct | __givdom_trait_name< int > |
|
struct | __givdom_trait_name< long > |
|
struct | __givdom_trait_name< short > |
|
struct | _perfArray0< T > |
| defined by marco GIVARO_PERF_DEFCLASS. ref counting and stuff. More...
|
|
class | Array0 |
| NODOC. More...
|
|
class | Array0Tag |
| Array0Tag. More...
|
|
class | ArrayAllocatort |
| ArrayAllocator: class for allocation of arrays. More...
|
|
class | ArrayFixed |
| ArrayFixed. More...
|
|
class | BaseDomain |
| Base Domain. More...
|
|
class | BaseTimer |
| base for class RealTimer; class SysTimer; class UserTimer; More...
|
|
class | Bits |
| Bits. More...
|
|
class | BlocFreeList |
| Data structure of a bloc. More...
|
|
struct | ChineseRemainder |
| CRA. More...
|
|
struct | ChineseRemainder< Ring, Domain, false > |
| CRA2. More...
|
|
class | Degree |
| Degree type for polynomials. More...
|
|
struct | ElemConstRef |
| Elem const Ref. More...
|
|
struct | ElemRef |
| Elem Ref. More...
|
|
class | Extension |
| Extension. More...
|
|
class | FermatDom |
| Fermat numbers. More...
|
|
class | GeneralRingNonZeroRandIter |
| Random iterator for nonzero random numbers. More...
|
|
class | GeneralRingRandIter |
| UnparametricRandIter. More...
|
|
class | GF2 |
| Integers modulo 2. More...
|
|
class | GFqDom |
| class GFqDom More...
|
|
class | GFqExt |
| GFq Ext (other) More...
|
|
class | GFqExtFast |
| GFq Ext. More...
|
|
struct | GFqKronecker |
| GFqKronecker. More...
|
|
class | GIV_ExtensionrandIter |
| Extension rand iters. More...
|
|
class | GIV_randIter |
| Random ring Element generator. More...
|
|
class | GivaroAppli |
| Main application class Could be not used. More...
|
|
class | GivaroMain |
| Initialisation of GIVARO . More...
|
|
class | GivaroMM |
| Memory manager that allocates array of object of type T for. More...
|
|
class | GivaroNoInit |
| GivaroNoInit. More...
|
|
class | GivBadFormat |
| Exception thrown in input of data structure. More...
|
|
class | GivError |
| Base class for exeception handling in Givaro. More...
|
|
class | GivMathDivZero |
| Div by 0. More...
|
|
class | GivMathError |
| Math error. More...
|
|
class | GivMMFreeList |
| Implementation of a memory manager with free-lists. More...
|
|
class | GivMMInfo |
| Static informations of memory allocation. More...
|
|
class | GivMMRefCount |
| Memory management with reference counter on allocated data. More...
|
|
class | GivModule |
| GivModule. More...
|
|
class | givNoCopy |
| Used to call cstor without copy. More...
|
|
class | givNoInit |
| Used to build no initialized object as static object. More...
|
|
class | GivRandom |
| GivRandom. More...
|
|
class | givWithCopy |
| Used to call cstor with copy. More...
|
|
class | HashTable |
| Hash table. More...
|
|
class | Indeter |
| Indeterminate. More...
|
|
class | InitAfter |
| InitAfter. More...
|
|
class | Integer |
| This is the Integer class. More...
|
|
struct | Interpolation |
| Interpolation. More...
|
|
class | IntFactorDom |
| Integer Factor Domain. More...
|
|
class | IntNumTheoDom |
| Num theory Domain. More...
|
|
class | IntPrimeDom |
| Primality tests. More...
|
|
class | IntRNSsystem |
| RNS system class. No doc. More...
|
|
class | IntRSADom |
| RSA domain. More...
|
|
class | IntSqrtModDom |
| Modular square roots. More...
|
|
class | Key |
| The class Key. More...
|
|
class | List0 |
| ListO. More...
|
|
class | Modular |
| Forward declaration for Givaro::Modular. More...
|
|
class | Modular< _Storage_t, _Compute_t, typename std::enable_if< is_same_ruint< _Storage_t, _Compute_t >::value||is_smaller_ruint< _Storage_t, _Compute_t >::value||is_same_rint< _Storage_t, _Compute_t >::value||is_smaller_rint< _Storage_t, _Compute_t >::value >::type > |
|
class | Modular< _Storage_t, _Compute_t, typename std::enable_if< std::is_floating_point< _Storage_t >::value >::type > |
|
class | Modular< _Storage_t, _Compute_t, typename std::enable_if< std::is_integral< _Storage_t >::value &&std::is_integral< _Compute_t >::value &&(sizeof(_Storage_t)==sizeof(_Compute_t)||2 *sizeof(_Storage_t)==sizeof(_Compute_t))>::type > |
|
class | Modular< Integer > |
| This class implement the standard arithmetic with Modulo Elements. More...
|
|
class | Modular< Log16 > |
| This class implement the standard arithmetic with Modulo Elements. More...
|
|
class | Modular_implem |
| This class implement the standard arithmetic with Modulo Elements. More...
|
|
class | ModularRandIter |
| Random ring Element generator. More...
|
|
class | ModularRandIter< Modular< Integer > > |
|
class | Neutral |
| Neutral type. More...
|
|
struct | NewtonInterpGeom |
| Newton. More...
|
|
struct | NewtonInterpGeomMultip |
| Newton (multip) More...
|
|
class | ObjectInit |
| GivModule. More...
|
|
struct | OMPTimer |
| OMP timer. More...
|
|
struct | Pair |
| Pair. More...
|
|
class | Poly1CRT |
| Poly1 CRT. More...
|
|
class | Poly1FactorDom |
| Poly1FactorDom. More...
|
|
class | Primes16 |
| class Primes16 More...
|
|
class | RandomIntegerIterator |
| Random Integer Iterator. More...
|
|
class | Rational |
| Rationals. No doc. More...
|
|
class | RealTimer |
| Real timer. More...
|
|
class | RefCounter |
| Ref counter. More...
|
|
class | RefCountPtr |
| Refcount Pointer. More...
|
|
class | RNSsystem |
| class RNSsystem. More...
|
|
class | RNSsystemFixed |
| NO DOC. More...
|
|
class | Stack |
| Stack. More...
|
|
struct | StaticElement |
| Static Element. More...
|
|
class | SysTimer |
| Sys timer. More...
|
|
class | Timer |
| Timer. More...
|
|
class | UnparametricZRing |
| Generic Class ZRing. More...
|
|
class | UserTimer |
| User timer. More...
|
|
|
template<class T1, class T2> |
std::ostream & | operator<< (std::ostream &o, const Pair< T1, T2 > &p) |
| IO.
|
|
template<class T1, class T2> |
std::istream & | operator>> (std::istream &fin, Pair< T1, T2 > &p) |
| IO.
|
|
template<class Rt> |
Rt | FF_EXPONENT_MAX (const Rt p, const Rt maxe=21) |
| XXX.
|
|
template<class Rt> |
Rt | FF_SUBEXPONENT_MAX (const Rt p, const Rt e) |
| XXX.
|
|
template<typename Field> |
int64_t | Exponent_Trait (const Field &F) |
| XXX.
|
|
template<> |
int64_t | Exponent_Trait (const GFqDom< int64_t > &F) |
| XXX.
|
|
template<typename BaseField> |
int64_t | Exponent_Trait (const Extension< BaseField > &F) |
| XXX.
|
|
Integer & | inv (Integer &u, const Integer &a, const Integer &b) |
| Modular inverse.
|
|
Integer & | invin (Integer &u, const Integer &b) |
|
Integer | gcd (const Integer &a, const Integer &b) |
|
Integer | pp (const Integer &P, const Integer &Q) |
|
Integer & | lcm (Integer &g, const Integer &a, const Integer &b) |
|
Integer | lcm (const Integer &a, const Integer &b) |
|
Integer & | pow (Integer &Res, const Integer &n, const int64_t l) |
|
Integer | pow (const Integer &n, const int64_t l) |
|
Integer | powmod (const Integer &n, const uint64_t e, const Integer &m) |
|
int32_t | sign (const Integer &a) |
|
int32_t | compare (const Integer &a, const Integer &b) |
|
int32_t | absCompare (const Integer &a, const Integer &b) |
|
int32_t | isZero (const Integer &a) |
|
int32_t | nonZero (const Integer &a) |
|
int32_t | isOne (const Integer &a) |
|
Integer | fact (uint64_t l) |
|
Integer | sqrt (const Integer &p) |
|
Integer | sqrtrem (const Integer &p, Integer &rem) |
|
Integer & | sqrt (Integer &r, const Integer &p) |
|
Integer & | sqrtrem (Integer &r, const Integer &p, Integer &rem) |
|
bool | root (Integer &q, const Integer &a, uint32_t n) |
|
int64_t | logp (const Integer &a, const Integer &p) |
|
double | logtwo (const Integer &a) |
|
double | naturallog (const Integer &a) |
|
void | swap (Integer &a, Integer &b) |
|
bool | isOdd (const Integer &a) |
| Tests parity of an integer.
|
|
uint64_t | length (const Integer &a) |
|
std::istream & | operator>> (std::istream &i, Integer &n) |
|
std::ostream & | operator<< (std::ostream &o, const Integer &n) |
|
std::ostream & | absOutput (std::ostream &o, const Integer &n) |
|
Integer | operator+ (const int32_t l, const Integer &n) |
|
int32_t | operator!= (uint32_t l, const Integer &n) |
|
int32_t | operator== (uint32_t l, const Integer &n) |
|
int32_t | operator> (uint32_t l, const Integer &n) |
|
int32_t | operator< (uint32_t l, const Integer &n) |
|
int32_t | operator>= (uint32_t l, const Integer &n) |
|
int32_t | operator<= (uint32_t l, const Integer &n) |
|
Integer | operator% (const int64_t l, const Integer &n) |
|
Integer | operator* (const int32_t l, const Integer &n) |
|
Integer | operator- (const int32_t l, const Integer &n) |
|
std::ostream & | operator<< (std::ostream &o, const GivMMInfo &T) |
| IO.
|
|
template<typename Storage_t> |
Storage_t & | gcdext (Storage_t &d, Storage_t &u, Storage_t &v, const Storage_t a, const Storage_t b) |
| Generalized extended GCD used by specialized Modular.
|
|
template<typename Storage_t> |
std::enable_if< std::is_floating_point< Storage_t >::value, Storage_t & >::type | extended_euclid (Storage_t &x, Storage_t &d, const Storage_t a, const Storage_t b) |
| Extended Euclidean algorithm computing only the Bezout coefficient for a.
|
|
template<typename Storage_t> |
Storage_t & | invext (Storage_t &x, Storage_t &d, const Storage_t a, const Storage_t b) |
| Generalized inversion used by specialized Modular.
|
|
template<typename T> |
unsigned | GIVINTLOG (const T &a) |
| Integer log.
|
|
template<class TT, class UU> |
TT | power (const TT n, const UU l) |
| Powering.
|
|
template<class D, class TT> |
TT & | dom_power (TT &res, const TT &n, long l, const D &F) |
| dom_power
|
|
std::ostream & | operator<< (std::ostream &o, const BaseTimer &BT) |
| I/O.
|
|
std::ostream & | operator<< (std::ostream &o, const Timer &T) |
| I/O.
|
|
int64_t | value (const Degree &d) |
| value
|
|
int | operator== (const Indeter &i1, const Indeter &i2) |
|
Namespace in which the whole Givaro library resides.
- Todo
- use NTL if available ?