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
|
/*
* Copyright (C) 2011 Google Inc. 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.
*/
#ifndef OrderIterator_h
#define OrderIterator_h
#include "wtf/Allocator.h"
#include "wtf/Noncopyable.h"
#include <set>
namespace blink {
class LayoutBox;
class OrderIterator {
DISALLOW_NEW();
WTF_MAKE_NONCOPYABLE(OrderIterator);
public:
friend class OrderIteratorPopulator;
OrderIterator(const LayoutBox*);
LayoutBox* currentChild() { return m_currentChild; }
const LayoutBox* currentChild() const { return m_currentChild; }
LayoutBox* first();
const LayoutBox* first() const {
return const_cast<OrderIterator*>(this)->first();
}
LayoutBox* next();
const LayoutBox* next() const {
return const_cast<OrderIterator*>(this)->next();
}
void reset();
private:
const LayoutBox* m_containerBox;
LayoutBox* m_currentChild;
typedef std::set<int> OrderValues;
OrderValues m_orderValues;
OrderValues::const_iterator m_orderValuesIterator;
bool m_isReset;
};
class OrderIteratorPopulator {
STACK_ALLOCATED();
public:
explicit OrderIteratorPopulator(OrderIterator& iterator)
: m_iterator(iterator) {
m_iterator.m_orderValues.clear();
}
~OrderIteratorPopulator();
void collectChild(const LayoutBox*);
private:
OrderIterator& m_iterator;
};
} // namespace blink
#endif // OrderIterator_h
|
