Replace uses of GrNoncopyable by SkNoncopyable.

src/gpu/GrRedBlackTree.h

-
 /*
  * Copyright 2011 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
-
 #ifndef GrRedBlackTree_DEFINED
 #define GrRedBlackTree_DEFINED
 
-#include "GrNoncopyable.h"
+#include "SkTypes.h"
 
 template <typename T>
 class GrLess {
 public:
     bool operator()(const T& a, const T& b) const { return a < b; }
 };
 
 template <typename T>
 class GrLess<T*> {
 public:
     bool operator()(const T* a, const T* b) const { return *a < *b; }
 };
 
 /**
  * In debug build this will cause full traversals of the tree when the validate
  * is called on insert and remove. Useful for debugging but very slow.
  */
 #define DEEP_VALIDATE 0
 
 /**
  * A sorted tree that uses the red-black tree algorithm. Allows duplicate
  * entries. Data is of type T and is compared using functor C. A single C object
  * will be created and used for all comparisons.
  */
 template <typename T, typename C = GrLess<T> >
-class GrRedBlackTree : public GrNoncopyable {
+class GrRedBlackTree : public SkNoncopyable {
 public:
     /**
      * Creates an empty tree.
      */
     GrRedBlackTree();
     virtual ~GrRedBlackTree();
 
     /**
      * Class used to iterater through the tree. The valid range of the tree
      * is given by [begin(), end()). It is legal to dereference begin() but not
@@ skipping 1058 matching lines @@
     // remove all entries
     while (!tree.empty()) {
         tree.remove(tree.begin());
     }
 
     // test reset on empty tree.
     tree.reset();
 }
 
 #endif