OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 10 matching lines...) Expand all Loading... |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #ifndef RenderLayerStackingNodeIterator_h | 31 #ifndef LayerStackingNodeIterator_h |
32 #define RenderLayerStackingNodeIterator_h | 32 #define LayerStackingNodeIterator_h |
33 | 33 |
34 #include "wtf/Noncopyable.h" | 34 #include "wtf/Noncopyable.h" |
35 | 35 |
36 namespace blink { | 36 namespace blink { |
37 | 37 |
38 enum ChildrenIteration { | 38 enum ChildrenIteration { |
39 NegativeZOrderChildren = 1, | 39 NegativeZOrderChildren = 1, |
40 NormalFlowChildren = 1 << 1, | 40 NormalFlowChildren = 1 << 1, |
41 PositiveZOrderChildren = 1 << 2, | 41 PositiveZOrderChildren = 1 << 2, |
42 AllChildren = NegativeZOrderChildren | NormalFlowChildren | PositiveZOrderCh
ildren | 42 AllChildren = NegativeZOrderChildren | NormalFlowChildren | PositiveZOrderCh
ildren |
43 }; | 43 }; |
44 | 44 |
45 class RenderLayerStackingNode; | 45 class LayerStackingNode; |
46 | 46 |
47 // This iterator walks the RenderLayerStackingNode lists in the following order: | 47 // This iterator walks the LayerStackingNode lists in the following order: |
48 // NegativeZOrderChildren -> NormalFlowChildren -> PositiveZOrderChildren. | 48 // NegativeZOrderChildren -> NormalFlowChildren -> PositiveZOrderChildren. |
49 class RenderLayerStackingNodeIterator { | 49 class LayerStackingNodeIterator { |
50 WTF_MAKE_NONCOPYABLE(RenderLayerStackingNodeIterator); | 50 WTF_MAKE_NONCOPYABLE(LayerStackingNodeIterator); |
51 public: | 51 public: |
52 RenderLayerStackingNodeIterator(const RenderLayerStackingNode& root, unsigne
d whichChildren) | 52 LayerStackingNodeIterator(const LayerStackingNode& root, unsigned whichChild
ren) |
53 : m_root(root) | 53 : m_root(root) |
54 , m_remainingChildren(whichChildren) | 54 , m_remainingChildren(whichChildren) |
55 , m_index(0) | 55 , m_index(0) |
56 { | 56 { |
57 } | 57 } |
58 | 58 |
59 RenderLayerStackingNode* next(); | 59 LayerStackingNode* next(); |
60 | 60 |
61 private: | 61 private: |
62 const RenderLayerStackingNode& m_root; | 62 const LayerStackingNode& m_root; |
63 unsigned m_remainingChildren; | 63 unsigned m_remainingChildren; |
64 unsigned m_index; | 64 unsigned m_index; |
65 }; | 65 }; |
66 | 66 |
67 // This iterator is similar to RenderLayerStackingNodeIterator but it walks the
lists in reverse order | 67 // This iterator is similar to LayerStackingNodeIterator but it walks the lists
in reverse order |
68 // (from the last item to the first one). | 68 // (from the last item to the first one). |
69 class RenderLayerStackingNodeReverseIterator { | 69 class LayerStackingNodeReverseIterator { |
70 WTF_MAKE_NONCOPYABLE(RenderLayerStackingNodeReverseIterator); | 70 WTF_MAKE_NONCOPYABLE(LayerStackingNodeReverseIterator); |
71 public: | 71 public: |
72 RenderLayerStackingNodeReverseIterator(const RenderLayerStackingNode& root,
unsigned whichChildren) | 72 LayerStackingNodeReverseIterator(const LayerStackingNode& root, unsigned whi
chChildren) |
73 : m_root(root) | 73 : m_root(root) |
74 , m_remainingChildren(whichChildren) | 74 , m_remainingChildren(whichChildren) |
75 { | 75 { |
76 setIndexToLastItem(); | 76 setIndexToLastItem(); |
77 } | 77 } |
78 | 78 |
79 RenderLayerStackingNode* next(); | 79 LayerStackingNode* next(); |
80 | 80 |
81 private: | 81 private: |
82 void setIndexToLastItem(); | 82 void setIndexToLastItem(); |
83 | 83 |
84 const RenderLayerStackingNode& m_root; | 84 const LayerStackingNode& m_root; |
85 unsigned m_remainingChildren; | 85 unsigned m_remainingChildren; |
86 int m_index; | 86 int m_index; |
87 }; | 87 }; |
88 | 88 |
89 } // namespace blink | 89 } // namespace blink |
90 | 90 |
91 #endif // RenderLayerStackingNodeIterator_h | 91 #endif // LayerStackingNodeIterator_h |
OLD | NEW |