detach -> release

src/gpu/gl/GrGLExtensions.cpp

 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "gl/GrGLExtensions.h"
 #include "gl/GrGLDefines.h"
 #include "gl/GrGLUtil.h"
@@ skipping 107 matching lines @@
     SkASSERT(fInitialized);
     return find_string(*fStrings, ext) >= 0;
 }
 
 bool GrGLExtensions::remove(const char ext[]) {
     SkASSERT(fInitialized);
     int idx = find_string(*fStrings, ext);
     if (idx >= 0) {
         // This is not terribly effecient but we really only expect this function to be called at
         // most a handful of times when our test programs start.
-        SkAutoTDelete< SkTArray<SkString> > oldStrings(fStrings.detach());
+        SkAutoTDelete< SkTArray<SkString> > oldStrings(fStrings.release());
         fStrings.reset(new SkTArray<SkString>(oldStrings->count() - 1));
         fStrings->push_back_n(idx, &oldStrings->front());
         fStrings->push_back_n(oldStrings->count() - idx - 1, &(*oldStrings)[idx] + 1);
         return true;
     } else {
         return false;
     }
 }
 
 void GrGLExtensions::add(const char ext[]) {
     int idx = find_string(*fStrings, ext);
     if (idx < 0) {
         // This is not the most effecient approach since we end up doing a full sort of the
         // extensions after the add
         fStrings->push_back().set(ext);
         SkTLessFunctionToFunctorAdaptor<SkString, extension_compare> cmp;
         SkTQSort(&fStrings->front(), &fStrings->back(), cmp);
     }
 }
 
 void GrGLExtensions::print(const char* sep) const {
     if (nullptr == sep) {
         sep = " ";
     }
     int cnt = fStrings->count();
     for (int i = 0; i < cnt; ++i) {
         SkDebugf("%s%s", (*fStrings)[i].c_str(), (i < cnt - 1) ? sep : "");
     }
 }