| 128 | } |
| 129 | } |
| 130 | ideal as_module() const |
| 131 | { |
| 132 | //no checks for rings |
| 133 | int s=size(); |
| 134 | |
| 135 | if (s==0) |
| 136 | s=1; |
| 137 | |
| 138 | ideal result=idInit(s,1); |
| 139 | result->m[0]=NULL; |
| 140 | s=size(); |
| 141 | for(int i=0;i<s;i++) |
| 142 | { |
| 143 | result->m[i]=storage[i].as_poly(); |
| 144 | } |
| 145 | if (size()==0) |
| 146 | result->rank=0; |
| 147 | else |
| 148 | result->rank=id_RankFreeModule(result,storage[0].getRing()); |
| 149 | return result; |
| 150 | } |
| 151 | Module(iterator first, |
| 152 | iterator last, |
| 153 | const allocator_type& __a = allocator_type()): |
no test coverage detected