From c07e9cff3c232b439b0993618d67f20da203492b Mon Sep 17 00:00:00 2001
From: nowrep <nowrep@gmail.com>
Date: Sun, 3 Nov 2013 14:22:27 +0100
Subject: [PATCH] Typo s/childs/children

---
 src/lib/adblock/adblocksearchtree.cpp | 16 ++++++++--------
 src/lib/adblock/adblocksearchtree.h   |  2 +-
 2 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/src/lib/adblock/adblocksearchtree.cpp b/src/lib/adblock/adblocksearchtree.cpp
index bbaa2d4f3..68f8a5180 100644
--- a/src/lib/adblock/adblocksearchtree.cpp
+++ b/src/lib/adblock/adblocksearchtree.cpp
@@ -43,14 +43,14 @@ bool AdBlockSearchTree::add(const AdBlockRule* rule)
 
     for (int i = 0; i < len; ++i) {
         const QChar &c = filter.at(i);
-        if (!node->childs.contains(c)) {
+        if (!node->children.contains(c)) {
             Node* n = new Node;
             n->c = c;
 
-            node->childs[c] = n;
+            node->children[c] = n;
         }
 
-        node = node->childs[c];
+        node = node->children[c];
     }
 
     node->rule = rule;
@@ -86,11 +86,11 @@ const AdBlockRule* AdBlockSearchTree::prefixSearch(const QNetworkRequest &reques
 
     QChar c = string.at(0);
 
-    if (!m_root->childs.contains(c)) {
+    if (!m_root->children.contains(c)) {
         return 0;
     }
 
-    Node* node = m_root->childs[c];
+    Node* node = m_root->children[c];
 
     for (int i = 1; i < len; ++i) {
         const QChar &c = string.at(i);
@@ -99,11 +99,11 @@ const AdBlockRule* AdBlockSearchTree::prefixSearch(const QNetworkRequest &reques
             return node->rule;
         }
 
-        if (!node->childs.contains(c)) {
+        if (!node->children.contains(c)) {
             return 0;
         }
 
-        node = node->childs[c];
+        node = node->children[c];
     }
 
     if (node->rule && node->rule->networkMatch(request, domain, urlString)) {
@@ -119,7 +119,7 @@ void AdBlockSearchTree::deleteNode(AdBlockSearchTree::Node* node)
         return;
     }
 
-    QHashIterator<QChar, Node*> i(node->childs);
+    QHashIterator<QChar, Node*> i(node->children);
     while (i.hasNext()) {
         i.next();
         deleteNode(i.value());
diff --git a/src/lib/adblock/adblocksearchtree.h b/src/lib/adblock/adblocksearchtree.h
index c4a7bb8b3..f22c0490f 100644
--- a/src/lib/adblock/adblocksearchtree.h
+++ b/src/lib/adblock/adblocksearchtree.h
@@ -40,7 +40,7 @@ private:
     struct Node {
         QChar c;
         const AdBlockRule* rule;
-        QHash<QChar, Node*> childs;
+        QHash<QChar, Node*> children;
 
         Node() : c(0) , rule(0) { }
     };