| /* |
| * Copyright (C) 2007, 2008, 2010, 2011, 2012 Apple Inc. All rights reserved. |
| * |
| * This library is free software; you can redistribute it and/or |
| * modify it under the terms of the GNU Library General Public |
| * License as published by the Free Software Foundation; either |
| * version 2 of the License, or (at your option) any later version. |
| * |
| * This library is distributed in the hope that it will be useful, |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| * Library General Public License for more details. |
| * |
| * You should have received a copy of the GNU Library General Public License |
| * along with this library; see the file COPYING.LIB. If not, write to |
| * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| * Boston, MA 02111-1307, USA. |
| * |
| */ |
| |
| #ifndef SpaceSplitString_h |
| #define SpaceSplitString_h |
| |
| #include "wtf/Allocator.h" |
| #include "wtf/RefCounted.h" |
| #include "wtf/Vector.h" |
| #include "wtf/text/AtomicString.h" |
| |
| namespace blink { |
| |
| class SpaceSplitString { |
| USING_FAST_MALLOC(SpaceSplitString); |
| |
| public: |
| enum CaseFolding { ShouldNotFoldCase, ShouldFoldCase }; |
| SpaceSplitString() {} |
| SpaceSplitString(const AtomicString& string, CaseFolding caseFolding) { |
| set(string, caseFolding); |
| } |
| |
| bool operator!=(const SpaceSplitString& other) const { |
| return m_data != other.m_data; |
| } |
| |
| void set(const AtomicString&, CaseFolding); |
| void clear() { m_data.clear(); } |
| |
| bool contains(const AtomicString& string) const { |
| return m_data && m_data->contains(string); |
| } |
| bool containsAll(const SpaceSplitString& names) const { |
| return !names.m_data || (m_data && m_data->containsAll(*names.m_data)); |
| } |
| void add(const AtomicString&); |
| bool remove(const AtomicString&); |
| |
| size_t size() const { return m_data ? m_data->size() : 0; } |
| bool isNull() const { return !m_data; } |
| const AtomicString& operator[](size_t i) const { return (*m_data)[i]; } |
| |
| private: |
| class Data : public RefCounted<Data> { |
| public: |
| static PassRefPtr<Data> create(const AtomicString&); |
| static PassRefPtr<Data> createUnique(const Data&); |
| |
| ~Data(); |
| |
| bool contains(const AtomicString& string) { |
| size_t size = m_vector.size(); |
| for (size_t i = 0; i < size; ++i) { |
| if (m_vector[i] == string) |
| return true; |
| } |
| return false; |
| } |
| |
| bool containsAll(Data&); |
| |
| void add(const AtomicString&); |
| void remove(unsigned index); |
| |
| bool isUnique() const { return m_keyString.isNull(); } |
| size_t size() const { return m_vector.size(); } |
| const AtomicString& operator[](size_t i) { return m_vector[i]; } |
| |
| private: |
| explicit Data(const AtomicString&); |
| explicit Data(const Data&); |
| |
| void createVector(const String&); |
| template <typename CharacterType> |
| inline void createVector(const CharacterType*, unsigned); |
| |
| AtomicString m_keyString; |
| Vector<AtomicString, 4> m_vector; |
| }; |
| typedef HashMap<AtomicString, Data*> DataMap; |
| |
| static DataMap& sharedDataMap(); |
| |
| void ensureUnique() { |
| if (m_data && !m_data->isUnique()) |
| m_data = Data::createUnique(*m_data); |
| } |
| |
| RefPtr<Data> m_data; |
| }; |
| |
| } // namespace blink |
| |
| #endif // SpaceSplitString_h |