You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
tdenetwork/kopete/libkopete/ui/kopetelistviewsearchline.cpp

139 lines
4.1 KiB

/*
kopetelistviewsearchline.cpp - a widget for performing quick searches on Kopete::ListViews
Based on code from KMail, copyright (c) 2004 Till Adam <adam@kde.org>
Copyright (c) 2004 by Richard Smith <kde@metafoo.co.uk>
Kopete (c) 2004 by the Kopete developers <kopete-devel@kde.org>
*************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
*************************************************************************
*/
#include "kopetelistviewsearchline.h"
#include "kopetelistviewitem.h"
#include "kopetelistview.h"
namespace Kopete {
namespace UI {
namespace ListView {
SearchLine::SearchLine( TQWidget *parent, ListView *listView, const char *name )
: TDEListViewSearchLine( parent, listView, name )
{
}
SearchLine::SearchLine(TQWidget *parent, const char *name)
: TDEListViewSearchLine( parent, 0, name )
{
}
SearchLine::~SearchLine()
{
}
void SearchLine::updateSearch( const TQString &s )
{
// we copy a huge chunk of code here simply in order to override
// the way items are shown/hidden. KSearchLine rudely
// calls setVisible() on items with no way to customise this behaviour.
//BEGIN code from KSearchLine::updateSearch
if( !listView() )
return;
search = s.isNull() ? text() : s;
// If there's a selected item that is visible, make sure that it's visible
// when the search changes too (assuming that it still matches).
TQListViewItem *currentItem = 0;
switch( listView()->selectionMode() )
{
case TDEListView::NoSelection:
break;
case TDEListView::Single:
currentItem = listView()->selectedItem();
break;
default:
for( TQListViewItemIterator it(listView(), TQListViewItemIterator::Selected | TQListViewItemIterator::Visible);
it.current() && !currentItem; ++it )
{
if( listView()->itemRect( it.current() ).isValid() )
currentItem = it.current();
}
}
if( keepParentsVisible() )
checkItemParentsVisible( listView()->firstChild() );
else
checkItemParentsNotVisible();
if( currentItem )
listView()->ensureItemVisible( currentItem );
//END code from KSearchLine::updateSearch
}
void SearchLine::checkItemParentsNotVisible()
{
//BEGIN code from KSearchLine::checkItemParentsNotVisible
TQListViewItemIterator it( listView() );
for( ; it.current(); ++it )
{
TQListViewItem *item = it.current();
if( itemMatches( item, search ) )
setItemVisible( item, true );
else
setItemVisible( item, false );
}
//END code from KSearchLine::checkItemParentsNotVisible
}
bool SearchLine::checkItemParentsVisible( TQListViewItem *item )
{
//BEGIN code from KSearchLine::checkItemParentsVisible
bool visible = false;
for( ; item; item = item->nextSibling() ) {
if( ( item->firstChild() && checkItemParentsVisible( item->firstChild() ) ) ||
itemMatches( item, search ) )
{
setItemVisible( item, true );
// OUCH! this operation just became exponential-time.
// however, setting an item visible sets all its descendents
// visible too, which we definitely don't want.
// plus, in Kopete the nesting is never more than 2 deep,
// so this really just doubles the runtime, if that.
// this still can be done in O(n) time by a mark-set process,
// but that's overkill in our case.
checkItemParentsVisible( item->firstChild() );
visible = true;
}
else
setItemVisible( item, false );
}
return visible;
//END code from KSearchLine::checkItemParentsVisible
}
void SearchLine::setItemVisible( TQListViewItem *it, bool b )
{
if( Item *item = dynamic_cast<Item*>( it ) )
item->setSearchMatch( b );
else
it->setVisible( b );
}
} // namespace ListView
} // namespace UI
} // namespace Kopete
#include "kopetelistviewsearchline.moc"