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
|
/* Copyright 2020 Jaakko Keränen <jaakko.keranen@iki.fi>
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. 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.
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. */
#pragma once
#include "gmdocument.h"
#include "gmrequest.h"
#include <the_Foundation/ptrarray.h>
#include <the_Foundation/regexp.h>
#include <the_Foundation/string.h>
#include <the_Foundation/stringarray.h>
#include <the_Foundation/time.h>
iDeclareType(RecentUrl)
iDeclareTypeConstruction(RecentUrl)
struct Impl_RecentUrl {
iString url;
float normScrollY; /* normalized to document height */
iGmResponse *cachedResponse; /* kept in memory for quicker back navigation */
iGmDocument *cachedDoc; /* cached copy of the presentation: layout and media (not serialized) */
};
iDeclareType(MemInfo)
struct Impl_MemInfo {
size_t cacheSize; /* number of bytes stored persistently */
size_t memorySize; /* number of bytes stored in RAM */
};
/*----------------------------------------------------------------------------------------------*/
iDeclareType(History)
iDeclareTypeConstruction(History)
iDeclareTypeSerialization(History)
iHistory * copy_History (const iHistory *);
void clear_History (iHistory *);
void add_History (iHistory *, const iString *url);
void replace_History (iHistory *, const iString *url);
void setCachedResponse_History (iHistory *, const iGmResponse *response);
void setCachedDocument_History (iHistory *, iGmDocument *doc);
iBool goBack_History (iHistory *);
iBool goForward_History (iHistory *);
iBool preceding_History (iHistory *d, iRecentUrl *recent_out);
//iBool following_History (iHistory *d, iRecentUrl *recent_out);
iRecentUrl *recentUrl_History (iHistory *, size_t pos);
iRecentUrl *mostRecentUrl_History (iHistory *);
iRecentUrl *findUrl_History (iHistory *, const iString *url);
void clearCache_History (iHistory *);
size_t pruneLeastImportant_History (iHistory *);
size_t pruneLeastImportantMemory_History (iHistory *);
iBool atLatest_History (const iHistory *);
iBool atOldest_History (const iHistory *);
const iStringArray * searchContents_History (const iHistory *, const iRegExp *pattern); /* chronologically ascending */
const iString *
url_History (const iHistory *, size_t pos);
const iRecentUrl *
constRecentUrl_History (const iHistory *d, size_t pos);
const iRecentUrl *
constMostRecentUrl_History (const iHistory *);
const iGmResponse *
cachedResponse_History (const iHistory *);
size_t cacheSize_History (const iHistory *);
size_t memorySize_History (const iHistory *);
iString * debugInfo_History (const iHistory *);
iMemInfo memoryUsage_History (const iHistory *);
|
