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 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
52 bool isShadowInsertionPoint() const; | 52 bool isShadowInsertionPoint() const; |
53 bool isContentInsertionPoint() const; | 53 bool isContentInsertionPoint() const; |
54 | 54 |
55 PassRefPtrWillBeRawPtr<StaticNodeList> getDistributedNodes(); | 55 PassRefPtrWillBeRawPtr<StaticNodeList> getDistributedNodes(); |
56 | 56 |
57 virtual bool canAffectSelector() const { return false; } | 57 virtual bool canAffectSelector() const { return false; } |
58 | 58 |
59 void attach(const AttachContext& = AttachContext()) override; | 59 void attach(const AttachContext& = AttachContext()) override; |
60 void detach(const AttachContext& = AttachContext()) override; | 60 void detach(const AttachContext& = AttachContext()) override; |
61 | 61 |
62 bool shouldUseFallbackElements() const; | |
63 | |
64 size_t distributedNodesSize() const { return m_distributedNodes.size(); } | 62 size_t distributedNodesSize() const { return m_distributedNodes.size(); } |
65 Node* distributedNodeAt(size_t index) const { return m_distributedNodes.at(
index).get(); } | 63 Node* distributedNodeAt(size_t index) const { return m_distributedNodes.at(
index).get(); } |
66 Node* firstDistributedNode() const { return m_distributedNodes.isEmpty() ? 0
: m_distributedNodes.first().get(); } | 64 Node* firstDistributedNode() const { return m_distributedNodes.isEmpty() ? 0
: m_distributedNodes.first().get(); } |
67 Node* lastDistributedNode() const { return m_distributedNodes.isEmpty() ? 0
: m_distributedNodes.last().get(); } | 65 Node* lastDistributedNode() const { return m_distributedNodes.isEmpty() ? 0
: m_distributedNodes.last().get(); } |
68 Node* distributedNodeNextTo(const Node* node) const { return m_distributedNo
des.nextTo(node); } | 66 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); } | 67 Node* distributedNodePreviousTo(const Node* node) const { return m_distribut
edNodes.previousTo(node); } |
70 | 68 |
71 DECLARE_VIRTUAL_TRACE(); | 69 DECLARE_VIRTUAL_TRACE(); |
72 | 70 |
73 protected: | 71 protected: |
(...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
114 return 0; | 112 return 0; |
115 } | 113 } |
116 | 114 |
117 const InsertionPoint* resolveReprojection(const Node*); | 115 const InsertionPoint* resolveReprojection(const Node*); |
118 | 116 |
119 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); | 117 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); |
120 | 118 |
121 } // namespace blink | 119 } // namespace blink |
122 | 120 |
123 #endif // InsertionPoint_h | 121 #endif // InsertionPoint_h |
OLD | NEW |