partitionequmult< P, Q > Class Template Reference

Multipication operator. More...

#include <partitionequ.h>

Collaboration diagram for partitionequmult< P, Q >:

List of all members.

Public Member Functions
	partitionequmult (P const &_left, Q const &_right)
	Construct the binary operator from left and right expressions.
template<typename W >
partitionequmult < partitionequmult< P, Q >, W >	operator* (W const &x)
	Intersect the partitions.
template<typename W >
partitionequadd < partitionequmult< P, Q >, W >	operator+ (W const &x)
	Join the partitions.
partitionequnot < partitionequmult< P, Q > >	operator! ()
	Logically negate the partition.
template<typename W >
partitionequmult < partitionequmult< P, Q > , partitionequnot< W > >	operator- (W const &x)
	Subtract partition x from this partition.
template<typename T >
boolc	isInside (T const &x) const
	Intersect/multiply the partition spaces.
Public Attributes
P	left
	Left argument of binary operator.
Q	right
	Right argument of binary operator.

---

Detailed Description

template<typename P, typename Q>
class partitionequmult< P, Q >

Multipication operator.

Definition at line 72 of file partitionequ.h.

---

Constructor & Destructor Documentation

template<typename P, typename Q>

partitionequmult< P, Q >::partitionequmult	(	P const &	_left,
		Q const &	_right
	)			[inline]

Construct the binary operator from left and right expressions.

Definition at line 83 of file partitionequ.h.

    : left(_left), right(_right) {}

---

Member Function Documentation

template<typename P, typename Q>

template<typename T >

boolc partitionequmult< P, Q >::isInside

(

T const &

x

)

const [inline]

Intersect/multiply the partition spaces.

Definition at line 110 of file partitionequ.h.

References partitionequmult< P, Q >::left, and partitionequmult< P, Q >::right.

  {
    if (left.isInside(x)==false)
      return false;

    return right.isInside(x);
  }

template<typename P, typename Q>

partitionequnot< partitionequmult<P,Q> > partitionequmult< P, Q >::operator!

(

)

[inline]

Logically negate the partition.

Definition at line 100 of file partitionequ.h.

    { return partitionequnot< partitionequmult<P,Q> >(*this); }

template<typename P, typename Q>

template<typename W >

partitionequmult< partitionequmult<P,Q>, W > partitionequmult< P, Q >::operator*

(

W const &

x

)

[inline]

Intersect the partitions.

Definition at line 91 of file partitionequ.h.

    { return partitionequmult< partitionequmult<P,Q>, W >(*this,x); }

template<typename P, typename Q>

template<typename W >

partitionequadd< partitionequmult<P,Q>, W > partitionequmult< P, Q >::operator+

(

W const &

x

)

[inline]

Join the partitions.

Definition at line 96 of file partitionequ.h.

    { return partitionequadd< partitionequmult<P,Q>, W >(*this,x); }

template<typename P, typename Q>

template<typename W >

partitionequmult< partitionequmult<P,Q>, partitionequnot<W> > partitionequmult< P, Q >::operator-

(

W const &

x

)

[inline]

Subtract partition x from this partition.

Definition at line 105 of file partitionequ.h.

    { return partitionequmult< partitionequmult<P,Q>, partitionequnot<W> >(*this,partitionequnot<W>(x)); }

---

Member Data Documentation

template<typename P, typename Q>

P partitionequmult< P, Q >::left

Left argument of binary operator.

Definition at line 77 of file partitionequ.h.

Referenced by partitionequmult< P, Q >::isInside().

template<typename P, typename Q>

Q partitionequmult< P, Q >::right

Right argument of binary operator.

Definition at line 79 of file partitionequ.h.

Referenced by partitionequmult< P, Q >::isInside().

---

The documentation for this class was generated from the following file:

• mathlib/partitionequ.h