fglmSdata Class Reference

Public Member Functions
	fglmSdata (const ideal thisIdeal)
	~fglmSdata ()
BOOLEAN	state () const
int	getBasisSize () const
int	newBasisElem (poly &p)
void	newBorderElem (poly &m, fglmVector v)
BOOLEAN	candidatesLeft () const
fglmSelem	nextCandidate ()
void	updateCandidates ()
int	getEdgeNumber (const poly m) const
poly	getSpanPoly (int number) const
fglmVector	getVectorRep (const poly m)
fglmVector	getBorderDiv (const poly m, int &var) const

Private Attributes
ideal	theIdeal
int	idelems
int *	varpermutation
int	basisBS
int	basisMax
int	basisSize
polyset	basis
int	borderBS
int	borderMax
int	borderSize
borderElem *	border
List< fglmSelem >	nlist
BOOLEAN	_state

Detailed Description

Definition at line 336 of file fglmzero.cc.

Constructor & Destructor Documentation

fglmSdata()

fglmSdata::fglmSdata

(

const ideal

thisIdeal

)

Definition at line 372 of file fglmzero.cc.

{
    // An dieser Stelle kann die BlockSize ( =BS ) noch sinnvoller berechnet
    // werden, jenachdem wie das Ideal aussieht.
    theIdeal= thisIdeal;
    idelems= IDELEMS( theIdeal );
    varpermutation = (int*)omAlloc( ((currRing->N)+1)*sizeof(int) );
    // Sort ring variables by increasing values (because of weighted orderings)
    ideal perm = idMaxIdeal(1);
    intvec *iv = idSort(perm,TRUE);
    idDelete(&perm);
    for(int i = (currRing->N); i > 0; i--) varpermutation[(currRing->N)+1-i] = (*iv)[i-1];
    delete iv;
 
    basisBS= 100;
    basisMax= basisBS;
    basisSize= 0;
    basis= (polyset)omAlloc( basisMax*sizeof( poly ) );
 
    borderBS= 100;
    borderMax= borderBS;
    borderSize= 0;
#ifndef HAVE_EXPLICIT_CONSTR
    border= new borderElem[ borderMax ];
#else
    border= (borderElem *)omAlloc( borderMax*sizeof( borderElem ) );
#endif
    // rem: the constructors are called in newBorderElem().
    _state= TRUE;
}

~fglmSdata()

fglmSdata::~fglmSdata

(

)

Definition at line 403 of file fglmzero.cc.

{
    omFreeSize( (ADDRESS)varpermutation, ((currRing->N)+1)*sizeof(int) );
    for ( int k = basisSize; k > 0; k-- )
        pLmDelete( basis + k );  //. rem: basis runs from basis[1]..basis[basisSize]
    omFreeSize( (ADDRESS)basis, basisMax*sizeof( poly ) );
#ifndef HAVE_EXPLICIT_CONSTR
    delete [] border;
#else
    for ( int l = borderSize; l > 0; l-- )
        // rem: the polys of borderElem are deleted via ~borderElem()
        border[l].~borderElem();
    omFreeSize( (ADDRESS)border, borderMax*sizeof( borderElem ) );
#endif
}

Member Function Documentation

candidatesLeft()

BOOLEAN fglmSdata::candidatesLeft ( ) const

inline

Definition at line 363 of file fglmzero.cc.

{ return ( nlist.isEmpty() ? FALSE : TRUE ); }

getBasisSize()

int fglmSdata::getBasisSize ( ) const

inline

Definition at line 360 of file fglmzero.cc.

{ return basisSize; };

getBorderDiv()

fglmVector fglmSdata::getBorderDiv	(	const poly	m,
		int &	var
	)		const

Definition at line 578 of file fglmzero.cc.

{
//     int num2 = borderSize;
//     while ( num2 > 0 ) {
//         poly temp = border[num2].monom;
//         if ( pDivisibleBy( temp, m ) ) {
//             poly divisor = pDivideM( m, temp );
//             int var = pIsPurePower( divisor );
//             if ( (var != 0) && (pGetCoeff( divisor, var ) == 1) ) {
//                 Print( "poly %s divides poly %s", pString( temp ), pString( m ) );
//             }
//         }
//         num2--;
//     }
    int num = borderSize;
    while ( num > 0 ) {
        poly temp = border[num].monom;
        if ( pDivisibleBy( temp, m ) ) {
            var = (currRing->N);
            while ( var > 0 ) {
                if ( (pGetExp( m, var ) - pGetExp( temp, var )) == 1 )
                    return border[num].nf;
                var--;
            }
        }
        num--;
    }
    return fglmVector();
}

getEdgeNumber()

int fglmSdata::getEdgeNumber

(

const poly

m

)

const

Definition at line 529 of file fglmzero.cc.

{
    for ( int k = idelems; k > 0; k-- )
        if ( pLmEqual( m, (theIdeal->m)[k-1] ) )
            return k;
    return 0;
}

getSpanPoly()

poly fglmSdata::getSpanPoly ( int  number ) const

inline

Definition at line 367 of file fglmzero.cc.

{ return pCopy( (theIdeal->m)[number-1] ); }

getVectorRep()

fglmVector fglmSdata::getVectorRep

(

const poly

m

)

Definition at line 543 of file fglmzero.cc.

{
    fglmVector temp( basisSize );
    poly m = p;
    int num = basisSize;
    while ( m != NULL ) {
        int comp = pCmp( m, basis[num] );
        if ( comp == 0 ) {
            fglmASSERT( num > 0, "Error(1) in fglmSdata::getVectorRep" );
            number newelem = nCopy( pGetCoeff( m ) );
            temp.setelem( num, newelem );
            num--;
            pIter( m );
        }
        else {
            if ( comp < 0 ) {
                num--;
            }
            else {
                // This is the place where we can detect if the sourceIdeal
                // is not reduced. In this case m is not in basis[]. Since basis[]
                // is ordered this is the case, if and only if basis[i]<m
                // and basis[j]>m for all j>i
                _state= FALSE;
                return temp;
            }
        }
    }
    return temp;
}

newBasisElem()

int fglmSdata::newBasisElem

(

poly &

p

)

Definition at line 424 of file fglmzero.cc.

{
    basisSize++;
    if ( basisSize == basisMax ) {
        basis= (polyset)omReallocSize( basis, basisMax*sizeof( poly ), (basisMax + basisBS)*sizeof( poly ) );
        basisMax+= basisBS;
    }
    basis[basisSize]= m;
    m= NULL;
    return basisSize;
}

newBorderElem()

void fglmSdata::newBorderElem	(	poly &	m,
		fglmVector	v
	)

Definition at line 441 of file fglmzero.cc.

{
    borderSize++;
    if ( borderSize == borderMax ) {
#ifndef HAVE_EXPLICIT_CONSTR
        borderElem * tempborder = new borderElem[ borderMax+borderBS ];
        for ( int k = 0; k < borderMax; k++ ) {
            tempborder[k]= border[k];
            border[k].insertElem( NULL, fglmVector() );
        }
        delete [] border;
        border= tempborder;
#else
        border= (borderElem *)omReallocSize( border, borderMax*sizeof( borderElem ), (borderMax + borderBS)*sizeof( borderElem ) );
#endif
        borderMax+= borderBS;
    }
#ifndef HAVE_EXPLICIT_CONSTR
    border[borderSize].insertElem( m, v );
#else
    border[borderSize].borderElem( m, v );
#endif
    m= NULL;
}

nextCandidate()

fglmSelem fglmSdata::nextCandidate

(

)

Definition at line 467 of file fglmzero.cc.

{
    fglmSelem result = nlist.getFirst();
    nlist.removeFirst();
    return result;
}

state()

BOOLEAN fglmSdata::state ( ) const

inline

Definition at line 359 of file fglmzero.cc.

{ return _state; };

updateCandidates()

void fglmSdata::updateCandidates

(

)

Definition at line 479 of file fglmzero.cc.

{
    ListIterator<fglmSelem> list = nlist;
    fglmASSERT( basisSize > 0 && basisSize < basisMax, "Error(1) in fglmSdata::updateCandidates - wrong bassSize" );
    poly m = basis[basisSize];
    poly newmonom = NULL;
    int k = (currRing->N);
    BOOLEAN done = FALSE;
    int state = 0;
    while ( k >= 1 )
    {
        newmonom = pCopy( m );
        pIncrExp( newmonom, varpermutation[k] );
        pSetm( newmonom );
        done= FALSE;
        while ( list.hasItem() && (!done) )
        {
            if ( (state= pCmp( list.getItem().monom, newmonom )) < 0 )
                list++;
            else done= TRUE;
        }
        if ( !done )
        {
            nlist.append( fglmSelem( newmonom, varpermutation[k] ) );
            break;
        }
        if ( state == 0 )
        {
            list.getItem().newDivisor( varpermutation[k] );
            pLmDelete(&newmonom);
        }
        else
        {
            list.insert( fglmSelem( newmonom, varpermutation[k] ) );
        }
        k--;
    }
    while ( --k >= 1 )
    {
        newmonom= pCopy( m ); // HIER
        pIncrExp( newmonom, varpermutation[k] );
        pSetm( newmonom );
        nlist.append( fglmSelem( newmonom, varpermutation[k] ) );
    }
}

Field Documentation

_state

BOOLEAN fglmSdata::_state

private

Definition at line 354 of file fglmzero.cc.

basis

polyset fglmSdata::basis

private

Definition at line 346 of file fglmzero.cc.

basisBS

int fglmSdata::basisBS

private

Definition at line 343 of file fglmzero.cc.

basisMax

int fglmSdata::basisMax

private

Definition at line 344 of file fglmzero.cc.

basisSize

int fglmSdata::basisSize

private

Definition at line 345 of file fglmzero.cc.

border

borderElem* fglmSdata::border

private

Definition at line 351 of file fglmzero.cc.

borderBS

int fglmSdata::borderBS

private

Definition at line 348 of file fglmzero.cc.

borderMax

int fglmSdata::borderMax

private

Definition at line 349 of file fglmzero.cc.

borderSize

int fglmSdata::borderSize

private

Definition at line 350 of file fglmzero.cc.

idelems

int fglmSdata::idelems

private

Definition at line 340 of file fglmzero.cc.

nlist

List<fglmSelem> fglmSdata::nlist

private

Definition at line 353 of file fglmzero.cc.

theIdeal

ideal fglmSdata::theIdeal

private

Definition at line 339 of file fglmzero.cc.

varpermutation

int* fglmSdata::varpermutation

private

Definition at line 341 of file fglmzero.cc.

---

The documentation for this class was generated from the following file:

• kernel/fglm/fglmzero.cc