asd

container/sortedvector.cpp

@@ -31,7 +31,7 @@ int SortedVector<T>::insertSort( const QSharedPointer<T> &pointer )
         this->append( pointer );
         row = 0;
     } else {
-        auto elementSmallerThanNew = std::lower_bound( this->begin(), this->end(), pointer, []( const auto & first, const auto & second )->bool{
+        auto elementSmallerThanNew = std::lower_bound( this->begin(), this->end(), pointer, []( const QSharedPointer<T> &first, const QSharedPointer<T> &second )->bool{
             return ( *first ) > ( *second );
         } );
 
@@ -46,7 +46,7 @@ template<typename T>
 int SortedVector<T>::findInsertPosition( const QSharedPointer<T> &pointer ) const
 {
     int row = -1;
-    auto elementSmallerThanNew = std::lower_bound( this->begin(), this->end(), pointer, []( const auto & first, const auto & second )->bool{
+    auto elementSmallerThanNew = std::lower_bound( this->begin(), this->end(), pointer, []( const QSharedPointer<T> &first, const QSharedPointer<T> &second )->bool{
         return ( *first ) > ( *second );
     } );
 
@@ -65,7 +65,7 @@ int SortedVector<T>::findPosition( const QSharedPointer<T> &pointer ) const
 template<typename T>
 void SortedVector<T>::reOrder()
 {
-    std::sort( this->begin(), this->end(), [ = ]( const auto & first, const auto & second )->bool{
+    std::sort( this->begin(), this->end(), [ = ]( const QSharedPointer<T> &first, const QSharedPointer<T> &second )->bool{
         return ( *first ) > ( *second );
     } );
 }