Avoid re-iterate out-of-order display items

Source/platform/graphics/ContiguousContainer.h

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef ContiguousContainer_h
 #define ContiguousContainer_h
 
 #include "platform/PlatformExport.h"
 #include "wtf/Alignment.h"
 #include "wtf/Compiler.h"
@@ skipping 72 matching lines @@
     // things. The whole random access iterator interface is a bit much.
     template <typename BaseIterator, typename ValueType>
     class IteratorWrapper : public std::iterator<ValueType, std::forward_iterator_tag> {
     public:
         IteratorWrapper() {}
         bool operator==(const IteratorWrapper& other) const { return m_it == other.m_it; }
         bool operator!=(const IteratorWrapper& other) const { return m_it != other.m_it; }
         ValueType& operator*() const { return *static_cast<ValueType*>(*m_it); }
         ValueType* operator->() const { return &operator*(); }
         IteratorWrapper operator+(std::ptrdiff_t n) const { return IteratorWrapper(m_it + n); }
-        IteratorWrapper operator++(int) const { IteratorWrapper tmp = *this; operator++(); return tmp; }
+        IteratorWrapper operator++(int) { IteratorWrapper tmp = *this; ++m_it; return tmp; }
         std::ptrdiff_t operator-(const IteratorWrapper& other) const { return m_it - other.m_it; }
         IteratorWrapper& operator++() { ++m_it; return *this; }
     private:
         explicit IteratorWrapper(const BaseIterator& it) : m_it(it) {}
         BaseIterator m_it;
         friend class ContiguousContainer;
     };
 
 public:
     using iterator = IteratorWrapper<Vector<void*>::iterator, BaseElementType>;
@@ skipping 83 matching lines @@
         ASSERT(alignedSize % alignment == 0);
         ASSERT(alignedSize >= size);
         ASSERT(alignedSize < size + alignment);
         return alignedSize;
     }
 };
 
 } // namespace blink
 
 #endif // ContiguousContainer_h