Dissertation-Endstand3 - KLUEDO - Universität Kaiserslautern

Anhang 83
return s;
}
// Positionsauswertung
bool getMinMaxPos(char direction, bool max, double& result) const
{
bool first = false;
for (int i=0; i < m_pos.size(); i++ ) {
if ( m_pos.at(i).valid ) {
if ( !first ) {
first = true;
if (direction == 'x') result = m_pos.at(i).x;
else result = m_pos.at(i).y;
}
else {
if (direction == 'x') {
if ( max == true && m_pos.at(i).x > result ) result = m_pos.at(i).x;
if ( max == false && m_pos.at(i).x < result ) result = m_pos.at(i).x;
}
else {
if ( max == true && m_pos.at(i).y > result ) result = m_pos.at(i).y;
if ( max == false && m_pos.at(i).y < result ) result = m_pos.at(i).y;
}
}
}
}
return first; // false = only invalids
}
bool getMaxXPos(double& result) const
{
return getMinMaxPos('x', true, result);
}
bool getMinXPos(double& result) const
{
return getMinMaxPos('x', false, result);
}
bool getMaxYPos(double& result) const
{
return getMinMaxPos('y', true, result);
}
bool getMinYPos(double& result) const
{
return getMinMaxPos('y', false, result);
}
bool getLimitPos(double& minx, double& miny, double& maxx, double &maxy) const
{
bool r1,r2,r3,r4;
r1 = getMaxXPos( maxx );
r2 = getMinXPos( minx );
r3 = getMaxYPos( maxy );
r4 = getMinYPos( miny );
return r1 && r2 && r3 && r4;
}
bool getFirstPos(double& x, double &y) const
{
bool valid = false;
for (int i=0; i < m_pos.size(); i++ ) {
if ( m_pos.at(i).valid ) {
valid = true;
x = m_pos.at(i).x;
y = m_pos.at(i).y;
break;
}
}
return valid; // false = only invalids
}
bool getLastPos(double& x, double &y) const
{
bool valid = false;
for (int i = m_pos.size()-1 ; i >= 0; i-- ) {
if ( m_pos.at(i).valid ) {
valid = true;
x = m_pos.at(i).x;
y = m_pos.at(i).y;