| 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 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 64 Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.f
irst().get(); } | 64 Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.f
irst().get(); } |
| 65 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.la
st().get(); } | 65 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.la
st().get(); } |
| 66 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); } | 66 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); } |
| 67 Node* previousTo(const Node* node) const { return m_distribution.previousTo(
node); } | 67 Node* previousTo(const Node* node) const { return m_distribution.previousTo(
node); } |
| 68 | 68 |
| 69 void willRecalcStyle(StyleRecalcChange); | 69 void willRecalcStyle(StyleRecalcChange); |
| 70 | 70 |
| 71 protected: | 71 protected: |
| 72 InsertionPoint(const QualifiedName&, Document&); | 72 InsertionPoint(const QualifiedName&, Document&); |
| 73 virtual void childrenChanged(const ChildrenChange&) override; | 73 virtual void childrenChanged(const ChildrenChange&) override; |
| 74 virtual InsertionNotificationRequest insertedInto(ContainerNode*) override; | 74 virtual void insertedInto(ContainerNode*) override; |
| 75 virtual void removedFrom(ContainerNode*) override; | 75 virtual void removedFrom(ContainerNode*) override; |
| 76 | 76 |
| 77 private: | 77 private: |
| 78 bool isInsertionPoint() const = delete; // This will catch anyone doing an u
nnecessary check. | 78 bool isInsertionPoint() const = delete; // This will catch anyone doing an u
nnecessary check. |
| 79 | 79 |
| 80 ContentDistribution m_distribution; | 80 ContentDistribution m_distribution; |
| 81 bool m_registeredWithShadowRoot; | 81 bool m_registeredWithShadowRoot; |
| 82 }; | 82 }; |
| 83 | 83 |
| 84 typedef Vector<RefPtr<InsertionPoint> > DestinationInsertionPoints; | 84 typedef Vector<RefPtr<InsertionPoint> > DestinationInsertionPoints; |
| (...skipping 19 matching lines...) Expand all Loading... |
| 104 return 0; | 104 return 0; |
| 105 } | 105 } |
| 106 | 106 |
| 107 const InsertionPoint* resolveReprojection(const Node*); | 107 const InsertionPoint* resolveReprojection(const Node*); |
| 108 | 108 |
| 109 void collectDestinationInsertionPoints(const Node&, Vector<RawPtr<InsertionPoint
>, 8>& results); | 109 void collectDestinationInsertionPoints(const Node&, Vector<RawPtr<InsertionPoint
>, 8>& results); |
| 110 | 110 |
| 111 } // namespace blink | 111 } // namespace blink |
| 112 | 112 |
| 113 #endif // SKY_ENGINE_CORE_DOM_SHADOW_INSERTIONPOINT_H_ | 113 #endif // SKY_ENGINE_CORE_DOM_SHADOW_INSERTIONPOINT_H_ |
| OLD | NEW |