CurveBrush/CurveCreator.cpp, CurveBrush/CurveCreator.h, CurveBrush/CurveDisplayer.cpp, PLYImport/Importer.cpp, PtexExtractor/PtexPaintExporter.cpp, PtexExtractor/PtexPaintExporter.h, PtexExtractor/PtexUtilizer.cpp, PtexExtractor/PtexUtilizer.h, PtexImporter/PtexImporter.h, and STLExport/STLExporter.cpp.
#include <qvector.h>

Public Types |
|
| typedef T * | iterator |
| typedef const T * | const_iterator |
| 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 iterator | Iterator |
| typedef const_iterator | ConstIterator |
| typedef int | size_type |
Public Member Functions |
|
| QVector () | |
| QVector (int size) | |
| QVector (int size, const T &t) | |
| QVector (const QVector< T > &v) | |
| ~QVector () | |
| QVector< T > & | operator= (const QVector< T > &v) |
| bool | operator== (const QVector< T > &v) const |
| bool | operator!= (const QVector< T > &v) const |
| int | size () const |
| bool | isEmpty () const |
| void | resize (int size) |
| int | capacity () const |
| void | reserve (int size) |
| void | squeeze () |
| void | detach () |
| bool | isDetached () const |
| void | setSharable (bool sharable) |
| bool | isSharedWith (const QVector< T > &other) const |
| T * | data () |
| const T * | data () const |
| const T * | constData () const |
| void | clear () |
| const T & | at (int i) const |
| T & | operator[] (int i) |
| const T & | operator[] (int i) const |
| void | append (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) |
| QVector< T > & | fill (const T &t, int size=-1) |
| int | indexOf (const T &t, int from=0) const |
| int | lastIndexOf (const T &t, int from=-1) const |
| bool | contains (const T &t) const |
| int | count (const T &t) 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) |
| int | count () const |
| T & | first () |
| const T & | first () const |
| T & | last () |
| const T & | last () const |
| bool | startsWith (const T &t) const |
| bool | endsWith (const T &t) const |
| QVector< T > | mid (int pos, int length=-1) const |
| T | value (int i) const |
| T | value (int i, const T &defaultValue) const |
| void | push_back (const T &t) |
| void | push_front (const T &t) |
| void | pop_back () |
| void | pop_front () |
| bool | empty () const |
| T & | front () |
| const_reference | front () const |
| reference | back () |
| const_reference | back () const |
| QVector< T > & | operator+= (const QVector< T > &l) |
| QVector< T > | operator+ (const QVector< T > &l) const |
| QVector< T > & | operator+= (const T &t) |
| QVector< T > & | operator<< (const T &t) |
| QVector< T > & | operator<< (const QVector< T > &l) |
| QList< T > | toList () const |
| std::vector< T > | toStdVector () const |
Static Public Member Functions |
|
| static QVector< T > | fromList (const QList< T > &list) |
| static QVector< T > | fromStdVector (const std::vector< T > &vector) |
Friends |
|
| class | QRegion |
| typedef T* iterator |
| typedef const T* const_iterator |
| 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 const_iterator ConstIterator |
| typedef int size_type |
| QVector | ( | ) | [inline] |
| QVector | ( | int | size | ) | [explicit] |
| QVector | ( | int | size, |
| const T & | t | ||
| ) |
| ~QVector | ( | ) | [inline] |
| bool operator== | ( | const QVector< T > & | v | ) | const |
| bool operator!= | ( | const QVector< T > & | v | ) | const [inline] |
| int size | ( | ) | const [inline] |
| bool isEmpty | ( | ) | const [inline] |
| void resize | ( | int | size | ) |
| int capacity | ( | ) | const [inline] |
| void reserve | ( | int | size | ) |
| void squeeze | ( | ) | [inline] |
| void detach | ( | ) | [inline] |
| bool isDetached | ( | ) | const [inline] |
| void setSharable | ( | bool | sharable | ) | [inline] |
| bool isSharedWith | ( | const QVector< T > & | other | ) | const [inline] |
| T* data | ( | ) | [inline] |
| const T* data | ( | ) | const [inline] |
| const T* constData | ( | ) | const [inline] |
| void clear | ( | ) | [inline] |
| const T & at | ( | int | i | ) | const [inline] |
| T & operator[] | ( | int | i | ) | [inline] |
| const T & operator[] | ( | int | i | ) | const [inline] |
| void append | ( | const T & | t | ) |
Definition at line 545 of file qvector.h.
{
if (d->ref != 1 || d->size + 1 > d->alloc) {
const T copy(t);
realloc(d->size, QVectorData::grow(sizeOfTypedData(), d->size + 1, sizeof(T),
QTypeInfo<T>::isStatic));
if (QTypeInfo<T>::isComplex)
new (p->array + d->size) T(copy);
else
p->array[d->size] = copy;
} else {
if (QTypeInfo<T>::isComplex)
new (p->array + d->size) T(t);
else
p->array[d->size] = t;
}
++d->size;
}
| void prepend | ( | const T & | t | ) | [inline] |
| void insert | ( | int | i, |
| const T & | t | ||
| ) | [inline] |
| void insert | ( | int | i, |
| int | n, | ||
| const T & | t | ||
| ) | [inline] |
| void replace | ( | int | i, |
| const T & | t | ||
| ) | [inline] |
| void remove | ( | int | i | ) | [inline] |
| void remove | ( | int | i, |
| int | n | ||
| ) | [inline] |
| QVector< T > & fill | ( | const T & | t, |
| int | size = -1 |
||
| ) |
| int indexOf | ( | const T & | t, |
| int | from = 0 |
||
| ) | const |
| int lastIndexOf | ( | const T & | t, |
| int | from = -1 |
||
| ) | const |
| bool contains | ( | const T & | t | ) | const |
| int count | ( | const T & | t | ) | const |
| iterator begin | ( | ) | [inline] |
| const_iterator begin | ( | ) | const [inline] |
| const_iterator constBegin | ( | ) | const [inline] |
| iterator end | ( | ) | [inline] |
| const_iterator end | ( | ) | const [inline] |
| const_iterator constEnd | ( | ) | const [inline] |
Definition at line 565 of file qvector.h.
{
int offset = int(before - p->array);
if (n != 0) {
const T copy(t);
if (d->ref != 1 || d->size + n > d->alloc)
realloc(d->size, QVectorData::grow(sizeOfTypedData(), d->size + n, sizeof(T),
QTypeInfo<T>::isStatic));
if (QTypeInfo<T>::isStatic) {
T *b = p->array + d->size;
T *i = p->array + d->size + n;
while (i != b)
new (--i) T;
i = p->array + d->size;
T *j = i + n;
b = p->array + offset;
while (i != b)
*--j = *--i;
i = b+n;
while (i != b)
*--i = copy;
} else {
T *b = p->array + offset;
T *i = b + n;
memmove(i, b, (d->size - offset) * sizeof(T));
while (i != b)
new (--i) T(copy);
}
d->size += n;
}
return p->array + offset;
}
Definition at line 599 of file qvector.h.
{
int f = int(abegin - p->array);
int l = int(aend - p->array);
int n = l - f;
detach();
if (QTypeInfo<T>::isComplex) {
qCopy(p->array+l, p->array+d->size, p->array+f);
T *i = p->array+d->size;
T* b = p->array+d->size-n;
while (i != b) {
--i;
i->~T();
}
} else {
memmove(p->array + f, p->array + l, (d->size-l)*sizeof(T));
}
d->size -= n;
return p->array + f;
}
| int count | ( | ) | const [inline] |
| T& first | ( | ) | [inline] |
| const T& first | ( | ) | const [inline] |
| T& last | ( | ) | [inline] |
| const T& last | ( | ) | const [inline] |
| bool startsWith | ( | const T & | t | ) | const [inline] |
| bool endsWith | ( | const T & | t | ) | const [inline] |
| Q_OUTOFLINE_TEMPLATE QVector< T > mid | ( | int | pos, |
| int | length = -1 |
||
| ) | const |
| Q_OUTOFLINE_TEMPLATE T value | ( | int | i | ) | const |
| Q_OUTOFLINE_TEMPLATE T value | ( | int | i, |
| const T & | defaultValue | ||
| ) | const |
| void push_back | ( | const T & | t | ) | [inline] |
| void push_front | ( | const T & | t | ) | [inline] |
| void pop_back | ( | ) | [inline] |
| void pop_front | ( | ) | [inline] |
| bool empty | ( | ) | const [inline] |
| T& front | ( | ) | [inline] |
| const_reference front | ( | ) | const [inline] |
| reference back | ( | ) | [inline] |
| const_reference back | ( | ) | const [inline] |
| QVector<T>& operator+= | ( | const T & | t | ) | [inline] |
| QVector<T>& operator<< | ( | const T & | t | ) | [inline] |
| Q_OUTOFLINE_TEMPLATE QList< T > toList | ( | ) | const |
| static QVector<T> fromStdVector | ( | const std::vector< T > & | vector | ) | [inline, static] |
Definition at line 295 of file qvector.h.
{ QVector<T> tmp; tmp.reserve(vector.size()); qCopy(vector.begin(), vector.end(), std::back_inserter(tmp)); return tmp; }
| std::vector<T> toStdVector | ( | ) | const [inline] |
friend class QRegion [friend] |