Mercurial > hg > svcore
view base/TextMatcher.h @ 1671:82d03c9661f9 single-point
Rework isReady()/getCompletion() on models. Previously the new overhauled models were implementing getCompletion() but inheriting a version of isReady() (from the Model base) that didn't call it, referring only to isOK(). So they were reporting completion as soon as they had begun. Instead hoist getCompletion() to abstract base and call it from Model::isReady().
author | Chris Cannam |
---|---|
date | Wed, 27 Mar 2019 13:15:16 +0000 |
parents | ad5f892c0c4d |
children | c3b5564cfb78 |
line wrap: on
line source
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */ /* Sonic Visualiser An audio file viewer and annotation editor. Centre for Digital Music, Queen Mary, University of London. This file copyright 2008 QMUL. 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. See the file COPYING included with this distribution for more information. */ #ifndef SV_TEXT_MATCHER_H #define SV_TEXT_MATCHER_H #include <QString> #include <QStringList> #include "XmlExportable.h" #include <map> /// A rather eccentric interface for matching texts in differently-scored fields class TextMatcher { public: TextMatcher(); virtual ~TextMatcher(); struct Match { QString key; // This field is not used by TextMatcher int score; typedef std::map<QString, QString> FragmentMap; // text type -> fragment FragmentMap fragments; Match() : score(0) { } Match(const Match &m) : key(m.key), score(m.score), fragments(m.fragments) { } bool operator<(const Match &m) const; // sort by score first }; void test(Match &match, // existing match record to be augmented QStringList keywords, // search terms QString text, // to search within QString textType, // key to use for fragment map int score); // relative weight for hits within this text type }; #endif