OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 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 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
11 * contributors may be used to endorse or promote products derived from | 11 * contributors may be used to endorse or promote products derived from |
12 * this software without specific prior written permission. | 12 * this software without specific prior written permission. |
13 * | 13 * |
14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
25 */ | 25 */ |
26 | 26 |
27 #ifndef UserActionElementSet_h | 27 #ifndef UserActionElementSet_h |
28 #define UserActionElementSet_h | 28 #define UserActionElementSet_h |
29 | 29 |
| 30 #include "platform/heap/Handle.h" |
30 #include "wtf/HashMap.h" | 31 #include "wtf/HashMap.h" |
31 #include "wtf/PassOwnPtr.h" | 32 #include "wtf/PassOwnPtr.h" |
32 #include "wtf/RefPtr.h" | 33 #include "wtf/RefPtr.h" |
33 | 34 |
34 namespace WebCore { | 35 namespace WebCore { |
35 | 36 |
36 class Node; | 37 class Node; |
37 class Element; | 38 class Element; |
38 | 39 |
39 class UserActionElementSet { | 40 class UserActionElementSet FINAL { |
| 41 DISALLOW_ALLOCATION(); |
40 public: | 42 public: |
41 static PassOwnPtr<UserActionElementSet> create() { return adoptPtr(new UserA
ctionElementSet()); } | |
42 | |
43 bool isFocused(const Node* node) { return hasFlags(node, IsFocusedFlag); } | 43 bool isFocused(const Node* node) { return hasFlags(node, IsFocusedFlag); } |
44 bool isActive(const Node* node) { return hasFlags(node, IsActiveFlag); } | 44 bool isActive(const Node* node) { return hasFlags(node, IsActiveFlag); } |
45 bool isInActiveChain(const Node* node) { return hasFlags(node, InActiveChain
Flag); } | 45 bool isInActiveChain(const Node* node) { return hasFlags(node, InActiveChain
Flag); } |
46 bool isHovered(const Node* node) { return hasFlags(node, IsHoveredFlag); } | 46 bool isHovered(const Node* node) { return hasFlags(node, IsHoveredFlag); } |
47 void setFocused(Node* node, bool enable) { setFlags(node, enable, IsFocusedF
lag); } | 47 void setFocused(Node* node, bool enable) { setFlags(node, enable, IsFocusedF
lag); } |
48 void setActive(Node* node, bool enable) { setFlags(node, enable, IsActiveFla
g); } | 48 void setActive(Node* node, bool enable) { setFlags(node, enable, IsActiveFla
g); } |
49 void setInActiveChain(Node* node, bool enable) { setFlags(node, enable, InAc
tiveChainFlag); } | 49 void setInActiveChain(Node* node, bool enable) { setFlags(node, enable, InAc
tiveChainFlag); } |
50 void setHovered(Node* node, bool enable) { setFlags(node, enable, IsHoveredF
lag); } | 50 void setHovered(Node* node, bool enable) { setFlags(node, enable, IsHoveredF
lag); } |
51 | 51 |
52 UserActionElementSet(); | 52 UserActionElementSet(); |
53 ~UserActionElementSet(); | 53 ~UserActionElementSet(); |
54 | 54 |
55 void didDetach(Node*); | 55 void didDetach(Node*); |
| 56 |
| 57 #if !ENABLE(OILPAN) |
56 void documentDidRemoveLastRef(); | 58 void documentDidRemoveLastRef(); |
| 59 #endif |
| 60 |
| 61 void trace(Visitor*); |
57 | 62 |
58 private: | 63 private: |
59 enum ElementFlags { | 64 enum ElementFlags { |
60 IsActiveFlag = 1 , | 65 IsActiveFlag = 1 , |
61 InActiveChainFlag = 1 << 1, | 66 InActiveChainFlag = 1 << 1, |
62 IsHoveredFlag = 1 << 2, | 67 IsHoveredFlag = 1 << 2, |
63 IsFocusedFlag = 1 << 3 | 68 IsFocusedFlag = 1 << 3 |
64 }; | 69 }; |
65 | 70 |
66 void setFlags(Node* node, bool enable, unsigned flags) { enable ? setFlags(n
ode, flags) : clearFlags(node, flags); } | 71 void setFlags(Node* node, bool enable, unsigned flags) { enable ? setFlags(n
ode, flags) : clearFlags(node, flags); } |
67 void setFlags(Node*, unsigned); | 72 void setFlags(Node*, unsigned); |
68 void clearFlags(Node*, unsigned); | 73 void clearFlags(Node*, unsigned); |
69 bool hasFlags(const Node*, unsigned flags) const; | 74 bool hasFlags(const Node*, unsigned flags) const; |
70 | 75 |
71 void setFlags(Element*, unsigned); | 76 void setFlags(Element*, unsigned); |
72 void clearFlags(Element*, unsigned); | 77 void clearFlags(Element*, unsigned); |
73 bool hasFlags(const Element*, unsigned flags) const; | 78 bool hasFlags(const Element*, unsigned flags) const; |
74 | 79 |
75 typedef HashMap<RefPtr<Element>, unsigned> ElementFlagMap; | 80 typedef WillBeHeapHashMap<RefPtrWillBeMember<Element>, unsigned> ElementFlag
Map; |
76 ElementFlagMap m_elements; | 81 ElementFlagMap m_elements; |
77 }; | 82 }; |
78 | 83 |
79 } // namespace | 84 } // namespace |
80 | 85 |
81 #endif // UserActionElementSet_h | 86 #endif // UserActionElementSet_h |
OLD | NEW |