Home | History | Annotate | Download | only in platform
      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     template <typename U>
     77     WebVector(const U* values, size_t size)
     78     {
     79         initializeFrom(values, size);
     80     }
     81 
     82     WebVector(const WebVector<T>& other)
     83     {
     84         initializeFrom(other.m_ptr, other.m_size);
     85     }
     86 
     87     template <typename C>
     88     WebVector(const C& other)
     89     {
     90         initializeFrom(other.size() ? &other[0] : 0, other.size());
     91     }
     92 
     93     WebVector& operator=(const WebVector& other)
     94     {
     95         if (this != &other)
     96             assign(other);
     97         return *this;
     98     }
     99 
    100     template <typename C>
    101     WebVector<T>& operator=(const C& other)
    102     {
    103         if (this != reinterpret_cast<const WebVector<T>*>(&other))
    104             assign(other);
    105         return *this;
    106     }
    107 
    108     template <typename C>
    109     void assign(const C& other)
    110     {
    111         assign(other.size() ? &other[0] : 0, other.size());
    112     }
    113 
    114     template <typename U>
    115     void assign(const U* values, size_t size)
    116     {
    117         destroy();
    118         initializeFrom(values, size);
    119     }
    120 
    121     size_t size() const { return m_size; }
    122     bool isEmpty() const { return !m_size; }
    123 
    124     T& operator[](size_t i)
    125     {
    126         WEBKIT_ASSERT(i < m_size);
    127         return m_ptr[i];
    128     }
    129     const T& operator[](size_t i) const
    130     {
    131         WEBKIT_ASSERT(i < m_size);
    132         return m_ptr[i];
    133     }
    134 
    135     bool contains(const T& value) const
    136     {
    137         for (size_t i = 0; i < m_size; i++) {
    138             if (m_ptr[i] == value)
    139                 return true;
    140         }
    141         return false;
    142     }
    143 
    144     T* data() { return m_ptr; }
    145     const T* data() const { return m_ptr; }
    146 
    147     void swap(WebVector<T>& other)
    148     {
    149         std::swap(m_ptr, other.m_ptr);
    150         std::swap(m_size, other.m_size);
    151     }
    152 
    153 private:
    154     void initialize(size_t size)
    155     {
    156         m_size = size;
    157         if (!m_size)
    158             m_ptr = 0;
    159         else {
    160             m_ptr = static_cast<T*>(::operator new(sizeof(T) * m_size));
    161             for (size_t i = 0; i < m_size; ++i)
    162                 new (&m_ptr[i]) T();
    163         }
    164     }
    165 
    166     template <typename U>
    167     void initializeFrom(const U* values, size_t size)
    168     {
    169         m_size = size;
    170         if (!m_size)
    171             m_ptr = 0;
    172         else {
    173             m_ptr = static_cast<T*>(::operator new(sizeof(T) * m_size));
    174             for (size_t i = 0; i < m_size; ++i)
    175                 new (&m_ptr[i]) T(values[i]);
    176         }
    177     }
    178 
    179     void destroy()
    180     {
    181         for (size_t i = 0; i < m_size; ++i)
    182             m_ptr[i].~T();
    183         ::operator delete(m_ptr);
    184     }
    185 
    186     T* m_ptr;
    187     size_t m_size;
    188 };
    189 
    190 } // namespace WebKit
    191 
    192 #endif
    193