IndexedDB: Replace O(n^2) algorithm computing multientry index keys

third_party/WebKit/Source/modules/indexeddb/IDBKey.h

 /*
  * Copyright (C) 2011 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1.  Redistributions of source code must retain the above copyright
  *     notice, this list of conditions and the following disclaimer.
  * 2.  Redistributions in binary form must reproduce the above copyright
@@ skipping 14 matching lines @@
 
 #ifndef IDBKey_h
 #define IDBKey_h
 
 #include "modules/ModulesExport.h"
 #include "platform/SharedBuffer.h"
 #include "platform/heap/Handle.h"
 #include "wtf/Forward.h"
 #include "wtf/Vector.h"
 #include "wtf/text/WTFString.h"
+#include <utility>
 
 namespace blink {
 
 class MODULES_EXPORT IDBKey : public GarbageCollectedFinalized<IDBKey> {
  public:
   typedef HeapVector<Member<IDBKey>> KeyArray;
 
   static IDBKey* createInvalid() { return new IDBKey(); }
 
   static IDBKey* createNumber(double number) {
     return new IDBKey(NumberType, number);
   }
 
   static IDBKey* createBinary(PassRefPtr<SharedBuffer> binary) {
     return new IDBKey(std::move(binary));
   }
 
   static IDBKey* createString(const String& string) {
     return new IDBKey(string);
   }
 
   static IDBKey* createDate(double date) { return new IDBKey(DateType, date); }
 
-  static IDBKey* createMultiEntryArray(const KeyArray& array) {
-    KeyArray result;
-
-    for (size_t i = 0; i < array.size(); i++) {
-      if (!array[i]->isValid())
-        continue;
-
-      bool skip = false;
-      for (size_t j = 0; j < result.size(); j++) {
-        if (array[i]->isEqual(result[j].get())) {
-          skip = true;
-          break;
-        }
-      }
-      if (!skip) {
-        result.push_back(array[i]);
-      }
-    }
-    IDBKey* idbKey = new IDBKey(result);
-    ASSERT(idbKey->isValid());
-    return idbKey;
-  }
+  static IDBKey* createMultiEntryArray(const KeyArray&);
 
   static IDBKey* createArray(const KeyArray& array) {
     return new IDBKey(array);
   }
 
   ~IDBKey();
   DECLARE_TRACE();
 
   // In order of the least to the highest precedent in terms of sort order.
   enum Type {
@@ skipping 39 matching lines @@
   bool isEqual(const IDBKey* other) const;
 
  private:
   IDBKey() : m_type(InvalidType) {}
   IDBKey(Type type, double number) : m_type(type), m_number(number) {}
   explicit IDBKey(const String& value) : m_type(StringType), m_string(value) {}
   explicit IDBKey(PassRefPtr<SharedBuffer> value)
       : m_type(BinaryType), m_binary(value) {}
   explicit IDBKey(const KeyArray& keyArray)
       : m_type(ArrayType), m_array(keyArray) {}
+  explicit IDBKey(KeyArray&& keyArray)
+      : m_type(ArrayType), m_array(std::move(keyArray)) {}
 
   const Type m_type;
   const KeyArray m_array;
   RefPtr<SharedBuffer> m_binary;
   const String m_string;
   const double m_number = 0;
 };
 
 }  // namespace blink
 
 #endif  // IDBKey_h