diff options
author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-19 12:01:04 -0600 |
---|---|---|
committer | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-19 12:01:04 -0600 |
commit | 84c989c19db5daab602a67f47ca0f5fd7a2b53d2 (patch) | |
tree | dc5875bd392dce2d636a94bebcf5c44a270fac6d /klinkstatus/src/engine/searchmanager.cpp | |
parent | 9445f97b426e97c6ce46de18fba4030da45d56df (diff) | |
download | tdewebdev-84c989c19db5daab602a67f47ca0f5fd7a2b53d2.tar.gz tdewebdev-84c989c19db5daab602a67f47ca0f5fd7a2b53d2.zip |
Remove additional unneeded tq method conversions
Diffstat (limited to 'klinkstatus/src/engine/searchmanager.cpp')
-rw-r--r-- | klinkstatus/src/engine/searchmanager.cpp | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/klinkstatus/src/engine/searchmanager.cpp b/klinkstatus/src/engine/searchmanager.cpp index 1070db43..591b3acd 100644 --- a/klinkstatus/src/engine/searchmanager.cpp +++ b/klinkstatus/src/engine/searchmanager.cpp @@ -217,7 +217,7 @@ void SearchManager::slotRootChecked(const LinkStatus * link, LinkChecker * check { current_depth_ = 1; - vector<LinkStatus*> no = tqchildren(LinkStatus::lastRedirection(&root_)); + vector<LinkStatus*> no = children(LinkStatus::lastRedirection(&root_)); emit signalLinksToCheckTotalSteps(no.size()); @@ -255,14 +255,14 @@ void SearchManager::slotRootChecked(const LinkStatus * link, LinkChecker * check checker = 0; } -vector<LinkStatus*> SearchManager::tqchildren(LinkStatus* link) +vector<LinkStatus*> SearchManager::children(LinkStatus* link) { - vector<LinkStatus*> tqchildren; + vector<LinkStatus*> children; if(!link || link->absoluteUrl().hasRef()) - return tqchildren; + return children; - vector<Node*> const& nodes = link->tqchildrenNodes(); + vector<Node*> const& nodes = link->childrenNodes(); int count = 0; for(uint i = 0; i != nodes.size(); ++i) @@ -278,7 +278,7 @@ vector<LinkStatus*> SearchManager::tqchildren(LinkStatus* link) if( (node->isLink() && checkable(url, *link) && - !Url::existUrl(url, tqchildren) && + !Url::existUrl(url, children) && !node->url().isEmpty()) || node->malformed() ) @@ -310,7 +310,7 @@ vector<LinkStatus*> SearchManager::tqchildren(LinkStatus* link) } Q_ASSERT(link->externalDomainDepth() <= external_domain_depth_); - tqchildren.push_back(ls); + children.push_back(ls); } if(count == 50) { @@ -319,7 +319,7 @@ vector<LinkStatus*> SearchManager::tqchildren(LinkStatus* link) } } - return tqchildren; + return children; } bool SearchManager::existUrl(KURL const& url, KURL const& url_parent) const @@ -513,7 +513,7 @@ void SearchManager::checkLinksSimultaneously(vector<LinkStatus*> const& links) ++ignored_links_; ls->setIgnored(true); ls->setErrorOccurred(true); - ls->setError(i18n("Protocol %1 not supported").tqarg(protocol)); + ls->setError(i18n("Protocol %1 not supported").arg(protocol)); ls->setStatus(LinkStatus::MALFORMED); ls->setChecked(true); slotLinkChecked(ls, 0); @@ -591,7 +591,7 @@ void SearchManager::addLevel() uint end_sub1 = ultimo_nivel[i].size(); for(uint j = 0; j != end_sub1; ++j) // links { - vector <LinkStatus*> f(tqchildren( LinkStatus::lastRedirection(((ultimo_nivel[i])[j])) )); + vector <LinkStatus*> f(children( LinkStatus::lastRedirection(((ultimo_nivel[i])[j])) )); if(f.size() != 0) { search_results_[search_results_.size() - 1].push_back(f); |