Sort GL extension strings and search to find.

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"
 
+#include "SkTSearch.h"
+#include "SkTSort.h"
+
+namespace {
+inline int extension_compare(const SkString* a, const SkString* b) {
+    return strcmp(a->c_str(), b->c_str());
+}
+}
+
 bool GrGLExtensions::init(GrGLBinding binding,
                           GrGLGetStringProc getString,
                           GrGLGetStringiProc getStringi,
                           GrGLGetIntegervProc getIntegerv) {
     fStrings.reset();
     if (NULL == getString) {
         return false;
     }
     bool indexed = false;
     if (kDesktop_GrGLBinding == binding) {
@@ skipping 35 matching lines @@
             GrAssert(i < extensionCnt);
             fStrings[i].set(extensions, length);
             ++i;
             if ('\0' == extensions[length]) {
                 break;
             }
             extensions += length + 1;
         }
         GrAssert(i == extensionCnt);
     }
+    SkTSearchCompareLTFunctor<SkString, extension_compare> cmp;
+    SkTQSort(&fStrings.front(), &fStrings.back(), cmp);
     return true;
 }
 
 bool GrGLExtensions::has(const char* ext) const {
-    // TODO: Sort the extensions and binary search.
-    int count = fStrings.count();
-    for (int i = 0; i < count; ++i) {
-        if (fStrings[i].equals(ext)) {
-            return true;
-        }
-    }
-    return false;
+    SkString extensionStr(ext);
+    int idx = SkTSearch<SkString, extension_compare>(&fStrings.front(),
+                                                     fStrings.count(),
+                                                     extensionStr,
+                                                     sizeof(SkString));
+    return idx >= 0;
 }