| 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 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
| (...skipping 371 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 382 shadow->setNeedsSelectFeatureSet(); | 382 shadow->setNeedsSelectFeatureSet(); |
| 383 } | 383 } |
| 384 setNeedsDistributionRecalc(); | 384 setNeedsDistributionRecalc(); |
| 385 } | 385 } |
| 386 | 386 |
| 387 void ElementShadow::clearDistribution() | 387 void ElementShadow::clearDistribution() |
| 388 { | 388 { |
| 389 m_nodeToInsertionPoints.clear(); | 389 m_nodeToInsertionPoints.clear(); |
| 390 | 390 |
| 391 for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadow
Root()) | 391 for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadow
Root()) |
| 392 root->setShadowInsertionPointOfYoungerShadowRoot(0); | 392 root->setShadowInsertionPointOfYoungerShadowRoot(nullptr); |
| 393 } | 393 } |
| 394 | 394 |
| 395 } // namespace | 395 } // namespace |
| OLD | NEW |