QVarLengthArray< T, Prealloc > Class Template Reference

#include <qcontainerfwd.h>

Class Description

template<class T, int Prealloc>
class QVarLengthArray< T, Prealloc >

Definition at line 64 of file qcontainerfwd.h.

Public Types
typedef int	size_type
typedef T	value_type
typedef value_type *	pointer
typedef const value_type *	const_pointer
typedef value_type &	reference
typedef const value_type &	const_reference
typedef qptrdiff	difference_type
typedef T *	iterator
typedef const T *	const_iterator

Public Member Functions
	QVarLengthArray (int size=0)
	QVarLengthArray (const QVarLengthArray< T, Prealloc > &other)
	~QVarLengthArray ()
QVarLengthArray< T, Prealloc > &	operator= (const QVarLengthArray< T, Prealloc > &other)
void	removeLast ()
int	size () const
int	count () const
bool	isEmpty () const
void	resize (int size)
void	clear ()
int	capacity () const
void	reserve (int size)
T &	operator[] (int idx)
const T &	operator[] (int idx) const
const T &	at (int idx) const
T	value (int i) const
T	value (int i, const T &defaultValue) const
void	append (const T &t)
void	append (const T *buf, int size)
QVarLengthArray< T, Prealloc > &	operator<< (const T &t)
QVarLengthArray< T, Prealloc > &	operator+= (const T &t)
void	prepend (const T &t)
void	insert (int i, const T &t)
void	insert (int i, int n, const T &t)
void	replace (int i, const T &t)
void	remove (int i)
void	remove (int i, int n)
T *	data ()
const T *	data () const
const T *	constData () const
iterator	begin ()
const_iterator	begin () const
const_iterator	constBegin () const
iterator	end ()
const_iterator	end () const
const_iterator	constEnd () const
iterator	insert (iterator before, int n, const T &x)
iterator	insert (iterator before, const T &x)
iterator	erase (iterator begin, iterator end)
iterator	erase (iterator pos)

Friends
class	QPodList< T, Prealloc >

Member Typedef Documentation

typedef int size_type

Definition at line 145 of file qvarlengtharray.h.

typedef T value_type

Definition at line 146 of file qvarlengtharray.h.

typedef value_type* pointer

Definition at line 147 of file qvarlengtharray.h.

typedef const value_type* const_pointer

Definition at line 148 of file qvarlengtharray.h.

typedef value_type& reference

Definition at line 149 of file qvarlengtharray.h.

typedef const value_type& const_reference

Definition at line 150 of file qvarlengtharray.h.

typedef qptrdiff difference_type

Definition at line 151 of file qvarlengtharray.h.

typedef T* iterator

Definition at line 154 of file qvarlengtharray.h.

typedef const T* const_iterator

Definition at line 155 of file qvarlengtharray.h.

Constructor & Destructor Documentation

Q_INLINE_TEMPLATE QVarLengthArray ( int  size = 0 )

inlineexplicit

Definition at line 184 of file qvarlengtharray.h.

    : s(asize) {
    if (s > Prealloc) {
        ptr = reinterpret_cast<T *>(qMalloc(s * sizeof(T)));
        Q_CHECK_PTR(ptr);
        a = s;
    } else {
        ptr = reinterpret_cast<T *>(array);
        a = Prealloc;
    }
    if (QTypeInfo<T>::isComplex) {
        T *i = ptr + s;
        while (i != ptr)
            new (--i) T;
    }
}

QVarLengthArray ( const QVarLengthArray< T, Prealloc > &  other )

inline

Definition at line 68 of file qvarlengtharray.h.

        : a(Prealloc), s(0), ptr(reinterpret_cast<T *>(array))
    {
        append(other.constData(), other.size());
    }

~QVarLengthArray ( )

inline

Definition at line 74 of file qvarlengtharray.h.

                              {
        if (QTypeInfo<T>::isComplex) {
            T *i = ptr + s;
            while (i-- != ptr)
                i->~T();
        }
        if (ptr != reinterpret_cast<T *>(array))
            qFree(ptr);
    }

Member Function Documentation

QVarLengthArray<T, Prealloc>& operator= ( const QVarLengthArray< T, Prealloc > &  other )

inline

Definition at line 83 of file qvarlengtharray.h.

    {
        if (this != &other) {
            clear();
            append(other.constData(), other.size());
        }
        return *this;
    }

void removeLast ( )

inline

Definition at line 92 of file qvarlengtharray.h.

                             {
        Q_ASSERT(s > 0);
        realloc(s - 1, a);
    }

int size ( ) const

inline

Definition at line 96 of file qvarlengtharray.h.

{ return s; }

int count ( ) const

inline

Definition at line 97 of file qvarlengtharray.h.

{ return s; }

bool isEmpty ( ) const

inline

Definition at line 98 of file qvarlengtharray.h.

{ return (s == 0); }

Q_INLINE_TEMPLATE void resize ( int  size )

inline

Definition at line 202 of file qvarlengtharray.h.

{ realloc(asize, qMax(asize, a)); }

void clear ( )

inline

Definition at line 100 of file qvarlengtharray.h.

{ resize(0); }

int capacity ( ) const

inline

Definition at line 102 of file qvarlengtharray.h.

{ return a; }

Q_INLINE_TEMPLATE void reserve ( int  size )

inline

Definition at line 206 of file qvarlengtharray.h.

{ if (asize > a) realloc(s, asize); }

T& operator[] ( int  idx )

inline

Definition at line 105 of file qvarlengtharray.h.

                                  {
        Q_ASSERT(idx >= 0 && idx < s);
        return ptr[idx];
    }

const T& operator[] ( int  idx ) const

inline

Definition at line 109 of file qvarlengtharray.h.

                                              {
        Q_ASSERT(idx >= 0 && idx < s);
        return ptr[idx];
    }

const T& at ( int  idx ) const

inline

Definition at line 113 of file qvarlengtharray.h.

{ return operator[](idx); }

Q_OUTOFLINE_TEMPLATE T value

(

int

i

)

const

Definition at line 292 of file qvarlengtharray.h.

{
    if (i < 0 || i >= size()) {
        return T();
    }
    return at(i);
}

Q_OUTOFLINE_TEMPLATE T value	(	int	i,
		const T &	defaultValue
	)		const

Definition at line 300 of file qvarlengtharray.h.

{
    return (i < 0 || i >= size()) ? defaultValue : at(i);
}

void append ( const T &  t )

inline

Definition at line 118 of file qvarlengtharray.h.

                                   {
        if (s == a)   // i.e. s != 0
            realloc(s, s<<1);
        const int idx = s++;
        if (QTypeInfo<T>::isComplex) {
            new (ptr + idx) T(t);
        } else {
            ptr[idx] = t;
        }
    }

Q_OUTOFLINE_TEMPLATE void append	(	const T *	buf,
		int	size
	)

Definition at line 210 of file qvarlengtharray.h.

{
    Q_ASSERT(abuf);
    if (increment <= 0)
        return;

    const int asize = s + increment;

    if (asize >= a)
        realloc(s, qMax(s*2, asize));

    if (QTypeInfo<T>::isComplex) {
        // call constructor for new objects (which can throw)
        while (s < asize)
            new (ptr+(s++)) T(*abuf++);
    } else {
        qMemCopy(&ptr[s], abuf, increment * sizeof(T));
        s = asize;
    }
}

QVarLengthArray<T, Prealloc>& operator<< ( const T &  t )

inline

Definition at line 129 of file qvarlengtharray.h.

    { append(t); return *this; }

QVarLengthArray<T, Prealloc>& operator+= ( const T &  t )

inline

Definition at line 131 of file qvarlengtharray.h.

    { append(t); return *this; }

void prepend ( const T &  t )

inline

Definition at line 322 of file qvarlengtharray.h.

{ insert(begin(), 1, t); }

void insert ( int  i, const T &  t  )

inline

Definition at line 306 of file qvarlengtharray.h.

{ Q_ASSERT_X(i >= 0 && i <= s, "QVarLengthArray::insert", "index out of range");
  insert(begin() + i, 1, t); }

void insert ( int  i, int  n, const T &  t  )

inline

Definition at line 310 of file qvarlengtharray.h.

{ Q_ASSERT_X(i >= 0 && i <= s, "QVarLengthArray::insert", "index out of range");
  insert(begin() + i, n, t); }

void replace ( int  i, const T &  t  )

inline

Definition at line 326 of file qvarlengtharray.h.

{
    Q_ASSERT_X(i >= 0 && i < s, "QVarLengthArray::replace", "index out of range");
    const T copy(t);
    data()[i] = copy;
}

void remove ( int  i )

inline

Definition at line 318 of file qvarlengtharray.h.

{ Q_ASSERT_X(i >= 0 && i < s, "QVarLengthArray::remove", "index out of range");
  erase(begin() + i, begin() + i + 1); }

void remove ( int  i, int  n  )

inline

Definition at line 314 of file qvarlengtharray.h.

{ Q_ASSERT_X(i >= 0 && n >= 0 && i + n <= s, "QVarLengthArray::remove", "index out of range");
  erase(begin() + i, begin() + i + n); }

T* data ( )

inline

Definition at line 142 of file qvarlengtharray.h.

{ return ptr; }

const T* data ( ) const

inline

Definition at line 143 of file qvarlengtharray.h.

{ return ptr; }

const T* constData ( ) const

inline

Definition at line 144 of file qvarlengtharray.h.

{ return ptr; }

iterator begin ( )

inline

Definition at line 157 of file qvarlengtharray.h.

{ return ptr; }

const_iterator begin ( ) const

inline

Definition at line 158 of file qvarlengtharray.h.

{ return ptr; }

const_iterator constBegin ( ) const

inline

Definition at line 159 of file qvarlengtharray.h.

{ return ptr; }

iterator end ( )

inline

Definition at line 160 of file qvarlengtharray.h.

{ return ptr + s; }

const_iterator end ( ) const

inline

Definition at line 161 of file qvarlengtharray.h.

{ return ptr + s; }

const_iterator constEnd ( ) const

inline

Definition at line 162 of file qvarlengtharray.h.

{ return ptr + s; }

Q_OUTOFLINE_TEMPLATE QVarLengthArray< T, Prealloc >::iterator insert	(	iterator	before,
		int	n,
		const T &	x
	)

Definition at line 335 of file qvarlengtharray.h.

{
    int offset = int(before - ptr);
    if (n != 0) {
        resize(s + n);
        const T copy(t);
        if (QTypeInfo<T>::isStatic) {
            T *b = ptr + offset;
            T *j = ptr + s;
            T *i = j - n;
            while (i != b)
                *--j = *--i;
            i = b + n;
            while (i != b)
                *--i = copy;
        } else {
            T *b = ptr + offset;
            T *i = b + n;
            memmove(i, b, (s - offset - n) * sizeof(T));
            while (i != b)
                new (--i) T(copy);
        }
    }
    return ptr + offset;
}

iterator insert ( iterator  before, const T &  x  )

inline

Definition at line 164 of file qvarlengtharray.h.

{ return insert(before, 1, x); }

Q_OUTOFLINE_TEMPLATE QVarLengthArray< T, Prealloc >::iterator erase	(	iterator	begin,
		iterator	end
	)

Definition at line 362 of file qvarlengtharray.h.

{
    int f = int(abegin - ptr);
    int l = int(aend - ptr);
    int n = l - f;
    if (QTypeInfo<T>::isComplex) {
        qCopy(ptr + l, ptr + s, ptr + f);
        T *i = ptr + s;
        T *b = ptr + s - n;
        while (i != b) {
            --i;
            i->~T();
        }
    } else {
        memmove(ptr + f, ptr + l, (s - l) * sizeof(T));
    }
    s -= n;
    return ptr + f;
}

iterator erase ( iterator  pos )

inline

Definition at line 166 of file qvarlengtharray.h.

{ return erase(pos, pos+1); }

Friends And Related Function Documentation

friend class QPodList< T, Prealloc >

friend

Definition at line 169 of file qvarlengtharray.h.

Member Data Documentation

char array[sizeof(qint64)*(((Prealloc *sizeof(T))/sizeof(qint64))+1)]

Definition at line 177 of file qvarlengtharray.h.

qint64 q_for_alignment_1

Definition at line 178 of file qvarlengtharray.h.

double q_for_alignment_2

Definition at line 179 of file qvarlengtharray.h.

---

The documentation for this class was generated from the following files:

• QtCore/qcontainerfwd.h
• QtCore/qvarlengtharray.h