WTF: Add support for std::initializer_list in Vector.

third_party/WebKit/Source/wtf/Vector.h

 /*
  *  Copyright (C) 2005, 2006, 2007, 2008 Apple Inc. All rights reserved.
  *
  *  This library is free software; you can redistribute it and/or
  *  modify it under the terms of the GNU Library General Public
  *  License as published by the Free Software Foundation; either
  *  version 2 of the License, or (at your option) any later version.
  *
  *  This library is distributed in the hope that it will be useful,
  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ skipping 12 matching lines @@
 
 #include "wtf/Alignment.h"
 #include "wtf/ConditionalDestructor.h"
 #include "wtf/ContainerAnnotations.h"
 #include "wtf/Noncopyable.h"
 #include "wtf/NotFound.h"
 #include "wtf/StdLibExtras.h"
 #include "wtf/VectorTraits.h"
 #include "wtf/allocator/PartitionAllocator.h"
 #include <algorithm>
+#include <initializer_list>
 #include <iterator>
 #include <string.h>
 #include <utility>
 
 // For ASAN builds, disable inline buffers completely as they cause various issues.
 #ifdef ANNOTATE_CONTIGUOUS_CONTAINER
 #define INLINE_CAPACITY 0
 #else
 #define INLINE_CAPACITY inlineCapacity
 #endif
@@ skipping 781 matching lines @@
     template <size_t otherCapacity>
     explicit Vector(const Vector<T, otherCapacity, Allocator>&);
 
     Vector& operator=(const Vector&);
     template <size_t otherCapacity>
     Vector& operator=(const Vector<T, otherCapacity, Allocator>&);
 
     Vector(Vector&&);
     Vector& operator=(Vector&&);
 
+    Vector(std::initializer_list<T> elements);
+    Vector& operator=(std::initializer_list<T> elements);
+
     size_t size() const { return m_size; }
     size_t capacity() const { return Base::capacity(); }
     bool isEmpty() const { return !size(); }
 
     T& at(size_t i)
     {
         RELEASE_ASSERT(i < size());
         return Base::buffer()[i];
     }
     const T& at(size_t i) const
@@ skipping 199 matching lines @@
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 Vector<T, inlineCapacity, Allocator>& Vector<T, inlineCapacity, Allocator>::operator=(Vector<T, inlineCapacity, Allocator>&& other)
 {
     swap(other);
     return *this;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
+Vector<T, inlineCapacity, Allocator>::Vector(std::initializer_list<T> elements)
+    : Base(elements.size())
+{
+    ANNOTATE_NEW_BUFFER(begin(), capacity(), elements.size());
+    m_size = elements.size();
+    TypeOperations::uninitializedCopy(elements.begin(), elements.end(), begin());
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+Vector<T, inlineCapacity, Allocator>& Vector<T, inlineCapacity, Allocator>::operator=(std::initializer_list<T> elements)
+{
+    if (size() > elements.size()) {
+        shrink(elements.size());
+    } else if (elements.size() > capacity()) {
+        clear();
+        reserveCapacity(elements.size());
+        DCHECK(begin());
+    }
+
+    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, elements.size());
+    std::copy(elements.begin(), elements.begin() + m_size, begin());
+    TypeOperations::uninitializedCopy(elements.begin() + m_size, elements.end(), end());
+    m_size = elements.size();
+
+    return *this;
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
 bool Vector<T, inlineCapacity, Allocator>::contains(const U& value) const
 {
     return find(value) != kNotFound;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
 size_t Vector<T, inlineCapacity, Allocator>::find(const U& value) const
 {
@@ skipping 433 matching lines @@
             Allocator::template trace<VisitorDispatcher, T, VectorTraits<T>>(visitor, *const_cast<T*>(bufferEntry));
         checkUnusedSlots(buffer() + size(), buffer() + capacity());
     }
 }
 
 } // namespace WTF
 
 using WTF::Vector;
 
 #endif // WTF_Vector_h