append(const KResolverEntry &value) | QList< KResolverEntry > | |
append(const QList< KResolverEntry > &value) | QList< KResolverEntry > | |
at(int i) const | QList< KResolverEntry > | |
back() | QList< KResolverEntry > | |
back() const | QList< KResolverEntry > | |
begin() | QList< KResolverEntry > | |
begin() const | QList< KResolverEntry > | |
clear() | QList< KResolverEntry > | |
const_pointer | QList< KResolverEntry > | |
const_reference | QList< KResolverEntry > | |
constBegin() const | QList< KResolverEntry > | |
constEnd() const | QList< KResolverEntry > | |
ConstIterator | QList< KResolverEntry > | |
contains(const KResolverEntry &value) const | QList< KResolverEntry > | |
count(const KResolverEntry &value) const | QList< KResolverEntry > | |
count() const | QList< KResolverEntry > | |
difference_type | QList< KResolverEntry > | |
empty() const | QList< KResolverEntry > | |
end() | QList< KResolverEntry > | |
end() const | QList< KResolverEntry > | |
endsWith(const KResolverEntry &value) const | QList< KResolverEntry > | |
erase(iterator pos) | QList< KResolverEntry > | |
erase(iterator begin, iterator end) | QList< KResolverEntry > | |
error() const | KNetwork::KResolverResults | |
find(const KResolverEntry &t) | QList< KResolverEntry > | |
find(const KResolverEntry &t) const | QList< KResolverEntry > | |
find(iterator from, const KResolverEntry &t) | QList< KResolverEntry > | |
find(const_iterator from, const KResolverEntry &t) const | QList< KResolverEntry > | |
findIndex(const KResolverEntry &t) const | QList< KResolverEntry > | |
first() | QList< KResolverEntry > | |
first() const | QList< KResolverEntry > | |
fromSet(const QSet< KResolverEntry > &set) | QList< KResolverEntry > | static |
fromStdList(const std::list< KResolverEntry > &list) | QList< KResolverEntry > | static |
fromVector(const QVector< KResolverEntry > &vector) | QList< KResolverEntry > | static |
front() | QList< KResolverEntry > | |
front() const | QList< KResolverEntry > | |
indexOf(const KResolverEntry &value, int from) const | QList< KResolverEntry > | |
insert(int i, const KResolverEntry &value) | QList< KResolverEntry > | |
insert(iterator before, const KResolverEntry &value) | QList< KResolverEntry > | |
isEmpty() const | QList< KResolverEntry > | |
Iterator | QList< KResolverEntry > | |
KResolverResults() | KNetwork::KResolverResults | |
KResolverResults(const KResolverResults &other) | KNetwork::KResolverResults | |
last() | QList< KResolverEntry > | |
last() const | QList< KResolverEntry > | |
lastIndexOf(const KResolverEntry &value, int from) const | QList< KResolverEntry > | |
length() const | QList< KResolverEntry > | |
mid(int pos, int length) const | QList< KResolverEntry > | |
move(int from, int to) | QList< KResolverEntry > | |
nodeName() const | KNetwork::KResolverResults | |
operator!=(const QList< KResolverEntry > &other) const | QList< KResolverEntry > | |
operator+(const QList< KResolverEntry > &other) const | QList< KResolverEntry > | |
operator+=(const QList< KResolverEntry > &other) | QList< KResolverEntry > | |
operator+=(const KResolverEntry &value) | QList< KResolverEntry > | |
operator<<(const KResolverEntry &value) | QList< KResolverEntry > | |
operator<<(const QList< KResolverEntry > &other) | QList< KResolverEntry > | |
operator=(const KResolverResults &other) | KNetwork::KResolverResults | |
QList< KResolverEntry >::operator=(const QList< KResolverEntry > &other) | QList< KResolverEntry > | |
operator==(const QList< KResolverEntry > &other) const | QList< KResolverEntry > | |
operator[](int i) const | QList< KResolverEntry > | |
operator[](int i) | QList< KResolverEntry > | |
pointer | QList< KResolverEntry > | |
pop_back() | QList< KResolverEntry > | |
pop_front() | QList< KResolverEntry > | |
prepend(const KResolverEntry &value) | QList< KResolverEntry > | |
push_back(const KResolverEntry &value) | QList< KResolverEntry > | |
push_front(const KResolverEntry &value) | QList< KResolverEntry > | |
QList() | QList< KResolverEntry > | |
QList(const QList< KResolverEntry > &other) | QList< KResolverEntry > | |
QList(std::initializer_list< KResolverEntry > args) | QList< KResolverEntry > | |
reference | QList< KResolverEntry > | |
remove(iterator pos) | QList< KResolverEntry > | |
remove(const KResolverEntry &t) | QList< KResolverEntry > | |
removeAll(const KResolverEntry &value) | QList< KResolverEntry > | |
removeAt(int i) | QList< KResolverEntry > | |
removeFirst() | QList< KResolverEntry > | |
removeLast() | QList< KResolverEntry > | |
removeOne(const KResolverEntry &value) | QList< KResolverEntry > | |
replace(int i, const KResolverEntry &value) | QList< KResolverEntry > | |
reserve(int alloc) | QList< KResolverEntry > | |
serviceName() const | KNetwork::KResolverResults | |
setAddress(const QString &host, const QString &service) | KNetwork::KResolverResults | |
setError(int errorcode, int systemerror=0) | KNetwork::KResolverResults | |
size() const | QList< KResolverEntry > | |
size_type | QList< KResolverEntry > | |
startsWith(const KResolverEntry &value) const | QList< KResolverEntry > | |
swap(QList< KResolverEntry > &other) | QList< KResolverEntry > | |
swap(int i, int j) | QList< KResolverEntry > | |
systemError() const | KNetwork::KResolverResults | |
takeAt(int i) | QList< KResolverEntry > | |
takeFirst() | QList< KResolverEntry > | |
takeLast() | QList< KResolverEntry > | |
toSet() const | QList< KResolverEntry > | |
toStdList() const | QList< KResolverEntry > | |
toVector() const | QList< KResolverEntry > | |
value(int i) const | QList< KResolverEntry > | |
value(int i, const KResolverEntry &defaultValue) const | QList< KResolverEntry > | |
value_type | QList< KResolverEntry > | |
virtual_hook(int id, void *data) | KNetwork::KResolverResults | protectedvirtual |
~KResolverResults() | KNetwork::KResolverResults | virtual |
~QList() | QList< KResolverEntry > | |