File indexing completed on 2024-04-28 05:08:19

 /***************************************************************************
     Copyright (C) 2005-2009 Robby Stephenson <robby@periapsis.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) version 3 or any later version        *
  *   accepted by the membership of KDE e.V. (or its successor approved     *
  *   by the membership of KDE e.V.), which shall act as a proxy            *
  *   defined in Section 14 of version 3 of the license.                    *
  *                                                                         *
  *   This program 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 this program.  If not, see <http://www.gnu.org/licenses/>. *
  *                                                                         *
  ***************************************************************************/
 
 #include "entryupdatejob.h"
 #include "entrycomparison.h"
 #include "entry.h"
 #include "collection.h"
 #include "utils/mergeconflictresolver.h"
 #include "tellico_debug.h"
 
 #include <QTimer>
 
 using namespace Tellico;
 using Tellico::EntryUpdateJob;
 
 EntryUpdateJob::EntryUpdateJob(QObject* parent_, Data::EntryPtr entry_, Fetch::Fetcher::Ptr fetcher_, Mode mode_)
     : KJob(parent_), m_entry(entry_), m_fetcher(fetcher_), m_mode(mode_), m_bestMatchScore(-1) {
   setCapabilities(KJob::Killable);
   connect(m_fetcher.data(), &Fetch::Fetcher::signalResultFound,
           this, &EntryUpdateJob::slotResult);
   connect(m_fetcher.data(), &Fetch::Fetcher::signalDone,
           this, &EntryUpdateJob::slotDone);
 }
 
 void EntryUpdateJob::start() {
   QTimer::singleShot(0, this, &EntryUpdateJob::startUpdate);
 }
 
 void EntryUpdateJob::startUpdate() {
   m_fetcher->startUpdate(m_entry);
 }
 
 void EntryUpdateJob::slotResult(Tellico::Fetch::FetchResult* result_) {
   if(!result_) {
     myDebug() << "null result";
     return;
   }
 
   Data::EntryPtr entry = result_->fetchEntry();
   Q_ASSERT(entry);
 
   const int match = m_entry->collection()->sameEntry(m_entry, entry);
   if(match > m_bestMatchScore) {
     myLog() << "Found better match:" << entry->title() << "; score =" << match;
     m_bestMatchScore = match;
     m_bestMatchEntry = entry;
   }
   // if perfect match, go ahead and top
   if(match >= EntryComparison::ENTRY_PERFECT_MATCH) {
     myLog() << "Score exceeds high confidence threshold, stopping search";
     doKill();
   }
 }
 
 void EntryUpdateJob::slotDone() {
   if(m_bestMatchEntry) {
     const int matchToBeat = (m_mode == PerfectMatchOnly ? EntryComparison::ENTRY_PERFECT_MATCH
                                                         : EntryComparison::ENTRY_GOOD_MATCH);
     if(m_bestMatchScore >= matchToBeat) {
       myLog() << "Best match is good enough, updating the entry";
       Merge::mergeEntry(m_entry, m_bestMatchEntry);
     } else {
       myLog() << "Best match is not good enough, not updating the entry";
     }
   }
   emitResult();
 }
 
 bool EntryUpdateJob::doKill() {
   m_fetcher->stop();
   return true;
 }