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
|
/* This file is part of mastodonpp.
* Copyright © 2020 tastytea <tastytea@tastytea.de>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, version 3.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "log.hpp"
#include "types.hpp"
#include <algorithm>
#include <cctype>
namespace mastodonpp
{
using std::search;
using std::tolower;
answer_type::operator bool() const
{
return (curl_error_code == 0 && http_status == 200);
}
answer_type::operator string_view() const
{
return body;
}
std::ostream &operator <<(std::ostream &out, const answer_type &answer)
{
out << answer.body;
return out;
}
string_view answer_type::get_header(const string_view field) const
{
const string_view searchstring{string(field) += ':'};
auto it{search(headers.begin(), headers.end(),
searchstring.begin(), searchstring.end(),
[](unsigned char a, unsigned char b)
{ return tolower(a) == tolower(b); })};
if (it != headers.end())
{
auto pos{static_cast<size_t>(it - headers.begin())};
pos = headers.find(':', pos) + 2;
const auto endpos{headers.find('\n', pos)};
return string_view(&headers[pos], endpos - pos);
}
return {};
}
parametermap answer_type::parse_pagination(const bool next) const
{
const string_view link{get_header("Link")};
if (link.empty())
{
return {};
}
const auto direction{next ? R"(rel="next")" : R"(rel="prev")"};
auto endpos{link.find(direction)};
endpos = link.rfind('>', endpos);
auto startpos{link.rfind('?', endpos) + 1};
const string_view paramstr{link.substr(startpos, endpos - startpos)};
debuglog << "Found parameters in Link header: " << paramstr << '\n';
startpos = 0;
parametermap parameters;
while ((endpos = paramstr.find('=', startpos)) != string_view::npos)
{
parameterpair param;
param.first = paramstr.substr(startpos, endpos - startpos);
startpos = endpos + 1;
endpos = paramstr.find('&', startpos);
param.second = paramstr.substr(startpos, endpos - startpos);
parameters.insert(param);
if (endpos == string_view::npos)
{
break;
}
startpos = endpos + 1;
}
return parameters;
}
} // namespace mastodonpp
|
