mirror of
https://github.com/YACReader/yacreader
synced 2025-06-04 01:28:55 -04:00
Merge pull request #36 from iain-benson/feature/extended_search
Feature/extended search
This commit is contained in:
commit
8c6e8cdf36
@ -7,6 +7,8 @@ spanish only. Sorry for the mess.
|
|||||||
Version counting is based on semantic versioning (Major.Feature.Patch)
|
Version counting is based on semantic versioning (Major.Feature.Patch)
|
||||||
|
|
||||||
## WIP
|
## WIP
|
||||||
|
### YACReaderLibrary
|
||||||
|
* New search engine.
|
||||||
|
|
||||||
## 9.7.1
|
## 9.7.1
|
||||||
### YACReader
|
### YACReader
|
||||||
|
@ -14,6 +14,8 @@ INCLUDEPATH += . \
|
|||||||
|
|
||||||
DEFINES += SERVER_RELEASE NOMINMAX YACREADER_LIBRARY
|
DEFINES += SERVER_RELEASE NOMINMAX YACREADER_LIBRARY
|
||||||
|
|
||||||
|
CONFIG += c++11
|
||||||
|
|
||||||
# load default build flags
|
# load default build flags
|
||||||
include (../config.pri)
|
include (../config.pri)
|
||||||
include (../dependencies/pdf_backend.pri)
|
include (../dependencies/pdf_backend.pri)
|
||||||
@ -67,10 +69,6 @@ macx {
|
|||||||
QT += macextras gui-private
|
QT += macextras gui-private
|
||||||
}
|
}
|
||||||
|
|
||||||
unix:!macx {
|
|
||||||
CONFIG += c++11
|
|
||||||
}
|
|
||||||
|
|
||||||
#CONFIG += release
|
#CONFIG += release
|
||||||
CONFIG -= flat
|
CONFIG -= flat
|
||||||
QT += sql network widgets script
|
QT += sql network widgets script
|
||||||
@ -80,7 +78,11 @@ QT += sql network widgets script
|
|||||||
|
|
||||||
# Input
|
# Input
|
||||||
HEADERS += comic_flow.h \
|
HEADERS += comic_flow.h \
|
||||||
|
../common/concurrent_queue.h \
|
||||||
create_library_dialog.h \
|
create_library_dialog.h \
|
||||||
|
db/comic_query_result_procesor.h \
|
||||||
|
db/folder_query_result_processor.h \
|
||||||
|
db/query_lexer.h \
|
||||||
library_creator.h \
|
library_creator.h \
|
||||||
library_window.h \
|
library_window.h \
|
||||||
add_library_dialog.h \
|
add_library_dialog.h \
|
||||||
@ -147,6 +149,7 @@ HEADERS += comic_flow.h \
|
|||||||
yacreader_comics_selection_helper.h \
|
yacreader_comics_selection_helper.h \
|
||||||
yacreader_comic_info_helper.h \
|
yacreader_comic_info_helper.h \
|
||||||
db/reading_list.h \
|
db/reading_list.h \
|
||||||
|
db/query_parser.h \
|
||||||
current_comic_view_helper.h
|
current_comic_view_helper.h
|
||||||
|
|
||||||
!CONFIG(no_opengl) {
|
!CONFIG(no_opengl) {
|
||||||
@ -155,6 +158,9 @@ HEADERS += comic_flow.h \
|
|||||||
|
|
||||||
SOURCES += comic_flow.cpp \
|
SOURCES += comic_flow.cpp \
|
||||||
create_library_dialog.cpp \
|
create_library_dialog.cpp \
|
||||||
|
db/comic_query_result_procesor.cpp \
|
||||||
|
db/folder_query_result_processor.cpp \
|
||||||
|
db/query_lexer.cpp \
|
||||||
library_creator.cpp \
|
library_creator.cpp \
|
||||||
library_window.cpp \
|
library_window.cpp \
|
||||||
main.cpp \
|
main.cpp \
|
||||||
@ -219,7 +225,8 @@ SOURCES += comic_flow.cpp \
|
|||||||
yacreader_comics_selection_helper.cpp \
|
yacreader_comics_selection_helper.cpp \
|
||||||
yacreader_comic_info_helper.cpp\
|
yacreader_comic_info_helper.cpp\
|
||||||
db/reading_list.cpp \
|
db/reading_list.cpp \
|
||||||
current_comic_view_helper.cpp
|
current_comic_view_helper.cpp \
|
||||||
|
db/query_parser.cpp
|
||||||
|
|
||||||
!CONFIG(no_opengl) {
|
!CONFIG(no_opengl) {
|
||||||
SOURCES += ../common/gl/yacreader_flow_gl.cpp
|
SOURCES += ../common/gl/yacreader_flow_gl.cpp
|
||||||
|
@ -9,6 +9,7 @@
|
|||||||
#include "qnaturalsorting.h"
|
#include "qnaturalsorting.h"
|
||||||
#include "comic_db.h"
|
#include "comic_db.h"
|
||||||
#include "db_helper.h"
|
#include "db_helper.h"
|
||||||
|
#include "query_parser.h"
|
||||||
|
|
||||||
//ci.number,ci.title,c.fileName,ci.numPages,c.id,c.parentId,c.path,ci.hash,ci.read
|
//ci.number,ci.title,c.fileName,ci.numPages,c.id,c.parentId,c.path,ci.hash,ci.read
|
||||||
#include "QsLog.h"
|
#include "QsLog.h"
|
||||||
@ -595,59 +596,25 @@ void ComicModel::setupReadingModelData(const QString &databasePath)
|
|||||||
endResetModel();
|
endResetModel();
|
||||||
}
|
}
|
||||||
|
|
||||||
void ComicModel::setupModelData(const SearchModifiers modifier, const QString &filter, const QString &databasePath)
|
void ComicModel::setModelData(QList<ComicItem *> *data, const QString &databasePath)
|
||||||
{
|
{
|
||||||
beginResetModel();
|
|
||||||
qDeleteAll(_data);
|
|
||||||
_data.clear();
|
|
||||||
_databasePath = databasePath;
|
_databasePath = databasePath;
|
||||||
QString connectionName = "";
|
|
||||||
|
|
||||||
{
|
beginResetModel();
|
||||||
QSqlDatabase db = DataBaseManagement::loadDatabase(databasePath);
|
|
||||||
QSqlQuery selectQuery(db);
|
|
||||||
|
|
||||||
switch (modifier) {
|
qDeleteAll(_data);
|
||||||
case YACReader::NoModifiers:
|
|
||||||
selectQuery.prepare("SELECT ci.number,ci.title,c.fileName,ci.numPages,c.id,c.parentId,c.path,ci.hash,ci.read,ci.isBis,ci.currentPage,ci.rating,ci.hasBeenOpened "
|
|
||||||
"FROM comic c INNER JOIN comic_info ci ON (c.comicInfoId = ci.id) "
|
|
||||||
"WHERE UPPER(ci.title) LIKE UPPER(:filter) OR UPPER(c.fileName) LIKE UPPER(:filter) LIMIT :limit");
|
|
||||||
selectQuery.bindValue(":filter", "%%" + filter + "%%");
|
|
||||||
selectQuery.bindValue(":limit", 500); //TODO, load this value from settings
|
|
||||||
break;
|
|
||||||
|
|
||||||
case YACReader::OnlyRead:
|
_data.clear();
|
||||||
selectQuery.prepare("SELECT ci.number,ci.title,c.fileName,ci.numPages,c.id,c.parentId,c.path,ci.hash,ci.read,ci.isBis,ci.currentPage,ci.rating,ci.hasBeenOpened "
|
|
||||||
"FROM comic c INNER JOIN comic_info ci ON (c.comicInfoId = ci.id) "
|
|
||||||
"WHERE (UPPER(ci.title) LIKE UPPER(:filter) OR UPPER(c.fileName) LIKE UPPER(:filter)) AND ci.read = 1 LIMIT :limit");
|
|
||||||
selectQuery.bindValue(":filter", "%%" + filter + "%%");
|
|
||||||
selectQuery.bindValue(":limit", 500); //TODO, load this value from settings
|
|
||||||
break;
|
|
||||||
|
|
||||||
case YACReader::OnlyUnread:
|
QLOG_ERROR() << "-d2>" << data->size();
|
||||||
selectQuery.prepare("SELECT ci.number,ci.title,c.fileName,ci.numPages,c.id,c.parentId,c.path,ci.hash,ci.read,ci.isBis,ci.currentPage,ci.rating,ci.hasBeenOpened "
|
|
||||||
"FROM comic c INNER JOIN comic_info ci ON (c.comicInfoId = ci.id) "
|
|
||||||
"WHERE (UPPER(ci.title) LIKE UPPER(:filter) OR UPPER(c.fileName) LIKE UPPER(:filter)) AND ci.read = 0 LIMIT :limit");
|
|
||||||
selectQuery.bindValue(":filter", "%%" + filter + "%%");
|
|
||||||
selectQuery.bindValue(":limit", 500); //TODO, load this value from settings
|
|
||||||
break;
|
|
||||||
|
|
||||||
default:
|
_data.append(*data);
|
||||||
QLOG_ERROR() << "not implemented";
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
|
|
||||||
selectQuery.exec();
|
|
||||||
|
|
||||||
QLOG_DEBUG() << selectQuery.lastError() << "--";
|
|
||||||
|
|
||||||
setupModelData(selectQuery);
|
|
||||||
connectionName = db.connectionName();
|
|
||||||
}
|
|
||||||
QSqlDatabase::removeDatabase(connectionName);
|
|
||||||
endResetModel();
|
endResetModel();
|
||||||
|
|
||||||
emit searchNumResults(_data.length());
|
emit searchNumResults(_data.length());
|
||||||
|
|
||||||
|
delete data;
|
||||||
}
|
}
|
||||||
|
|
||||||
QString ComicModel::getComicPath(QModelIndex mi)
|
QString ComicModel::getComicPath(QModelIndex mi)
|
||||||
|
@ -16,7 +16,6 @@ class ComicItem;
|
|||||||
|
|
||||||
using namespace YACReader;
|
using namespace YACReader;
|
||||||
|
|
||||||
//! [0]
|
|
||||||
class ComicModel : public QAbstractItemModel
|
class ComicModel : public QAbstractItemModel
|
||||||
{
|
{
|
||||||
Q_OBJECT
|
Q_OBJECT
|
||||||
@ -89,8 +88,6 @@ public:
|
|||||||
void setupReadingListModelData(unsigned long long int parentReadingList, const QString &databasePath);
|
void setupReadingListModelData(unsigned long long int parentReadingList, const QString &databasePath);
|
||||||
void setupFavoritesModelData(const QString &databasePath);
|
void setupFavoritesModelData(const QString &databasePath);
|
||||||
void setupReadingModelData(const QString &databasePath);
|
void setupReadingModelData(const QString &databasePath);
|
||||||
//configures the model for showing the comics matching the filter criteria.
|
|
||||||
void setupModelData(const SearchModifiers modifier, const QString &filter, const QString &databasePath);
|
|
||||||
|
|
||||||
//Métodos de conveniencia
|
//Métodos de conveniencia
|
||||||
QStringList getPaths(const QString &_source);
|
QStringList getPaths(const QString &_source);
|
||||||
@ -142,6 +139,8 @@ public slots:
|
|||||||
void addComicsToLabel(const QList<qulonglong> &comicIds, qulonglong labelId);
|
void addComicsToLabel(const QList<qulonglong> &comicIds, qulonglong labelId);
|
||||||
void addComicsToReadingList(const QList<qulonglong> &comicIds, qulonglong readingListId);
|
void addComicsToReadingList(const QList<qulonglong> &comicIds, qulonglong readingListId);
|
||||||
|
|
||||||
|
void setModelData(QList<ComicItem *> *data, const QString &databasePath);
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
private:
|
private:
|
||||||
void setupModelData(QSqlQuery &sqlquery);
|
void setupModelData(QSqlQuery &sqlquery);
|
||||||
@ -164,6 +163,5 @@ signals:
|
|||||||
void resortedIndexes(QList<int>);
|
void resortedIndexes(QList<int>);
|
||||||
void newSelectedIndex(const QModelIndex &);
|
void newSelectedIndex(const QModelIndex &);
|
||||||
};
|
};
|
||||||
//! [0]
|
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
112
YACReaderLibrary/db/comic_query_result_procesor.cpp
Normal file
112
YACReaderLibrary/db/comic_query_result_procesor.cpp
Normal file
@ -0,0 +1,112 @@
|
|||||||
|
#include "comic_query_result_procesor.h"
|
||||||
|
|
||||||
|
#include "comic_item.h"
|
||||||
|
#include "comic_model.h"
|
||||||
|
#include "data_base_management.h"
|
||||||
|
#include "qnaturalsorting.h"
|
||||||
|
#include "db_helper.h"
|
||||||
|
#include "query_parser.h"
|
||||||
|
|
||||||
|
#include "QsLog.h"
|
||||||
|
|
||||||
|
QString getLastExecutedQuery(const QSqlQuery &query)
|
||||||
|
{
|
||||||
|
QString str = query.lastQuery();
|
||||||
|
QMapIterator<QString, QVariant> it(query.boundValues());
|
||||||
|
while (it.hasNext()) {
|
||||||
|
it.next();
|
||||||
|
str.replace(it.key(), it.value().toString());
|
||||||
|
}
|
||||||
|
return str;
|
||||||
|
}
|
||||||
|
|
||||||
|
YACReader::ComicQueryResultProcesor::ComicQueryResultProcesor()
|
||||||
|
: querySearchQueue(1)
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
void YACReader::ComicQueryResultProcesor::createModelData(const YACReader::SearchModifiers modifier, const QString &filter, const QString &databasePath)
|
||||||
|
{
|
||||||
|
querySearchQueue.cancellPending();
|
||||||
|
|
||||||
|
querySearchQueue.enqueue([=] {
|
||||||
|
QString connectionName = "";
|
||||||
|
{
|
||||||
|
QSqlDatabase db = DataBaseManagement::loadDatabase(databasePath);
|
||||||
|
QSqlQuery selectQuery(db);
|
||||||
|
|
||||||
|
std::string queryString("SELECT ci.number,ci.title,c.fileName,ci.numPages,c.id,c.parentId,c.path,ci.hash,ci.read,ci.isBis,ci.currentPage,ci.rating,ci.hasBeenOpened "
|
||||||
|
"FROM comic c INNER JOIN comic_info ci ON (c.comicInfoId = ci.id) LEFT JOIN folder f ON (f.id == c.parentId) WHERE ");
|
||||||
|
|
||||||
|
try {
|
||||||
|
QueryParser parser;
|
||||||
|
auto result = parser.parse(filter.toStdString());
|
||||||
|
result.buildSqlString(queryString);
|
||||||
|
|
||||||
|
switch (modifier) {
|
||||||
|
case YACReader::NoModifiers:
|
||||||
|
queryString += " LIMIT :limit";
|
||||||
|
break;
|
||||||
|
|
||||||
|
case YACReader::OnlyRead:
|
||||||
|
queryString += " AND ci.read = 1 LIMIT :limit";
|
||||||
|
break;
|
||||||
|
|
||||||
|
case YACReader::OnlyUnread:
|
||||||
|
queryString += " AND ci.read = 0 LIMIT :limit";
|
||||||
|
break;
|
||||||
|
|
||||||
|
default:
|
||||||
|
queryString += " LIMIT :limit";
|
||||||
|
QLOG_ERROR() << "not implemented";
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
selectQuery.prepare(queryString.c_str());
|
||||||
|
selectQuery.bindValue(":limit", 500); //TODO, load this value from settings
|
||||||
|
result.bindValues(selectQuery);
|
||||||
|
|
||||||
|
selectQuery.exec();
|
||||||
|
|
||||||
|
auto data = modelData(selectQuery);
|
||||||
|
|
||||||
|
emit newData(data, databasePath);
|
||||||
|
} catch (const std::exception &e) {
|
||||||
|
//Do nothing, uncomplete search string will end here and it is part of how the QueryParser works
|
||||||
|
//I don't like the idea of using exceptions for this though
|
||||||
|
}
|
||||||
|
|
||||||
|
connectionName = db.connectionName();
|
||||||
|
}
|
||||||
|
QSqlDatabase::removeDatabase(connectionName);
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
QList<ComicItem *> *YACReader::ComicQueryResultProcesor::modelData(QSqlQuery &sqlquery)
|
||||||
|
{
|
||||||
|
auto list = new QList<ComicItem *>();
|
||||||
|
|
||||||
|
int numColumns = sqlquery.record().count();
|
||||||
|
|
||||||
|
while (sqlquery.next()) {
|
||||||
|
QList<QVariant> data;
|
||||||
|
|
||||||
|
for (int i = 0; i < numColumns; i++)
|
||||||
|
data << sqlquery.value(i);
|
||||||
|
|
||||||
|
list->append(new ComicItem(data));
|
||||||
|
}
|
||||||
|
|
||||||
|
std::sort(list->begin(), list->end(), [](const ComicItem *c1, const ComicItem *c2) {
|
||||||
|
if (c1->data(ComicModel::Number).isNull() && c2->data(ComicModel::Number).isNull()) {
|
||||||
|
return naturalSortLessThanCI(c1->data(ComicModel::FileName).toString(), c2->data(ComicModel::FileName).toString());
|
||||||
|
} else {
|
||||||
|
if (c1->data(ComicModel::Number).isNull() == false && c2->data(ComicModel::Number).isNull() == false) {
|
||||||
|
return c1->data(ComicModel::Number).toInt() < c2->data(ComicModel::Number).toInt();
|
||||||
|
} else {
|
||||||
|
return c2->data(ComicModel::Number).isNull();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
});
|
||||||
|
|
||||||
|
return list;
|
||||||
|
}
|
32
YACReaderLibrary/db/comic_query_result_procesor.h
Normal file
32
YACReaderLibrary/db/comic_query_result_procesor.h
Normal file
@ -0,0 +1,32 @@
|
|||||||
|
#ifndef COMIC_QUERY_RESULT_PROCESOR_H
|
||||||
|
#define COMIC_QUERY_RESULT_PROCESOR_H
|
||||||
|
|
||||||
|
#include <QtCore>
|
||||||
|
#include <QSqlQuery>
|
||||||
|
|
||||||
|
#include "yacreader_global.h"
|
||||||
|
#include "concurrent_queue.h"
|
||||||
|
|
||||||
|
class ComicItem;
|
||||||
|
|
||||||
|
namespace YACReader {
|
||||||
|
|
||||||
|
class ComicQueryResultProcesor : public QObject
|
||||||
|
{
|
||||||
|
Q_OBJECT
|
||||||
|
public:
|
||||||
|
ComicQueryResultProcesor();
|
||||||
|
|
||||||
|
public slots:
|
||||||
|
void createModelData(const SearchModifiers modifier, const QString &filter, const QString &databasePath);
|
||||||
|
signals:
|
||||||
|
void newData(QList<ComicItem *> *, const QString &);
|
||||||
|
|
||||||
|
private:
|
||||||
|
ConcurrentQueue querySearchQueue;
|
||||||
|
|
||||||
|
QList<ComicItem *> *modelData(QSqlQuery &sqlquery);
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif // COMIC_QUERY_RESULT_PROCESOR_H
|
@ -1,60 +1,15 @@
|
|||||||
/****************************************************************************
|
#include "folder_model.h"
|
||||||
**
|
|
||||||
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
|
||||||
** All rights reserved.
|
|
||||||
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
||||||
**
|
|
||||||
** This file is part of the examples of the Qt Toolkit.
|
|
||||||
**
|
|
||||||
** $QT_BEGIN_LICENSE:BSD$
|
|
||||||
** You may use this file under the terms of the BSD license as follows:
|
|
||||||
**
|
|
||||||
** "Redistribution and use in source and binary forms, with or without
|
|
||||||
** modification, are permitted provided that the following conditions are
|
|
||||||
** met:
|
|
||||||
** * Redistributions of source code must retain the above copyright
|
|
||||||
** notice, this list of conditions and the following disclaimer.
|
|
||||||
** * Redistributions in binary form must reproduce the above copyright
|
|
||||||
** notice, this list of conditions and the following disclaimer in
|
|
||||||
** the documentation and/or other materials provided with the
|
|
||||||
** distribution.
|
|
||||||
** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor
|
|
||||||
** the names of its contributors may be used to endorse or promote
|
|
||||||
** products derived from this software without specific prior written
|
|
||||||
** permission.
|
|
||||||
**
|
|
||||||
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
||||||
** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
||||||
** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
||||||
** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
||||||
** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
||||||
** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
||||||
** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
||||||
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
||||||
** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
|
|
||||||
** $QT_END_LICENSE$
|
|
||||||
**
|
|
||||||
****************************************************************************/
|
|
||||||
|
|
||||||
/*
|
|
||||||
treemodel.cpp
|
|
||||||
|
|
||||||
Provides a simple tree model to show how to create and use hierarchical
|
|
||||||
models.
|
|
||||||
*/
|
|
||||||
|
|
||||||
#include <QtGui>
|
|
||||||
|
|
||||||
#include "folder_item.h"
|
#include "folder_item.h"
|
||||||
#include "folder_model.h"
|
|
||||||
#include "data_base_management.h"
|
#include "data_base_management.h"
|
||||||
#include "folder.h"
|
#include "folder.h"
|
||||||
#include "db_helper.h"
|
#include "db_helper.h"
|
||||||
#include "qnaturalsorting.h"
|
#include "qnaturalsorting.h"
|
||||||
#include "yacreader_global_gui.h"
|
#include "yacreader_global_gui.h"
|
||||||
#include "QsLog.h"
|
#include "QsLog.h"
|
||||||
|
#include "query_parser.h"
|
||||||
|
|
||||||
|
#include <QtGui>
|
||||||
|
|
||||||
#ifdef Q_OS_MAC
|
#ifdef Q_OS_MAC
|
||||||
#include <QFileIconProvider>
|
#include <QFileIconProvider>
|
||||||
@ -103,7 +58,6 @@ FolderModel::FolderModel(QObject *parent)
|
|||||||
connect(this, SIGNAL(reset()), this, SIGNAL(modelReset()));
|
connect(this, SIGNAL(reset()), this, SIGNAL(modelReset()));
|
||||||
}
|
}
|
||||||
|
|
||||||
//! [0]
|
|
||||||
FolderModel::FolderModel(QSqlQuery &sqlquery, QObject *parent)
|
FolderModel::FolderModel(QSqlQuery &sqlquery, QObject *parent)
|
||||||
: QAbstractItemModel(parent), rootItem(0)
|
: QAbstractItemModel(parent), rootItem(0)
|
||||||
{
|
{
|
||||||
@ -116,17 +70,13 @@ FolderModel::FolderModel(QSqlQuery &sqlquery, QObject *parent)
|
|||||||
setupModelData(sqlquery, rootItem);
|
setupModelData(sqlquery, rootItem);
|
||||||
//sqlquery.finish();
|
//sqlquery.finish();
|
||||||
}
|
}
|
||||||
//! [0]
|
|
||||||
|
|
||||||
//! [1]
|
|
||||||
FolderModel::~FolderModel()
|
FolderModel::~FolderModel()
|
||||||
{
|
{
|
||||||
if (rootItem != 0)
|
if (rootItem != 0)
|
||||||
delete rootItem;
|
delete rootItem;
|
||||||
}
|
}
|
||||||
//! [1]
|
|
||||||
|
|
||||||
//! [2]
|
|
||||||
int FolderModel::columnCount(const QModelIndex &parent) const
|
int FolderModel::columnCount(const QModelIndex &parent) const
|
||||||
{
|
{
|
||||||
if (parent.isValid())
|
if (parent.isValid())
|
||||||
@ -134,9 +84,7 @@ int FolderModel::columnCount(const QModelIndex &parent) const
|
|||||||
else
|
else
|
||||||
return rootItem->columnCount();
|
return rootItem->columnCount();
|
||||||
}
|
}
|
||||||
//! [2]
|
|
||||||
|
|
||||||
//! [3]
|
|
||||||
QVariant FolderModel::data(const QModelIndex &index, int role) const
|
QVariant FolderModel::data(const QModelIndex &index, int role) const
|
||||||
{
|
{
|
||||||
if (!index.isValid())
|
if (!index.isValid())
|
||||||
@ -187,9 +135,7 @@ QVariant FolderModel::data(const QModelIndex &index, int role) const
|
|||||||
|
|
||||||
return item->data(index.column());
|
return item->data(index.column());
|
||||||
}
|
}
|
||||||
//! [3]
|
|
||||||
|
|
||||||
//! [4]
|
|
||||||
Qt::ItemFlags FolderModel::flags(const QModelIndex &index) const
|
Qt::ItemFlags FolderModel::flags(const QModelIndex &index) const
|
||||||
{
|
{
|
||||||
if (!index.isValid())
|
if (!index.isValid())
|
||||||
@ -197,9 +143,7 @@ Qt::ItemFlags FolderModel::flags(const QModelIndex &index) const
|
|||||||
|
|
||||||
return Qt::ItemIsEnabled | Qt::ItemIsSelectable | Qt::ItemIsDropEnabled | Qt::ItemIsDragEnabled;
|
return Qt::ItemIsEnabled | Qt::ItemIsSelectable | Qt::ItemIsDropEnabled | Qt::ItemIsDragEnabled;
|
||||||
}
|
}
|
||||||
//! [4]
|
|
||||||
|
|
||||||
//! [5]
|
|
||||||
QVariant FolderModel::headerData(int section, Qt::Orientation orientation,
|
QVariant FolderModel::headerData(int section, Qt::Orientation orientation,
|
||||||
int role) const
|
int role) const
|
||||||
{
|
{
|
||||||
@ -208,9 +152,7 @@ QVariant FolderModel::headerData(int section, Qt::Orientation orientation,
|
|||||||
|
|
||||||
return QVariant();
|
return QVariant();
|
||||||
}
|
}
|
||||||
//! [5]
|
|
||||||
|
|
||||||
//! [6]
|
|
||||||
QModelIndex FolderModel::index(int row, int column, const QModelIndex &parent)
|
QModelIndex FolderModel::index(int row, int column, const QModelIndex &parent)
|
||||||
const
|
const
|
||||||
{
|
{
|
||||||
@ -230,9 +172,7 @@ QModelIndex FolderModel::index(int row, int column, const QModelIndex &parent)
|
|||||||
else
|
else
|
||||||
return QModelIndex();
|
return QModelIndex();
|
||||||
}
|
}
|
||||||
//! [6]
|
|
||||||
|
|
||||||
//! [7]
|
|
||||||
QModelIndex FolderModel::parent(const QModelIndex &index) const
|
QModelIndex FolderModel::parent(const QModelIndex &index) const
|
||||||
{
|
{
|
||||||
if (!index.isValid())
|
if (!index.isValid())
|
||||||
@ -246,19 +186,7 @@ QModelIndex FolderModel::parent(const QModelIndex &index) const
|
|||||||
|
|
||||||
return createIndex(parentItem->row(), 0, parentItem);
|
return createIndex(parentItem->row(), 0, parentItem);
|
||||||
}
|
}
|
||||||
//! [7]
|
|
||||||
|
|
||||||
/*
|
|
||||||
QModelIndex FolderModel::indexFromItem(FolderItem * item,int column)
|
|
||||||
{
|
|
||||||
//if(item->parent() != 0)
|
|
||||||
// return index(item->row(),column,parent(indexFromItem(item->parent(),column-1)));
|
|
||||||
//else
|
|
||||||
// return index(item->row(),0,QModelIndex());
|
|
||||||
return createIndex(item->row(), column, item);
|
|
||||||
}*/
|
|
||||||
|
|
||||||
//! [8]
|
|
||||||
int FolderModel::rowCount(const QModelIndex &parent) const
|
int FolderModel::rowCount(const QModelIndex &parent) const
|
||||||
{
|
{
|
||||||
FolderItem *parentItem;
|
FolderItem *parentItem;
|
||||||
@ -272,7 +200,6 @@ int FolderModel::rowCount(const QModelIndex &parent) const
|
|||||||
|
|
||||||
return parentItem->childCount();
|
return parentItem->childCount();
|
||||||
}
|
}
|
||||||
//! [8]
|
|
||||||
|
|
||||||
void FolderModel::setupModelData(QString path)
|
void FolderModel::setupModelData(QString path)
|
||||||
{
|
{
|
||||||
@ -385,27 +312,6 @@ QString FolderModel::getFolderPath(const QModelIndex &folder)
|
|||||||
return static_cast<FolderItem *>(folder.internalPointer())->data(FolderModel::Path).toString();
|
return static_cast<FolderItem *>(folder.internalPointer())->data(FolderModel::Path).toString();
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
|
||||||
void FolderModel::resetFilter()
|
|
||||||
{
|
|
||||||
beginResetModel();
|
|
||||||
filter = "";
|
|
||||||
includeComics = false;
|
|
||||||
//TODO hay que liberar la memoria reservada para el filtrado
|
|
||||||
//items.clear();
|
|
||||||
filteredItems.clear();
|
|
||||||
FolderItem * root = rootItem;
|
|
||||||
rootItem = rootBeforeFilter; //TODO si no se aplica el filtro previamente, esto invalidar<61>a en modelo
|
|
||||||
if(root !=0)
|
|
||||||
delete root;
|
|
||||||
|
|
||||||
rootBeforeFilter = 0;
|
|
||||||
filterEnabled = false;
|
|
||||||
endResetModel();
|
|
||||||
|
|
||||||
|
|
||||||
}*/
|
|
||||||
|
|
||||||
void FolderModel::updateFolderCompletedStatus(const QModelIndexList &list, bool status)
|
void FolderModel::updateFolderCompletedStatus(const QModelIndexList &list, bool status)
|
||||||
{
|
{
|
||||||
QString connectionName = "";
|
QString connectionName = "";
|
||||||
@ -625,7 +531,7 @@ void FolderModel::updateFolderChildrenInfo(qulonglong folderId)
|
|||||||
//PROXY
|
//PROXY
|
||||||
|
|
||||||
FolderModelProxy::FolderModelProxy(QObject *parent)
|
FolderModelProxy::FolderModelProxy(QObject *parent)
|
||||||
: QSortFilterProxyModel(parent), rootItem(0), includeComics(true), filter(""), filterEnabled(false)
|
: QSortFilterProxyModel(parent), rootItem(0), filterEnabled(false)
|
||||||
{
|
{
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -648,85 +554,29 @@ bool FolderModelProxy::filterAcceptsRow(int source_row, const QModelIndex &sourc
|
|||||||
return filteredItems.contains(item->id);
|
return filteredItems.contains(item->id);
|
||||||
}
|
}
|
||||||
|
|
||||||
void FolderModelProxy::setFilter(const YACReader::SearchModifiers modifier, QString filter, bool includeComics)
|
void FolderModelProxy::setFilterData(QMap<unsigned long long, FolderItem *> *filteredItems, FolderItem *root)
|
||||||
{
|
{
|
||||||
clear();
|
clear();
|
||||||
this->filter = filter;
|
|
||||||
this->includeComics = includeComics;
|
|
||||||
this->modifier = modifier;
|
|
||||||
filterEnabled = true;
|
filterEnabled = true;
|
||||||
setupFilteredModelData();
|
|
||||||
}
|
|
||||||
|
|
||||||
void FolderModelProxy::setupFilteredModelData()
|
|
||||||
{
|
|
||||||
beginResetModel();
|
beginResetModel();
|
||||||
|
|
||||||
//TODO hay que liberar memoria de anteriores filtrados
|
|
||||||
|
|
||||||
//inicializar el nodo ra<72>z
|
|
||||||
|
|
||||||
if (rootItem != 0)
|
if (rootItem != 0)
|
||||||
delete rootItem; //TODO comprobar que se libera bien la memoria
|
delete rootItem; //TODO comprobar que se libera bien la memoria
|
||||||
|
|
||||||
rootItem = 0;
|
rootItem = root;
|
||||||
|
|
||||||
//inicializar el nodo ra<72>z
|
#if QT_VERSION < QT_VERSION_CHECK(5, 15, 0)
|
||||||
QList<QVariant> rootData;
|
QMap<unsigned long long, FolderItem *>::iterator i;
|
||||||
rootData << "root";
|
for (i = filteredItems->begin(); i != filteredItems->end(); ++i)
|
||||||
rootItem = new FolderItem(rootData);
|
this->filteredItems.insert(i.key(), i.value());
|
||||||
rootItem->id = ROOT;
|
#else
|
||||||
rootItem->parentItem = 0;
|
this->filteredItems.insert(*filteredItems);
|
||||||
|
#endif
|
||||||
auto model = static_cast<FolderModel *>(sourceModel());
|
|
||||||
|
|
||||||
QString connectionName = "";
|
|
||||||
{
|
|
||||||
QSqlDatabase db = DataBaseManagement::loadDatabase(model->_databasePath);
|
|
||||||
|
|
||||||
QSqlQuery selectQuery(db); //TODO check
|
|
||||||
if (!includeComics) {
|
|
||||||
selectQuery.prepare("select * from folder where id <> 1 and upper(name) like upper(:filter) order by parentId,name ");
|
|
||||||
selectQuery.bindValue(":filter", "%%" + filter + "%%");
|
|
||||||
} else {
|
|
||||||
switch (modifier) {
|
|
||||||
case YACReader::NoModifiers:
|
|
||||||
selectQuery.prepare("SELECT DISTINCT f.id, f.parentId, f.name, f.path, f.finished, f.completed "
|
|
||||||
"FROM folder f LEFT JOIN comic c ON (f.id = c.parentId) "
|
|
||||||
"WHERE f.id <> 1 AND ((UPPER(c.fileName) like UPPER(:filter)) OR (UPPER(f.name) like UPPER(:filter2))) ORDER BY f.parentId,f.name");
|
|
||||||
selectQuery.bindValue(":filter", "%%" + filter + "%%");
|
|
||||||
selectQuery.bindValue(":filter2", "%%" + filter + "%%");
|
|
||||||
break;
|
|
||||||
|
|
||||||
case YACReader::OnlyRead:
|
|
||||||
selectQuery.prepare("SELECT DISTINCT f.id, f.parentId, f.name, f.path, f.finished, f.completed "
|
|
||||||
"FROM folder f LEFT JOIN (comic c INNER JOIN comic_info ci ON (c.comicInfoId = ci.id)) ON (f.id = c.parentId) "
|
|
||||||
"WHERE f.id <> 1 AND ((UPPER(c.fileName) like UPPER(:filter)) OR (UPPER(f.name) like UPPER(:filter2))) AND ci.read = 1 ORDER BY f.parentId,f.name;");
|
|
||||||
selectQuery.bindValue(":filter", "%%" + filter + "%%");
|
|
||||||
selectQuery.bindValue(":filter2", "%%" + filter + "%%");
|
|
||||||
break;
|
|
||||||
|
|
||||||
case YACReader::OnlyUnread:
|
|
||||||
selectQuery.prepare("SELECT DISTINCT f.id, f.parentId, f.name, f.path, f.finished, f.completed "
|
|
||||||
"FROM folder f LEFT JOIN (comic c INNER JOIN comic_info ci ON (c.comicInfoId = ci.id)) ON (f.id = c.parentId) "
|
|
||||||
"WHERE f.id <> 1 AND ((UPPER(c.fileName) like UPPER(:filter)) OR (UPPER(f.name) like UPPER(:filter2))) AND ci.read = 0 ORDER BY f.parentId,f.name;");
|
|
||||||
selectQuery.bindValue(":filter", "%%" + filter + "%%");
|
|
||||||
selectQuery.bindValue(":filter2", "%%" + filter + "%%");
|
|
||||||
break;
|
|
||||||
|
|
||||||
default:
|
|
||||||
QLOG_ERROR() << "not implemented";
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
selectQuery.exec();
|
|
||||||
|
|
||||||
setupFilteredModelData(selectQuery, rootItem);
|
|
||||||
connectionName = db.connectionName();
|
|
||||||
}
|
|
||||||
QSqlDatabase::removeDatabase(connectionName);
|
|
||||||
|
|
||||||
endResetModel();
|
endResetModel();
|
||||||
|
|
||||||
|
delete filteredItems;
|
||||||
}
|
}
|
||||||
|
|
||||||
void FolderModelProxy::clear()
|
void FolderModelProxy::clear()
|
||||||
@ -737,88 +587,3 @@ void FolderModelProxy::clear()
|
|||||||
|
|
||||||
QSortFilterProxyModel::clear();
|
QSortFilterProxyModel::clear();
|
||||||
}
|
}
|
||||||
|
|
||||||
void FolderModelProxy::setupFilteredModelData(QSqlQuery &sqlquery, FolderItem *parent)
|
|
||||||
{
|
|
||||||
auto model = static_cast<FolderModel *>(sourceModel());
|
|
||||||
|
|
||||||
//64 bits para la primary key, es decir la misma precisi<73>n que soporta sqlit 2^64
|
|
||||||
filteredItems.clear();
|
|
||||||
|
|
||||||
//se a<>ade el nodo 0 al modelo que representa el arbol de elementos que cumplen con el filtro
|
|
||||||
filteredItems.insert(parent->id, parent);
|
|
||||||
|
|
||||||
QSqlRecord record = sqlquery.record();
|
|
||||||
|
|
||||||
int name = record.indexOf("name");
|
|
||||||
int path = record.indexOf("path");
|
|
||||||
int finished = record.indexOf("finished");
|
|
||||||
int completed = record.indexOf("completed");
|
|
||||||
int parentIdIndex = record.indexOf("parentId");
|
|
||||||
|
|
||||||
while (sqlquery.next()) { //se procesan todos los folders que cumplen con el filtro
|
|
||||||
//datos de la base de datos
|
|
||||||
QList<QVariant> data;
|
|
||||||
|
|
||||||
data << sqlquery.value(name).toString();
|
|
||||||
data << sqlquery.value(path).toString();
|
|
||||||
data << sqlquery.value(finished).toBool();
|
|
||||||
data << sqlquery.value(completed).toBool();
|
|
||||||
|
|
||||||
auto item = new FolderItem(data);
|
|
||||||
item->id = sqlquery.value(0).toULongLong();
|
|
||||||
|
|
||||||
//id del padre
|
|
||||||
quint64 parentId = sqlquery.value(parentIdIndex).toULongLong();
|
|
||||||
|
|
||||||
//se a<>ade el item al map, de forma que se pueda encontrar como padre en siguientes iteraciones
|
|
||||||
if (!filteredItems.contains(item->id))
|
|
||||||
filteredItems.insert(item->id, item);
|
|
||||||
|
|
||||||
//es necesario conocer las coordenadas de origen para poder realizar scroll autom<6F>tico en la vista
|
|
||||||
item->originalItem = model->items.value(item->id);
|
|
||||||
|
|
||||||
//si el padre ya existe en el modelo, el item se a<>ade como hijo
|
|
||||||
if (filteredItems.contains(parentId))
|
|
||||||
filteredItems.value(parentId)->appendChild(item);
|
|
||||||
else //si el padre a<>n no se ha a<>adido, hay que a<>adirlo a <20>l y todos los padres hasta el nodo ra<72>z
|
|
||||||
{
|
|
||||||
//comprobamos con esta variable si el <20>ltimo de los padres (antes del nodo ra<72>z) ya exist<73>a en el modelo
|
|
||||||
bool parentPreviousInserted = false;
|
|
||||||
|
|
||||||
//mientras no se alcance el nodo ra<72>z se procesan todos los padres (de abajo a arriba)
|
|
||||||
while (parentId != ROOT) {
|
|
||||||
//el padre no estaba en el modelo filtrado, as<61> que se rescata del modelo original
|
|
||||||
FolderItem *parentItem = model->items.value(parentId);
|
|
||||||
//se debe crear un nuevo nodo (para no compartir los hijos con el nodo original)
|
|
||||||
FolderItem *newparentItem = new FolderItem(parentItem->getData()); //padre que se a<>adir<69> a la estructura de directorios filtrados
|
|
||||||
newparentItem->id = parentId;
|
|
||||||
|
|
||||||
newparentItem->originalItem = parentItem;
|
|
||||||
|
|
||||||
//si el modelo contiene al padre, se a<>ade el item actual como hijo
|
|
||||||
if (filteredItems.contains(parentId)) {
|
|
||||||
filteredItems.value(parentId)->appendChild(item);
|
|
||||||
parentPreviousInserted = true;
|
|
||||||
}
|
|
||||||
//sino se registra el nodo para poder encontrarlo con posterioridad y se a<>ade el item actual como hijo
|
|
||||||
else {
|
|
||||||
newparentItem->appendChild(item);
|
|
||||||
filteredItems.insert(newparentItem->id, newparentItem);
|
|
||||||
parentPreviousInserted = false;
|
|
||||||
}
|
|
||||||
|
|
||||||
//variables de control del bucle, se avanza hacia el nodo padre
|
|
||||||
item = newparentItem;
|
|
||||||
parentId = parentItem->parentItem->id;
|
|
||||||
}
|
|
||||||
|
|
||||||
//si el nodo es hijo de 1 y no hab<61>a sido previamente insertado como hijo, se a<>ade como tal
|
|
||||||
if (!parentPreviousInserted) {
|
|
||||||
filteredItems.value(ROOT)->appendChild(item);
|
|
||||||
} else {
|
|
||||||
delete item;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
@ -1,43 +1,3 @@
|
|||||||
/****************************************************************************
|
|
||||||
**
|
|
||||||
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
|
||||||
** All rights reserved.
|
|
||||||
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
||||||
**
|
|
||||||
** This file is part of the examples of the Qt Toolkit.
|
|
||||||
**
|
|
||||||
** $QT_BEGIN_LICENSE:BSD$
|
|
||||||
** You may use this file under the terms of the BSD license as follows:
|
|
||||||
**
|
|
||||||
** "Redistribution and use in source and binary forms, with or without
|
|
||||||
** modification, are permitted provided that the following conditions are
|
|
||||||
** met:
|
|
||||||
** * Redistributions of source code must retain the above copyright
|
|
||||||
** notice, this list of conditions and the following disclaimer.
|
|
||||||
** * Redistributions in binary form must reproduce the above copyright
|
|
||||||
** notice, this list of conditions and the following disclaimer in
|
|
||||||
** the documentation and/or other materials provided with the
|
|
||||||
** distribution.
|
|
||||||
** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor
|
|
||||||
** the names of its contributors may be used to endorse or promote
|
|
||||||
** products derived from this software without specific prior written
|
|
||||||
** permission.
|
|
||||||
**
|
|
||||||
** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
||||||
** "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
||||||
** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
||||||
** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
||||||
** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
||||||
** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
||||||
** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
||||||
** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
||||||
** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
||||||
** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
||||||
** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
|
|
||||||
** $QT_END_LICENSE$
|
|
||||||
**
|
|
||||||
****************************************************************************/
|
|
||||||
|
|
||||||
#ifndef TREEMODEL_H
|
#ifndef TREEMODEL_H
|
||||||
#define TREEMODEL_H
|
#define TREEMODEL_H
|
||||||
|
|
||||||
@ -49,6 +9,7 @@
|
|||||||
#include <QSqlDatabase>
|
#include <QSqlDatabase>
|
||||||
|
|
||||||
#include "yacreader_global.h"
|
#include "yacreader_global.h"
|
||||||
|
#include "folder_query_result_processor.h"
|
||||||
|
|
||||||
class FolderItem;
|
class FolderItem;
|
||||||
|
|
||||||
@ -59,9 +20,7 @@ public:
|
|||||||
explicit FolderModelProxy(QObject *parent = 0);
|
explicit FolderModelProxy(QObject *parent = 0);
|
||||||
~FolderModelProxy() override;
|
~FolderModelProxy() override;
|
||||||
|
|
||||||
void setFilter(const YACReader::SearchModifiers modifier, QString filter, bool includeComics);
|
void setFilterData(QMap<unsigned long long, FolderItem *> *filteredItems, FolderItem *root);
|
||||||
void setupFilteredModelData(QSqlQuery &sqlquery, FolderItem *parent);
|
|
||||||
void setupFilteredModelData();
|
|
||||||
void clear();
|
void clear();
|
||||||
|
|
||||||
bool filterAcceptsRow(int source_row, const QModelIndex &source_parent) const override;
|
bool filterAcceptsRow(int source_row, const QModelIndex &source_parent) const override;
|
||||||
@ -70,8 +29,6 @@ protected:
|
|||||||
FolderItem *rootItem;
|
FolderItem *rootItem;
|
||||||
QMap<unsigned long long int, FolderItem *> filteredItems; //relación entre folders
|
QMap<unsigned long long int, FolderItem *> filteredItems; //relación entre folders
|
||||||
|
|
||||||
bool includeComics;
|
|
||||||
QString filter;
|
|
||||||
bool filterEnabled;
|
bool filterEnabled;
|
||||||
|
|
||||||
YACReader::SearchModifiers modifier;
|
YACReader::SearchModifiers modifier;
|
||||||
@ -79,10 +36,10 @@ protected:
|
|||||||
|
|
||||||
class FolderModel : public QAbstractItemModel
|
class FolderModel : public QAbstractItemModel
|
||||||
{
|
{
|
||||||
|
|
||||||
Q_OBJECT
|
Q_OBJECT
|
||||||
|
|
||||||
friend class FolderModelProxy;
|
friend class FolderModelProxy;
|
||||||
|
friend class YACReader::FolderQueryResultProcessor;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
FolderModel(QObject *parent = 0);
|
FolderModel(QObject *parent = 0);
|
||||||
@ -147,6 +104,5 @@ signals:
|
|||||||
void beforeReset();
|
void beforeReset();
|
||||||
void reset();
|
void reset();
|
||||||
};
|
};
|
||||||
//! [0]
|
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
176
YACReaderLibrary/db/folder_query_result_processor.cpp
Normal file
176
YACReaderLibrary/db/folder_query_result_processor.cpp
Normal file
@ -0,0 +1,176 @@
|
|||||||
|
#include "folder_query_result_processor.h"
|
||||||
|
|
||||||
|
#include "folder_item.h"
|
||||||
|
#include "qnaturalsorting.h"
|
||||||
|
#include "yacreader_global_gui.h"
|
||||||
|
#include "query_parser.h"
|
||||||
|
#include "folder_model.h"
|
||||||
|
#include "data_base_management.h"
|
||||||
|
|
||||||
|
#include "QsLog.h"
|
||||||
|
|
||||||
|
#include <QSqlQuery>
|
||||||
|
#include <QSqlDatabase>
|
||||||
|
|
||||||
|
//Copy/pasted from "folder_model.cpp"
|
||||||
|
#define ROOT 1
|
||||||
|
|
||||||
|
YACReader::FolderQueryResultProcessor::FolderQueryResultProcessor(FolderModel *model)
|
||||||
|
: querySearchQueue(1), model(model)
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
void YACReader::FolderQueryResultProcessor::createModelData(const YACReader::SearchModifiers modifier, const QString &filter, bool includeComics)
|
||||||
|
{
|
||||||
|
querySearchQueue.cancellPending();
|
||||||
|
|
||||||
|
QString connectionName = "";
|
||||||
|
{
|
||||||
|
QSqlDatabase db = DataBaseManagement::loadDatabase(model->getDatabase());
|
||||||
|
|
||||||
|
QSqlQuery selectQuery(db); //TODO check
|
||||||
|
if (!includeComics) {
|
||||||
|
selectQuery.prepare("select * from folder where id <> 1 and upper(name) like upper(:filter) order by parentId,name ");
|
||||||
|
selectQuery.bindValue(":filter", "%%" + filter + "%%");
|
||||||
|
} else {
|
||||||
|
std::string queryString("SELECT DISTINCT f.id, f.parentId, f.name, f.path, f.finished, f.completed "
|
||||||
|
"FROM folder f LEFT JOIN comic c ON (f.id = c.parentId) "
|
||||||
|
"INNER JOIN comic_info ci ON (c.comicInfoId = ci.id) WHERE ");
|
||||||
|
|
||||||
|
try {
|
||||||
|
QueryParser parser;
|
||||||
|
auto result = parser.parse(filter.toStdString());
|
||||||
|
result.buildSqlString(queryString);
|
||||||
|
|
||||||
|
switch (modifier) {
|
||||||
|
case YACReader::NoModifiers:
|
||||||
|
queryString += " AND f.id <> 1 ORDER BY f.parentId,f.name";
|
||||||
|
break;
|
||||||
|
|
||||||
|
case YACReader::OnlyRead:
|
||||||
|
queryString += " AND f.id <> 1 AND ci.read = 1 ORDER BY f.parentId,f.name";
|
||||||
|
break;
|
||||||
|
|
||||||
|
case YACReader::OnlyUnread:
|
||||||
|
queryString += " AND f.id <> 1 AND ci.read = 0 ORDER BY f.parentId,f.name";
|
||||||
|
break;
|
||||||
|
|
||||||
|
default:
|
||||||
|
queryString += " AND f.id <> 1 ORDER BY f.parentId,f.name";
|
||||||
|
QLOG_ERROR() << "not implemented";
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
selectQuery.prepare(queryString.c_str());
|
||||||
|
result.bindValues(selectQuery);
|
||||||
|
|
||||||
|
selectQuery.exec();
|
||||||
|
QLOG_DEBUG() << selectQuery.lastError() << "--";
|
||||||
|
|
||||||
|
setupFilteredModelData(selectQuery);
|
||||||
|
} catch (const std::exception &e) {
|
||||||
|
//Do nothing, uncomplete search string will end here and it is part of how the QueryParser works
|
||||||
|
//I don't like the idea of using exceptions for this though
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
connectionName = db.connectionName();
|
||||||
|
}
|
||||||
|
|
||||||
|
QSqlDatabase::removeDatabase(connectionName);
|
||||||
|
}
|
||||||
|
|
||||||
|
void YACReader::FolderQueryResultProcessor::setupFilteredModelData(QSqlQuery &sqlquery)
|
||||||
|
{
|
||||||
|
FolderItem *rootItem = 0;
|
||||||
|
|
||||||
|
//inicializar el nodo ra<72>z
|
||||||
|
QList<QVariant> rootData;
|
||||||
|
rootData << "root";
|
||||||
|
rootItem = new FolderItem(rootData);
|
||||||
|
rootItem->id = ROOT;
|
||||||
|
rootItem->parentItem = 0;
|
||||||
|
|
||||||
|
FolderItem *parent = rootItem;
|
||||||
|
|
||||||
|
QMap<unsigned long long int, FolderItem *> *filteredItems = new QMap<unsigned long long int, FolderItem *>();
|
||||||
|
|
||||||
|
//add tree root node
|
||||||
|
filteredItems->insert(parent->id, parent);
|
||||||
|
|
||||||
|
QSqlRecord record = sqlquery.record();
|
||||||
|
|
||||||
|
int name = record.indexOf("name");
|
||||||
|
int path = record.indexOf("path");
|
||||||
|
int finished = record.indexOf("finished");
|
||||||
|
int completed = record.indexOf("completed");
|
||||||
|
int parentIdIndex = record.indexOf("parentId");
|
||||||
|
|
||||||
|
while (sqlquery.next()) { //se procesan todos los folders que cumplen con el filtro
|
||||||
|
//datos de la base de datos
|
||||||
|
QList<QVariant> data;
|
||||||
|
|
||||||
|
data << sqlquery.value(name).toString();
|
||||||
|
data << sqlquery.value(path).toString();
|
||||||
|
data << sqlquery.value(finished).toBool();
|
||||||
|
data << sqlquery.value(completed).toBool();
|
||||||
|
|
||||||
|
auto item = new FolderItem(data);
|
||||||
|
item->id = sqlquery.value(0).toULongLong();
|
||||||
|
|
||||||
|
//id del padre
|
||||||
|
quint64 parentId = sqlquery.value(parentIdIndex).toULongLong();
|
||||||
|
|
||||||
|
//se a<>ade el item al map, de forma que se pueda encontrar como padre en siguientes iteraciones
|
||||||
|
if (!filteredItems->contains(item->id))
|
||||||
|
filteredItems->insert(item->id, item);
|
||||||
|
|
||||||
|
//es necesario conocer las coordenadas de origen para poder realizar scroll autom<6F>tico en la vista
|
||||||
|
item->originalItem = model->items.value(item->id);
|
||||||
|
|
||||||
|
//si el padre ya existe en el modelo, el item se a<>ade como hijo
|
||||||
|
if (filteredItems->contains(parentId))
|
||||||
|
filteredItems->value(parentId)->appendChild(item);
|
||||||
|
else //si el padre a<>n no se ha a<>adido, hay que a<>adirlo a <20>l y todos los padres hasta el nodo ra<72>z
|
||||||
|
{
|
||||||
|
//comprobamos con esta variable si el <20>ltimo de los padres (antes del nodo ra<72>z) ya exist<73>a en el modelo
|
||||||
|
bool parentPreviousInserted = false;
|
||||||
|
|
||||||
|
//mientras no se alcance el nodo ra<72>z se procesan todos los padres (de abajo a arriba)
|
||||||
|
while (parentId != ROOT) {
|
||||||
|
//el padre no estaba en el modelo filtrado, as<61> que se rescata del modelo original
|
||||||
|
FolderItem *parentItem = model->items.value(parentId);
|
||||||
|
//se debe crear un nuevo nodo (para no compartir los hijos con el nodo original)
|
||||||
|
FolderItem *newparentItem = new FolderItem(parentItem->getData()); //padre que se a<>adir<69> a la estructura de directorios filtrados
|
||||||
|
newparentItem->id = parentId;
|
||||||
|
|
||||||
|
newparentItem->originalItem = parentItem;
|
||||||
|
|
||||||
|
//si el modelo contiene al padre, se a<>ade el item actual como hijo
|
||||||
|
if (filteredItems->contains(parentId)) {
|
||||||
|
filteredItems->value(parentId)->appendChild(item);
|
||||||
|
parentPreviousInserted = true;
|
||||||
|
}
|
||||||
|
//sino se registra el nodo para poder encontrarlo con posterioridad y se a<>ade el item actual como hijo
|
||||||
|
else {
|
||||||
|
newparentItem->appendChild(item);
|
||||||
|
filteredItems->insert(newparentItem->id, newparentItem);
|
||||||
|
parentPreviousInserted = false;
|
||||||
|
}
|
||||||
|
|
||||||
|
//variables de control del bucle, se avanza hacia el nodo padre
|
||||||
|
item = newparentItem;
|
||||||
|
parentId = parentItem->parentItem->id;
|
||||||
|
}
|
||||||
|
|
||||||
|
//si el nodo es hijo de 1 y no hab<61>a sido previamente insertado como hijo, se a<>ade como tal
|
||||||
|
if (!parentPreviousInserted) {
|
||||||
|
filteredItems->value(ROOT)->appendChild(item);
|
||||||
|
} else {
|
||||||
|
delete item;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
emit newData(filteredItems, rootItem);
|
||||||
|
}
|
36
YACReaderLibrary/db/folder_query_result_processor.h
Normal file
36
YACReaderLibrary/db/folder_query_result_processor.h
Normal file
@ -0,0 +1,36 @@
|
|||||||
|
#ifndef FOLDER_QUERY_RESULT_PROCESSOR_H
|
||||||
|
#define FOLDER_QUERY_RESULT_PROCESSOR_H
|
||||||
|
|
||||||
|
#include <QObject>
|
||||||
|
|
||||||
|
#include "yacreader_global.h"
|
||||||
|
#include "concurrent_queue.h"
|
||||||
|
|
||||||
|
class FolderItem;
|
||||||
|
class FolderModel;
|
||||||
|
class QSqlQuery;
|
||||||
|
|
||||||
|
namespace YACReader {
|
||||||
|
|
||||||
|
class FolderQueryResultProcessor : public QObject
|
||||||
|
{
|
||||||
|
Q_OBJECT
|
||||||
|
public:
|
||||||
|
FolderQueryResultProcessor(FolderModel *model);
|
||||||
|
|
||||||
|
public slots:
|
||||||
|
void createModelData(const SearchModifiers modifier, const QString &filter, bool includeComics);
|
||||||
|
|
||||||
|
signals:
|
||||||
|
void newData(QMap<unsigned long long int, FolderItem *> *filteredItems, FolderItem *root);
|
||||||
|
|
||||||
|
private:
|
||||||
|
ConcurrentQueue querySearchQueue;
|
||||||
|
|
||||||
|
FolderModel *model;
|
||||||
|
|
||||||
|
void setupFilteredModelData(QSqlQuery &sqlquery);
|
||||||
|
};
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif // FOLDER_QUERY_RESULT_PROCESSOR_H
|
84
YACReaderLibrary/db/query_lexer.cpp
Normal file
84
YACReaderLibrary/db/query_lexer.cpp
Normal file
@ -0,0 +1,84 @@
|
|||||||
|
#include "query_lexer.h"
|
||||||
|
|
||||||
|
QueryLexer::QueryLexer(const std::string &input)
|
||||||
|
: input(input)
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
Token QueryLexer::next()
|
||||||
|
{
|
||||||
|
while (isSpace(peek())) {
|
||||||
|
get();
|
||||||
|
}
|
||||||
|
|
||||||
|
switch (peek()) {
|
||||||
|
case '\0':
|
||||||
|
return Token(Token::Type::eof);
|
||||||
|
case '(':
|
||||||
|
case ')':
|
||||||
|
return single(Token::Type::opcode);
|
||||||
|
case '"':
|
||||||
|
return quotedWord();
|
||||||
|
default:
|
||||||
|
return word();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
char QueryLexer::peek()
|
||||||
|
{
|
||||||
|
return input[index];
|
||||||
|
}
|
||||||
|
|
||||||
|
char QueryLexer::get()
|
||||||
|
{
|
||||||
|
return input[index++];
|
||||||
|
}
|
||||||
|
|
||||||
|
Token QueryLexer::single(Token::Type type)
|
||||||
|
{
|
||||||
|
return Token(type, input.substr(index++, 1));
|
||||||
|
}
|
||||||
|
|
||||||
|
Token QueryLexer::word()
|
||||||
|
{
|
||||||
|
auto start = index;
|
||||||
|
get();
|
||||||
|
auto current = peek();
|
||||||
|
while (current != '\0' && !isSpace(current) && current != '"' && current != '(' && current != ')') {
|
||||||
|
get();
|
||||||
|
current = peek();
|
||||||
|
}
|
||||||
|
return Token(Token::Type::word, input.substr(start, index - start));
|
||||||
|
}
|
||||||
|
|
||||||
|
Token QueryLexer::quotedWord()
|
||||||
|
{
|
||||||
|
auto start = index;
|
||||||
|
get();
|
||||||
|
auto current = peek();
|
||||||
|
while (current != '\0' && current != '"') {
|
||||||
|
get();
|
||||||
|
current = peek();
|
||||||
|
}
|
||||||
|
|
||||||
|
if (current == '"') {
|
||||||
|
get();
|
||||||
|
return Token(Token::Type::quotedWord, input.substr(start, index - start));
|
||||||
|
}
|
||||||
|
|
||||||
|
//This should be a lexical error, but the grammar doesn't support it
|
||||||
|
return Token(Token::Type::eof);
|
||||||
|
}
|
||||||
|
|
||||||
|
bool QueryLexer::isSpace(char c)
|
||||||
|
{
|
||||||
|
switch (c) {
|
||||||
|
case ' ':
|
||||||
|
case '\t':
|
||||||
|
case '\r':
|
||||||
|
case '\n':
|
||||||
|
return true;
|
||||||
|
default:
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
57
YACReaderLibrary/db/query_lexer.h
Normal file
57
YACReaderLibrary/db/query_lexer.h
Normal file
@ -0,0 +1,57 @@
|
|||||||
|
#ifndef QUERY_LEXER_H
|
||||||
|
#define QUERY_LEXER_H
|
||||||
|
|
||||||
|
#include <string>
|
||||||
|
|
||||||
|
class Token
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
enum class Type {
|
||||||
|
eof,
|
||||||
|
opcode,
|
||||||
|
word,
|
||||||
|
quotedWord,
|
||||||
|
undefined
|
||||||
|
};
|
||||||
|
|
||||||
|
Token(Type type, std::string lexeme = "")
|
||||||
|
: _type(type), _lexeme(std::move(lexeme))
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
Type type() const
|
||||||
|
{
|
||||||
|
return _type;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::string lexeme() const
|
||||||
|
{
|
||||||
|
return _lexeme;
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
Type _type {};
|
||||||
|
std::string _lexeme {};
|
||||||
|
};
|
||||||
|
|
||||||
|
class QueryLexer
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
QueryLexer(const std::string &input);
|
||||||
|
Token next();
|
||||||
|
|
||||||
|
private:
|
||||||
|
std::string input;
|
||||||
|
int index = 0;
|
||||||
|
|
||||||
|
char peek();
|
||||||
|
char get();
|
||||||
|
|
||||||
|
Token single(Token::Type type);
|
||||||
|
Token word();
|
||||||
|
Token quotedWord();
|
||||||
|
|
||||||
|
bool isSpace(char c);
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif // QUERY_LEXER_H
|
246
YACReaderLibrary/db/query_parser.cpp
Normal file
246
YACReaderLibrary/db/query_parser.cpp
Normal file
@ -0,0 +1,246 @@
|
|||||||
|
#include "query_parser.h"
|
||||||
|
|
||||||
|
#include <QVariant>
|
||||||
|
#include <type_traits>
|
||||||
|
#include <numeric>
|
||||||
|
|
||||||
|
const std::map<QueryParser::FieldType, std::vector<std::string>> QueryParser::fieldNames {
|
||||||
|
{ FieldType::numeric, { "numpages", "number", "count", "arcnumber", "arccount" } },
|
||||||
|
{ FieldType::text, { "title", "volume", "storyarc", "genere", "writer", "penciller", "inker", "colorist", "letterer", "coverartist", "publisher", "format", "agerating", "synopsis", "characters", "notes" } },
|
||||||
|
{ FieldType::boolean, { "isbis", "color", "read" } },
|
||||||
|
{ FieldType::date, { "date" } },
|
||||||
|
{ FieldType::filename, { "filename" } },
|
||||||
|
{ FieldType::folder, { "folder" } },
|
||||||
|
{ FieldType::booleanFolder, { "completed", "finished" } },
|
||||||
|
};
|
||||||
|
|
||||||
|
int QueryParser::TreeNode::buildSqlString(std::string &sqlString, int bindPosition) const
|
||||||
|
{
|
||||||
|
if (t == "token") {
|
||||||
|
++bindPosition;
|
||||||
|
if (toLower(children[0].t) == "all") {
|
||||||
|
sqlString += "(";
|
||||||
|
for (const auto &field : fieldNames.at(FieldType::text)) {
|
||||||
|
sqlString += "UPPER(ci." + field + ") LIKE UPPER(:bindPosition" + std::to_string(bindPosition) + ") OR ";
|
||||||
|
}
|
||||||
|
sqlString += "UPPER(c.filename) LIKE UPPER(:bindPosition" + std::to_string(bindPosition) + ") OR ";
|
||||||
|
sqlString += "UPPER(f.name) LIKE UPPER(:bindPosition" + std::to_string(bindPosition) + ")) ";
|
||||||
|
} else if (isIn(fieldType(children[0].t), { FieldType::numeric, FieldType::boolean })) {
|
||||||
|
sqlString += "ci." + children[0].t + " = :bindPosition" + std::to_string(bindPosition) + " ";
|
||||||
|
} else if (fieldType(children[0].t) == FieldType::filename) {
|
||||||
|
sqlString += "(UPPER(c." + children[0].t + ") LIKE UPPER(:bindPosition" + std::to_string(bindPosition) + ")) ";
|
||||||
|
} else if (fieldType(children[0].t) == FieldType::folder) {
|
||||||
|
sqlString += "(UPPER(f.name) LIKE UPPER(:bindPosition" + std::to_string(bindPosition) + ")) ";
|
||||||
|
} else if (fieldType(children[0].t) == FieldType::booleanFolder) {
|
||||||
|
sqlString += "f." + children[0].t + " = :bindPosition" + std::to_string(bindPosition) + " ";
|
||||||
|
} else {
|
||||||
|
sqlString += "(UPPER(ci." + children[0].t + ") LIKE UPPER(:bindPosition" + std::to_string(bindPosition) + ")) ";
|
||||||
|
}
|
||||||
|
} else if (t == "not") {
|
||||||
|
sqlString += "(NOT ";
|
||||||
|
bindPosition = children[0].buildSqlString(sqlString, bindPosition);
|
||||||
|
sqlString += ")";
|
||||||
|
} else {
|
||||||
|
sqlString += "(";
|
||||||
|
bindPosition = children[0].buildSqlString(sqlString, bindPosition);
|
||||||
|
sqlString += " " + t + " ";
|
||||||
|
bindPosition = children[1].buildSqlString(sqlString, bindPosition);
|
||||||
|
sqlString += ")";
|
||||||
|
}
|
||||||
|
|
||||||
|
return bindPosition;
|
||||||
|
}
|
||||||
|
|
||||||
|
int QueryParser::TreeNode::bindValues(QSqlQuery &selectQuery, int bindPosition) const
|
||||||
|
{
|
||||||
|
if (t == "token") {
|
||||||
|
std::string bind_string(":bindPosition" + std::to_string(++bindPosition));
|
||||||
|
if (isIn(fieldType(children[0].t), { FieldType::numeric })) {
|
||||||
|
selectQuery.bindValue(QString::fromStdString(bind_string), std::stoi(children[1].t));
|
||||||
|
} else if (isIn(fieldType(children[0].t), { FieldType::boolean, FieldType::booleanFolder })) {
|
||||||
|
auto value = toLower(children[1].t);
|
||||||
|
if (value == "true") {
|
||||||
|
selectQuery.bindValue(QString::fromStdString(bind_string), 1);
|
||||||
|
} else if (value == "false") {
|
||||||
|
selectQuery.bindValue(QString::fromStdString(bind_string), 0);
|
||||||
|
} else {
|
||||||
|
selectQuery.bindValue(QString::fromStdString(bind_string), std::stoi(value));
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
selectQuery.bindValue(QString::fromStdString(bind_string), QString::fromStdString("%%" + children[1].t + "%%"));
|
||||||
|
}
|
||||||
|
} else if (t == "not") {
|
||||||
|
bindPosition = children[0].bindValues(selectQuery, bindPosition);
|
||||||
|
} else {
|
||||||
|
bindPosition = children[0].bindValues(selectQuery, bindPosition);
|
||||||
|
bindPosition = children[1].bindValues(selectQuery, bindPosition);
|
||||||
|
}
|
||||||
|
|
||||||
|
return bindPosition;
|
||||||
|
}
|
||||||
|
|
||||||
|
QueryParser::QueryParser()
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
QueryParser::TreeNode QueryParser::parse(const std::string &expr)
|
||||||
|
{
|
||||||
|
lexer = QueryLexer(expr);
|
||||||
|
advance();
|
||||||
|
|
||||||
|
auto prog = orExpression();
|
||||||
|
|
||||||
|
if (!isEof()) {
|
||||||
|
throw std::invalid_argument("Extra characters at end of search");
|
||||||
|
}
|
||||||
|
|
||||||
|
return prog;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::string QueryParser::toLower(const std::string &string)
|
||||||
|
{
|
||||||
|
std::string res(string);
|
||||||
|
std::transform(res.begin(), res.end(), res.begin(), ::tolower);
|
||||||
|
return res;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::string QueryParser::token(bool advance)
|
||||||
|
{
|
||||||
|
if (isEof()) {
|
||||||
|
return "";
|
||||||
|
}
|
||||||
|
|
||||||
|
auto lexeme = currentToken.lexeme();
|
||||||
|
|
||||||
|
auto res = (tokenType() == Token::Type::quotedWord) ? currentToken.lexeme().substr(1, lexeme.size() - 2) : lexeme; //TODO process quotedWordDiferently?
|
||||||
|
if (advance) {
|
||||||
|
this->advance();
|
||||||
|
}
|
||||||
|
return res;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::string QueryParser::lcaseToken(bool advance)
|
||||||
|
{
|
||||||
|
if (isEof()) {
|
||||||
|
return "";
|
||||||
|
}
|
||||||
|
|
||||||
|
auto lexeme = currentToken.lexeme();
|
||||||
|
|
||||||
|
auto res = (tokenType() == Token::Type::quotedWord) ? currentToken.lexeme().substr(1, lexeme.size() - 2) : lexeme;
|
||||||
|
|
||||||
|
if (advance) {
|
||||||
|
this->advance();
|
||||||
|
}
|
||||||
|
return toLower(res);
|
||||||
|
}
|
||||||
|
|
||||||
|
Token::Type QueryParser::tokenType()
|
||||||
|
{
|
||||||
|
return currentToken.type();
|
||||||
|
}
|
||||||
|
|
||||||
|
bool QueryParser::isEof() const
|
||||||
|
{
|
||||||
|
return currentToken.type() == Token::Type::eof;
|
||||||
|
}
|
||||||
|
|
||||||
|
void QueryParser::advance()
|
||||||
|
{
|
||||||
|
currentToken = lexer.next();
|
||||||
|
}
|
||||||
|
|
||||||
|
QueryParser::FieldType QueryParser::fieldType(const std::string &str)
|
||||||
|
{
|
||||||
|
for (const auto &names : fieldNames) {
|
||||||
|
if (std::find(names.second.begin(), names.second.end(), toLower(str)) != names.second.end()) {
|
||||||
|
return names.first;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return FieldType::unknown;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::string QueryParser::join(const QStringList &strings, const std::string &delim)
|
||||||
|
{
|
||||||
|
return std::accumulate(strings.begin(), strings.end(), std::string(),
|
||||||
|
[&delim](const std::string &a, const QString &b) -> std::string {
|
||||||
|
return a + (a.length() > 0 && b.length() > 0 ? delim : "") + b.toStdString();
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
QStringList QueryParser::split(const std::string &string, char delim)
|
||||||
|
{
|
||||||
|
auto words = QString::fromStdString(string).split(delim);
|
||||||
|
return words;
|
||||||
|
}
|
||||||
|
|
||||||
|
QueryParser::TreeNode QueryParser::orExpression()
|
||||||
|
{
|
||||||
|
auto lhs = andExpression();
|
||||||
|
if (lcaseToken() == "or") {
|
||||||
|
advance();
|
||||||
|
return TreeNode("or", { lhs, orExpression() });
|
||||||
|
}
|
||||||
|
return lhs;
|
||||||
|
}
|
||||||
|
|
||||||
|
QueryParser::TreeNode QueryParser::andExpression()
|
||||||
|
{
|
||||||
|
auto lhs = notExpression();
|
||||||
|
if (lcaseToken() == "and") {
|
||||||
|
advance();
|
||||||
|
return TreeNode("and", { lhs, andExpression() });
|
||||||
|
}
|
||||||
|
|
||||||
|
if ((isIn(tokenType(), { Token::Type::word, Token::Type::quotedWord }) || token() == "(") && lcaseToken() != "or") {
|
||||||
|
return TreeNode("and", { lhs, andExpression() });
|
||||||
|
}
|
||||||
|
|
||||||
|
return lhs;
|
||||||
|
}
|
||||||
|
|
||||||
|
QueryParser::TreeNode QueryParser::notExpression()
|
||||||
|
{
|
||||||
|
if (lcaseToken() == "not") {
|
||||||
|
advance();
|
||||||
|
return TreeNode("not", { notExpression() });
|
||||||
|
}
|
||||||
|
return locationExpression();
|
||||||
|
}
|
||||||
|
|
||||||
|
QueryParser::TreeNode QueryParser::locationExpression()
|
||||||
|
{
|
||||||
|
if (tokenType() == Token::Type::opcode && token() == "(") {
|
||||||
|
advance();
|
||||||
|
auto res = orExpression();
|
||||||
|
if (tokenType() != Token::Type::opcode || token(true) != ")") {
|
||||||
|
throw std::invalid_argument("missing )'");
|
||||||
|
}
|
||||||
|
return res;
|
||||||
|
}
|
||||||
|
if (!isIn(tokenType(), { Token::Type::word, Token::Type::quotedWord })) {
|
||||||
|
throw std::invalid_argument("Invalid syntax. Expected a lookup name or a word");
|
||||||
|
}
|
||||||
|
return baseToken();
|
||||||
|
}
|
||||||
|
|
||||||
|
QueryParser::TreeNode QueryParser::baseToken()
|
||||||
|
{
|
||||||
|
if (tokenType() == Token::Type::quotedWord) {
|
||||||
|
return TreeNode("token", { TreeNode("all", {}), TreeNode(token(true), {}) });
|
||||||
|
}
|
||||||
|
|
||||||
|
auto words(split(token(true), ':'));
|
||||||
|
|
||||||
|
if (words.size() > 1 && fieldType(words[0].toStdString()) != FieldType::unknown) {
|
||||||
|
auto loc(toLower(words[0].toStdString()));
|
||||||
|
words.erase(words.begin());
|
||||||
|
if (words.size() == 1 && tokenType() == Token::Type::quotedWord) {
|
||||||
|
return TreeNode("token", { TreeNode(loc, {}), TreeNode(token(true), {}) });
|
||||||
|
}
|
||||||
|
return TreeNode("token", { TreeNode(loc, {}), TreeNode(join(words, ":"), {}) });
|
||||||
|
}
|
||||||
|
|
||||||
|
return TreeNode("token", { TreeNode("all", {}), TreeNode(join(words, ":"), {}) });
|
||||||
|
}
|
100
YACReaderLibrary/db/query_parser.h
Normal file
100
YACReaderLibrary/db/query_parser.h
Normal file
@ -0,0 +1,100 @@
|
|||||||
|
#ifndef QUERY_PARSER_H
|
||||||
|
#define QUERY_PARSER_H
|
||||||
|
|
||||||
|
#include "query_lexer.h"
|
||||||
|
|
||||||
|
#include <map>
|
||||||
|
#include <QSqlQuery>
|
||||||
|
#include <string>
|
||||||
|
#include <vector>
|
||||||
|
#include <list>
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This class is used to generate an SQL query string from a search expression,
|
||||||
|
* with a syntax very similar to that used by the Google search engine.
|
||||||
|
*
|
||||||
|
* The code herein is based upon the SearchQueryParser python class written by
|
||||||
|
* Kovid Goyal as part of the Calibre eBook manager (https://calibre-ebook.com)
|
||||||
|
*
|
||||||
|
* Grammar:
|
||||||
|
* prog ::= or_expression
|
||||||
|
* or_expression ::= and_expression [ 'or' or_expression ]
|
||||||
|
* and_expression ::= not_expression [ [ 'and' ] and_expression ]
|
||||||
|
* not_expression ::= [ 'not' ] location_expression
|
||||||
|
* location_expression ::= base_token | ( '(' or_expression ')' )
|
||||||
|
* base_token ::= a sequence of letters and colons, perhaps quoted
|
||||||
|
*
|
||||||
|
* Usage Example:
|
||||||
|
* QSqlQuery selectQuery(db);
|
||||||
|
* std::string queryString("SELECT ... FROM ... WHERE ");
|
||||||
|
*
|
||||||
|
* QueryParser parser; // Create the parser object
|
||||||
|
* TreeNode result = parser.parse(expr); // Parse the query expression
|
||||||
|
*
|
||||||
|
* result.buildSqlString(queryString); // Append the SQL query to a string
|
||||||
|
*
|
||||||
|
* selectQuery.prepare(queryString.c_str()); // Convert the string to a query
|
||||||
|
* result.bindValues(selectQuery); // Populate the SQL query variables
|
||||||
|
*
|
||||||
|
* selectQuery.exec();
|
||||||
|
*/
|
||||||
|
class QueryParser
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
struct TreeNode {
|
||||||
|
std::string t;
|
||||||
|
std::vector<TreeNode> children;
|
||||||
|
|
||||||
|
explicit TreeNode(std::string t, std::vector<TreeNode> children)
|
||||||
|
: t(t), children(children)
|
||||||
|
{
|
||||||
|
}
|
||||||
|
|
||||||
|
int buildSqlString(std::string &sqlString, int bindPosition = 0) const;
|
||||||
|
int bindValues(QSqlQuery &selectQuery, int bindPosition = 0) const;
|
||||||
|
};
|
||||||
|
|
||||||
|
explicit QueryParser();
|
||||||
|
TreeNode parse(const std::string &expr);
|
||||||
|
|
||||||
|
private:
|
||||||
|
static std::string toLower(const std::string &string);
|
||||||
|
|
||||||
|
std::string token(bool advance = false);
|
||||||
|
std::string lcaseToken(bool advance = false);
|
||||||
|
Token::Type tokenType();
|
||||||
|
bool isEof() const;
|
||||||
|
void advance();
|
||||||
|
|
||||||
|
QueryLexer lexer = QueryLexer("");
|
||||||
|
Token currentToken = Token(Token::Type::undefined);
|
||||||
|
|
||||||
|
template<typename T>
|
||||||
|
static bool isIn(const T &e, const std::list<T> &v)
|
||||||
|
{
|
||||||
|
return std::find(v.begin(), v.end(), e) != v.end();
|
||||||
|
}
|
||||||
|
|
||||||
|
enum class FieldType { unknown,
|
||||||
|
numeric,
|
||||||
|
text,
|
||||||
|
boolean,
|
||||||
|
date,
|
||||||
|
folder,
|
||||||
|
booleanFolder,
|
||||||
|
filename };
|
||||||
|
static FieldType fieldType(const std::string &str);
|
||||||
|
|
||||||
|
static std::string join(const QStringList &strings, const std::string &delim);
|
||||||
|
static QStringList split(const std::string &string, char delim);
|
||||||
|
|
||||||
|
TreeNode orExpression();
|
||||||
|
TreeNode andExpression();
|
||||||
|
TreeNode notExpression();
|
||||||
|
TreeNode locationExpression();
|
||||||
|
TreeNode baseToken();
|
||||||
|
|
||||||
|
static const std::map<FieldType, std::vector<std::string>> fieldNames;
|
||||||
|
};
|
||||||
|
|
||||||
|
#endif // QUERY_PARSER_H
|
@ -92,7 +92,7 @@
|
|||||||
using namespace YACReader;
|
using namespace YACReader;
|
||||||
|
|
||||||
LibraryWindow::LibraryWindow()
|
LibraryWindow::LibraryWindow()
|
||||||
: QMainWindow(), fullscreen(false), previousFilter(""), fetching(false), status(LibraryWindow::Normal), removeError(false)
|
: QMainWindow(), fullscreen(false), previousFilter(""), fetching(false), status(LibraryWindow::Normal), removeError(false), comicQueryResultProcesor()
|
||||||
{
|
{
|
||||||
setupUI();
|
setupUI();
|
||||||
|
|
||||||
@ -400,6 +400,7 @@ void LibraryWindow::doModels()
|
|||||||
//folders
|
//folders
|
||||||
foldersModel = new FolderModel();
|
foldersModel = new FolderModel();
|
||||||
foldersModelProxy = new FolderModelProxy();
|
foldersModelProxy = new FolderModelProxy();
|
||||||
|
folderQueryResultProcessor = new FolderQueryResultProcessor(foldersModel);
|
||||||
//foldersModelProxy->setSourceModel(foldersModel);
|
//foldersModelProxy->setSourceModel(foldersModel);
|
||||||
//comics
|
//comics
|
||||||
comicsModel = new ComicModel(this);
|
comicsModel = new ComicModel(this);
|
||||||
@ -1053,10 +1054,10 @@ void LibraryWindow::createConnections()
|
|||||||
connect(optionsDialog, SIGNAL(optionsChanged()), this, SLOT(reloadOptions()));
|
connect(optionsDialog, SIGNAL(optionsChanged()), this, SLOT(reloadOptions()));
|
||||||
connect(optionsDialog, SIGNAL(editShortcuts()), editShortcutsDialog, SLOT(show()));
|
connect(optionsDialog, SIGNAL(editShortcuts()), editShortcutsDialog, SLOT(show()));
|
||||||
|
|
||||||
//Folders filter
|
//Search filter
|
||||||
//connect(clearFoldersFilter,SIGNAL(clicked()),foldersFilter,SLOT(clear()));
|
|
||||||
connect(searchEdit, SIGNAL(filterChanged(YACReader::SearchModifiers, QString)), this, SLOT(setSearchFilter(YACReader::SearchModifiers, QString)));
|
connect(searchEdit, SIGNAL(filterChanged(YACReader::SearchModifiers, QString)), this, SLOT(setSearchFilter(YACReader::SearchModifiers, QString)));
|
||||||
//connect(includeComicsCheckBox,SIGNAL(stateChanged(int)),this,SLOT(searchInFiles(int)));
|
connect(&comicQueryResultProcesor, &ComicQueryResultProcesor::newData, this, &LibraryWindow::setComicSearchFilterData);
|
||||||
|
connect(folderQueryResultProcessor, &FolderQueryResultProcessor::newData, this, &LibraryWindow::setFolderSearchFilterData);
|
||||||
|
|
||||||
//ContextMenus
|
//ContextMenus
|
||||||
connect(openContainingFolderComicAction, SIGNAL(triggered()), this, SLOT(openContainingFolderComic()));
|
connect(openContainingFolderComicAction, SIGNAL(triggered()), this, SLOT(openContainingFolderComic()));
|
||||||
@ -2070,21 +2071,32 @@ void LibraryWindow::toNormal()
|
|||||||
void LibraryWindow::setSearchFilter(const YACReader::SearchModifiers modifier, QString filter)
|
void LibraryWindow::setSearchFilter(const YACReader::SearchModifiers modifier, QString filter)
|
||||||
{
|
{
|
||||||
if (!filter.isEmpty()) {
|
if (!filter.isEmpty()) {
|
||||||
|
folderQueryResultProcessor->createModelData(modifier, filter, true);
|
||||||
|
comicQueryResultProcesor.createModelData(modifier, filter, foldersModel->getDatabase());
|
||||||
|
} else if (status == LibraryWindow::Searching) { //if no searching, then ignore this
|
||||||
|
clearSearchFilter();
|
||||||
|
navigationController->loadPreviousStatus();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void LibraryWindow::setComicSearchFilterData(QList<ComicItem *> *data, const QString &databasePath)
|
||||||
|
{
|
||||||
status = LibraryWindow::Searching;
|
status = LibraryWindow::Searching;
|
||||||
foldersModelProxy->setFilter(modifier, filter, true); //includeComicsCheckBox->isChecked());
|
|
||||||
comicsModel->setupModelData(modifier, filter, foldersModel->getDatabase());
|
comicsModel->setModelData(data, databasePath);
|
||||||
comicsViewsManager->comicsView->enableFilterMode(true);
|
comicsViewsManager->comicsView->enableFilterMode(true);
|
||||||
comicsViewsManager->comicsView->setModel(comicsModel); //TODO, columns are messed up after ResetModel some times, this shouldn't be necesary
|
comicsViewsManager->comicsView->setModel(comicsModel); //TODO, columns are messed up after ResetModel some times, this shouldn't be necesary
|
||||||
foldersView->expandAll();
|
|
||||||
|
|
||||||
if (comicsModel->rowCount() == 0)
|
if (comicsModel->rowCount() == 0)
|
||||||
comicsViewsManager->showNoSearchResultsView();
|
comicsViewsManager->showNoSearchResultsView();
|
||||||
else
|
else
|
||||||
comicsViewsManager->showComicsView();
|
comicsViewsManager->showComicsView();
|
||||||
} else if (status == LibraryWindow::Searching) { //if no searching, then ignore this
|
}
|
||||||
clearSearchFilter();
|
|
||||||
navigationController->loadPreviousStatus();
|
void LibraryWindow::setFolderSearchFilterData(QMap<unsigned long long, FolderItem *> *filteredItems, FolderItem *root)
|
||||||
}
|
{
|
||||||
|
foldersModelProxy->setFilterData(filteredItems, root);
|
||||||
|
foldersView->expandAll();
|
||||||
}
|
}
|
||||||
|
|
||||||
void LibraryWindow::clearSearchFilter()
|
void LibraryWindow::clearSearchFilter()
|
||||||
|
@ -10,6 +10,8 @@
|
|||||||
#include "yacreader_libraries.h"
|
#include "yacreader_libraries.h"
|
||||||
|
|
||||||
#include "yacreader_navigation_controller.h"
|
#include "yacreader_navigation_controller.h"
|
||||||
|
#include "comic_query_result_procesor.h"
|
||||||
|
#include "folder_query_result_processor.h"
|
||||||
|
|
||||||
#include <future>
|
#include <future>
|
||||||
|
|
||||||
@ -327,6 +329,8 @@ public slots:
|
|||||||
void toNormal();
|
void toNormal();
|
||||||
void toFullScreen();
|
void toFullScreen();
|
||||||
void setSearchFilter(const YACReader::SearchModifiers modifier, QString filter);
|
void setSearchFilter(const YACReader::SearchModifiers modifier, QString filter);
|
||||||
|
void setComicSearchFilterData(QList<ComicItem *> *, const QString &);
|
||||||
|
void setFolderSearchFilterData(QMap<unsigned long long int, FolderItem *> *filteredItems, FolderItem *root);
|
||||||
void clearSearchFilter();
|
void clearSearchFilter();
|
||||||
void showProperties();
|
void showProperties();
|
||||||
void exportLibrary(QString destPath);
|
void exportLibrary(QString destPath);
|
||||||
@ -399,6 +403,8 @@ private:
|
|||||||
std::future<void> upgradeLibraryFuture;
|
std::future<void> upgradeLibraryFuture;
|
||||||
|
|
||||||
TrayIconController *trayIconController;
|
TrayIconController *trayIconController;
|
||||||
|
ComicQueryResultProcesor comicQueryResultProcesor;
|
||||||
|
FolderQueryResultProcessor *folderQueryResultProcessor;
|
||||||
};
|
};
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
132
common/concurrent_queue.h
Normal file
132
common/concurrent_queue.h
Normal file
@ -0,0 +1,132 @@
|
|||||||
|
#ifndef CONCURRENT_QUEUE_H
|
||||||
|
#define CONCURRENT_QUEUE_H
|
||||||
|
|
||||||
|
#include <thread>
|
||||||
|
#include <mutex>
|
||||||
|
#include <functional>
|
||||||
|
#include <condition_variable>
|
||||||
|
#include <queue>
|
||||||
|
|
||||||
|
namespace YACReader {
|
||||||
|
class ConcurrentQueue
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
explicit ConcurrentQueue(int threadCount)
|
||||||
|
: jobsLeft(0),
|
||||||
|
bailout(false)
|
||||||
|
{
|
||||||
|
threads = std::vector<std::thread>(threadCount);
|
||||||
|
for (int index = 0; index < threadCount; ++index) {
|
||||||
|
threads[index] = std::thread([this] {
|
||||||
|
this->nextJob();
|
||||||
|
});
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
~ConcurrentQueue()
|
||||||
|
{
|
||||||
|
joinAll();
|
||||||
|
}
|
||||||
|
|
||||||
|
void enqueue(std::function<void(void)> job)
|
||||||
|
{
|
||||||
|
{
|
||||||
|
std::lock_guard<std::mutex> lock(queueMutex);
|
||||||
|
_queue.emplace(job);
|
||||||
|
}
|
||||||
|
|
||||||
|
{
|
||||||
|
std::lock_guard<std::mutex> lock(jobsLeftMutex);
|
||||||
|
++jobsLeft;
|
||||||
|
}
|
||||||
|
|
||||||
|
jobAvailableVar.notify_one();
|
||||||
|
}
|
||||||
|
|
||||||
|
void cancellPending()
|
||||||
|
{
|
||||||
|
std::unique_lock<std::mutex> lock(jobsLeftMutex);
|
||||||
|
_queue = std::queue<std::function<void(void)>>();
|
||||||
|
jobsLeft = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void waitAll()
|
||||||
|
{
|
||||||
|
std::unique_lock<std::mutex> lock(jobsLeftMutex);
|
||||||
|
if (jobsLeft > 0) {
|
||||||
|
_waitVar.wait(lock, [this] {
|
||||||
|
return jobsLeft == 0;
|
||||||
|
});
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
std::vector<std::thread> threads;
|
||||||
|
std::queue<std::function<void(void)>> _queue;
|
||||||
|
int jobsLeft;
|
||||||
|
bool bailout;
|
||||||
|
std::condition_variable jobAvailableVar;
|
||||||
|
std::condition_variable _waitVar;
|
||||||
|
std::mutex jobsLeftMutex;
|
||||||
|
std::mutex queueMutex;
|
||||||
|
|
||||||
|
void nextJob()
|
||||||
|
{
|
||||||
|
while (true) {
|
||||||
|
std::function<void(void)> job;
|
||||||
|
|
||||||
|
{
|
||||||
|
std::unique_lock<std::mutex> lock(queueMutex);
|
||||||
|
|
||||||
|
if (bailout) {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
jobAvailableVar.wait(lock, [this] {
|
||||||
|
return _queue.size() > 0 || bailout;
|
||||||
|
});
|
||||||
|
|
||||||
|
if (bailout) {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
job = _queue.front();
|
||||||
|
_queue.pop();
|
||||||
|
}
|
||||||
|
|
||||||
|
job();
|
||||||
|
|
||||||
|
{
|
||||||
|
std::lock_guard<std::mutex> lock(jobsLeftMutex);
|
||||||
|
--jobsLeft;
|
||||||
|
}
|
||||||
|
|
||||||
|
_waitVar.notify_one();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void joinAll()
|
||||||
|
{
|
||||||
|
{
|
||||||
|
std::lock_guard<std::mutex> lock(queueMutex);
|
||||||
|
|
||||||
|
if (bailout) {
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
bailout = true;
|
||||||
|
}
|
||||||
|
|
||||||
|
jobAvailableVar.notify_all();
|
||||||
|
|
||||||
|
for (auto &x : threads) {
|
||||||
|
if (x.joinable()) {
|
||||||
|
x.join();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif // CONCURRENT_QUEUE_H
|
@ -36,8 +36,7 @@ enum YACReaderErrors {
|
|||||||
enum SearchModifiers {
|
enum SearchModifiers {
|
||||||
NoModifiers = 0,
|
NoModifiers = 0,
|
||||||
OnlyRead,
|
OnlyRead,
|
||||||
OnlyUnread,
|
OnlyUnread
|
||||||
ByAuthor
|
|
||||||
};
|
};
|
||||||
|
|
||||||
enum LabelColors {
|
enum LabelColors {
|
||||||
|
@ -40,7 +40,7 @@ YACReaderSearchLineEdit::YACReaderSearchLineEdit(QWidget *parent)
|
|||||||
#ifdef Q_OS_MAC
|
#ifdef Q_OS_MAC
|
||||||
setMaximumWidth(212);
|
setMaximumWidth(212);
|
||||||
#else
|
#else
|
||||||
setMaximumWidth(173);
|
setMaximumWidth(255);
|
||||||
setFixedHeight(26);
|
setFixedHeight(26);
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
Loading…
x
Reference in New Issue
Block a user