Extending Qt Creator Manual | TrieNode

Extending Qt Creator Manual 4.7.2

# TrieNode Class

(QmlJS::PersistentTrie::TrieNode)

- List of all members, including inherited members

## Public Types

typedef | CTrie
typedef | Ptr

## Public Functions

| TrieNode(const QString &pre = QString(), QList<QmlJS::PersistentTrie::TrieNode::Ptr> post = ...)
| TrieNode(const QmlJS::PersistentTrie::TrieNode &o)

## Static Public Members

void | complete(QStringList &results, const QmlJS::PersistentTrie::TrieNode::Ptr &trie, const QString &root, const QString &base = QString(), QmlJS::PersistentTrie::LookupFlags flags = LookupFlags(CaseInsensitive|Partial))
bool | contains(const QmlJS::PersistentTrie::TrieNode::Ptr &trie, const QString &value, QmlJS::PersistentTrie::LookupFlags flags = LookupFlags(0))
QmlJS::PersistentTrie::TrieNode::Ptr | create(const QString &pre = QString(), QList<QmlJS::PersistentTrie::TrieNode::Ptr> post = ...)
QDebug & | describe(QDebug &dbg, const QmlJS::PersistentTrie::TrieNode::Ptr &trie, int indent)
QmlJS::PersistentTrie::TrieNode::Ptr | insertF(const QmlJS::PersistentTrie::TrieNode::Ptr &trie, const QString &value)
std::pair<Ptr, int> | intersectF(const QmlJS::PersistentTrie::TrieNode::Ptr &v1, const QmlJS::PersistentTrie::TrieNode::Ptr &v2, int index1 = 0)
bool | isSame(const QmlJS::PersistentTrie::TrieNode::Ptr &trie1, const QmlJS::PersistentTrie::TrieNode::Ptr &trie2)
std::pair<Ptr, int> | mergeF(const QmlJS::PersistentTrie::TrieNode::Ptr &v1, const QmlJS::PersistentTrie::TrieNode::Ptr &v2)
QDebug & | printStrings(QDebug &dbg, const QmlJS::PersistentTrie::TrieNode::Ptr &trie)
QmlJS::PersistentTrie::TrieNode::Ptr | replaceF(const QmlJS::PersistentTrie::TrieNode::Ptr &trie, const QHash<QString, QString> &replacements)
QStringList | stringList(const QmlJS::PersistentTrie::TrieNode::Ptr &trie)

## Member Type Documentation

### typedef TrieNode::CTrie

### typedef TrieNode::Ptr

## Member Function Documentation

### TrieNode::TrieNode(const QString &pre = QString(), QList<QmlJS::PersistentTrie::TrieNode::Ptr> post = ...)

Default constructs an instance of TrieNode.

### TrieNode::TrieNode(const QmlJS::PersistentTrie::TrieNode &o)

Default constructs an instance of TrieNode.

### `[static]` void TrieNode::complete(QStringList &results, const QmlJS::PersistentTrie::TrieNode::Ptr &trie, const QString &root, const QString &base = QString(), QmlJS::PersistentTrie::LookupFlags flags = LookupFlags(CaseInsensitive|Partial))

### `[static]` bool TrieNode::contains(const QmlJS::PersistentTrie::TrieNode::Ptr &trie, const QString &value, QmlJS::PersistentTrie::LookupFlags flags = LookupFlags(0))

### `[static]` QmlJS::PersistentTrie::TrieNode::Ptr TrieNode::create(const QString &pre = QString(), QList<QmlJS::PersistentTrie::TrieNode::Ptr> post = ...)

### `[static]` QDebug &TrieNode::describe(QDebug &dbg, const QmlJS::PersistentTrie::TrieNode::Ptr &trie, int indent)

### `[static]` QmlJS::PersistentTrie::TrieNode::Ptr TrieNode::insertF(const QmlJS::PersistentTrie::TrieNode::Ptr &trie, const QString &value)

### `[static]` std::pair<Ptr, int> TrieNode::intersectF(const QmlJS::PersistentTrie::TrieNode::Ptr &v1, const QmlJS::PersistentTrie::TrieNode::Ptr &v2, int index1 = 0)

### `[static]` bool TrieNode::isSame(const QmlJS::PersistentTrie::TrieNode::Ptr &trie1, const QmlJS::PersistentTrie::TrieNode::Ptr &trie2)

### `[static]` std::pair<Ptr, int> TrieNode::mergeF(const QmlJS::PersistentTrie::TrieNode::Ptr &v1, const QmlJS::PersistentTrie::TrieNode::Ptr &v2)

### `[static]` QDebug &TrieNode::printStrings(QDebug &dbg, const QmlJS::PersistentTrie::TrieNode::Ptr &trie)

### `[static]` QmlJS::PersistentTrie::TrieNode::Ptr TrieNode::replaceF(const QmlJS::PersistentTrie::TrieNode::Ptr &trie, const QHash<QString, QString> &replacements)

### `[static]` QStringList TrieNode::stringList(const QmlJS::PersistentTrie::TrieNode::Ptr &trie)