| 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 153 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 164 bool InsertionPoint::isShadowInsertionPoint() const | 164 bool InsertionPoint::isShadowInsertionPoint() const |
| 165 { | 165 { |
| 166 return isHTMLShadowElement(*this) && isActive(); | 166 return isHTMLShadowElement(*this) && isActive(); |
| 167 } | 167 } |
| 168 | 168 |
| 169 bool InsertionPoint::isContentInsertionPoint() const | 169 bool InsertionPoint::isContentInsertionPoint() const |
| 170 { | 170 { |
| 171 return isHTMLContentElement(*this) && isActive(); | 171 return isHTMLContentElement(*this) && isActive(); |
| 172 } | 172 } |
| 173 | 173 |
| 174 PassRefPtrWillBeRawPtr<NodeList> InsertionPoint::getDistributedNodes() | 174 PassRefPtrWillBeRawPtr<StaticNodeList> InsertionPoint::getDistributedNodes() |
| 175 { | 175 { |
| 176 document().updateDistributionForNodeIfNeeded(this); | 176 document().updateDistributionForNodeIfNeeded(this); |
| 177 | 177 |
| 178 WillBeHeapVector<RefPtrWillBeMember<Node> > nodes; | 178 WillBeHeapVector<RefPtrWillBeMember<Node> > nodes; |
| 179 nodes.reserveInitialCapacity(m_distribution.size()); | 179 nodes.reserveInitialCapacity(m_distribution.size()); |
| 180 for (size_t i = 0; i < m_distribution.size(); ++i) | 180 for (size_t i = 0; i < m_distribution.size(); ++i) |
| 181 nodes.uncheckedAppend(m_distribution.at(i)); | 181 nodes.uncheckedAppend(m_distribution.at(i)); |
| 182 | 182 |
| 183 return StaticNodeList::adopt(nodes); | 183 return StaticNodeList::adopt(nodes); |
| 184 } | 184 } |
| (...skipping 100 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 285 if (!insertionPoints) | 285 if (!insertionPoints) |
| 286 return; | 286 return; |
| 287 for (size_t i = 0; i < insertionPoints->size(); ++i) | 287 for (size_t i = 0; i < insertionPoints->size(); ++i) |
| 288 results.append(insertionPoints->at(i).get()); | 288 results.append(insertionPoints->at(i).get()); |
| 289 ASSERT(current != insertionPoints->last().get()); | 289 ASSERT(current != insertionPoints->last().get()); |
| 290 current = insertionPoints->last().get(); | 290 current = insertionPoints->last().get(); |
| 291 } | 291 } |
| 292 } | 292 } |
| 293 | 293 |
| 294 } // namespace WebCore | 294 } // namespace WebCore |
| OLD | NEW |