Simple 2D indexed LUT Implementation. More...

#include <LUT2D.h>

Public Member Functions
	LUT2D (RESULT_T(*generator_func)(IDX_T v1, IDX_T v2), IDX_T minVal, IDX_T maxVal)
	creating a new LUT2D object with given element creation function More...

	~LUT2D ()
	destructor More...

RESULT_T	operator() (IDX_T v1, IDX_T v2) const
	inline access in constant time of data element at (v1,v2) More...

Private Attributes
RESULT_T *	lut

int	minVal

int	range

Detailed Description

template<class RESULT_T = float, class IDX_T = int>
class icl::filter::LUT2D< RESULT_T, IDX_T >

Simple 2D indexed LUT Implementation.

The LUT2D template class provides functionalities for aranging 2D index data in a linear array for best and constant access performance, whereby x and y indices are allowed to be in an abitrary integer range [minVal,maxVal].

Internally an array of size RANGE² named "lut" is created. Date element Lookup can be calculated using the following formula ( $range := maxVal - minVal$ ):

$LUTIDX_{naiv}(x,y) = x-minVal + range \cdot (y-minVal)$

To enhance access performace, the lut-pointer can be adapted as follows:

$lut -= (range+1)*minVal;$

Now, data element lookup can be calculated much easier:

$LUTIDX_{optimized}(x,y) = x + range\cdot y$