| 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 167 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 178 updateDistribution(); | 178 updateDistribution(); |
| 179 | 179 |
| 180 WillBeHeapVector<RefPtrWillBeMember<Node>> nodes; | 180 WillBeHeapVector<RefPtrWillBeMember<Node>> nodes; |
| 181 nodes.reserveInitialCapacity(m_distributedNodes.size()); | 181 nodes.reserveInitialCapacity(m_distributedNodes.size()); |
| 182 for (size_t i = 0; i < m_distributedNodes.size(); ++i) | 182 for (size_t i = 0; i < m_distributedNodes.size(); ++i) |
| 183 nodes.uncheckedAppend(m_distributedNodes.at(i)); | 183 nodes.uncheckedAppend(m_distributedNodes.at(i)); |
| 184 | 184 |
| 185 return StaticNodeList::adopt(nodes); | 185 return StaticNodeList::adopt(nodes); |
| 186 } | 186 } |
| 187 | 187 |
| 188 bool InsertionPoint::layoutObjectIsNeeded(const LayoutStyle& style) | 188 bool InsertionPoint::layoutObjectIsNeeded(const ComputedStyle& style) |
| 189 { | 189 { |
| 190 return !isActive() && HTMLElement::layoutObjectIsNeeded(style); | 190 return !isActive() && HTMLElement::layoutObjectIsNeeded(style); |
| 191 } | 191 } |
| 192 | 192 |
| 193 void InsertionPoint::childrenChanged(const ChildrenChange& change) | 193 void InsertionPoint::childrenChanged(const ChildrenChange& change) |
| 194 { | 194 { |
| 195 HTMLElement::childrenChanged(change); | 195 HTMLElement::childrenChanged(change); |
| 196 if (ShadowRoot* root = containingShadowRoot()) { | 196 if (ShadowRoot* root = containingShadowRoot()) { |
| 197 if (ElementShadow* rootOwner = root->owner()) | 197 if (ElementShadow* rootOwner = root->owner()) |
| 198 rootOwner->setNeedsDistributionRecalc(); | 198 rootOwner->setNeedsDistributionRecalc(); |
| (...skipping 88 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 287 if (!insertionPoints) | 287 if (!insertionPoints) |
| 288 return; | 288 return; |
| 289 for (size_t i = 0; i < insertionPoints->size(); ++i) | 289 for (size_t i = 0; i < insertionPoints->size(); ++i) |
| 290 results.append(insertionPoints->at(i).get()); | 290 results.append(insertionPoints->at(i).get()); |
| 291 ASSERT(current != insertionPoints->last().get()); | 291 ASSERT(current != insertionPoints->last().get()); |
| 292 current = insertionPoints->last().get(); | 292 current = insertionPoints->last().get(); |
| 293 } | 293 } |
| 294 } | 294 } |
| 295 | 295 |
| 296 } // namespace blink | 296 } // namespace blink |
| OLD | NEW |