| 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 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 44 | 44 |
| 45 bool hasDistribution() const { return !m_distribution.isEmpty(); } | 45 bool hasDistribution() const { return !m_distribution.isEmpty(); } |
| 46 void setDistribution(ContentDistribution&); | 46 void setDistribution(ContentDistribution&); |
| 47 void clearDistribution() { m_distribution.clear(); } | 47 void clearDistribution() { m_distribution.clear(); } |
| 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<NodeList> 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(); } |
| (...skipping 45 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 110 return 0; | 110 return 0; |
| 111 } | 111 } |
| 112 | 112 |
| 113 const InsertionPoint* resolveReprojection(const Node*); | 113 const InsertionPoint* resolveReprojection(const Node*); |
| 114 | 114 |
| 115 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); | 115 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB
eMember<InsertionPoint>, 8>& results); |
| 116 | 116 |
| 117 } // namespace WebCore | 117 } // namespace WebCore |
| 118 | 118 |
| 119 #endif // InsertionPoint_h | 119 #endif // InsertionPoint_h |
| OLD | NEW |