| 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 158 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 169 document().updateDistributionForNodeIfNeeded(this); | 169 document().updateDistributionForNodeIfNeeded(this); |
| 170 | 170 |
| 171 Vector<RefPtr<Node> > nodes; | 171 Vector<RefPtr<Node> > nodes; |
| 172 nodes.reserveInitialCapacity(m_distribution.size()); | 172 nodes.reserveInitialCapacity(m_distribution.size()); |
| 173 for (size_t i = 0; i < m_distribution.size(); ++i) | 173 for (size_t i = 0; i < m_distribution.size(); ++i) |
| 174 nodes.uncheckedAppend(m_distribution.at(i)); | 174 nodes.uncheckedAppend(m_distribution.at(i)); |
| 175 | 175 |
| 176 return StaticNodeList::adopt(nodes); | 176 return StaticNodeList::adopt(nodes); |
| 177 } | 177 } |
| 178 | 178 |
| 179 bool InsertionPoint::rendererIsNeeded(const RenderStyle& style) | |
| 180 { | |
| 181 return !isActive() && HTMLElement::rendererIsNeeded(style); | |
| 182 } | |
| 183 | |
| 184 void InsertionPoint::childrenChanged(const ChildrenChange& change) | 179 void InsertionPoint::childrenChanged(const ChildrenChange& change) |
| 185 { | 180 { |
| 186 HTMLElement::childrenChanged(change); | 181 HTMLElement::childrenChanged(change); |
| 187 if (ShadowRoot* root = containingShadowRoot()) { | 182 if (ShadowRoot* root = containingShadowRoot()) { |
| 188 if (ElementShadow* rootOwner = root->owner()) | 183 if (ElementShadow* rootOwner = root->owner()) |
| 189 rootOwner->setNeedsDistributionRecalc(); | 184 rootOwner->setNeedsDistributionRecalc(); |
| 190 } | 185 } |
| 191 } | 186 } |
| 192 | 187 |
| 193 Node::InsertionNotificationRequest InsertionPoint::insertedInto(ContainerNode* i
nsertionPoint) | 188 Node::InsertionNotificationRequest InsertionPoint::insertedInto(ContainerNode* i
nsertionPoint) |
| (...skipping 78 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 272 if (!insertionPoints) | 267 if (!insertionPoints) |
| 273 return; | 268 return; |
| 274 for (size_t i = 0; i < insertionPoints->size(); ++i) | 269 for (size_t i = 0; i < insertionPoints->size(); ++i) |
| 275 results.append(insertionPoints->at(i).get()); | 270 results.append(insertionPoints->at(i).get()); |
| 276 ASSERT(current != insertionPoints->last().get()); | 271 ASSERT(current != insertionPoints->last().get()); |
| 277 current = insertionPoints->last().get(); | 272 current = insertionPoints->last().get(); |
| 278 } | 273 } |
| 279 } | 274 } |
| 280 | 275 |
| 281 } // namespace blink | 276 } // namespace blink |
| OLD | NEW |