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 21 matching lines...) Expand all Loading... |
32 #include "core/dom/NodeTraversal.h" | 32 #include "core/dom/NodeTraversal.h" |
33 #include "core/dom/shadow/ContentDistribution.h" | 33 #include "core/dom/shadow/ContentDistribution.h" |
34 #include "core/html/HTMLContentElement.h" | 34 #include "core/html/HTMLContentElement.h" |
35 #include "core/html/HTMLShadowElement.h" | 35 #include "core/html/HTMLShadowElement.h" |
36 #include "core/inspector/InspectorInstrumentation.h" | 36 #include "core/inspector/InspectorInstrumentation.h" |
37 #include "platform/EventDispatchForbiddenScope.h" | 37 #include "platform/EventDispatchForbiddenScope.h" |
38 #include "platform/ScriptForbiddenScope.h" | 38 #include "platform/ScriptForbiddenScope.h" |
39 | 39 |
40 namespace blink { | 40 namespace blink { |
41 | 41 |
42 class DistributionPool FINAL { | 42 class DistributionPool final { |
43 STACK_ALLOCATED(); | 43 STACK_ALLOCATED(); |
44 public: | 44 public: |
45 explicit DistributionPool(const ContainerNode&); | 45 explicit DistributionPool(const ContainerNode&); |
46 void clear(); | 46 void clear(); |
47 ~DistributionPool(); | 47 ~DistributionPool(); |
48 void distributeTo(InsertionPoint*, ElementShadow*); | 48 void distributeTo(InsertionPoint*, ElementShadow*); |
49 void populateChildren(const ContainerNode&); | 49 void populateChildren(const ContainerNode&); |
50 | 50 |
51 private: | 51 private: |
52 void detachNonDistributedNodes(); | 52 void detachNonDistributedNodes(); |
(...skipping 308 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
361 visitor->trace(m_nodeToInsertionPoints); | 361 visitor->trace(m_nodeToInsertionPoints); |
362 visitor->trace(m_selectFeatures); | 362 visitor->trace(m_selectFeatures); |
363 // Shadow roots are linked with previous and next pointers which are traced. | 363 // Shadow roots are linked with previous and next pointers which are traced. |
364 // It is therefore enough to trace one of the shadow roots here and the | 364 // It is therefore enough to trace one of the shadow roots here and the |
365 // rest will be traced from there. | 365 // rest will be traced from there. |
366 visitor->trace(m_shadowRoots.head()); | 366 visitor->trace(m_shadowRoots.head()); |
367 #endif | 367 #endif |
368 } | 368 } |
369 | 369 |
370 } // namespace | 370 } // namespace |
OLD | NEW |