blob: e744f92121de71d06a53e817aedd32e4f3b4fdb4 (
plain) (
blame)
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
|
#ifndef CACHEHANDLER_HPP
#define CACHEHANDLER_HPP
#include "mimeparser.hpp"
#include <memory>
#include <unordered_map>
#include <QUrl>
#include <QString>
#include <QByteArray>
#include <QtGlobal>
#include <QDateTime>
// Need a QString hash implementation for Qt versions below 5.14
#if QT_VERSION < QT_VERSION_CHECK(5, 14, 0)
#include <QHash>
namespace std
{
template<>
struct hash<QString>
{
std::size_t operator()(const QString& s) const noexcept
{
return (size_t)qHash(s);
}
};
}
#endif
struct CachedPage
{
QUrl url;
QByteArray body;
MimeType mime;
int scroll_pos;
QDateTime time_cached;
// also: maybe compress page contents? May test
// to see if it's worth it
CachedPage(const QUrl &url, const QByteArray &body,
const MimeType &mime, const QDateTime &cached)
: url(url), body(body), mime(mime), scroll_pos(-1), time_cached(cached)
{
this->url.setFragment("");
}
};
// Maybe unordered_map isn't the best type for this?
typedef std::unordered_map<QString, std::shared_ptr<CachedPage>> CacheMap;
class CacheHandler
{
public:
void push(QUrl const & url, QByteArray const & body, MimeType const & mime);
std::shared_ptr<CachedPage> find(QUrl const &url);
bool contains(QUrl const & url);
int size();
void clean();
CacheMap const& getPages() const;
private:
void popOldest();
static QString cleanUrl(QUrl const & str);
private:
// In-memory cache storage.
CacheMap page_cache;
};
#endif
|
