| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2010 Google Inc. All rights reserved. | 2 * Copyright (C) 2010 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 13 matching lines...) Expand all Loading... |
| 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 "modules/filesystem/EntryArraySync.h" | 32 #include "modules/filesystem/EntryArraySync.h" |
| 33 | 33 |
| 34 #include "modules/filesystem/EntryArray.h" | 34 #include "modules/filesystem/Entry.h" |
| 35 | 35 |
| 36 namespace WebCore { | 36 namespace WebCore { |
| 37 | 37 |
| 38 PassRefPtr<EntryArraySync> EntryArraySync::create(EntryArray* entries) | 38 PassRefPtr<EntryArraySync> EntryArraySync::create(const EntryVector& entries) |
| 39 { | 39 { |
| 40 RefPtr<EntryArraySync> entriesSync = adoptRef(new EntryArraySync()); | 40 RefPtr<EntryArraySync> entriesSync = adoptRef(new EntryArraySync()); |
| 41 if (entries) { | 41 for (size_t i = 0; i < entries.size(); ++i) |
| 42 for (unsigned i = 0; i < entries->length(); ++i) | 42 entriesSync->append(EntrySync::create(entries[i].get())); |
| 43 entriesSync->append(EntrySync::create(entries->item(i))); | |
| 44 } | |
| 45 return entriesSync.release(); | 43 return entriesSync.release(); |
| 46 } | 44 } |
| 47 | 45 |
| 48 EntryArraySync::EntryArraySync() | 46 EntryArraySync::EntryArraySync() |
| 49 { | 47 { |
| 50 ScriptWrappable::init(this); | 48 ScriptWrappable::init(this); |
| 51 } | 49 } |
| 52 | 50 |
| 53 EntrySync* EntryArraySync::item(unsigned index) const | 51 EntrySync* EntryArraySync::item(unsigned index) const |
| 54 { | 52 { |
| 55 if (index >= m_entries.size()) | 53 if (index >= m_entries.size()) |
| 56 return 0; | 54 return 0; |
| 57 return m_entries[index].get(); | 55 return m_entries[index].get(); |
| 58 } | 56 } |
| 59 | 57 |
| 60 } | 58 } |
| OLD | NEW |