1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
/*
* Copyright (C) 2011 Google Inc. All rights reserved.
* Copyright (C) 2013 Igalia S.L. 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
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "OrderIterator.h"
#include "RenderBox.h"
#include "RenderStyleInlines.h"
namespace WebCore {
OrderIterator::OrderIterator(RenderBox& containerBox)
: m_containerBox(containerBox)
{
reset();
}
RenderBox* OrderIterator::first()
{
reset();
return next();
}
RenderBox* OrderIterator::next()
{
do {
if (!m_currentChild) {
if (m_orderValuesIterator == m_orderValues.end())
return nullptr;
if (!m_isReset) {
++m_orderValuesIterator;
if (m_orderValuesIterator == m_orderValues.end())
return nullptr;
} else
m_isReset = false;
m_currentChild = m_reversedOrder ? m_containerBox.lastChildBox() : m_containerBox.firstChildBox();
} else {
m_currentChild = m_reversedOrder ? m_currentChild->previousSiblingBox() : m_currentChild->nextSiblingBox();
}
} while (!m_currentChild || m_currentChild->style().order() != *m_orderValuesIterator);
return m_currentChild;
}
void OrderIterator::reset()
{
m_currentChild = nullptr;
m_orderValuesIterator = m_orderValues.begin();
m_isReset = true;
}
bool OrderIterator::shouldSkipChild(const RenderObject& child) const
{
return child.isOutOfFlowPositioned() || child.isExcludedFromNormalLayout();
}
OrderIterator OrderIterator::reverse()
{
OrderIterator reversedItr(*this);
OrderValues reversedValues;
for (auto valuesItr = m_orderValues.rbegin(); valuesItr != m_orderValues.rend(); valuesItr++)
reversedValues.insert(*valuesItr);
reversedItr.m_orderValues = reversedValues;
reversedItr.m_reversedOrder = !m_reversedOrder;
reversedItr.reset();
return reversedItr;
}
OrderIteratorPopulator::~OrderIteratorPopulator()
{
m_iterator.reset();
}
bool OrderIteratorPopulator::collectChild(const RenderBox& child)
{
m_iterator.m_orderValues.insert(child.style().order());
return !m_iterator.shouldSkipChild(child);
}
} // namespace WebCore
|
