diff options
Diffstat (limited to 'kmymoney2/widgets/kmymoneyselector.cpp')
| -rw-r--r-- | kmymoney2/widgets/kmymoneyselector.cpp | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/kmymoney2/widgets/kmymoneyselector.cpp b/kmymoney2/widgets/kmymoneyselector.cpp index daf7991..b32adcb 100644 --- a/kmymoney2/widgets/kmymoneyselector.cpp +++ b/kmymoney2/widgets/kmymoneyselector.cpp @@ -319,7 +319,7 @@ void KMyMoneySelector::removeItem(const TQString& id) it++; } - // get rid of top items that just lost the last tqchildren (e.g. Favorites) + // get rid of top items that just lost the last children (e.g. Favorites) it = TQListViewItemIterator(m_listView, TQListViewItemIterator::NotSelectable); while((it_v = it.current()) != 0) { if(it_v->rtti() == 1) { @@ -536,14 +536,14 @@ int KMyMoneySelector::slotMakeCompletion(const TQRegExp& exp) TQListViewItem* it_v; // The logic used here seems to be awkward. The problem is, that - // TQListViewItem::setVisible works recursively on all it's tqchildren - // and grand-tqchildren. + // TQListViewItem::setVisible works recursively on all it's children + // and grand-children. // // The way out of this is as follows: Make all items visible. // Then go through the list again and perform the checks. - // If an item does not have any tqchildren (last leaf in the tree view) + // If an item does not have any children (last leaf in the tree view) // perform the check. Then check recursively on the parent of this - // leaf that it has no visible tqchildren. If that is the case, make the + // leaf that it has no visible children. If that is the case, make the // parent invisible and continue this check with it's parent. while((it_v = it.current()) != 0) { it_v->setVisible(true); @@ -558,12 +558,12 @@ int KMyMoneySelector::slotMakeCompletion(const TQRegExp& exp) if(it_v->firstChild() == 0) { if(!match(exp, it_v)) { // this is a node which does not contain the - // text and does not have tqchildren. So we can + // text and does not have children. So we can // safely hide it. Then we check, if the parent - // has more tqchildren which are still visible. If + // has more children which are still visible. If // none are found, the parent node is hidden also. We // continue until the top of the tree or until we - // find a node that still has visible tqchildren. + // find a node that still has visible children. bool hide = true; while(hide) { it_v->setVisible(false); @@ -587,7 +587,7 @@ int KMyMoneySelector::slotMakeCompletion(const TQRegExp& exp) if(!firstMatch) { firstMatch = it_v; } - // a node with tqchildren contains the text. We want + // a node with children contains the text. We want // to display all child nodes in this case, so we need // to advance the iterator to the next sibling of the // current node. This could well be the sibling of a @@ -606,7 +606,7 @@ int KMyMoneySelector::slotMakeCompletion(const TQRegExp& exp) } while(it.current() && it.current() != item); } else { - // It's a node with tqchildren that does not match. We don't + // It's a node with children that does not match. We don't // change it's status here. ++it; } |