2 * Copyright (C) 2011 Google Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
8 * * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
14 * * Neither the name of Google Inc. nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 #include "core/layout/OrderIterator.h"
34 #include "core/layout/LayoutBox.h"
38 OrderIterator::OrderIterator(const LayoutBox
* containerBox
)
39 : m_containerBox(containerBox
)
40 , m_currentChild(nullptr)
45 LayoutBox
* OrderIterator::first()
51 LayoutBox
* OrderIterator::next()
54 if (!m_currentChild
) {
55 if (m_orderValuesIterator
== m_orderValues
.end())
59 ++m_orderValuesIterator
;
60 if (m_orderValuesIterator
== m_orderValues
.end())
66 m_currentChild
= m_containerBox
->firstChildBox();
68 m_currentChild
= m_currentChild
->nextSiblingBox();
70 } while (!m_currentChild
|| m_currentChild
->style()->order() != *m_orderValuesIterator
);
72 return m_currentChild
;
75 void OrderIterator::reset()
77 m_currentChild
= nullptr;
78 m_orderValuesIterator
= m_orderValues
.begin();
82 OrderIteratorPopulator::~OrderIteratorPopulator()
87 void OrderIteratorPopulator::collectChild(const LayoutBox
* child
)
89 m_iterator
.m_orderValues
.insert(child
->style()->order());