Option Groups with display: none should not show the children option elements

public/platform/WebVector.h

 /*
  * Copyright (C) 2009 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 134 matching lines @@
 
     T* data() { return m_ptr; }
     const T* data() const { return m_ptr; }
 
     void swap(WebVector<T>& other)
     {
         std::swap(m_ptr, other.m_ptr);
         std::swap(m_size, other.m_size);
     }
 
+    void shrink(size_t size)

[tkent, 2014/08/06 12:46:07]

Why is this necessary?
WebVector has no rich operations intentionally. We should not add this.

[spartha, 2014/08/06 13:31:09]

The function pre-allocates the vector for efficiency. This worked fine earlier
as the size was fixed. Now with this patch, the final size can change and we
have to resize the vector for the patch to work. I wanted to avoid looping
through the list again to make a copy, hence added the method. If the goal is to
keep WebVector simple, then I can check for alternative approach. Please let me
know your opinion.

+    {
+        BLINK_ASSERT(size <= m_size);
+        for (size_t index = m_size - 1; index >= size; --index)
+            m_ptr[index].~T();
+        m_size = size;
+    }
+
 private:
     void initialize(size_t size)
     {
         validateSize(size);
         m_size = size;
         if (!m_size)
             m_ptr = 0;
         else {
             m_ptr = static_cast<T*>(::operator new(sizeof(T) * m_size));
             for (size_t i = 0; i < m_size; ++i)
@@ skipping 28 matching lines @@
         ::operator delete(m_ptr);
     }
 
     T* m_ptr;
     size_t m_size;
 };
 
 } // namespace blink
 
 #endif