Torne (Richard Coles) | 53e740f | 2013-05-09 18:38:43 +0100 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2010 Google Inc. All Rights Reserved. |
| 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions |
| 6 | * are met: |
| 7 | * 1. Redistributions of source code must retain the above copyright |
| 8 | * notice, this list of conditions and the following disclaimer. |
| 9 | * 2. Redistributions in binary form must reproduce the above copyright |
| 10 | * notice, this list of conditions and the following disclaimer in the |
| 11 | * documentation and/or other materials provided with the distribution. |
| 12 | * |
| 13 | * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY |
| 14 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 15 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 16 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR |
| 17 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 18 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 19 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| 20 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| 21 | * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 22 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 23 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 24 | */ |
| 25 | |
| 26 | #include "config.h" |
| 27 | #include "core/dom/DOMStringList.h" |
| 28 | |
| 29 | namespace WebCore { |
| 30 | |
| 31 | String DOMStringList::item(unsigned index) const |
| 32 | { |
| 33 | if (index >= m_strings.size()) |
| 34 | return String(); |
| 35 | return m_strings[index]; |
| 36 | } |
| 37 | |
| 38 | bool DOMStringList::contains(const String& string) const |
| 39 | { |
| 40 | // FIXME: Currently, all consumers of DOMStringList store fairly small lists and thus an O(n) |
| 41 | // algorithm is OK. But this may need to be optimized if larger amounts of data are |
| 42 | // stored in m_strings. |
| 43 | size_t count = m_strings.size(); |
| 44 | for (size_t i = 0; i < count; ++i) { |
| 45 | if (m_strings[i] == string) |
| 46 | return true; |
| 47 | } |
| 48 | return false; |
| 49 | } |
| 50 | |
| 51 | void DOMStringList::sort() |
| 52 | { |
| 53 | std::sort(m_strings.begin(), m_strings.end(), WTF::codePointCompareLessThan); |
| 54 | } |
| 55 | |
| 56 | } // namespace WebCore |