 |
My Project
debian-1:4.1.1-p2+ds-4
|
#include <nforder.h>
|
void | calcdisc () |
|
int | ref_count_incref () |
|
int | ref_count_decref () |
|
int | ref_count () |
|
| nforder (int dim, bigintmat **m, const coeffs q) |
| 0 Konstruktoren/Destruktoren /// More...
|
|
| nforder (nforder *o, bigintmat *base, number div, const coeffs q) |
|
| nforder (nforder *o, int) |
|
| ~nforder () |
|
void | Write () |
|
char * | String () |
|
void | Print () |
|
nforder * | simplify () |
|
number | getDisc () |
|
number | viewDisc () |
|
int | getDim () |
|
coeffs | basecoeffs () const |
|
number | getDiv () |
|
bool | getMult (bigintmat **m) |
|
nforder * | getBase () |
|
bigintmat * | getBasis () |
|
bigintmat * | viewBasis () |
|
bool | oneIsOne () |
|
void | setOneIsOne () |
|
bool | isMaximalKnown () |
|
bool | isMaximal () |
|
void | setIsMaximal (bool is) |
|
void | elAdd (bigintmat *a, bigintmat *b) |
|
void | elSub (bigintmat *a, bigintmat *b) |
|
void | elMult (bigintmat *a, bigintmat *b) |
|
number | elTrace (bigintmat *a) |
|
number | elNorm (bigintmat *a) |
|
bigintmat * | elRepMat (bigintmat *a) |
|
void | multmap (bigintmat *a, bigintmat *m) |
|
bigintmat * | traceMatrix () |
|
void | createmulttable (bigintmat **a) |
|
Definition at line 23 of file nforder.h.
◆ nforder() [1/3]
0 Konstruktoren/Destruktoren ///
Definition at line 30 of file nforder.cpp.
35 for (
int i=0;
i<
dim;
i++) {
◆ nforder() [2/3]
◆ nforder() [3/3]
nforder::nforder |
( |
nforder * |
o, |
|
|
int |
|
|
) |
| |
◆ ~nforder()
◆ basecoeffs()
coeffs nforder::basecoeffs |
( |
| ) |
const |
|
inline |
◆ calcdisc()
void nforder::calcdisc |
( |
| ) |
|
◆ createmulttable()
void nforder::createmulttable |
( |
bigintmat ** |
a | ) |
|
◆ elAdd()
◆ elMult()
◆ elNorm()
◆ elRepMat()
◆ elSub()
◆ elTrace()
◆ getBase()
◆ getBasis()
◆ getDim()
◆ getDisc()
number nforder::getDisc |
( |
| ) |
|
◆ getDiv()
number nforder::getDiv |
( |
| ) |
|
◆ getMult()
◆ init()
◆ isMaximal()
bool nforder::isMaximal |
( |
| ) |
|
|
inline |
◆ isMaximalKnown()
bool nforder::isMaximalKnown |
( |
| ) |
|
|
inline |
◆ multmap()
◆ oneIsOne()
bool nforder::oneIsOne |
( |
| ) |
|
|
inline |
◆ Print()
◆ ref_count()
int nforder::ref_count |
( |
| ) |
|
|
inline |
◆ ref_count_decref()
int nforder::ref_count_decref |
( |
| ) |
|
|
inline |
◆ ref_count_incref()
int nforder::ref_count_incref |
( |
| ) |
|
|
inline |
◆ setIsMaximal()
void nforder::setIsMaximal |
( |
bool |
is | ) |
|
|
inline |
◆ setOneIsOne()
void nforder::setOneIsOne |
( |
| ) |
|
|
inline |
◆ simplify()
◆ String()
char * nforder::String |
( |
| ) |
|
◆ traceMatrix()
◆ viewBasis()
◆ viewDisc()
number nforder::viewDisc |
( |
| ) |
|
|
inline |
◆ Write()
◆ baseorder
◆ basis
◆ dimension
◆ discriminant
number nforder::discriminant |
|
private |
◆ divisor
◆ flags
◆ inv_basis
◆ inv_divisor
number nforder::inv_divisor |
|
private |
◆ m_coeffs
◆ multtable
◆ rc
The documentation for this class was generated from the following files:
bigintmat * elRepMat(bigintmat *a)
void StringAppendS(const char *st)
void nforder_delete(nforder *o)
static FORCE_INLINE void n_InpMult(number &a, number b, const coeffs r)
multiplication of 'a' and 'b'; replacement of 'a' by the product a*b
void Write()
IO: writes the matrix into the current internal string buffer which must be started/ allocated before...
number view(int i, int j) const
view an entry an entry. NOTE: starts at [1,1]
number elTrace(bigintmat *a)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
coeffs basecoeffs() const
bigintmat * traceMatrix()
nforder(int dim, bigintmat **m, const coeffs q)
0 Konstruktoren/Destruktoren ///
static FORCE_INLINE BOOLEAN n_IsZero(number n, const coeffs r)
TRUE iff 'n' represents the zero element.
void basis_elt(bigintmat *m, int i)
coeffs basecoeffs() const
void multmap(bigintmat *a, bigintmat *m)
bigintmat * bimMult(bigintmat *a, bigintmat *b)
number det()
det (via LaPlace in general, hnf for euc. rings)
void skaldiv(number b)
Macht Ganzzahldivision aller Matrixeinträge mit b.
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
void PrintS(const char *s)
void set(int i, int j, number n, const coeffs C=NULL)
replace an entry with a copy (delete old + copy new!). NOTE: starts at [1,1]
bool getMult(bigintmat **m)
static FORCE_INLINE number n_Mult(number a, number b, const coeffs r)
return the product of 'a' and 'b', i.e., a*b
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
void getcol(int j, bigintmat *a)
copies the j-th column into the matrix a - which needs to be pre-allocated with the correct size.
bool add(bigintmat *b)
Addiert zur Matrix die Matrix b dazu. Return false => an error occurred.
number pseudoinv(bigintmat *a)
Speichert in Matrix a die Pseudoinverse, liefert den Nenner zurück.
number get(int i, int j) const
get a copy of an entry. NOTE: starts at [1,1]
void elMult(bigintmat *a, bigintmat *b)
void StringSetS(const char *st)
void Werror(const char *fmt,...)
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
const CanonicalForm int s
static FORCE_INLINE number n_Div(number a, number b, const coeffs r)
return the quotient of 'a' and 'b', i.e., a/b; raises an error if 'b' is not invertible in r exceptio...
void simplifyContentDen(number *den)
ensures that Gcd(den, content)=1 enden hier wieder
number trace()
the trace ....
bool sub(bigintmat *b)
Subtrahiert ...
bool skalmult(number b, coeffs c)
Multipliziert zur Matrix den Skalar b hinzu.