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 276 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
287 { | 287 { |
288 return m_shadowRootRareData ? m_shadowRootRareData->childShadowRootCount() :
0; | 288 return m_shadowRootRareData ? m_shadowRootRareData->childShadowRootCount() :
0; |
289 } | 289 } |
290 | 290 |
291 void ShadowRoot::invalidateDescendantInsertionPoints() | 291 void ShadowRoot::invalidateDescendantInsertionPoints() |
292 { | 292 { |
293 m_descendantInsertionPointsIsValid = false; | 293 m_descendantInsertionPointsIsValid = false; |
294 m_shadowRootRareData->clearDescendantInsertionPoints(); | 294 m_shadowRootRareData->clearDescendantInsertionPoints(); |
295 } | 295 } |
296 | 296 |
297 const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& ShadowRoot::descend
antInsertionPoints() | 297 const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint>>& ShadowRoot::descenda
ntInsertionPoints() |
298 { | 298 { |
299 DEFINE_STATIC_LOCAL(WillBePersistentHeapVector<RefPtrWillBeMember<InsertionP
oint> >, emptyList, ()); | 299 DEFINE_STATIC_LOCAL(WillBePersistentHeapVector<RefPtrWillBeMember<InsertionP
oint>>, emptyList, ()); |
300 if (m_shadowRootRareData && m_descendantInsertionPointsIsValid) | 300 if (m_shadowRootRareData && m_descendantInsertionPointsIsValid) |
301 return m_shadowRootRareData->descendantInsertionPoints(); | 301 return m_shadowRootRareData->descendantInsertionPoints(); |
302 | 302 |
303 m_descendantInsertionPointsIsValid = true; | 303 m_descendantInsertionPointsIsValid = true; |
304 | 304 |
305 if (!containsInsertionPoints()) | 305 if (!containsInsertionPoints()) |
306 return emptyList; | 306 return emptyList; |
307 | 307 |
308 WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> > insertionPoints; | 308 WillBeHeapVector<RefPtrWillBeMember<InsertionPoint>> insertionPoints; |
309 for (InsertionPoint& insertionPoint : Traversal<InsertionPoint>::descendants
Of(*this)) | 309 for (InsertionPoint& insertionPoint : Traversal<InsertionPoint>::descendants
Of(*this)) |
310 insertionPoints.append(&insertionPoint); | 310 insertionPoints.append(&insertionPoint); |
311 | 311 |
312 ensureShadowRootRareData()->setDescendantInsertionPoints(insertionPoints); | 312 ensureShadowRootRareData()->setDescendantInsertionPoints(insertionPoints); |
313 | 313 |
314 return m_shadowRootRareData->descendantInsertionPoints(); | 314 return m_shadowRootRareData->descendantInsertionPoints(); |
315 } | 315 } |
316 | 316 |
317 StyleSheetList* ShadowRoot::styleSheets() | 317 StyleSheetList* ShadowRoot::styleSheets() |
318 { | 318 { |
319 if (!ensureShadowRootRareData()->styleSheets()) | 319 if (!ensureShadowRootRareData()->styleSheets()) |
320 m_shadowRootRareData->setStyleSheets(StyleSheetList::create(this)); | 320 m_shadowRootRareData->setStyleSheets(StyleSheetList::create(this)); |
321 | 321 |
322 return m_shadowRootRareData->styleSheets(); | 322 return m_shadowRootRareData->styleSheets(); |
323 } | 323 } |
324 | 324 |
325 DEFINE_TRACE(ShadowRoot) | 325 DEFINE_TRACE(ShadowRoot) |
326 { | 326 { |
327 visitor->trace(m_prev); | 327 visitor->trace(m_prev); |
328 visitor->trace(m_next); | 328 visitor->trace(m_next); |
329 visitor->trace(m_shadowRootRareData); | 329 visitor->trace(m_shadowRootRareData); |
330 TreeScope::trace(visitor); | 330 TreeScope::trace(visitor); |
331 DocumentFragment::trace(visitor); | 331 DocumentFragment::trace(visitor); |
332 } | 332 } |
333 | 333 |
334 } | 334 } |
OLD | NEW |