| 204 | // ---------------------------------------------------------------------------- |
| 205 | |
| 206 | static inline poly normalFormZ( poly f,poly Z, const ring r ) |
| 207 | { |
| 208 | poly *ptr = &f; |
| 209 | |
| 210 | while( (*ptr)!=NULL ) |
| 211 | { |
| 212 | if( !isMultiple( Z,*ptr,r ) ) |
| 213 | { |
| 214 | ptr = &(pNext( *ptr )); |
| 215 | } |
| 216 | else |
| 217 | { |
| 218 | p_LmDelete(ptr,r); |
| 219 | } |
| 220 | } |
| 221 | |
| 222 | return f; |
| 223 | } |
| 224 | |
| 225 | // ?? HS: |
| 226 | // Looks for the shortest polynomial f in stdJ which is divisible |
no test coverage detected