DynamicSearcher.cpp

Go to the documentation of this file.

/*

Copyright (C) 2005-2007 by Peter Dimov.

This file is part of Calitko (http://www.calitko.org).

Calitko 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.

Calitko is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with Calitko; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

*/

#include "Qt.h"
#include "DynamicSearcher.h"
#include "DynamicSearch.h"
#include "Imports.cpp"

namespace Gnutella{
namespace PacketProcessing{
namespace DynamicSearching{

class DynamicSearcherPrivate
{
    REFERENCE_OBJECT (DynamicSearcherPrivate)

public:
    typedef QList <PacketSession *>         Sessions;
    typedef QHash <QUuid, DynamicSearch *>  Searches;

    Sessions        sessions;
    Searches        searches;
    PacketProcessor *packetProcessor;

    DynamicSearcherPrivate() :  sessions(), searches(), packetProcessor (0) {}
};

} // namespace Gnutella
} // namespace PacketProcessing
} // namespace DynamicSearching

DynamicSearcher::DynamicSearcher (PacketProcessor *packetProcessor)
 :  p (new DynamicSearcherPrivate)
{
    p->packetProcessor = packetProcessor;
}

DynamicSearcher::~DynamicSearcher()
{
    delete p;
}

void DynamicSearcher::addSession (PacketSession *session)
{
    // Only neighboring peers will be queried using dynamic searching:
    if (session->nodeInfo().type == TypePeer) {
        p->sessions.append (session);
        foreach (DynamicSearch *search, p->searches) {
            search->addSession (session);
        }
    }
}

void DynamicSearcher::removeSession (PacketSession *session)
{
    // Remove only if the session was added at all (not a peer session?):
    if (p->sessions.removeAll (session) > 0) {
        foreach (DynamicSearch *search, p->searches) {
            search->removeSession (session);
        }
    }
}

void DynamicSearcher::startSearch (const Query &query)
{
    DynamicSearch *dynamicSearch = new DynamicSearch (query, p->sessions);

    connect (dynamicSearch, SIGNAL (searchStopped (const Query &)),
             this, SLOT (searchStopped (const Query &)));

    connect (dynamicSearch, SIGNAL (statusRequest (const QueryStatusRequest &)),
             this, SLOT (statusRequest (const QueryStatusRequest &)));

    p->searches.insert (query.descriptorId(), dynamicSearch);
    dynamicSearch->startSearch();
}

void DynamicSearcher::countHits (const QueryHits &queryHits)
{
    DynamicSearch *search = p->searches.value (queryHits.descriptorId());
    if (search != 0)
        search->countHits (queryHits);
}

void DynamicSearcher::countHits (const QueryStatusResponse &response)
{
    DynamicSearch *search = p->searches.value (response.descriptorId());
    if (search != 0)
        search->countHits (response);
}

void DynamicSearcher::stopSearch (const Query &query)
{
    DynamicSearch *search = p->searches.value (query.descriptorId());
    if (search != 0)
        search->stopSearch();
}

void DynamicSearcher::searchStopped (const Query &query)
{
    DynamicSearch *search = p->searches.take (query.descriptorId());
    Q_ASSERT (search != 0);
    search->deleteLater();
}

void DynamicSearcher::statusRequest (const QueryStatusRequest &request)
{
    p->packetProcessor->sendPacket (request);
}

Copyright © 2006 Peter Dimov.
Powered by Doxygen.