Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
4.4 kB · 159 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2002 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
#include <algorithm>
namespace Gecode { namespace Support {
/** * \brief Array with arbitrary number of elements * * \ingroup FuncSupport */ template<class T, class A> class DynamicArray { private: /// Memory allocator A& a; /// Size of array int n; /// Array elements T* x; /// Resize to at least \a n + 1 elements void resize(int n); public: /// Initialize with size \a n DynamicArray(A& a0, int n = 32); /// Initialize with size \a n DynamicArray(A& a0, unsigned int n); /// Copy elements from array \a da DynamicArray(const DynamicArray<T,A>& da); /// Release memory ~DynamicArray(void);
/// Assign array (copy elements from \a a) const DynamicArray<T,A>& operator =(const DynamicArray<T,A>& da);
/// Return element at position \a i (possibly resize) T& operator [](int i); /// Return element at position \a i (possibly resize) T& operator [](unsigned int i); /// Return element at position \a i const T& operator [](int i) const; /// Return element at position \a i const T& operator [](unsigned int i) const;
/// Cast in to pointer of type \a T operator T*(void); };
template<class T, class A> forceinline DynamicArray<T,A>::DynamicArray(A& a0, int n0) : a(a0), n(n0), x(a.template alloc<T>(n)) {}
template<class T, class A> forceinline DynamicArray<T,A>::DynamicArray(A& a0, unsigned int n0) : a(a0), n(static_cast<int>(n0)), x(a.template alloc<T>(n)) {}
template<class T, class A> forceinline DynamicArray<T,A>::DynamicArray(const DynamicArray<T,A>& da) : a(da.a), n(da.n), x(a.template alloc<T>(n)) { (void) heap.copy<T>(x,da.x,n); }
template<class T, class A> forceinline DynamicArray<T,A>::~DynamicArray(void) { a.free(x,n); }
template<class T, class A> forceinline const DynamicArray<T,A>& DynamicArray<T,A>::operator =(const DynamicArray<T,A>& da) { if (this != &da) { if (n < da.n) { a.free(x,n); n = da.n; x = a.template alloc<T>(n); } (void) heap.copy(x,da.x,n); } return *this; }
template<class T, class A> void DynamicArray<T,A>::resize(int i) { int m = std::max(i+1, (3*n)/2); x = a.realloc(x,n,m); n = m; }
template<class T, class A> forceinline T& DynamicArray<T,A>::operator [](int i) { if (i >= n) resize(i); assert(n > i); return x[i]; }
template<class T, class A> forceinline T& DynamicArray<T,A>::operator [](unsigned int i) { return operator [](static_cast<int>(i)); }
template<class T, class A> forceinline const T& DynamicArray<T,A>::operator [](int i) const { assert(n > i); return x[i]; }
template<class T, class A> forceinline const T& DynamicArray<T,A>::operator [](unsigned int i) const { return operator [](static_cast<int>(i)); }
template<class T, class A> forceinline DynamicArray<T,A>::operator T*(void) { return x; }
}}
// STATISTICS: support-any