| 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 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 60 | 60 |
| 61 bool shouldUseFallbackElements() const; | 61 bool shouldUseFallbackElements() const; |
| 62 | 62 |
| 63 size_t size() const { return m_distribution.size(); } | 63 size_t size() const { return m_distribution.size(); } |
| 64 Node* at(size_t index) const { return m_distribution.at(index).get(); } | 64 Node* at(size_t index) const { return m_distribution.at(index).get(); } |
| 65 Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.f
irst().get(); } | 65 Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.f
irst().get(); } |
| 66 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.la
st().get(); } | 66 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.la
st().get(); } |
| 67 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); } | 67 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); } |
| 68 Node* previousTo(const Node* node) const { return m_distribution.previousTo(
node); } | 68 Node* previousTo(const Node* node) const { return m_distribution.previousTo(
node); } |
| 69 | 69 |
| 70 virtual void trace(Visitor*) override; | 70 void willRecalcStyle(StyleRecalcChange); |
| 71 | 71 |
| 72 protected: | 72 protected: |
| 73 InsertionPoint(const QualifiedName&, Document&); | 73 InsertionPoint(const QualifiedName&, Document&); |
| 74 virtual bool rendererIsNeeded(const RenderStyle&) override; | 74 virtual bool rendererIsNeeded(const RenderStyle&) override; |
| 75 virtual void childrenChanged(const ChildrenChange&) override; | 75 virtual void childrenChanged(const ChildrenChange&) override; |
| 76 virtual InsertionNotificationRequest insertedInto(ContainerNode*) override; | 76 virtual InsertionNotificationRequest insertedInto(ContainerNode*) override; |
| 77 virtual void removedFrom(ContainerNode*) override; | 77 virtual void removedFrom(ContainerNode*) override; |
| 78 virtual void willRecalcStyle(StyleRecalcChange) override; | |
| 79 | 78 |
| 80 private: | 79 private: |
| 81 bool isInsertionPoint() const = delete; // This will catch anyone doing an u
nnecessary check. | 80 bool isInsertionPoint() const = delete; // This will catch anyone doing an u
nnecessary check. |
| 82 | 81 |
| 83 ContentDistribution m_distribution; | 82 ContentDistribution m_distribution; |
| 84 bool m_registeredWithShadowRoot; | 83 bool m_registeredWithShadowRoot; |
| 85 }; | 84 }; |
| 86 | 85 |
| 87 typedef Vector<RefPtr<InsertionPoint> > DestinationInsertionPoints; | 86 typedef Vector<RefPtr<InsertionPoint> > DestinationInsertionPoints; |
| 88 | 87 |
| (...skipping 23 matching lines...) Expand all Loading... |
| 112 return 0; | 111 return 0; |
| 113 } | 112 } |
| 114 | 113 |
| 115 const InsertionPoint* resolveReprojection(const Node*); | 114 const InsertionPoint* resolveReprojection(const Node*); |
| 116 | 115 |
| 117 void collectDestinationInsertionPoints(const Node&, Vector<RawPtr<InsertionPoint
>, 8>& results); | 116 void collectDestinationInsertionPoints(const Node&, Vector<RawPtr<InsertionPoint
>, 8>& results); |
| 118 | 117 |
| 119 } // namespace blink | 118 } // namespace blink |
| 120 | 119 |
| 121 #endif // InsertionPoint_h | 120 #endif // InsertionPoint_h |
| OLD | NEW |