remwharead/src/adoc.cpp

236 lines
7.4 KiB
C++
Raw Normal View History

2019-05-16 08:37:50 +02:00
/* This file is part of remwharead.
* Copyright © 2019 tastytea <tastytea@tastytea.de>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <regex>
#include <algorithm>
#include <utility>
2019-05-19 19:04:18 +02:00
#include <locale>
2019-05-16 08:37:50 +02:00
#include <curlpp/cURLpp.hpp>
#include "version.hpp"
#include "export.hpp"
using std::cerr;
using std::endl;
using std::regex;
using std::regex_replace;
2019-05-16 12:39:22 +02:00
using tagpair = std::pair<string,vector<Database::entry>>;
2019-05-16 08:37:50 +02:00
void Export::AsciiDoc::print() const
2019-05-16 08:37:50 +02:00
{
try
2019-05-16 08:37:50 +02:00
{
_out << "= Visited things\n"
<< ":Author: remwharead " << global::version << endl
<< ":Date: "
<< timepoint_to_string(system_clock::now()) << endl
<< ":TOC: right" << endl
<< ":TOCLevels: 2" << endl
<< endl;
tagmap alltags;
string day;
for (const Database::entry &entry : _entries)
2019-05-16 08:37:50 +02:00
{
const string newday = get_day(entry);
if (newday != day)
2019-05-16 08:37:50 +02:00
{
day = newday;
_out << "== " << day << endl << endl;
}
_out << "[[dt_" << timepoint_to_string(entry.datetime) << "]]\n";
_out << "* link:" << entry.uri;
if (!entry.title.empty())
{
_out << '[' << replace_in_title(entry.title) << ']';
}
else
{
_out << "[]";
}
_out << " +" << endl;
_out << '_' << get_time(entry).substr(0, 5) << '_';
if (!entry.archive_uri.empty())
{
_out << " (link:" << entry.archive_uri << "[archived version])";
}
bool separator = false;
for (const string &tag : entry.tags)
{
if (tag.empty())
2019-05-16 08:37:50 +02:00
{
continue;
2019-05-16 08:37:50 +02:00
}
if (!separator)
{
_out << "\n| ";
separator = true;
}
2019-05-16 08:37:50 +02:00
auto globaltag = alltags.find(tag);
if (globaltag != alltags.end())
2019-05-16 08:37:50 +02:00
{
globaltag->second.push_back(entry);
2019-05-16 08:37:50 +02:00
}
else
2019-05-16 08:37:50 +02:00
{
alltags.insert({ tag, { entry } });
2019-05-16 08:37:50 +02:00
}
_out << "xref:t_" << replace_in_tag(tag) << "[" << tag << ']';
if (tag != *(entry.tags.rbegin()))
2019-05-16 08:37:50 +02:00
{
_out << ", ";
2019-05-16 08:37:50 +02:00
}
}
2019-05-16 12:53:32 +02:00
if (!entry.description.empty())
2019-05-16 08:37:50 +02:00
{
_out << " +" << endl << entry.description;
2019-05-16 08:37:50 +02:00
}
_out << endl << endl;
2019-05-16 08:37:50 +02:00
}
if (!alltags.empty())
2019-05-16 08:37:50 +02:00
{
print_tags(alltags);
2019-05-16 08:37:50 +02:00
}
}
catch (std::exception &e)
{
cerr << "Error in " << __func__ << ": " << e.what() << endl;
}
}
2019-05-16 08:37:50 +02:00
const string Export::AsciiDoc::replace(string text,
const replacemap &replacements) const
{
for (const std::pair<const string, const string> &sr : replacements)
{
size_t pos = 0;
while ((pos = text.find(sr.first, pos)) != std::string::npos)
{
text.replace(pos, sr.first.length(), sr.second);
pos += sr.second.length();
}
}
return text;
}
const string Export::AsciiDoc::replace_in_tag(const string &text) const
{
// TODO: Find a better solution.
const replacemap replacements =
{
{ " ", "-" }, { "§", "-" },
{ "$", "-" }, { "%", "-" },
{ "&", "-" }, { "/", "-" },
{ "=", "-" }, { "^", "-" },
{ "!", "-" }, { "?", "-" },
{ "", "0" }, { "", "0" },
{ "", "1" }, { "¹", "1" },
{ "", "2" }, { "²", "2" },
{ "", "3" }, { "³", "3" },
{ "", "4" }, { "", "4" },
{ "", "5" }, { "", "5" },
{ "", "6" }, { "", "6" },
{ "", "7" }, { "", "7" },
{ "", "8" }, { "", "8" },
{ "", "9" }, { "", "9" }
};
return replace(text, replacements);
}
const string Export::AsciiDoc::replace_in_title(const string &text) const
{
// [ is implicitly escaped if the corresponding ] is.
return replace(text, {{ "]", "\\]" }});
}
void Export::AsciiDoc::print_tags(const tagmap &tags) const
{
_out << "== Tags\n\n";
vector<tagpair> sortedtags(tags.size());
std::move(tags.begin(), tags.end(), sortedtags.begin());
std::sort(sortedtags.begin(), sortedtags.end(),
[](const tagpair &a, tagpair &b)
{
if (a.second.size() != b.second.size())
{ // Sort by number of occurrences if they are different.
return a.second.size() > b.second.size();
}
else
{ // Sort by tag names otherwise.
std::locale loc;
const std::collate<char> &coll =
std::use_facet<std::collate<char>>(loc);
return (coll.compare(
a.first.data(), a.first.data()
+ a.first.length(),
b.first.data(), b.first.data()
+ b.first.length()) == -1);
}
});
bool othertags = false; // Have we printed “Less used tags” already?
for (const auto &tag : sortedtags)
{
// If we have more than 20 tags, group all tags that occur only 1 time
// under the section “Less used tags”.
if (sortedtags.size() > 20 && tag.second.size() == 1)
{
if (!othertags)
{
_out << "=== Less used tags\n\n";
othertags = true;
}
_out << "=";
}
_out << "=== [[t_" << replace_in_tag(tag.first) << "]]"
<< tag.first << endl;
for (const Database::entry &entry : tag.second)
{
const string datetime = timepoint_to_string(entry.datetime);
const string date = datetime.substr(0, datetime.find('T'));
string title = replace_in_title(entry.title);
if (title.empty())
{
title = "++" + entry.uri + "++";
}
_out << endl << "* xref:dt_" << datetime
<< '[' << title << "] _(" << date << ")_" << endl;
}
_out << endl;
}
_out << endl;
}
const string Export::AsciiDoc::get_day(const Database::entry &entry) const
{
const string datetime = timepoint_to_string(entry.datetime);
return datetime.substr(0, datetime.find('T'));
}
const string Export::AsciiDoc::get_time(const Database::entry &entry) const
{
const string datetime = timepoint_to_string(entry.datetime);
return datetime.substr(datetime.find('T') + 1);
}