2 * Copyright (C) 2011 Google Inc. All rights reserved.
3 * Copyright (C) 2013 Igalia S.L. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
9 * * Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * * Redistributions in binary form must reproduce the above
12 * copyright notice, this list of conditions and the following disclaimer
13 * in the documentation and/or other materials provided with the
15 * * Neither the name of Google Inc. nor the names of its
16 * contributors may be used to endorse or promote products derived from
17 * this software without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 #include "OrderIterator.h"
35 #include "RenderBox.h"
39 static const int cInvalidIndex = -1;
41 OrderIterator::OrderIterator(RenderBox& containerBox)
42 : m_containerBox(containerBox)
47 RenderBox* OrderIterator::first()
53 RenderBox* OrderIterator::next()
55 int endIndex = m_orderValues.size();
58 m_currentChild = m_currentChild->nextSiblingBox();
62 if (m_orderIndex == endIndex)
65 if (m_orderIndex != cInvalidIndex) {
67 if (m_orderIndex == endIndex)
72 m_currentChild = m_containerBox.firstChildBox();
73 } while (!m_currentChild || m_currentChild->style().order() != m_orderValues[m_orderIndex]);
75 return m_currentChild;
78 void OrderIterator::reset()
80 m_currentChild = nullptr;
81 m_orderIndex = cInvalidIndex;
84 OrderIteratorPopulator::OrderIteratorPopulator(OrderIterator& iterator)
85 : m_iterator(iterator)
87 // Note that we don't release the memory here, we only invalidate the size
88 // This avoids unneeded reallocation if the size ends up not changing.
89 m_iterator.m_orderValues.shrink(0);
92 OrderIteratorPopulator::~OrderIteratorPopulator()
96 if (m_iterator.m_orderValues.size() > 1)
97 removeDuplicatedOrderValues();
100 void OrderIteratorPopulator::removeDuplicatedOrderValues()
102 auto& orderValues = m_iterator.m_orderValues;
104 std::sort(orderValues.begin(), orderValues.end());
105 auto nextElement = std::unique(orderValues.begin(), orderValues.end());
106 orderValues.shrinkCapacity(nextElement - orderValues.begin());
109 void OrderIteratorPopulator::collectChild(const RenderBox& child)
111 m_iterator.m_orderValues.append(child.style().order());
115 } // namespace WebCore