|virtual void||clear ()=0|
|virtual MemoryRegion||final ()=0|
|virtual bool||ok () const =0|
|MemoryRegion||process (const MemoryRegion &a)|
|virtual MemoryRegion||update (const MemoryRegion &a)=0|
General superclass for filtering transformation algorithms
A filtering computation is characterised by having the algorithm take input data in an incremental way, with results delivered for each input, or block of input. Some internal state may be managed, with the transformation completed when final() is called.
If this seems a big vague, then you might try deriving your class from a subclass with stronger semantics, or if your update() function is always returning null results, and everything comes out at final(), try BufferedComputation.
Member Function Documentation
Perform an "all in one" update, returning the result.
This is appropriate if you have all the data in one array - just call process on that array, and you will get back the results of the computation.
- This will invalidate any previous computation using this object.
a the data to process in this step
The documentation for this class was generated from the following file: