Move when swapping, if possible.

src/core/SkTSort.h

 /*
  * Copyright 2006 The Android Open Source Project
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 
 #ifndef SkTSort_DEFINED
 #define SkTSort_DEFINED
@@ skipping 101 matching lines @@
 /** Sorts the array of size count using comparator '<' using a Heap Sort algorithm. */
 template <typename T> void SkTHeapSort(T array[], size_t count) {
     SkTHeapSort(array, count, SkTCompareLT<T>());
 }
 
 ///////////////////////////////////////////////////////////////////////////////
 
 /** Sorts the array of size count using comparator lessThan using an Insertion Sort algorithm. */
 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) {
     for (T* next = left + 1; next <= right; ++next) {
-        T insert = *next;
+        T insert = std::move(*next);
         T* hole = next;
         while (left < hole && lessThan(insert, *(hole - 1))) {
-            *hole = *(hole - 1);
+            *hole = std::move(*(hole - 1));
             --hole;
         }
-        *hole = insert;
+        *hole = std::move(insert);
     }
 }
 
 ///////////////////////////////////////////////////////////////////////////////
 
 template <typename T, typename C>
 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) {
     T pivotValue = *pivot;
     SkTSwap(*pivot, *right);
     T* newPivot = left;
@@ skipping 61 matching lines @@
 template <typename T> void SkTQSort(T* left, T* right) {
     SkTQSort(left, right, SkTCompareLT<T>());
 }
 
 /** Sorts the region from left to right using comparator '* < *' using a Quick Sort algorithm. */
 template <typename T> void SkTQSort(T** left, T** right) {
     SkTQSort(left, right, SkTPointerCompareLT<T>());
 }
 
 #endif