private sync tizen_2.2 2.2.1_release 2.2_release submit/tizen_2.2/20130814.085807 submit/tizen_2.2/20130814.101603
authorSungyeon Woo <s.woo@samsung.com>
Wed, 7 Aug 2013 05:56:08 +0000 (14:56 +0900)
committerSungyeon Woo <s.woo@samsung.com>
Wed, 7 Aug 2013 05:58:47 +0000 (14:58 +0900)
Change-Id: Ia099b0cac19680298c8d0a243c16f3c234be9c11
Signed-off-by: Sungyeon Woo <s.woo@samsung.com>
aapl/avlcommon.h
aapl/bstcommon.h
aapl/bubblesort.h
aapl/mergesort.h
packaging/ragel.spec

index 2cee80c..06983bc 100644 (file)
@@ -881,9 +881,9 @@ template <AVLMEL_TEMPDEF> Element *AvlTree<AVLMEL_TEMPUSE>::
                }
 
 #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
 
@@ -920,7 +920,7 @@ template <AVLMEL_TEMPDEF> Element *AvlTree<AVLMEL_TEMPUSE>::
        long keyRelation;
 
        while (curEl) {
-               keyRelation = this->compare( *element, *curEl );
+               keyRelation = compare( *element, *curEl );
 
                /* Do we go left? */
                if ( keyRelation < 0 )
@@ -969,7 +969,7 @@ template <AVLMEL_TEMPDEF> Element *AvlTree<AVLMEL_TEMPUSE>::
                        return element;
                }
 
-               keyRelation = this->compare( key, curEl->BASEKEY(getKey()) );
+               keyRelation = compare( key, curEl->BASEKEY(getKey()) );
 
                /* Do we go left? */
                if ( keyRelation < 0 ) {
@@ -1023,7 +1023,7 @@ template <AVLMEL_TEMPDEF> Element *AvlTree<AVLMEL_TEMPUSE>::
                        return element;
                }
 
-               keyRelation = this->compare(key, curEl->getKey());
+               keyRelation = compare(key, curEl->getKey());
 
                /* Do we go left? */
                if ( keyRelation < 0 ) {
@@ -1058,7 +1058,7 @@ template <AVLMEL_TEMPDEF> Element *AvlTree<AVLMEL_TEMPUSE>::
        long keyRelation;
 
        while (curEl) {
-               keyRelation = this->compare( key, curEl->BASEKEY(getKey()) );
+               keyRelation = compare( key, curEl->BASEKEY(getKey()) );
 
                /* Do we go left? */
                if ( keyRelation < 0 )
index 7c53ff3..888717f 100644 (file)
@@ -361,7 +361,7 @@ template <BST_TEMPL_DEF> bool BstTable<BST_TEMPL_USE>::
                }
 
                mid = lower + ((upper-lower)>>1);
-               keyRelation = this->compare(key, GET_KEY(*mid));
+               keyRelation = compare(key, GET_KEY(*mid));
 
                if ( keyRelation < 0 )
                        upper = mid - 1;
@@ -373,12 +373,12 @@ template <BST_TEMPL_DEF> bool BstTable<BST_TEMPL_USE>::
 
                        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;
@@ -419,7 +419,7 @@ template <BST_TEMPL_DEF> Element *BstTable<BST_TEMPL_USE>::
                }
 
                mid = lower + ((upper-lower)>>1);
-               keyRelation = this->compare(key, GET_KEY(*mid));
+               keyRelation = compare(key, GET_KEY(*mid));
 
                if ( keyRelation < 0 )
                        upper = mid - 1;
@@ -457,7 +457,7 @@ template <BST_TEMPL_DEF> Element *BstTable<BST_TEMPL_USE>::
                }
 
                mid = lower + ((upper-lower)>>1);
-               keyRelation = this->compare(key, GET_KEY(*mid));
+               keyRelation = compare(key, GET_KEY(*mid));
 
                if ( keyRelation < 0 )
                        upper = mid - 1;
@@ -508,7 +508,7 @@ template <BST_TEMPL_DEF> Element *BstTable<BST_TEMPL_USE>::
                }
 
                mid = lower + ((upper-lower)>>1);
-               keyRelation = this->compare(key, GET_KEY(*mid));
+               keyRelation = compare(key, GET_KEY(*mid));
 
                if ( keyRelation < 0 )
                        upper = mid - 1;
@@ -603,7 +603,7 @@ template <BST_TEMPL_DEF> Element *BstTable<BST_TEMPL_USE>::
                }
 
                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;
@@ -662,7 +662,7 @@ template <BST_TEMPL_DEF> Element *BstTable<BST_TEMPL_USE>::
                }
 
                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;
index f0f4ce5..bcc2fb6 100644 (file)
@@ -72,7 +72,7 @@ template <class T, class Compare> void BubbleSort<T,Compare>::
                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. */
index 8cefa73..68b8426 100644 (file)
@@ -110,7 +110,7 @@ template< class T, class Compare> void MergeSort<T,Compare>::
                }
                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) );
index e26aef4..d4aea86 100644 (file)
@@ -1,12 +1,13 @@
 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++,