57 std::ostream& operator<<(std::ostream&, const PRegion<T>&);
123 if ((Bmin == Bmax && Amin == Bmin) ||
124 (Bmin != Bmax && Amin >= Bmin && Amin < Bmax))
127 else if (Bmin == Bmax) {
128 if (Bmin >= Amin && Bmin < Amax)
132 if (Amax > Bmin && Bmax > Amin) {
133 A = (Amin > Bmin ? Amin : Bmin);
134 B = (Amax < Bmax ? Amax : Bmax);
153 if ((Bmin == Bmax && Amin == Bmin) ||
154 (Bmin != Bmax && Amin >= Bmin && Amin < Bmax))
157 else if (Bmin == Bmax) {
158 if (Bmin >= Amin && Bmin < Amax)
162 if (Amax > Bmin && Bmax > Amin)
182 bool operator<(const PRegion<T>& r)
const {
187 return ( (L1 < L2) || ( (L1 == L2) && ( (Amin < Bmin) ||
188 ( (Amin == Bmin) && (L1 > 0) ) ) ) );
201 #ifdef IPPL_USE_MEMBER_TEMPLATES
212 #ifdef IPPL_USE_MEMBER_TEMPLATES
277 std::ostream& operator<<(std::ostream& out, const PRegion<T>& r) {
278 out <<
'[' << r.
min();
279 out <<
',' << r.max();
Matrix< T > operator+(const Matrix< T > &, const Matrix< T > &)
Matrix addition.
Matrix< T > operator/(const Matrix< T > &, const T &)
Matrix divided by scalar.
PRegion< T > & operator*=(T t)
Matrix< T > operator*(const Matrix< T > &, const Matrix< T > &)
Matrix multiply.
void getMessage_iter(Message &m, OutputIterator o)
PRegion< T > intersect(const PRegion< T > &r) const
Message & get_iter(OutputIterator o)
Message & putMessage(Message &m)
PRegion< T > & operator/=(T t)
bool split(PRegion< T > &l, PRegion< T > &r) const
bool touches(const PRegion< T > &r) const
PRegion< T > & operator+=(T t)
bool contains(const PRegion< T > &r) const
Message & getMessage(Message &m)
bool operator==(const PRegion< T > &r) const
Message & put(const T &val)
PRegion< T > & operator-=(T t)
Matrix< T > operator-(const Matrix< T > &, const Matrix< T > &)
Matrix subtraction.