remwharead/src/adoc.cpp

194 lines
6.5 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 <map>
#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 "time.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_adoc(const vector<Database::entry> &entries, ostream &out)
{
try
{
out << "= Visited things\n"
<< ":Author: remwharead " << global::version << endl
2019-05-16 12:53:32 +02:00
<< ":Date: " << timepoint_to_string(system_clock::now()) << endl
2019-05-17 01:42:49 +02:00
<< ":TOC: right" << endl
2019-05-16 08:37:50 +02:00
// << ":toc-title:" << endl
<< endl;
2019-05-16 12:39:22 +02:00
std::map<string,vector<Database::entry>> alltags;
2019-05-16 08:37:50 +02:00
string day;
for (const Database::entry &entry : entries)
{
const string datetime = timepoint_to_string(entry.datetime);
const string newday = datetime.substr(0, datetime.find('T'));
const string time = datetime.substr(datetime.find('T') + 1);
if (newday != day)
{
day = newday;
out << "== " << day << endl << endl;
}
2019-05-16 12:53:32 +02:00
out << "[[dt_" << datetime << "]]\n";
out << "* link:" << entry.uri;
2019-05-16 08:37:50 +02:00
if (!entry.title.empty())
{
out << '[' << entry.title << ']';
}
else
{
out << "[]";
}
out << " +" << endl;
2019-05-16 12:53:32 +02:00
out << '_' << time.substr(0, 5) << '_';
if (!entry.archive_uri.empty())
{
out << " (link:" << entry.archive_uri << "[archived version])";
}
bool separator = false;
2019-05-16 08:37:50 +02:00
for (const string &tag : entry.tags)
{
if (tag.empty())
{
continue;
}
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 12:39:22 +02:00
globaltag->second.push_back(entry);
2019-05-16 08:37:50 +02:00
}
else
{
2019-05-16 12:39:22 +02:00
alltags.insert({ tag, { entry } });
2019-05-16 08:37:50 +02:00
}
out << "xref:t_" << replace_in_tags(tag) << "[" << tag << ']';
2019-05-16 08:37:50 +02:00
if (tag != *(entry.tags.rbegin()))
{
out << ", ";
2019-05-16 08:37:50 +02:00
}
}
2019-05-16 12:53:32 +02:00
2019-05-16 08:37:50 +02:00
if (!entry.description.empty())
{
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())
{
out << "== Tags\n\n";
2019-05-16 12:39:22 +02:00
vector<tagpair> sortedtags(alltags.size());
2019-05-16 08:37:50 +02:00
std::move(alltags.begin(), alltags.end(), sortedtags.begin());
std::sort(sortedtags.begin(), sortedtags.end(),
2019-05-16 12:39:22 +02:00
[](const tagpair &a, tagpair &b)
2019-05-16 08:37:50 +02:00
{
if (a.second.size() != b.second.size())
{ // Sort by number of occurrences if they are
// different.
return a.second.size() > b.second.size();
}
else
2019-05-19 19:04:18 +02:00
{ // Sort by tag names otherwise.
2019-05-22 12:25:06 +02:00
std::locale loc;
2019-05-19 19:04:18 +02:00
const std::collate<char> &coll =
std::use_facet<std::collate<char>>(loc);
2019-05-22 12:25:06 +02:00
return (coll.compare(
a.first.data(), a.first.data()
+ a.first.length(),
b.first.data(), b.first.data()
+ b.first.length()) == -1);
}
2019-05-16 08:37:50 +02:00
});
for (const auto &tag : sortedtags)
{
out << "=== [[t_" << replace_in_tags(tag.first) << "]]"
2019-05-16 12:39:22 +02:00
<< tag.first << endl;
for (const Database::entry &entry : tag.second)
2019-05-16 08:37:50 +02:00
{
string title = entry.title;
if (title.empty())
{
title = "++" + entry.uri + "++";
}
out << endl << "* xref:dt_"
2019-05-16 12:39:22 +02:00
<< timepoint_to_string(entry.datetime)
<< '[' << title << ']' << endl;
2019-05-16 08:37:50 +02:00
}
2019-05-16 12:39:22 +02:00
out << endl;
2019-05-16 08:37:50 +02:00
}
}
}
catch (std::exception &e)
{
cerr << "Error in " << __func__ << ": " << e.what() << endl;
}
}
const string replace_in_tags(string text)
2019-05-16 08:37:50 +02:00
{
// TODO: Find a better solution.
const std::map<const string, const string> searchreplace =
{
{ " ", "-" }, { "§", "-" },
{ "$", "-" }, { "%", "-" },
{ "&", "-" }, { "/", "-" },
{ "=", "-" }, { "^", "-" },
{ "!", "-" }, { "?", "-" },
{ "", "0" }, { "", "0" },
{ "", "1" }, { "¹", "1" },
{ "", "2" }, { "²", "2" },
{ "", "3" }, { "³", "3" },
{ "", "4" }, { "", "4" },
{ "", "5" }, { "", "5" },
{ "", "6" }, { "", "6" },
{ "", "7" }, { "", "7" },
{ "", "8" }, { "", "8" },
{ "", "9" }, { "", "9" }
};
for (const std::pair<const string, const string> &sr : searchreplace)
{
size_t pos = 0;
while ((pos = text.find(sr.first, pos)) != std::string::npos)
{
text.replace(pos, sr.first.length(), sr.second);
}
}
return text;
2019-05-16 08:37:50 +02:00
}