{\
if (
mIsUdf(v) ) return false;\
const bool ascendingvalonly = (ascvalonly); \
if ( dah_.
isEmpty() || dh >= dah_[dah_.size()-1] )\
if ( !dah_.isEmpty() && ascendingvalonly && v <= vals[dah_.size()-1] )\
return false;\
dah_ += dh; vals += val;\
}\
if ( dh < dah_[0] )\
if ( ascendingvalonly && v >= vals[0] )\
return false;\
dah_.insert( 0, dh ); vals.insert( 0, v );\
return true; \
}\
const
int insertidx =
indexOf( dh );\
if ( insertidx<0 ) return false;\
if ( ascendingvalonly && (v <= vals[insertidx] || v >= vals[insertidx+1]) )\
return false;\
dah_.insert( insertidx+1, dh ); vals.insert( insertidx+1, v );\
}
#define mIsUdf(val)
Use mIsUdf to check for undefinedness of simple types.
Definition: undefval.h:287
if(!noudf_ &&(mIsUdf(inpval)))
Definition: arrayndalgo.h:1662
ObjectSet< T >::size_type indexOf(const ObjectSet< T > &os, const S &val)
Locate object in set.
Definition: objectset.h:169
bool isEmpty(const NLAModel *mdl)