}
#ifdef AVL_BASIC
- keyRelation = this->compare( *element, *curEl );
+ keyRelation = compare( *element, *curEl );
#else
- keyRelation = this->compare( element->BASEKEY(getKey()),
+ keyRelation = compare( element->BASEKEY(getKey()),
curEl->BASEKEY(getKey()) );
#endif
long keyRelation;
while (curEl) {
- keyRelation = this->compare( *element, *curEl );
+ keyRelation = compare( *element, *curEl );
/* Do we go left? */
if ( keyRelation < 0 )
return element;
}
- keyRelation = this->compare( key, curEl->BASEKEY(getKey()) );
+ keyRelation = compare( key, curEl->BASEKEY(getKey()) );
/* Do we go left? */
if ( keyRelation < 0 ) {
return element;
}
- keyRelation = this->compare(key, curEl->getKey());
+ keyRelation = compare(key, curEl->getKey());
/* Do we go left? */
if ( keyRelation < 0 ) {
long keyRelation;
while (curEl) {
- keyRelation = this->compare( key, curEl->BASEKEY(getKey()) );
+ keyRelation = compare( key, curEl->BASEKEY(getKey()) );
/* Do we go left? */
if ( keyRelation < 0 )
}
mid = lower + ((upper-lower)>>1);
- keyRelation = this->compare(key, GET_KEY(*mid));
+ keyRelation = compare(key, GET_KEY(*mid));
if ( keyRelation < 0 )
upper = mid - 1;
lower = mid - 1;
while ( lower != lowEnd &&
- this->compare(key, GET_KEY(*lower)) == 0 )
+ compare(key, GET_KEY(*lower)) == 0 )
lower--;
upper = mid + 1;
while ( upper != highEnd &&
- this->compare(key, GET_KEY(*upper)) == 0 )
+ compare(key, GET_KEY(*upper)) == 0 )
upper++;
low = (Element*)lower + 1;
}
mid = lower + ((upper-lower)>>1);
- keyRelation = this->compare(key, GET_KEY(*mid));
+ keyRelation = compare(key, GET_KEY(*mid));
if ( keyRelation < 0 )
upper = mid - 1;
}
mid = lower + ((upper-lower)>>1);
- keyRelation = this->compare(key, GET_KEY(*mid));
+ keyRelation = compare(key, GET_KEY(*mid));
if ( keyRelation < 0 )
upper = mid - 1;
}
mid = lower + ((upper-lower)>>1);
- keyRelation = this->compare(key, GET_KEY(*mid));
+ keyRelation = compare(key, GET_KEY(*mid));
if ( keyRelation < 0 )
upper = mid - 1;
}
mid = lower + ((upper-lower)>>1);
- keyRelation = this->compare(GET_KEY(el), GET_KEY(*mid));
+ keyRelation = compare(GET_KEY(el), GET_KEY(*mid));
if ( keyRelation < 0 )
upper = mid - 1;
}
mid = lower + ((upper-lower)>>1);
- keyRelation = this->compare(GET_KEY(el), GET_KEY(*mid));
+ keyRelation = compare(GET_KEY(el), GET_KEY(*mid));
if ( keyRelation < 0 )
upper = mid - 1;
changed = false;
for ( long i = 0; i < len-pass; i++ ) {
/* Do we swap pos with the next one? */
- if ( this->compare( data[i], data[i+1] ) > 0 ) {
+ if ( compare( data[i], data[i+1] ) > 0 ) {
char tmp[sizeof(T)];
/* Swap the two items. */
}
else {
/* Both upper and lower left. */
- if ( this->compare(*lower, *upper) <= 0 )
+ if ( compare(*lower, *upper) <= 0 )
memcpy( dest++, lower++, sizeof(T) );
else
memcpy( dest++, upper++, sizeof(T) );
Name: ragel
Summary: Ragel
-Version: 6.6
+Version: 6.7
Release: 1
Group: TO_BE/FILLED_IN
License: TO BE FILLED IN
Source0: %{name}-%{version}.tar.gz
Patch0: no-doc.patch
+
%description
compiles finite state machines into code in various languages
Ragel compiles finite state machines from regular languages into C, C++,