| 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 24 matching lines...) Expand all Loading... |
| 35 | 35 |
| 36 namespace blink { | 36 namespace blink { |
| 37 | 37 |
| 38 void CustomElementAsyncImportMicrotaskQueue::enqueue(PassOwnPtrWillBeRawPtr<Cust
omElementMicrotaskStep> step) | 38 void CustomElementAsyncImportMicrotaskQueue::enqueue(PassOwnPtrWillBeRawPtr<Cust
omElementMicrotaskStep> step) |
| 39 { | 39 { |
| 40 m_queue.append(step); | 40 m_queue.append(step); |
| 41 } | 41 } |
| 42 | 42 |
| 43 void CustomElementAsyncImportMicrotaskQueue::doDispatch() | 43 void CustomElementAsyncImportMicrotaskQueue::doDispatch() |
| 44 { | 44 { |
| 45 WillBeHeapVector<OwnPtrWillBeMember<CustomElementMicrotaskStep> > remaining; | 45 WillBeHeapVector<OwnPtrWillBeMember<CustomElementMicrotaskStep>> remaining; |
| 46 | 46 |
| 47 for (unsigned i = 0; i < m_queue.size(); ++i) { | 47 for (unsigned i = 0; i < m_queue.size(); ++i) { |
| 48 if (CustomElementMicrotaskStep::Processing == m_queue[i]->process()) | 48 if (CustomElementMicrotaskStep::Processing == m_queue[i]->process()) |
| 49 remaining.append(m_queue[i].release()); | 49 remaining.append(m_queue[i].release()); |
| 50 } | 50 } |
| 51 | 51 |
| 52 m_queue.swap(remaining); | 52 m_queue.swap(remaining); |
| 53 } | 53 } |
| 54 | 54 |
| 55 } // namespace blink | 55 } // namespace blink |
| OLD | NEW |