| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 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 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
| (...skipping 171 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 182 , m_validity(Undetermined) | 182 , m_validity(Undetermined) |
| 183 { | 183 { |
| 184 } | 184 } |
| 185 | 185 |
| 186 ContentDistributor::~ContentDistributor() | 186 ContentDistributor::~ContentDistributor() |
| 187 { | 187 { |
| 188 } | 188 } |
| 189 | 189 |
| 190 InsertionPoint* ContentDistributor::findInsertionPointFor(const Node* key) const | 190 InsertionPoint* ContentDistributor::findInsertionPointFor(const Node* key) const |
| 191 { | 191 { |
| 192 return m_nodeToInsertionPoint.get(key).get(); | 192 return m_nodeToInsertionPoint.get(key); |
| 193 } | 193 } |
| 194 | 194 |
| 195 void ContentDistributor::populate(Node* node, ContentDistribution& pool) | 195 void ContentDistributor::populate(Node* node, ContentDistribution& pool) |
| 196 { | 196 { |
| 197 if (!isActiveInsertionPoint(node)) { | 197 if (!isActiveInsertionPoint(node)) { |
| 198 pool.append(node); | 198 pool.append(node); |
| 199 return; | 199 return; |
| 200 } | 200 } |
| 201 | 201 |
| 202 InsertionPoint* insertionPoint = toInsertionPoint(node); | 202 InsertionPoint* insertionPoint = toInsertionPoint(node); |
| (...skipping 227 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 430 invalidateDistribution(host); | 430 invalidateDistribution(host); |
| 431 } | 431 } |
| 432 | 432 |
| 433 void ContentDistributor::didShadowBoundaryChange(Element* host) | 433 void ContentDistributor::didShadowBoundaryChange(Element* host) |
| 434 { | 434 { |
| 435 setValidity(Undetermined); | 435 setValidity(Undetermined); |
| 436 invalidateDistribution(host); | 436 invalidateDistribution(host); |
| 437 } | 437 } |
| 438 | 438 |
| 439 } | 439 } |
| OLD | NEW |