The Perl Toolchain Summit needs more sponsors. If your company depends on Perl, please support this very important event.

NAME

Qt::XmlPatterns::Template::T000

PUBLIC METHODS

QVector<QXmlName>()
QVector<QXmlName>(int size)
QVector<QXmlName>(const QVector<QXmlName> & v)
QVector<QXmlName>(int size, const QXmlName & t)
~QVector<QXmlName>()
void append(const QXmlName & t)
const QXmlName & at(int i)
int capacity()
void clear()
const QXmlName * constData()
bool contains(const QXmlName & t)
int count(const QXmlName & t)
const QXmlName * data()
void detach()
QVector<QXmlName> & fill(const QXmlName & t, int size)
QVector<QXmlName> & fill(const QXmlName & t, int size = -1)
int indexOf(const QXmlName & t, int from)
int indexOf(const QXmlName & t, int from = 0)
void insert(int i, const QXmlName & t)
void insert(int i, int n, const QXmlName & t)
bool isDetached()
bool isEmpty()
bool isSharedWith(const QVector<QXmlName> & other)
int lastIndexOf(const QXmlName & t, int from)
int lastIndexOf(const QXmlName & t, int from = -1)
bool operator!=(const QVector<QXmlName> & v)
QVector<QXmlName> & operator=(const QVector<QXmlName> & v)
bool operator==(const QVector<QXmlName> & v)
const QXmlName & operator[](int i)
void prepend(const QXmlName & t)
void remove(int i)
void remove(int i, int n)
void replace(int i, const QXmlName & t)
void reserve(int size)
void resize(int size)
void setSharable(bool shrable)
int size()
void squeeze()

ENUM VALUES

EXPORT

None by default.

AUTHOR

Dongxu Ma <dongxu@cpan.org>

COPYRIGHT AND LICENSE

Copyright (C) 2011 - 2012 by Dongxu Ma

This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

See http://dev.perl.org/licenses/artistic.html

NAME

Qt::XmlPatterns::Template::T001

PUBLIC METHODS

QVector<QXmlNodeModelIndex>()
QVector<QXmlNodeModelIndex>(int size)
QVector<QXmlNodeModelIndex>(const QVector<QXmlNodeModelIndex> & v)
QVector<QXmlNodeModelIndex>(int size, const QXmlNodeModelIndex & t)
~QVector<QXmlNodeModelIndex>()
void append(const QXmlNodeModelIndex & t)
const QXmlNodeModelIndex & at(int i)
int capacity()
void clear()
const QXmlNodeModelIndex * constData()
bool contains(const QXmlNodeModelIndex & t)
int count(const QXmlNodeModelIndex & t)
const QXmlNodeModelIndex * data()
void detach()
QVector<QXmlNodeModelIndex> & fill(const QXmlNodeModelIndex & t, int size)
QVector<QXmlNodeModelIndex> & fill(const QXmlNodeModelIndex & t, int size = -1)
int indexOf(const QXmlNodeModelIndex & t, int from)
int indexOf(const QXmlNodeModelIndex & t, int from = 0)
void insert(int i, const QXmlNodeModelIndex & t)
void insert(int i, int n, const QXmlNodeModelIndex & t)
bool isDetached()
bool isEmpty()
bool isSharedWith(const QVector<QXmlNodeModelIndex> & other)
int lastIndexOf(const QXmlNodeModelIndex & t, int from)
int lastIndexOf(const QXmlNodeModelIndex & t, int from = -1)
bool operator!=(const QVector<QXmlNodeModelIndex> & v)
QVector<QXmlNodeModelIndex> & operator=(const QVector<QXmlNodeModelIndex> & v)
bool operator==(const QVector<QXmlNodeModelIndex> & v)
const QXmlNodeModelIndex & operator[](int i)
void prepend(const QXmlNodeModelIndex & t)
void remove(int i)
void remove(int i, int n)
void replace(int i, const QXmlNodeModelIndex & t)
void reserve(int size)
void resize(int size)
void setSharable(bool shrable)
int size()
void squeeze()

ENUM VALUES

EXPORT

None by default.

AUTHOR

Dongxu Ma <dongxu@cpan.org>

COPYRIGHT AND LICENSE

Copyright (C) 2011 - 2012 by Dongxu Ma

This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.

See http://dev.perl.org/licenses/artistic.html