forked from enlightenment/efl
732 lines
18 KiB
C++
732 lines
18 KiB
C++
#ifndef EINA_INARRAY_HH_
|
|
#define EINA_INARRAY_HH_
|
|
|
|
#include <Eina.h>
|
|
#include <eina_type_traits.hh>
|
|
#include <eina_range_types.hh>
|
|
|
|
#include <iterator>
|
|
#include <cstring>
|
|
#include <cassert>
|
|
|
|
namespace efl { namespace eina {
|
|
|
|
struct _inarray_access_traits {
|
|
|
|
template <typename T>
|
|
struct const_iterator
|
|
{
|
|
typedef T const* type;
|
|
};
|
|
template <typename T>
|
|
struct iterator
|
|
{
|
|
typedef T* type;
|
|
};
|
|
template <typename T>
|
|
struct const_native_handle
|
|
{
|
|
typedef Eina_Inarray const* type;
|
|
};
|
|
template <typename T>
|
|
struct native_handle
|
|
{
|
|
typedef Eina_Inarray* type;
|
|
};
|
|
|
|
template <typename T>
|
|
static Eina_Inarray* native_handle_from_const(Eina_Inarray const* array)
|
|
{
|
|
return const_cast<Eina_Inarray*>(array);
|
|
}
|
|
template <typename T>
|
|
static T& back(Eina_Inarray* raw)
|
|
{
|
|
assert(!_inarray_access_traits::empty<T>(raw));
|
|
return *static_cast<T*>( ::eina_inarray_nth(raw, _inarray_access_traits::size<T>(raw)-1u));
|
|
}
|
|
template <typename T>
|
|
static T const& back(Eina_Inarray const* raw)
|
|
{
|
|
return _inarray_access_traits::back<T>(const_cast<Eina_Inarray*>(raw));
|
|
}
|
|
template <typename T>
|
|
static T& front(Eina_Inarray* raw)
|
|
{
|
|
assert(!empty<T>(raw));
|
|
return *static_cast<T*>( ::eina_inarray_nth(raw, 0u));
|
|
}
|
|
template <typename T>
|
|
static T const& front(Eina_Inarray const* raw)
|
|
{
|
|
return _inarray_access_traits::front<T>(const_cast<Eina_Inarray*>(raw));
|
|
}
|
|
template <typename T>
|
|
static T* begin(Eina_Inarray* raw)
|
|
{
|
|
return !raw->members ? 0 : static_cast<T*>( ::eina_inarray_nth(raw, 0u));
|
|
}
|
|
template <typename T>
|
|
static T* end(Eina_Inarray* raw)
|
|
{
|
|
return !raw->members ? 0
|
|
: static_cast<T*>( ::eina_inarray_nth(raw, _inarray_access_traits::size<T>(raw) -1)) + 1;
|
|
}
|
|
template <typename T>
|
|
static T const* begin(Eina_Inarray const* raw)
|
|
{
|
|
return _inarray_access_traits::begin<T>(const_cast<Eina_Inarray*>(raw));
|
|
}
|
|
template <typename T>
|
|
static T const* end(Eina_Inarray const* raw)
|
|
{
|
|
return _inarray_access_traits::end<T>(const_cast<Eina_Inarray*>(raw));
|
|
}
|
|
template <typename T>
|
|
static std::reverse_iterator<T const*> rbegin(Eina_Inarray const* raw)
|
|
{
|
|
return std::reverse_iterator<T const*>(_inarray_access_traits::begin<T>(raw));
|
|
}
|
|
template <typename T>
|
|
static std::reverse_iterator<T const*> rend(Eina_Inarray const* raw)
|
|
{
|
|
return std::reverse_iterator<T const*>(_inarray_access_traits::end<T>(raw));
|
|
}
|
|
template <typename T>
|
|
static std::reverse_iterator<T*> rbegin(Eina_Inarray* raw)
|
|
{
|
|
return std::reverse_iterator<T*>(_inarray_access_traits::begin<T>(raw));
|
|
}
|
|
template <typename T>
|
|
static std::reverse_iterator<T*> rend(Eina_Inarray* raw)
|
|
{
|
|
return std::reverse_iterator<T*>(_inarray_access_traits::end<T>(raw));
|
|
}
|
|
template <typename T>
|
|
static T const* cbegin(Eina_Inarray const* raw)
|
|
{
|
|
return _inarray_access_traits::begin<T>(raw);
|
|
}
|
|
template <typename T>
|
|
static T const* cend(Eina_Inarray const* raw)
|
|
{
|
|
return _inarray_access_traits::end<T>(raw);
|
|
}
|
|
template <typename T>
|
|
static std::reverse_iterator<T const*> crbegin(Eina_Inarray const* raw)
|
|
{
|
|
return _inarray_access_traits::rbegin<T const*>(raw);
|
|
}
|
|
template <typename T>
|
|
static std::reverse_iterator<T const*> crend(Eina_Inarray const* raw)
|
|
{
|
|
return _inarray_access_traits::rend<T const*>(raw);
|
|
}
|
|
template <typename T>
|
|
static inline bool empty(Eina_Inarray const* raw)
|
|
{
|
|
return _inarray_access_traits::size<T>(raw) == 0;
|
|
}
|
|
template <typename T>
|
|
static inline std::size_t size(Eina_Inarray const* raw)
|
|
{
|
|
return ::eina_inarray_count(raw);
|
|
}
|
|
template <typename T>
|
|
static T const& index(Eina_Inarray const* raw, std::size_t i)
|
|
{
|
|
return *(_inarray_access_traits::begin<T>(raw) + i);
|
|
}
|
|
template <typename T>
|
|
static T& index(Eina_Inarray* raw, std::size_t i)
|
|
{
|
|
return *(_inarray_access_traits::begin<T>(raw) + i);
|
|
}
|
|
|
|
};
|
|
|
|
template <typename T>
|
|
struct inarray;
|
|
|
|
template <typename T>
|
|
struct range_inarray : _range_template<T, _inarray_access_traits>
|
|
{
|
|
typedef _range_template<T, _inarray_access_traits> _base_type;
|
|
typedef typename std::remove_const<T>::type value_type;
|
|
|
|
range_inarray(Eina_Inarray* array)
|
|
: _base_type(array)
|
|
{}
|
|
range_inarray(inarray<T>& array)
|
|
: _base_type(array.native_handle())
|
|
{}
|
|
|
|
value_type& operator[](std::size_t index) const
|
|
{
|
|
return _inarray_access_traits::index<T>(this->native_handle(), index);
|
|
}
|
|
};
|
|
|
|
struct _inarray_common_base
|
|
{
|
|
typedef std::size_t size_type;
|
|
typedef Eina_Inarray* native_handle_type;
|
|
typedef Eina_Inarray const* const_native_handle_type;
|
|
|
|
explicit _inarray_common_base(Eina_Inarray* array)
|
|
: _array(array) {}
|
|
explicit _inarray_common_base(size_type member_size)
|
|
: _array( ::eina_inarray_new(member_size, 0) )
|
|
{
|
|
}
|
|
~_inarray_common_base()
|
|
{
|
|
::eina_inarray_free(_array);
|
|
}
|
|
|
|
size_type size() const
|
|
{
|
|
return _inarray_access_traits::size<void>(_array);
|
|
}
|
|
bool empty() const
|
|
{
|
|
return _inarray_access_traits::empty<void>(_array);
|
|
}
|
|
native_handle_type native_handle() { return _array; }
|
|
const_native_handle_type native_handle() const { return _array; }
|
|
|
|
Eina_Inarray* _array;
|
|
private:
|
|
_inarray_common_base(_inarray_common_base const& other);
|
|
_inarray_common_base& operator=(_inarray_common_base const& other);
|
|
};
|
|
|
|
template <typename T>
|
|
class _pod_inarray : _inarray_common_base
|
|
{
|
|
typedef _inarray_common_base _base_type;
|
|
public:
|
|
typedef T value_type;
|
|
typedef T& reference;
|
|
typedef T const& const_reference;
|
|
typedef T* pointer;
|
|
typedef T const* const_pointer;
|
|
typedef pointer iterator;
|
|
typedef const_pointer const_iterator;
|
|
typedef std::size_t size_type;
|
|
typedef std::ptrdiff_t difference_type;
|
|
typedef _base_type::native_handle_type native_handle_type;
|
|
typedef _base_type::const_native_handle_type const_native_handle_type;
|
|
|
|
typedef std::reverse_iterator<iterator> reverse_iterator;
|
|
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
|
|
|
|
using _base_type::size;
|
|
using _base_type::empty;
|
|
using _base_type::native_handle;
|
|
|
|
_pod_inarray(Eina_Inarray* array)
|
|
: _base_type(array) {}
|
|
_pod_inarray() : _base_type(sizeof(T))
|
|
{
|
|
}
|
|
_pod_inarray(size_type n, value_type const& t) : _base_type(sizeof(T))
|
|
{
|
|
while(n--)
|
|
push_back(t);
|
|
}
|
|
template <typename InputIterator>
|
|
_pod_inarray(InputIterator i, InputIterator const& j
|
|
, typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
|
|
: _base_type(sizeof(T))
|
|
{
|
|
while(i != j)
|
|
{
|
|
push_back(*i);
|
|
++i;
|
|
}
|
|
}
|
|
_pod_inarray(_pod_inarray<T>const& other)
|
|
: _base_type(sizeof(T))
|
|
{
|
|
insert(end(), other.begin(), other.end());
|
|
}
|
|
~_pod_inarray()
|
|
{
|
|
}
|
|
_pod_inarray<T>& operator=(_pod_inarray<T>const& other)
|
|
{
|
|
clear();
|
|
insert(end(), other.begin(), other.end());
|
|
return *this;
|
|
}
|
|
void clear()
|
|
{
|
|
::eina_inarray_flush(_array);
|
|
}
|
|
void push_back(T const& value)
|
|
{
|
|
size_type s = size();
|
|
eina_inarray_push(_array, &value);
|
|
assert(size() != s);
|
|
assert(size() == s + 1u);
|
|
}
|
|
void pop_back()
|
|
{
|
|
eina_inarray_pop(_array);
|
|
}
|
|
iterator insert(iterator i, value_type const& t)
|
|
{
|
|
if(i != end())
|
|
{
|
|
T* q = static_cast<iterator>
|
|
( ::eina_inarray_alloc_at(_array, i - begin(), 1u));
|
|
std::memcpy(q, &t, sizeof(t));
|
|
return q;
|
|
}
|
|
else
|
|
{
|
|
push_back(t);
|
|
return end()-1;
|
|
}
|
|
}
|
|
iterator insert(iterator i, size_t n, value_type const& t)
|
|
{
|
|
T* q;
|
|
if(i != end())
|
|
{
|
|
q = static_cast<iterator>
|
|
( ::eina_inarray_alloc_at(_array, i - &_array->members, n));
|
|
}
|
|
else
|
|
{
|
|
q = eina_inarray_grow(_array, n);
|
|
}
|
|
for(T* p = q; n; --n, ++p)
|
|
std::memcpy(p, &t, sizeof(t));
|
|
return q;
|
|
}
|
|
template <typename InputIterator>
|
|
iterator insert(iterator p, InputIterator i, InputIterator j
|
|
, typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
|
|
{
|
|
size_type n = 0;
|
|
while(i != j)
|
|
{
|
|
p = insert(p, *i);
|
|
++p;
|
|
++i;
|
|
++n;
|
|
}
|
|
return p - n;
|
|
}
|
|
iterator erase(iterator q)
|
|
{
|
|
::eina_inarray_remove_at(_array, q - begin());
|
|
return q;
|
|
}
|
|
iterator erase(iterator i, iterator j)
|
|
{
|
|
while(i != j)
|
|
{
|
|
erase(--j);
|
|
}
|
|
return i;
|
|
}
|
|
template <typename InputIterator>
|
|
void assign(InputIterator i, InputIterator j
|
|
, typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0);
|
|
void assign(size_type n, value_type const& t);
|
|
value_type& operator[](size_type i)
|
|
{
|
|
return *(begin() + i);
|
|
}
|
|
value_type const& operator[](size_type i) const
|
|
{
|
|
return const_cast<inarray<T>&>(*this)[i];
|
|
}
|
|
value_type& back()
|
|
{
|
|
return _inarray_access_traits::back<value_type>(_array);
|
|
}
|
|
value_type const& back() const
|
|
{
|
|
return _inarray_access_traits::back<value_type>(_array);
|
|
}
|
|
value_type& front()
|
|
{
|
|
return _inarray_access_traits::front<value_type>(_array);
|
|
}
|
|
value_type const& front() const
|
|
{
|
|
return _inarray_access_traits::front<value_type>(_array);
|
|
}
|
|
iterator begin()
|
|
{
|
|
return _inarray_access_traits::begin<value_type>(_array);
|
|
}
|
|
iterator end()
|
|
{
|
|
return _inarray_access_traits::end<value_type>(_array);
|
|
}
|
|
const_iterator begin() const
|
|
{
|
|
return _inarray_access_traits::begin<value_type>(_array);
|
|
}
|
|
const_iterator end() const
|
|
{
|
|
return _inarray_access_traits::end<value_type>(_array);
|
|
}
|
|
const_reverse_iterator rbegin() const
|
|
{
|
|
return _inarray_access_traits::rbegin<value_type>(_array);
|
|
}
|
|
const_reverse_iterator rend() const
|
|
{
|
|
return _inarray_access_traits::rend<value_type>(_array);
|
|
}
|
|
reverse_iterator rbegin()
|
|
{
|
|
return _inarray_access_traits::rbegin<value_type>(_array);
|
|
}
|
|
reverse_iterator rend()
|
|
{
|
|
return _inarray_access_traits::rend<value_type>(_array);
|
|
}
|
|
const_iterator cbegin() const
|
|
{
|
|
return _inarray_access_traits::cbegin<value_type>(_array);
|
|
}
|
|
const_iterator cend() const
|
|
{
|
|
return _inarray_access_traits::cend<value_type>(_array);
|
|
}
|
|
const_reverse_iterator crbegin() const
|
|
{
|
|
return _inarray_access_traits::crbegin<value_type>(_array);
|
|
}
|
|
const_reverse_iterator crend() const
|
|
{
|
|
return _inarray_access_traits::crend<value_type>(_array);
|
|
}
|
|
void swap(_pod_inarray<T>& other)
|
|
{
|
|
std::swap(_array, other._array);
|
|
}
|
|
size_type max_size() const { return -1; }
|
|
|
|
Eina_Inarray* native_handle()
|
|
{
|
|
return this->_array;
|
|
}
|
|
Eina_Inarray const* native_handle() const
|
|
{
|
|
return this->_array;
|
|
}
|
|
};
|
|
|
|
template <typename T>
|
|
class _nonpod_inarray : _inarray_common_base
|
|
{
|
|
typedef _inarray_common_base _base_type;
|
|
public:
|
|
typedef T value_type;
|
|
typedef T& reference;
|
|
typedef T const& const_reference;
|
|
typedef T* pointer;
|
|
typedef T const* const_pointer;
|
|
typedef pointer iterator;
|
|
typedef const_pointer const_iterator;
|
|
typedef std::size_t size_type;
|
|
typedef std::ptrdiff_t difference_type;
|
|
|
|
typedef std::reverse_iterator<iterator> reverse_iterator;
|
|
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
|
|
|
|
using _base_type::size;
|
|
using _base_type::empty;
|
|
|
|
_nonpod_inarray(Eina_Inarray* array)
|
|
: _base_type(array) {}
|
|
_nonpod_inarray() : _base_type(sizeof(T))
|
|
{
|
|
}
|
|
_nonpod_inarray(size_type n, value_type const& t) : _base_type(sizeof(T))
|
|
{
|
|
while(n--)
|
|
push_back(t);
|
|
}
|
|
template <typename InputIterator>
|
|
_nonpod_inarray(InputIterator i, InputIterator const& j
|
|
, typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
|
|
: _base_type(sizeof(T))
|
|
{
|
|
while(i != j)
|
|
{
|
|
push_back(*i);
|
|
++i;
|
|
}
|
|
}
|
|
_nonpod_inarray(_nonpod_inarray<T>const& other)
|
|
: _base_type(sizeof(T))
|
|
{
|
|
insert(end(), other.begin(), other.end());
|
|
}
|
|
~_nonpod_inarray()
|
|
{
|
|
for(T* first = static_cast<T*>(_array->members)
|
|
, *last = first + _array->len; first != last; ++first)
|
|
first->~T();
|
|
}
|
|
_nonpod_inarray<T>& operator=(_nonpod_inarray<T>const& other)
|
|
{
|
|
clear();
|
|
insert(end(), other.begin(), other.end());
|
|
return *this;
|
|
}
|
|
void clear()
|
|
{
|
|
for(T* first = static_cast<T*>(_array->members)
|
|
, *last = first + _array->len; first != last; ++first)
|
|
first->~T();
|
|
::eina_inarray_flush(_array);
|
|
}
|
|
void push_back(T const& value)
|
|
{
|
|
insert(end(), 1u, value);
|
|
}
|
|
void pop_back()
|
|
{
|
|
T* elem = static_cast<T*>(_array->members) + _array->len - 1;
|
|
elem->~T();
|
|
eina_inarray_pop(_array);
|
|
}
|
|
iterator insert(iterator i, value_type const& t)
|
|
{
|
|
return insert(i, 1u, t);
|
|
}
|
|
iterator insert(iterator i, size_t n, value_type const& t)
|
|
{
|
|
if(_array->max - _array->len >= n)
|
|
{
|
|
iterator end = static_cast<T*>(_array->members)
|
|
+ _array->len
|
|
, last = end + n;
|
|
_array->len += n;
|
|
std::reverse_iterator<iterator>
|
|
dest(last), src(end), src_end(i);
|
|
for(;src != src_end; ++src)
|
|
{
|
|
if(dest.base() <= end)
|
|
*dest++ = *src;
|
|
else
|
|
new (&*dest++) T(*src);
|
|
}
|
|
iterator j = i;
|
|
for(size_type i = 0;i != n;++i)
|
|
{
|
|
if(j < end)
|
|
*j = t;
|
|
else
|
|
new (&*j++) T(t);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
size_type index = i - static_cast<iterator>(_array->members);
|
|
|
|
Eina_Inarray* old_array = eina_inarray_new(_array->member_size, 0);
|
|
*old_array = *_array;
|
|
_array->len = _array->max = 0;
|
|
_array->members = 0;
|
|
eina_inarray_resize(_array, old_array->len+n);
|
|
_array->len = old_array->len+n;
|
|
|
|
iterator old_first = static_cast<iterator>(old_array->members)
|
|
, first = begin()
|
|
, last = first + _array->len;
|
|
i = index + begin();
|
|
|
|
while(first != i)
|
|
{
|
|
new (&*first++) T(*old_first);
|
|
old_first++->~T();
|
|
}
|
|
for(size_type i = 0;i != n;++i)
|
|
new (&*first++) T(t);
|
|
std::size_t diff = last - first;
|
|
assert(diff == _array->len - index - n);
|
|
while(first != last)
|
|
{
|
|
new (&*first++) T(*old_first);
|
|
old_first++->~T();
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
template <typename InputIterator>
|
|
iterator insert(iterator p, InputIterator i, InputIterator j
|
|
, typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
|
|
{
|
|
size_type n = 0;
|
|
while(i != j)
|
|
{
|
|
p = insert(p, *i);
|
|
++p;
|
|
++i;
|
|
++n;
|
|
}
|
|
return p - n;
|
|
}
|
|
iterator erase(iterator q)
|
|
{
|
|
return erase(q, q+1);
|
|
}
|
|
iterator erase(iterator i, iterator j)
|
|
{
|
|
iterator last = end();
|
|
iterator k = i, l = j;
|
|
while(l != last)
|
|
*k++ = *l++;
|
|
while(k != last)
|
|
k++->~T();
|
|
_array->len -= j - i;
|
|
|
|
return i;
|
|
}
|
|
template <typename InputIterator>
|
|
void assign(InputIterator i, InputIterator j
|
|
, typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0);
|
|
void assign(size_type n, value_type const& t);
|
|
value_type& operator[](size_type i)
|
|
{
|
|
return *(begin() + i);
|
|
}
|
|
value_type const& operator[](size_type i) const
|
|
{
|
|
return const_cast<inarray<T>&>(*this)[i];
|
|
}
|
|
value_type& back()
|
|
{
|
|
return _inarray_access_traits::back<value_type>(_array);
|
|
}
|
|
value_type const& back() const
|
|
{
|
|
return _inarray_access_traits::back<value_type>(_array);
|
|
}
|
|
value_type& front()
|
|
{
|
|
return _inarray_access_traits::front<value_type>(_array);
|
|
}
|
|
value_type const& front() const
|
|
{
|
|
return _inarray_access_traits::front<value_type>(_array);
|
|
}
|
|
iterator begin()
|
|
{
|
|
return _inarray_access_traits::begin<value_type>(_array);
|
|
}
|
|
iterator end()
|
|
{
|
|
return _inarray_access_traits::end<value_type>(_array);
|
|
}
|
|
const_iterator begin() const
|
|
{
|
|
return _inarray_access_traits::begin<value_type>(_array);
|
|
}
|
|
const_iterator end() const
|
|
{
|
|
return _inarray_access_traits::end<value_type>(_array);
|
|
}
|
|
const_reverse_iterator rbegin() const
|
|
{
|
|
return _inarray_access_traits::rbegin<value_type>(_array);
|
|
}
|
|
const_reverse_iterator rend() const
|
|
{
|
|
return _inarray_access_traits::rend<value_type>(_array);
|
|
}
|
|
reverse_iterator rbegin()
|
|
{
|
|
return _inarray_access_traits::rbegin<value_type>(_array);
|
|
}
|
|
reverse_iterator rend()
|
|
{
|
|
return _inarray_access_traits::rend<value_type>(_array);
|
|
}
|
|
const_iterator cbegin() const
|
|
{
|
|
return _inarray_access_traits::cbegin<value_type>(_array);
|
|
}
|
|
const_iterator cend() const
|
|
{
|
|
return _inarray_access_traits::cend<value_type>(_array);
|
|
}
|
|
const_reverse_iterator crbegin() const
|
|
{
|
|
return _inarray_access_traits::crbegin<value_type>(_array);
|
|
}
|
|
const_reverse_iterator crend() const
|
|
{
|
|
return _inarray_access_traits::crend<value_type>(_array);
|
|
}
|
|
void swap(_nonpod_inarray<T>& other)
|
|
{
|
|
std::swap(_array, other._array);
|
|
}
|
|
size_type max_size() const { return -1; }
|
|
|
|
Eina_Inarray* native_handle()
|
|
{
|
|
return this->_array;
|
|
}
|
|
Eina_Inarray const* native_handle() const
|
|
{
|
|
return this->_array;
|
|
}
|
|
};
|
|
|
|
template <typename T>
|
|
class inarray : public eina::if_<eina::is_pod<T>, _pod_inarray<T>
|
|
, _nonpod_inarray<T> >::type
|
|
{
|
|
typedef typename eina::if_<eina::is_pod<T>, _pod_inarray<T>
|
|
, _nonpod_inarray<T> >::type _base_type;
|
|
public:
|
|
inarray(Eina_Inarray* array)
|
|
: _base_type(array) {}
|
|
inarray() : _base_type() {}
|
|
inarray(typename _base_type::size_type n, typename _base_type::value_type const& t)
|
|
: _base_type(n, t) {}
|
|
template <typename InputIterator>
|
|
inarray(InputIterator i, InputIterator const& j
|
|
, typename eina::enable_if<!eina::is_integral<InputIterator>::value>::type* = 0)
|
|
: _base_type(i, j)
|
|
{}
|
|
|
|
};
|
|
|
|
template <typename T>
|
|
bool operator==(inarray<T> const& lhs, inarray<T> const& rhs)
|
|
{
|
|
return lhs.size() == rhs.size() &&
|
|
std::equal(lhs.begin(), lhs.end(), rhs.begin());
|
|
}
|
|
|
|
template <typename T>
|
|
bool operator!=(inarray<T> const& lhs, inarray<T> const& rhs)
|
|
{
|
|
return !(lhs == rhs);
|
|
}
|
|
|
|
template <typename T>
|
|
void swap(inarray<T>& lhs, inarray<T>& rhs)
|
|
{
|
|
lhs.swap(rhs);
|
|
}
|
|
|
|
|
|
} }
|
|
|
|
#endif
|