OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2014 Google Inc. All rights reserved. | 2 * Copyright (C) 2014 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 | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * | 7 * |
8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. 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 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
(...skipping 10 matching lines...) Expand all Loading... |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
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 "core/dom/custom/CustomElementAsyncImportMicrotaskQueue.h" | 31 #include "core/dom/custom/V0CustomElementAsyncImportMicrotaskQueue.h" |
32 | 32 |
33 #include "core/dom/custom/CustomElementMicrotaskImportStep.h" | 33 #include "core/dom/custom/V0CustomElementMicrotaskImportStep.h" |
34 | 34 |
35 namespace blink { | 35 namespace blink { |
36 | 36 |
37 void CustomElementAsyncImportMicrotaskQueue::enqueue(CustomElementMicrotaskStep*
step) | 37 void V0CustomElementAsyncImportMicrotaskQueue::enqueue(V0CustomElementMicrotaskS
tep* step) |
38 { | 38 { |
39 m_queue.append(step); | 39 m_queue.append(step); |
40 } | 40 } |
41 | 41 |
42 void CustomElementAsyncImportMicrotaskQueue::doDispatch() | 42 void V0CustomElementAsyncImportMicrotaskQueue::doDispatch() |
43 { | 43 { |
44 HeapVector<Member<CustomElementMicrotaskStep>> remaining; | 44 HeapVector<Member<V0CustomElementMicrotaskStep>> remaining; |
45 | 45 |
46 for (unsigned i = 0; i < m_queue.size(); ++i) { | 46 for (unsigned i = 0; i < m_queue.size(); ++i) { |
47 if (CustomElementMicrotaskStep::Processing == m_queue[i]->process()) | 47 if (V0CustomElementMicrotaskStep::Processing == m_queue[i]->process()) |
48 remaining.append(m_queue[i].release()); | 48 remaining.append(m_queue[i].release()); |
49 } | 49 } |
50 | 50 |
51 m_queue.swap(remaining); | 51 m_queue.swap(remaining); |
52 } | 52 } |
53 | 53 |
54 } // namespace blink | 54 } // namespace blink |
OLD | NEW |