casa
$Rev:20696$
|
Class to make a mask from a condition. More...
#include <LELCondition.h>
Public Member Functions | |
LELCondition (const CountedPtr< LELInterface< T > > &expr, const CountedPtr< LELInterface< Bool > > &cond) | |
Construct the condition on the given expression. | |
~LELCondition () | |
Destructor does nothing. | |
virtual void | eval (LELArray< T > &result, const Slicer §ion) const |
Recursively evaluate the expression. | |
virtual LELScalar< T > | getScalar () const |
Recursively evaluate the scalar. | |
virtual Bool | prepareScalarExpr () |
Do further preparations (e.g. | |
virtual String | className () const |
Get class name. | |
virtual Bool | lock (FileLocker::LockType, uInt nattempts) |
Handle locking/syncing of a lattice in a lattice expression. | |
virtual void | unlock () |
virtual Bool | hasLock (FileLocker::LockType) const |
virtual void | resync () |
Private Attributes | |
CountedPtr< LELInterface< T > > | pExpr_p |
CountedPtr< LELInterface< Bool > > | pCond_p |
Class to make a mask from a condition.
Internal
This derived LEL letter class handles a condition as a mask.
This LEL letter class is derived from LELInterface. It is used to construct LEL objects that know how to deal with a condition (given using operator[]). The operands cannot be a scalar. The LELCondition object is embedded in the tree, and the conversion actually happens at tree evaluation time.
A description of the implementation details of the LEL classes can be found in Note 216
Examples are not very useful as the user would never use these classes directly. Look in LatticeExprNode.cc to see how it invokes these classes. An example of how the user would indirectly use this class (through the envelope) is:
IPosition shape(2,5,10); ArrayLattice<Float> x(shape); x.set(1.0); ArrayLattice<Double> y(shape); y.copyData(x[x>5]); // y = x;
The LELCondition class is embedded in the tree at construction time so as to turn the condition in a mask on x.
Definition at line 90 of file LELCondition.h.
casa::LELCondition< T >::LELCondition | ( | const CountedPtr< LELInterface< T > > & | expr, |
const CountedPtr< LELInterface< Bool > > & | cond | ||
) |
Construct the condition on the given expression.
casa::LELCondition< T >::~LELCondition | ( | ) |
Destructor does nothing.
virtual String casa::LELCondition< T >::className | ( | ) | const [virtual] |
Get class name.
Implements casa::LELInterface< T >.
virtual void casa::LELCondition< T >::eval | ( | LELArray< T > & | result, |
const Slicer & | section | ||
) | const [virtual] |
Recursively evaluate the expression.
Implements casa::LELInterface< T >.
virtual LELScalar<T> casa::LELCondition< T >::getScalar | ( | ) | const [virtual] |
Recursively evaluate the scalar.
Implements casa::LELInterface< T >.
virtual Bool casa::LELCondition< T >::hasLock | ( | FileLocker::LockType | ) | const [virtual] |
Reimplemented from casa::LELInterface< T >.
virtual Bool casa::LELCondition< T >::lock | ( | FileLocker::LockType | , |
uInt | nattempts | ||
) | [virtual] |
Handle locking/syncing of a lattice in a lattice expression.
Reimplemented from casa::LELInterface< T >.
virtual Bool casa::LELCondition< T >::prepareScalarExpr | ( | ) | [virtual] |
virtual void casa::LELCondition< T >::resync | ( | ) | [virtual] |
Reimplemented from casa::LELInterface< T >.
virtual void casa::LELCondition< T >::unlock | ( | ) | [virtual] |
Reimplemented from casa::LELInterface< T >.
CountedPtr<LELInterface<Bool> > casa::LELCondition< T >::pCond_p [private] |
Definition at line 127 of file LELCondition.h.
CountedPtr<LELInterface<T> > casa::LELCondition< T >::pExpr_p [private] |
Definition at line 126 of file LELCondition.h.