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 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 69 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
80 virtual void parseAttribute(const QualifiedName&, const AtomicString&) OVERR
IDE; | 80 virtual void parseAttribute(const QualifiedName&, const AtomicString&) OVERR
IDE; |
81 virtual void willRecalcStyle(StyleRecalcChange) OVERRIDE; | 81 virtual void willRecalcStyle(StyleRecalcChange) OVERRIDE; |
82 | 82 |
83 private: | 83 private: |
84 ContentDistribution m_distribution; | 84 ContentDistribution m_distribution; |
85 bool m_registeredWithShadowRoot; | 85 bool m_registeredWithShadowRoot; |
86 }; | 86 }; |
87 | 87 |
88 typedef Vector<RefPtr<InsertionPoint> > DestinationInsertionPoints; | 88 typedef Vector<RefPtr<InsertionPoint> > DestinationInsertionPoints; |
89 | 89 |
90 DEFINE_NODE_TYPE_CASTS(InsertionPoint, isInsertionPoint()); | 90 DEFINE_ELEMENT_TYPE_CASTS(InsertionPoint, isInsertionPoint()); |
91 | 91 |
92 inline bool isActiveInsertionPoint(const Node& node) | 92 inline bool isActiveInsertionPoint(const Node& node) |
93 { | 93 { |
94 return node.isInsertionPoint() && toInsertionPoint(node).isActive(); | 94 return node.isInsertionPoint() && toInsertionPoint(node).isActive(); |
95 } | 95 } |
96 | 96 |
97 inline bool isActiveShadowInsertionPoint(const Node& node) | 97 inline bool isActiveShadowInsertionPoint(const Node& node) |
98 { | 98 { |
99 return node.isInsertionPoint() && toInsertionPoint(node).isShadowInsertionPo
int(); | 99 return node.isInsertionPoint() && toInsertionPoint(node).isShadowInsertionPo
int(); |
100 } | 100 } |
(...skipping 12 matching lines...) Expand all Loading... |
113 return 0; | 113 return 0; |
114 } | 114 } |
115 | 115 |
116 const InsertionPoint* resolveReprojection(const Node*); | 116 const InsertionPoint* resolveReprojection(const Node*); |
117 | 117 |
118 void collectDestinationInsertionPoints(const Node&, Vector<InsertionPoint*, 8>&
results); | 118 void collectDestinationInsertionPoints(const Node&, Vector<InsertionPoint*, 8>&
results); |
119 | 119 |
120 } // namespace WebCore | 120 } // namespace WebCore |
121 | 121 |
122 #endif // InsertionPoint_h | 122 #endif // InsertionPoint_h |
OLD | NEW |