| 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 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 48 bool isActive() const; | 48 bool isActive() const; |
| 49 bool canBeActive() const; | 49 bool canBeActive() const; |
| 50 | 50 |
| 51 bool isShadowInsertionPoint() const; | 51 bool isShadowInsertionPoint() const; |
| 52 bool isContentInsertionPoint() const; | 52 bool isContentInsertionPoint() const; |
| 53 | 53 |
| 54 PassRefPtrWillBeRawPtr<StaticNodeList> getDistributedNodes(); | 54 PassRefPtrWillBeRawPtr<StaticNodeList> getDistributedNodes(); |
| 55 | 55 |
| 56 virtual bool canAffectSelector() const { return false; } | 56 virtual bool canAffectSelector() const { return false; } |
| 57 | 57 |
| 58 virtual void attach(const AttachContext& = AttachContext()) OVERRIDE; | 58 virtual void attach(const AttachContext& = AttachContext()) override; |
| 59 virtual void detach(const AttachContext& = AttachContext()) OVERRIDE; | 59 virtual void detach(const AttachContext& = AttachContext()) override; |
| 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 virtual void trace(Visitor*) override; |
| 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; | 78 virtual void willRecalcStyle(StyleRecalcChange) override; |
| 79 | 79 |
| 80 private: | 80 private: |
| 81 bool isInsertionPoint() const WTF_DELETED_FUNCTION; // This will catch anyon
e doing an unnecessary check. | 81 bool isInsertionPoint() const WTF_DELETED_FUNCTION; // This will catch anyon
e doing an unnecessary check. |
| 82 | 82 |
| 83 ContentDistribution m_distribution; | 83 ContentDistribution m_distribution; |
| 84 bool m_registeredWithShadowRoot; | 84 bool m_registeredWithShadowRoot; |
| 85 }; | 85 }; |
| 86 | 86 |
| 87 typedef WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> > DestinationInserti
onPoints; | 87 typedef WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> > DestinationInserti
onPoints; |
| 88 | 88 |
| (...skipping 23 matching lines...) Expand all Loading... |
| 112 return 0; | 112 return 0; |
| 113 } | 113 } |
| 114 | 114 |
| 115 const InsertionPoint* resolveReprojection(const Node*); | 115 const InsertionPoint* resolveReprojection(const Node*); |
| 116 | 116 |
| 117 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); | 117 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); |
| 118 | 118 |
| 119 } // namespace blink | 119 } // namespace blink |
| 120 | 120 |
| 121 #endif // InsertionPoint_h | 121 #endif // InsertionPoint_h |
| OLD | NEW |