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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the Qt Mobility Components.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QORGANIZERDBCACHE_H
#define QORGANIZERDBCACHE_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists purely as an
// implementation detail. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
//
#include "qtorganizer.h"
#include "qorganizerdbcachewrappers.h"
#include <QCache>
QTM_USE_NAMESPACE
class OrganizerGuidCacheKey {
public:
OrganizerGuidCacheKey(int calId, int compType, QString guid)
: m_calId(calId), m_compType(compType), m_guid(guid) { }
int m_calId;
int m_compType;
QString m_guid;
};
inline bool operator==(const OrganizerGuidCacheKey &k1, const OrganizerGuidCacheKey &k2)
{
return (k1.m_calId == k2.m_calId && k1.m_compType == k2.m_compType
&& k1.m_guid == k2.m_guid);
}
inline uint qHash(const OrganizerGuidCacheKey &key)
{
return qHash(key.m_guid); // TODO: Check this
}
class OrganizerIdCacheKey {
public:
OrganizerIdCacheKey(int calId, QString id)
: m_calId(calId), m_id(id) { }
int m_calId;
QString m_id;
};
inline bool operator==(const OrganizerIdCacheKey &k1, const OrganizerIdCacheKey &k2)
{
return (k1.m_calId == k2.m_calId && k1.m_id == k2.m_id);
}
inline uint qHash(const OrganizerIdCacheKey &key)
{
return qHash(key.m_id) ^ qHash(key.m_calId);
}
class OrganizerCalIdTypeIdCacheKey {
public:
OrganizerCalIdTypeIdCacheKey(int calId, int compType)
: m_calId(calId), m_compType(compType) { }
int m_calId;
int m_compType;
};
inline bool operator==(const OrganizerCalIdTypeIdCacheKey &k1, const OrganizerCalIdTypeIdCacheKey &k2)
{
return (k1.m_calId == k2.m_calId && k1.m_compType == k2.m_compType);
}
inline uint qHash(const OrganizerCalIdTypeIdCacheKey &key)
{
return qHash(key.m_calId) ^ qHash(key.m_compType);
}
class OrganizerDbCache : public QObject {
Q_OBJECT
public:
OrganizerDbCache();
~OrganizerDbCache();
void insertEvent(const OrganizerIdCacheKey &key, const CEvent* event);
void insertTodo(const OrganizerIdCacheKey &key, const CTodo* todo);
void insertJournal(const OrganizerIdCacheKey &key, const CJournal* journal);
void insertEventVector(const OrganizerGuidCacheKey &key, const std::vector<CEvent *>& eventVector);
void insertTodoVector(const OrganizerGuidCacheKey &key, const std::vector<CTodo *>& todoVector);
void insertJournalVector(const OrganizerGuidCacheKey &key, const std::vector<CJournal *>& journalVector);
void insertCalId(quint32 key, int value);
void insertTypeId(quint32 key, int value);
void insertIds(const OrganizerCalIdTypeIdCacheKey &key, const std::vector<std::string>& idsVector);
bool containsEvent(const OrganizerIdCacheKey &key) const;
bool containsTodo(const OrganizerIdCacheKey &key) const;
bool containsJournal(const OrganizerIdCacheKey &key) const;
bool containsEventVector(const OrganizerGuidCacheKey &key) const;
bool containsTodoVector(const OrganizerGuidCacheKey &key) const;
bool containsJournalVector(const OrganizerGuidCacheKey &key) const;
bool containsCalId(quint32 key) const;
bool containsTypeId(quint32 key) const;
bool containsIds(const OrganizerCalIdTypeIdCacheKey &key) const;
CEvent* takeEvent(const OrganizerIdCacheKey &key) const;
CTodo* takeTodo(const OrganizerIdCacheKey &key) const;
CJournal* takeJournal(const OrganizerIdCacheKey &key) const;
void takeEventVector(const OrganizerGuidCacheKey &key, std::vector<CEvent *>& result) const;
void takeTodoVector(const OrganizerGuidCacheKey &key, std::vector<CTodo *>& result) const;
void takeJournalVector(const OrganizerGuidCacheKey &key, std::vector<CJournal *>& result) const;
int takeCalId(quint32 key) const;
int takeTypeId(quint32 key) const;
void takeIdsVector(const OrganizerCalIdTypeIdCacheKey &key, std::vector<std::string>& result) const;
public Q_SLOTS:
void invalidate();
private:
QCache<OrganizerIdCacheKey, OrganizerCacheEvent> m_idEventCache;
QCache<OrganizerIdCacheKey, OrganizerCacheTodo> m_idTodoCache;
QCache<OrganizerIdCacheKey, OrganizerCacheJournal> m_idJournalCache;
QCache<OrganizerGuidCacheKey, QList<OrganizerCacheEvent> > m_guidEventCache;
QCache<OrganizerGuidCacheKey, QList<OrganizerCacheTodo> > m_guidTodoCache;
QCache<OrganizerGuidCacheKey, QList<OrganizerCacheJournal> > m_guidJournalCache;
QCache<quint32, int> m_calIdCache;
QCache<quint32, int> m_typeCache;
QCache<OrganizerCalIdTypeIdCacheKey, std::vector<std::string> > m_idsCache;
};
#endif // QORGANIZERDBCACHE_H
|
