1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
// Copyright (C) 2016 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
#include "recentfiles.h"
#include "globals.h"
#include <QtCore/QDebug>
#include <QtCore/QFileInfo>
#include <QtCore/QSettings>
#include <QtCore/QString>
#include <QtCore/QStringList>
QT_BEGIN_NAMESPACE
static QString configKey()
{
return settingPath("RecentlyOpenedFiles");
}
RecentFiles::RecentFiles(const int maxEntries)
: m_groupOpen(false),
m_clone1st(false),
m_maxEntries(maxEntries)
{
m_timer.setSingleShot(true);
m_timer.setInterval(3 * 60 * 1000);
connect(&m_timer, &QTimer::timeout,
this, &RecentFiles::closeGroup);
}
/*
* The logic is as follows:
* - The most recent (i.e., topmost) item can be open ("in flux")
* - The item is closed by either a timeout (3 min or so) or a
* "terminal action" (e.g., closing all files)
* - While the item is open, modifications to the set of open files
* will modify that item instead of creating new items
* - If the open item is modified to be equal to an existing item,
* the existing item is deleted, but will be re-created when the
* open item is modified even further
* Cases (actions in parentheses are no-ops):
* - identical to top item => (do nothing)
* - closed, new item => insert at top, (clear marker)
* - closed, existing item => move to top, mark for cloning
* - open, new item, not marked => replace top, (clear marker)
* - open, new item, marked => insert at top, clear marker
* - open, existing item, not marked => replace top, delete copy, mark for cloning
* - open, existing item, marked => insert at top, delete copy, (mark for cloning)
* - closing clears marker
*/
void RecentFiles::addFiles(const QStringList &names)
{
if (m_strLists.isEmpty() || names != m_strLists.first()) {
if (m_groupOpen && !m_clone1st)
// Group being open implies at least one item in the list
m_strLists.removeFirst();
m_groupOpen = true;
// We do *not* sort the actual entries, as that would destroy the user's
// chosen arrangement. However, we do the searching on sorted lists, so
// we throw out (probably) obsolete arrangements.
QList<QStringList> sortedLists = m_strLists;
for (int i = 0; i < sortedLists.size(); ++i)
sortedLists[i].sort();
QStringList sortedNames = names;
sortedNames.sort();
int index = sortedLists.indexOf(sortedNames);
if (index >= 0) {
m_strLists.removeAt(index);
m_clone1st = true;
} else {
if (m_strLists.size() >= m_maxEntries)
m_strLists.removeLast();
m_clone1st = false;
}
m_strLists.prepend(names);
}
m_timer.start();
}
void RecentFiles::closeGroup()
{
m_timer.stop();
m_groupOpen = false;
}
void RecentFiles::readConfig()
{
m_strLists.clear();
QVariant val = QSettings().value(configKey());
if (val.metaType().id() == QMetaType::QVariantList) {
const auto list = val.toList();
for (const QVariant &v : list)
m_strLists << v.toStringList();
}
}
void RecentFiles::writeConfig() const
{
QList<QVariant> vals;
for (const QStringList &sl : m_strLists)
vals << sl;
QSettings().setValue(configKey(), vals);
}
QT_END_NAMESPACE
|
