| 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 105 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 116 void InsertionPoint::detach(const AttachContext& context) | 116 void InsertionPoint::detach(const AttachContext& context) |
| 117 { | 117 { |
| 118 for (size_t i = 0; i < m_distributedNodes.size(); ++i) | 118 for (size_t i = 0; i < m_distributedNodes.size(); ++i) |
| 119 m_distributedNodes.at(i)->lazyReattachIfAttached(); | 119 m_distributedNodes.at(i)->lazyReattachIfAttached(); |
| 120 | 120 |
| 121 HTMLElement::detach(context); | 121 HTMLElement::detach(context); |
| 122 } | 122 } |
| 123 | 123 |
| 124 void InsertionPoint::willRecalcStyle(StyleRecalcChange change) | 124 void InsertionPoint::willRecalcStyle(StyleRecalcChange change) |
| 125 { | 125 { |
| 126 if (change < Inherit && styleChangeType() < SubtreeStyleChange) | 126 if (change < Inherit && getStyleChangeType() < SubtreeStyleChange) |
| 127 return; | 127 return; |
| 128 for (size_t i = 0; i < m_distributedNodes.size(); ++i) | 128 for (size_t i = 0; i < m_distributedNodes.size(); ++i) |
| 129 m_distributedNodes.at(i)->setNeedsStyleRecalc(SubtreeStyleChange, StyleC
hangeReasonForTracing::create(StyleChangeReason::PropagateInheritChangeToDistrib
utedNodes)); | 129 m_distributedNodes.at(i)->setNeedsStyleRecalc(SubtreeStyleChange, StyleC
hangeReasonForTracing::create(StyleChangeReason::PropagateInheritChangeToDistrib
utedNodes)); |
| 130 } | 130 } |
| 131 | 131 |
| 132 bool InsertionPoint::canBeActive() const | 132 bool InsertionPoint::canBeActive() const |
| 133 { | 133 { |
| 134 ShadowRoot* shadowRoot = containingShadowRoot(); | 134 ShadowRoot* shadowRoot = containingShadowRoot(); |
| 135 if (!shadowRoot) | 135 if (!shadowRoot) |
| 136 return false; | 136 return false; |
| (...skipping 149 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 286 if (!insertionPoints) | 286 if (!insertionPoints) |
| 287 return; | 287 return; |
| 288 for (size_t i = 0; i < insertionPoints->size(); ++i) | 288 for (size_t i = 0; i < insertionPoints->size(); ++i) |
| 289 results.append(insertionPoints->at(i).get()); | 289 results.append(insertionPoints->at(i).get()); |
| 290 ASSERT(current != insertionPoints->last().get()); | 290 ASSERT(current != insertionPoints->last().get()); |
| 291 current = insertionPoints->last().get(); | 291 current = insertionPoints->last().get(); |
| 292 } | 292 } |
| 293 } | 293 } |
| 294 | 294 |
| 295 } // namespace blink | 295 } // namespace blink |
| OLD | NEW |