if p == pHead( (theIdeal->m)[k] ) return k, 0 otherwise (Assumes that pLmEqual just checks the leading monomials without coefficients.)
| 526 | // (Assumes that pLmEqual just checks the leading monomials without |
| 527 | // coefficients.) |
| 528 | int |
| 529 | fglmSdata::getEdgeNumber( const poly m ) const |
| 530 | { |
| 531 | for ( int k = idelems; k > 0; k-- ) |
| 532 | if ( pLmEqual( m, (theIdeal->m)[k-1] ) ) |
| 533 | return k; |
| 534 | return 0; |
| 535 | } |
| 536 | |
| 537 | // Returns the fglmVector v, s.t. |
| 538 | // p = v[1]*basis(1) + .. + v[basisSize]*basis(basisSize) |
no outgoing calls
no test coverage detected