| 61 | } |
| 62 | |
| 63 | forceinline bool |
| 64 | overflow(Term* t, int n, FloatVal c) { |
| 65 | FloatVal est = c; |
| 66 | for (int i=n; i--; ) |
| 67 | est += t[i].a * t[i].x.domain(); |
| 68 | FloatNum min = est.min(); |
| 69 | FloatNum max = est.max(); |
| 70 | return ((min < Limits::min) || (min > Limits::max) || |
| 71 | (max < Limits::min) || (max > Limits::max)); |
| 72 | } |
| 73 | |
| 74 | /// Sort linear terms by view |
| 75 | class TermLess { |