From d1b6b7be7d5bc7754a143b424295a267bbdafdbd Mon Sep 17 00:00:00 2001
From: Timothy Pearson <kb9vqf@pearsoncomputing.net>
Date: Sun, 22 Dec 2013 03:17:30 -0600
Subject: Repair performance regression accidentally introduced with new style
 API

---
 src/tools/qvaluelist.h | 15 +++++++++++++++
 1 file changed, 15 insertions(+)

(limited to 'src/tools/qvaluelist.h')

diff --git a/src/tools/qvaluelist.h b/src/tools/qvaluelist.h
index 95dc7ff..b082097 100644
--- a/src/tools/qvaluelist.h
+++ b/src/tools/qvaluelist.h
@@ -250,6 +250,7 @@ public:
     NodePtr find( NodePtr start, const T& x ) const;
     int findIndex( NodePtr start, const T& x ) const;
     uint contains( const T& x ) const;
+    bool containsYesNo( const T& x ) const;
     uint remove( const T& x );
     NodePtr at( size_type i ) const;
     void clear();
@@ -354,6 +355,19 @@ Q_INLINE_TEMPLATES uint QValueListPrivate<T>::contains( const T& x ) const
     return result;
 }
 
+template <class T>
+Q_INLINE_TEMPLATES bool QValueListPrivate<T>::containsYesNo( const T& x ) const
+{
+    Iterator first = Iterator( node->next );
+    Iterator last = Iterator( node );
+    while( first != last) {
+	if ( *first == x )
+	    return true;
+	++first;
+    }
+    return false;
+}
+
 template <class T>
 Q_INLINE_TEMPLATES uint QValueListPrivate<T>::remove( const T& _x )
 {
@@ -547,6 +561,7 @@ public:
     const_iterator find ( const_iterator it, const T& x ) const { return const_iterator( sh->find( it.node, x ) ); }
     int findIndex( const T& x ) const { return sh->findIndex( sh->node->next, x) ; }
     size_type contains( const T& x ) const { return sh->contains( x ); }
+    bool containsYesNo( const T& x ) const { return sh->containsYesNo( x ); }
 
     size_type count() const { return sh->nodes; }
 
-- 
cgit v1.2.3