Source Code (Use browser search to find items of interest.)
Class Index
kfract'Lambda (./kdegraphics/kfract/lambda.h:31)
class Lambda : public Fract
{
public:
Lambda();
void init( double center_x, double center_y,
double dx, double dy,
int x_max, int y_max,
int iter_max, double bail_out,
double param_x, double param_y );
int calcPoint( int x, int y );
double defaultCenterX();
double defaultCenterY();
double defaultWidth();
double defaultBailout();
protected:
private:
double lambda_x, lambda_y;
};
kfract'Lambda::Lambda() (./kdegraphics/kfract/lambda.C:37)
Lambda::Lambda()
{
}
kfract'Lambda::init() (./kdegraphics/kfract/lambda.C:42)
void Lambda::init( double center_x, double center_y,
double dx, double dy,
int x_max, int y_max,
int iter_max, double bail_out,
double param_x, double param_y )
{
Fract::init( center_x, center_y, dx, dy,
x_max, y_max, iter_max, bail_out );
lambda_x = param_x;
lambda_y = param_y;
}
kfract'Lambda::calcPoint() (./kdegraphics/kfract/lambda.C:55)
int Lambda::calcPoint( int x, int y )
{
double r = x_values[x], i = y_values[y];
double r_out = r, i_out = i;
double tmp, r2 = r * r, i2 = i * i;
register int iter = 0;
while ( ( r2 + i2 < bail ) && ( iter < max_iter ) )
{
tmp = 2.0 * r_out * i_out + julia_x;
// This is sort of sneaky because we actually compare the values of the
// last iteration to bailout. But the results are very close to those of
// the correct way and it's significantly faster.
r_out = ( r2 = r_out * r_out ) - ( i2 = i_out * i_out ) + julia_y;
i_out = tmp;
iter++;
}
return iter;
}
kfract'Lambda::defaultCenterX() (./kdegraphics/kfract/lambda.C:76)
double Lambda::defaultCenterX()
{
return DEFAULT_X;
}
kfract'Lambda::defaultCenterY() (./kdegraphics/kfract/lambda.C:82)
double Lambda::defaultCenterY()
{
return DEFAULT_Y;
}
kfract'Lambda::defaultWidth() (./kdegraphics/kfract/lambda.C:88)
double Lambda::defaultWidth()
{
return DEFAULT_WIDTH;
}
kfract'Lambda::defaultBailout() (./kdegraphics/kfract/lambda.C:94)
double Lambda::defaultBailout()
{
return DEFAULT_BAILOUT;
}