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 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
68 Node* distributedNodeNextTo(const Node* node) const { return m_distributedNo
des.nextTo(node); } | 68 Node* distributedNodeNextTo(const Node* node) const { return m_distributedNo
des.nextTo(node); } |
69 Node* distributedNodePreviousTo(const Node* node) const { return m_distribut
edNodes.previousTo(node); } | 69 Node* distributedNodePreviousTo(const Node* node) const { return m_distribut
edNodes.previousTo(node); } |
70 | 70 |
71 DECLARE_VIRTUAL_TRACE(); | 71 DECLARE_VIRTUAL_TRACE(); |
72 | 72 |
73 protected: | 73 protected: |
74 InsertionPoint(const QualifiedName&, Document&); | 74 InsertionPoint(const QualifiedName&, Document&); |
75 bool layoutObjectIsNeeded(const ComputedStyle&) override; | 75 bool layoutObjectIsNeeded(const ComputedStyle&) override; |
76 void childrenChanged(const ChildrenChange&) override; | 76 void childrenChanged(const ChildrenChange&) override; |
77 InsertionNotificationRequest insertedInto(ContainerNode*) override; | 77 InsertionNotificationRequest insertedInto(ContainerNode*) override; |
78 void removedFrom(ContainerNode*) override; | 78 void removedFrom(ContainerNode* insertionPoint, Node* next) override; |
79 void willRecalcStyle(StyleRecalcChange) override; | 79 void willRecalcStyle(StyleRecalcChange) override; |
80 | 80 |
81 private: | 81 private: |
82 bool isInsertionPoint() const = delete; // This will catch anyone doing an u
nnecessary check. | 82 bool isInsertionPoint() const = delete; // This will catch anyone doing an u
nnecessary check. |
83 | 83 |
84 DistributedNodes m_distributedNodes; | 84 DistributedNodes m_distributedNodes; |
85 bool m_registeredWithShadowRoot; | 85 bool m_registeredWithShadowRoot; |
86 }; | 86 }; |
87 | 87 |
88 typedef WillBeHeapVector<RefPtrWillBeMember<InsertionPoint>, 1> DestinationInser
tionPoints; | 88 typedef WillBeHeapVector<RefPtrWillBeMember<InsertionPoint>, 1> DestinationInser
tionPoints; |
(...skipping 24 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&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); | 118 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); |
119 | 119 |
120 } // namespace blink | 120 } // namespace blink |
121 | 121 |
122 #endif // InsertionPoint_h | 122 #endif // InsertionPoint_h |
OLD | NEW |