| 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 13 matching lines...) Expand all Loading... |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #ifndef InsertionPoint_h | 31 #ifndef InsertionPoint_h |
| 32 #define InsertionPoint_h | 32 #define InsertionPoint_h |
| 33 | 33 |
| 34 #include "core/CoreExport.h" |
| 34 #include "core/css/CSSSelectorList.h" | 35 #include "core/css/CSSSelectorList.h" |
| 35 #include "core/dom/shadow/DistributedNodes.h" | 36 #include "core/dom/shadow/DistributedNodes.h" |
| 36 #include "core/dom/shadow/ShadowRoot.h" | 37 #include "core/dom/shadow/ShadowRoot.h" |
| 37 #include "core/html/HTMLElement.h" | 38 #include "core/html/HTMLElement.h" |
| 38 | 39 |
| 39 namespace blink { | 40 namespace blink { |
| 40 | 41 |
| 41 class InsertionPoint : public HTMLElement { | 42 class CORE_EXPORT InsertionPoint : public HTMLElement { |
| 42 public: | 43 public: |
| 43 virtual ~InsertionPoint(); | 44 virtual ~InsertionPoint(); |
| 44 | 45 |
| 45 bool hasDistribution() const { return !m_distributedNodes.isEmpty(); } | 46 bool hasDistribution() const { return !m_distributedNodes.isEmpty(); } |
| 46 void setDistributedNodes(DistributedNodes&); | 47 void setDistributedNodes(DistributedNodes&); |
| 47 void clearDistribution() { m_distributedNodes.clear(); } | 48 void clearDistribution() { m_distributedNodes.clear(); } |
| 48 bool isActive() const; | 49 bool isActive() const; |
| 49 bool canBeActive() const; | 50 bool canBeActive() const; |
| 50 | 51 |
| 51 bool isShadowInsertionPoint() const; | 52 bool isShadowInsertionPoint() const; |
| (...skipping 60 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 112 return 0; | 113 return 0; |
| 113 } | 114 } |
| 114 | 115 |
| 115 const InsertionPoint* resolveReprojection(const Node*); | 116 const InsertionPoint* resolveReprojection(const Node*); |
| 116 | 117 |
| 117 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); | 118 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); |
| 118 | 119 |
| 119 } // namespace blink | 120 } // namespace blink |
| 120 | 121 |
| 121 #endif // InsertionPoint_h | 122 #endif // InsertionPoint_h |
| OLD | NEW |