| 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 127 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 138 ShadowRoot& ElementShadowV0::oldestShadowRoot() const { | 138 ShadowRoot& ElementShadowV0::oldestShadowRoot() const { |
| 139 return m_elementShadow->oldestShadowRoot(); | 139 return m_elementShadow->oldestShadowRoot(); |
| 140 } | 140 } |
| 141 | 141 |
| 142 const InsertionPoint* ElementShadowV0::finalDestinationInsertionPointFor( | 142 const InsertionPoint* ElementShadowV0::finalDestinationInsertionPointFor( |
| 143 const Node* key) const { | 143 const Node* key) const { |
| 144 DCHECK(key); | 144 DCHECK(key); |
| 145 DCHECK(!key->needsDistributionRecalc()); | 145 DCHECK(!key->needsDistributionRecalc()); |
| 146 NodeToDestinationInsertionPoints::const_iterator it = | 146 NodeToDestinationInsertionPoints::const_iterator it = |
| 147 m_nodeToInsertionPoints.find(key); | 147 m_nodeToInsertionPoints.find(key); |
| 148 return it == m_nodeToInsertionPoints.end() ? nullptr : it->value->last(); | 148 return it == m_nodeToInsertionPoints.end() ? nullptr : it->value->back(); |
| 149 } | 149 } |
| 150 | 150 |
| 151 const DestinationInsertionPoints* | 151 const DestinationInsertionPoints* |
| 152 ElementShadowV0::destinationInsertionPointsFor(const Node* key) const { | 152 ElementShadowV0::destinationInsertionPointsFor(const Node* key) const { |
| 153 DCHECK(key); | 153 DCHECK(key); |
| 154 DCHECK(!key->needsDistributionRecalc()); | 154 DCHECK(!key->needsDistributionRecalc()); |
| 155 NodeToDestinationInsertionPoints::const_iterator it = | 155 NodeToDestinationInsertionPoints::const_iterator it = |
| 156 m_nodeToInsertionPoints.find(key); | 156 m_nodeToInsertionPoints.find(key); |
| 157 return it == m_nodeToInsertionPoints.end() ? nullptr : it->value; | 157 return it == m_nodeToInsertionPoints.end() ? nullptr : it->value; |
| 158 } | 158 } |
| (...skipping 103 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 262 | 262 |
| 263 DEFINE_TRACE(ElementShadowV0) { | 263 DEFINE_TRACE(ElementShadowV0) { |
| 264 visitor->trace(m_elementShadow); | 264 visitor->trace(m_elementShadow); |
| 265 visitor->trace(m_nodeToInsertionPoints); | 265 visitor->trace(m_nodeToInsertionPoints); |
| 266 visitor->trace(m_selectFeatures); | 266 visitor->trace(m_selectFeatures); |
| 267 } | 267 } |
| 268 | 268 |
| 269 DEFINE_TRACE_WRAPPERS(ElementShadowV0) {} | 269 DEFINE_TRACE_WRAPPERS(ElementShadowV0) {} |
| 270 | 270 |
| 271 } // namespace blink | 271 } // namespace blink |
| OLD | NEW |