[493c477] | 1 | /* emacs edit mode for this file is -*- C++ -*- */ |
---|
[2dd068] | 2 | |
---|
[e4fe2b] | 3 | #include "config.h" |
---|
[b973c0] | 4 | |
---|
[650f2d8] | 5 | #include "cf_assert.h" |
---|
[b973c0] | 6 | |
---|
[2dd068] | 7 | #include "cf_defs.h" |
---|
| 8 | #include "cf_iter.h" |
---|
| 9 | #include "int_cf.h" |
---|
| 10 | #include "int_poly.h" |
---|
| 11 | |
---|
| 12 | |
---|
| 13 | CFIterator::CFIterator() |
---|
| 14 | { |
---|
| 15 | data = 0; cursor = 0; |
---|
| 16 | ispoly = false; hasterms = false; |
---|
| 17 | } |
---|
| 18 | |
---|
| 19 | CFIterator::CFIterator( const CFIterator & i ) |
---|
| 20 | { |
---|
| 21 | data = i.data; |
---|
| 22 | cursor = i.cursor; |
---|
| 23 | ispoly = i.ispoly; |
---|
| 24 | hasterms = i.hasterms; |
---|
| 25 | } |
---|
| 26 | |
---|
| 27 | CFIterator::CFIterator( const CanonicalForm & f ) |
---|
| 28 | { |
---|
[592e22] | 29 | if ( f.inBaseDomain() || f.inQuotDomain() ) |
---|
| 30 | { |
---|
| 31 | data = f; cursor = 0; |
---|
| 32 | ispoly = false; hasterms = true; |
---|
[2dd068] | 33 | } |
---|
[592e22] | 34 | else |
---|
| 35 | { |
---|
| 36 | data = f; |
---|
| 37 | cursor = ((InternalPoly*)(f.value))->firstTerm; |
---|
| 38 | ispoly = true; hasterms = true; |
---|
[2dd068] | 39 | } |
---|
| 40 | } |
---|
| 41 | |
---|
| 42 | CFIterator::CFIterator( const CanonicalForm & f, const Variable & v ) |
---|
| 43 | { |
---|
| 44 | ASSERT( !f.inQuotDomain(), "illegal iterator" ); |
---|
| 45 | ASSERT( v.level() > 0, "illegal iterator" ); |
---|
[592e22] | 46 | if ( f.inBaseDomain() ) |
---|
| 47 | { |
---|
| 48 | data = f; cursor = 0; |
---|
| 49 | ispoly = false; hasterms = true; |
---|
[2dd068] | 50 | } |
---|
[592e22] | 51 | else |
---|
| 52 | { |
---|
| 53 | if ( f.mvar() == v ) |
---|
| 54 | { |
---|
| 55 | data = f; |
---|
| 56 | cursor = ((InternalPoly*)(f.value))->firstTerm; |
---|
| 57 | ispoly = true; hasterms = true; |
---|
| 58 | } |
---|
| 59 | else if ( v > f.mvar() ) |
---|
| 60 | { |
---|
| 61 | data = f; cursor = 0; |
---|
| 62 | ispoly = false; hasterms = true; |
---|
| 63 | } |
---|
| 64 | else |
---|
| 65 | { |
---|
| 66 | data = swapvar( f, v, f.mvar().next() ); |
---|
| 67 | if ( data.mvar() == f.mvar().next() ) |
---|
| 68 | { |
---|
| 69 | cursor = ((InternalPoly*)(data.value))->firstTerm; |
---|
| 70 | ispoly = true; hasterms = true; |
---|
| 71 | } |
---|
| 72 | else |
---|
| 73 | { |
---|
| 74 | cursor = 0; |
---|
| 75 | ispoly = false; hasterms = true; |
---|
| 76 | } |
---|
| 77 | } |
---|
[2dd068] | 78 | } |
---|
| 79 | } |
---|
| 80 | |
---|
| 81 | CFIterator::~CFIterator() |
---|
| 82 | { |
---|
| 83 | data = 0; cursor = 0; |
---|
| 84 | } |
---|
| 85 | |
---|
| 86 | CFIterator& |
---|
| 87 | CFIterator::operator= ( const CFIterator & i ) |
---|
| 88 | { |
---|
[592e22] | 89 | if ( this != &i ) |
---|
| 90 | { |
---|
| 91 | data = i.data; |
---|
| 92 | cursor = i.cursor; |
---|
| 93 | ispoly = i.ispoly; |
---|
| 94 | hasterms = i.hasterms; |
---|
[2dd068] | 95 | } |
---|
| 96 | return *this; |
---|
| 97 | } |
---|
| 98 | |
---|
| 99 | CFIterator& |
---|
| 100 | CFIterator::operator= ( const CanonicalForm & f ) |
---|
| 101 | { |
---|
[592e22] | 102 | if ( f.inBaseDomain() || f.inQuotDomain() ) |
---|
| 103 | { |
---|
| 104 | data = f; cursor = 0; |
---|
| 105 | ispoly = false; hasterms = true; |
---|
[2dd068] | 106 | } |
---|
[592e22] | 107 | else |
---|
| 108 | { |
---|
| 109 | data = f; |
---|
| 110 | cursor = ((InternalPoly*)(f.value))->firstTerm; |
---|
| 111 | ispoly = true; hasterms = true; |
---|
[2dd068] | 112 | } |
---|
| 113 | return *this; |
---|
| 114 | } |
---|