| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright (C) 2009 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 are | |
| 6 * met: | |
| 7 * | |
| 8 * * Redistributions of source code must retain the above copyright | |
| 9 * notice, this list of conditions and the following disclaimer. | |
| 10 * * Redistributions in binary form must reproduce the above | |
| 11 * copyright notice, this list of conditions and the following disclaimer | |
| 12 * in the documentation and/or other materials provided with the | |
| 13 * distribution. | |
| 14 * * Neither the name of Google Inc. nor the names of its | |
| 15 * contributors may be used to endorse or promote products derived from | |
| 16 * this software without specific prior written permission. | |
| 17 * | |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 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. | |
| 29 */ | |
| 30 | |
| 31 #ifndef WebVector_h | |
| 32 #define WebVector_h | |
| 33 | |
| 34 #include "WebCommon.h" | |
| 35 | |
| 36 #include <algorithm> | |
| 37 | |
| 38 namespace WebKit { | |
| 39 | |
| 40 // A simple vector class. | |
| 41 // | |
| 42 // Sample usage: | |
| 43 // | |
| 44 // void Foo(WebVector<int>& result) | |
| 45 // { | |
| 46 // WebVector<int> data(10); | |
| 47 // for (size_t i = 0; i < data.size(); ++i) | |
| 48 // data[i] = ... | |
| 49 // result.swap(data); | |
| 50 // } | |
| 51 // | |
| 52 // It is also possible to assign from other types of random access | |
| 53 // containers: | |
| 54 // | |
| 55 // void Foo(const std::vector<std::string>& input) | |
| 56 // { | |
| 57 // WebVector<WebCString> cstrings = input; | |
| 58 // ... | |
| 59 // } | |
| 60 // | |
| 61 template <typename T> | |
| 62 class WebVector { | |
| 63 public: | |
| 64 typedef T ValueType; | |
| 65 | |
| 66 ~WebVector() | |
| 67 { | |
| 68 destroy(); | |
| 69 } | |
| 70 | |
| 71 explicit WebVector(size_t size = 0) | |
| 72 { | |
| 73 initialize(size); | |
| 74 } | |
| 75 | |
| 76 WebVector(const WebVector<T>& other) | |
| 77 { | |
| 78 initializeFrom(other.m_ptr, other.m_size); | |
| 79 } | |
| 80 | |
| 81 template <typename C> | |
| 82 WebVector(const C& other) | |
| 83 { | |
| 84 initializeFrom(other.size() ? &other[0] : 0, other.size()); | |
| 85 } | |
| 86 | |
| 87 template <typename C> | |
| 88 WebVector<T>& operator=(const C& other) | |
| 89 { | |
| 90 if (this != reinterpret_cast<const WebVector<T>*>(&other)) | |
| 91 assign(other); | |
| 92 return *this; | |
| 93 } | |
| 94 | |
| 95 template <typename C> | |
| 96 void assign(const C& other) | |
| 97 { | |
| 98 assign(other.size() ? &other[0] : 0, other.size()); | |
| 99 } | |
| 100 | |
| 101 template <typename U> | |
| 102 void assign(const U* values, size_t size) | |
| 103 { | |
| 104 destroy(); | |
| 105 initializeFrom(values, size); | |
| 106 } | |
| 107 | |
| 108 size_t size() const { return m_size; } | |
| 109 bool isEmpty() const { return !m_size; } | |
| 110 | |
| 111 T& operator[](size_t i) { return m_ptr[i]; } | |
| 112 const T& operator[](size_t i) const { return m_ptr[i]; } | |
| 113 | |
| 114 T* data() { return m_ptr; } | |
| 115 const T* data() const { return m_ptr; } | |
| 116 | |
| 117 void swap(WebVector<T>& other) | |
| 118 { | |
| 119 std::swap(m_ptr, other.m_ptr); | |
| 120 std::swap(m_size, other.m_size); | |
| 121 } | |
| 122 | |
| 123 private: | |
| 124 void initialize(size_t size) | |
| 125 { | |
| 126 m_size = size; | |
| 127 if (!m_size) | |
| 128 m_ptr = 0; | |
| 129 else { | |
| 130 m_ptr = static_cast<T*>(::operator new(sizeof(T) * m_size)); | |
| 131 for (size_t i = 0; i < m_size; ++i) | |
| 132 new (&m_ptr[i]) T(); | |
| 133 } | |
| 134 } | |
| 135 | |
| 136 template <typename U> | |
| 137 void initializeFrom(const U* values, size_t size) | |
| 138 { | |
| 139 m_size = size; | |
| 140 if (!m_size) | |
| 141 m_ptr = 0; | |
| 142 else { | |
| 143 m_ptr = static_cast<T*>(::operator new(sizeof(T) * m_size)); | |
| 144 for (size_t i = 0; i < m_size; ++i) | |
| 145 new (&m_ptr[i]) T(values[i]); | |
| 146 } | |
| 147 } | |
| 148 | |
| 149 void destroy() | |
| 150 { | |
| 151 for (size_t i = 0; i < m_size; ++i) | |
| 152 m_ptr[i].~T(); | |
| 153 ::operator delete(m_ptr); | |
| 154 } | |
| 155 | |
| 156 T* m_ptr; | |
| 157 size_t m_size; | |
| 158 }; | |
| 159 | |
| 160 } // namespace WebKit | |
| 161 | |
| 162 #endif | |
| OLD | NEW |