| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 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 48 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 59 } | 59 } |
| 60 | 60 |
| 61 inline NodeChildRemovalTracker::~NodeChildRemovalTracker() | 61 inline NodeChildRemovalTracker::~NodeChildRemovalTracker() |
| 62 { | 62 { |
| 63 s_last = m_previous; | 63 s_last = m_previous; |
| 64 } | 64 } |
| 65 | 65 |
| 66 inline bool NodeChildRemovalTracker::isBeingRemoved(Node* node) | 66 inline bool NodeChildRemovalTracker::isBeingRemoved(Node* node) |
| 67 { | 67 { |
| 68 for (NodeChildRemovalTracker* removal = s_last; removal; removal = removal->
previous()) { | 68 for (NodeChildRemovalTracker* removal = s_last; removal; removal = removal->
previous()) { |
| 69 if (removal->node().containsIncludingShadowDOM(node)) | 69 if (removal->node().isShadowIncludingInclusiveAncestorOf(node)) |
| 70 return true; | 70 return true; |
| 71 } | 71 } |
| 72 | 72 |
| 73 return false; | 73 return false; |
| 74 } | 74 } |
| 75 | 75 |
| 76 } // namespace blink | 76 } // namespace blink |
| 77 | 77 |
| 78 #endif | 78 #endif |
| OLD | NEW |