| 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  *     * Redistributions in binary form must reproduce the above | 10  *     * Redistributions in binary form must reproduce the above | 
| (...skipping 11 matching lines...) Expand all  Loading... | 
| 22  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 
| 23  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 
| 24  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 
| 25  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 
| 26  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 
| 27  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 
| 28  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 
| 29  */ | 29  */ | 
| 30 | 30 | 
| 31 #include "config.h" | 31 #include "config.h" | 
| 32 #include "core/dom/CustomElementUpgradeCandidateMap.h" | 32 #include "core/dom/custom/CustomElementUpgradeCandidateMap.h" | 
| 33 | 33 | 
| 34 #include "core/dom/Element.h" | 34 #include "core/dom/Element.h" | 
| 35 | 35 | 
| 36 namespace WebCore { | 36 namespace WebCore { | 
| 37 | 37 | 
| 38 CustomElementUpgradeCandidateMap::~CustomElementUpgradeCandidateMap() | 38 CustomElementUpgradeCandidateMap::~CustomElementUpgradeCandidateMap() | 
| 39 { | 39 { | 
| 40     UpgradeCandidateMap::const_iterator::Keys end = m_upgradeCandidates.end().ke
     ys(); | 40     UpgradeCandidateMap::const_iterator::Keys end = m_upgradeCandidates.end().ke
     ys(); | 
| 41     for (UpgradeCandidateMap::const_iterator::Keys it = m_upgradeCandidates.begi
     n().keys(); it != end; ++it) | 41     for (UpgradeCandidateMap::const_iterator::Keys it = m_upgradeCandidates.begi
     n().keys(); it != end; ++it) | 
| 42         unobserve(*it); | 42         unobserve(*it); | 
| (...skipping 58 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 101 | 101 | 
| 102     for (ElementSet::const_iterator candidate = candidates.begin(); candidate !=
      candidates.end(); ++candidate) { | 102     for (ElementSet::const_iterator candidate = candidates.begin(); candidate !=
      candidates.end(); ++candidate) { | 
| 103         unobserve(*candidate); | 103         unobserve(*candidate); | 
| 104         m_upgradeCandidates.remove(*candidate); | 104         m_upgradeCandidates.remove(*candidate); | 
| 105     } | 105     } | 
| 106 | 106 | 
| 107     return candidates; | 107     return candidates; | 
| 108 } | 108 } | 
| 109 | 109 | 
| 110 } | 110 } | 
| OLD | NEW | 
|---|