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 | #pragma once |
33 | |
34 | #include <wtf/StdSet.h> |
35 | |
36 | namespace WebCore { |
37 | |
38 | class RenderBox; |
39 | class RenderObject; |
40 | |
41 | class OrderIterator { |
42 | public: |
43 | friend class OrderIteratorPopulator; |
44 | |
45 | explicit OrderIterator(RenderBox&); |
46 | |
47 | RenderBox* currentChild() const { return m_currentChild; } |
48 | RenderBox* first(); |
49 | RenderBox* next(); |
50 | |
51 | bool shouldSkipChild(const RenderObject&) const; |
52 | |
53 | private: |
54 | void reset(); |
55 | |
56 | RenderBox& m_containerBox; |
57 | RenderBox* m_currentChild; |
58 | |
59 | using OrderValues = StdSet<int>; |
60 | OrderValues m_orderValues; |
61 | OrderValues::const_iterator m_orderValuesIterator; |
62 | bool m_isReset { false }; |
63 | }; |
64 | |
65 | class OrderIteratorPopulator { |
66 | public: |
67 | explicit OrderIteratorPopulator(OrderIterator& iterator) |
68 | : m_iterator(iterator) |
69 | { |
70 | m_iterator.m_orderValues.clear(); |
71 | } |
72 | ~OrderIteratorPopulator(); |
73 | |
74 | bool collectChild(const RenderBox&); |
75 | |
76 | private: |
77 | OrderIterator& m_iterator; |
78 | }; |
79 | |
80 | } // namespace WebCore |
81 | |