| 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 119 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 130 } | 130 } |
| 131 | 131 |
| 132 bool InsertionPoint::isActive() const | 132 bool InsertionPoint::isActive() const |
| 133 { | 133 { |
| 134 // FIXME(sky): Remove this. | 134 // FIXME(sky): Remove this. |
| 135 return canBeActive(); | 135 return canBeActive(); |
| 136 } | 136 } |
| 137 | 137 |
| 138 bool InsertionPoint::isContentInsertionPoint() const | 138 bool InsertionPoint::isContentInsertionPoint() const |
| 139 { | 139 { |
| 140 return isHTMLContentElement(*this) && isActive(); | 140 return false; |
| 141 } | 141 } |
| 142 | 142 |
| 143 Vector<RefPtr<Node>> InsertionPoint::getDistributedNodes() | 143 Vector<RefPtr<Node>> InsertionPoint::getDistributedNodes() |
| 144 { | 144 { |
| 145 document().updateDistributionForNodeIfNeeded(this); | 145 document().updateDistributionForNodeIfNeeded(this); |
| 146 | 146 |
| 147 Vector<RefPtr<Node> > result; | 147 Vector<RefPtr<Node> > result; |
| 148 result.reserveInitialCapacity(m_distribution.size()); | 148 result.reserveInitialCapacity(m_distribution.size()); |
| 149 for (size_t i = 0; i < m_distribution.size(); ++i) | 149 for (size_t i = 0; i < m_distribution.size(); ++i) |
| 150 result.uncheckedAppend(m_distribution.at(i)); | 150 result.uncheckedAppend(m_distribution.at(i)); |
| (...skipping 89 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 240 if (!insertionPoints) | 240 if (!insertionPoints) |
| 241 return; | 241 return; |
| 242 for (size_t i = 0; i < insertionPoints->size(); ++i) | 242 for (size_t i = 0; i < insertionPoints->size(); ++i) |
| 243 results.append(insertionPoints->at(i).get()); | 243 results.append(insertionPoints->at(i).get()); |
| 244 ASSERT(current != insertionPoints->last().get()); | 244 ASSERT(current != insertionPoints->last().get()); |
| 245 current = insertionPoints->last().get(); | 245 current = insertionPoints->last().get(); |
| 246 } | 246 } |
| 247 } | 247 } |
| 248 | 248 |
| 249 } // namespace blink | 249 } // namespace blink |
| OLD | NEW |