Move when swapping, if possible.

src/core/SkTSort.h

Index: src/core/SkTSort.h
diff --git a/src/core/SkTSort.h b/src/core/SkTSort.h
index 7101bab9bab58aa7d4ab592464b1f3fb2bed57fe..893af8703a9d30a23d4126621cbad7c4ff8561a1 100644
--- a/src/core/SkTSort.h
+++ b/src/core/SkTSort.h
@@ -119,13 +119,13 @@ template <typename T> void SkTHeapSort(T array[], size_t count) {
 /** 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);
     }
 }