1/*
2 * Copyright (C) 2011 Google Inc. All rights reserved.
3 * Copyright (C) 2013 Igalia S.L. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met:
8 *
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
14 * distribution.
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.
18 *
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.
30 */
31
32#include "config.h"
33#include "OrderIterator.h"
34
35#include "RenderBox.h"
36
37namespace WebCore {
38
39OrderIterator::OrderIterator(RenderBox& containerBox)
40 : m_containerBox(containerBox)
41{
42 reset();
43}
44
45RenderBox* OrderIterator::first()
46{
47 reset();
48 return next();
49}
50
51RenderBox* OrderIterator::next()
52{
53 do {
54 if (!m_currentChild) {
55 if (m_orderValuesIterator == m_orderValues.end())
56 return nullptr;
57
58 if (!m_isReset) {
59 ++m_orderValuesIterator;
60 if (m_orderValuesIterator == m_orderValues.end())
61 return nullptr;
62 } else
63 m_isReset = false;
64 m_currentChild = m_containerBox.firstChildBox();
65 } else {
66 m_currentChild = m_currentChild->nextSiblingBox();
67 }
68 } while (!m_currentChild || m_currentChild->style().order() != *m_orderValuesIterator);
69
70 return m_currentChild;
71}
72
73void OrderIterator::reset()
74{
75 m_currentChild = nullptr;
76 m_orderValuesIterator = m_orderValues.begin();
77 m_isReset = true;
78}
79
80bool OrderIterator::shouldSkipChild(const RenderObject& child) const
81{
82 return child.isOutOfFlowPositioned() || child.isExcludedFromNormalLayout();
83}
84
85OrderIteratorPopulator::~OrderIteratorPopulator()
86{
87 m_iterator.reset();
88}
89
90bool OrderIteratorPopulator::collectChild(const RenderBox& child)
91{
92 m_iterator.m_orderValues.insert(child.style().order());
93 return !m_iterator.shouldSkipChild(child);
94}
95
96
97} // namespace WebCore
98