| 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 187 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 198 shadowWhereNodeCanBeDistributedForV0(*shadowInsertionPoint)) | 198 shadowWhereNodeCanBeDistributedForV0(*shadowInsertionPoint)) |
| 199 shadow->setNeedsDistributionRecalc(); | 199 shadow->setNeedsDistributionRecalc(); |
| 200 } | 200 } |
| 201 InspectorInstrumentation::didPerformElementShadowDistribution( | 201 InspectorInstrumentation::didPerformElementShadowDistribution( |
| 202 &m_elementShadow->host()); | 202 &m_elementShadow->host()); |
| 203 } | 203 } |
| 204 | 204 |
| 205 void ElementShadowV0::didDistributeNode(const Node* node, | 205 void ElementShadowV0::didDistributeNode(const Node* node, |
| 206 InsertionPoint* insertionPoint) { | 206 InsertionPoint* insertionPoint) { |
| 207 NodeToDestinationInsertionPoints::AddResult result = | 207 NodeToDestinationInsertionPoints::AddResult result = |
| 208 m_nodeToInsertionPoints.add(node, nullptr); | 208 m_nodeToInsertionPoints.insert(node, nullptr); |
| 209 if (result.isNewEntry) | 209 if (result.isNewEntry) |
| 210 result.storedValue->value = new DestinationInsertionPoints; | 210 result.storedValue->value = new DestinationInsertionPoints; |
| 211 result.storedValue->value->push_back(insertionPoint); | 211 result.storedValue->value->push_back(insertionPoint); |
| 212 } | 212 } |
| 213 | 213 |
| 214 const SelectRuleFeatureSet& ElementShadowV0::ensureSelectFeatureSet() { | 214 const SelectRuleFeatureSet& ElementShadowV0::ensureSelectFeatureSet() { |
| 215 if (!m_needsSelectFeatureSet) | 215 if (!m_needsSelectFeatureSet) |
| 216 return m_selectFeatures; | 216 return m_selectFeatures; |
| 217 | 217 |
| 218 m_selectFeatures.clear(); | 218 m_selectFeatures.clear(); |
| (...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 259 | 259 |
| 260 DEFINE_TRACE(ElementShadowV0) { | 260 DEFINE_TRACE(ElementShadowV0) { |
| 261 visitor->trace(m_elementShadow); | 261 visitor->trace(m_elementShadow); |
| 262 visitor->trace(m_nodeToInsertionPoints); | 262 visitor->trace(m_nodeToInsertionPoints); |
| 263 visitor->trace(m_selectFeatures); | 263 visitor->trace(m_selectFeatures); |
| 264 } | 264 } |
| 265 | 265 |
| 266 DEFINE_TRACE_WRAPPERS(ElementShadowV0) {} | 266 DEFINE_TRACE_WRAPPERS(ElementShadowV0) {} |
| 267 | 267 |
| 268 } // namespace blink | 268 } // namespace blink |
| OLD | NEW |