Hashtag usage graphs
FossilOrigin-Name: 1a355c5c2f0b9143d27d724484d7ef81c363f7209db5dd3a4677c64a42613585
This commit is contained in:
parent
d901b99839
commit
238b2bcd19
5 changed files with 179 additions and 4 deletions
|
@ -526,7 +526,7 @@ void content_account_bookmarks(struct session* ssn, mastodont_t* api, char** dat
|
|||
|
||||
void content_account_favourites(struct session* ssn, mastodont_t* api, char** data)
|
||||
{
|
||||
size_t status_count = 0, statuses_html_count = 0;
|
||||
size_t status_count = 0, statuses_html_count = 0;
|
||||
struct mstdnt_status* statuses = NULL;
|
||||
struct mstdnt_storage storage = { 0 };
|
||||
char* status_format = NULL,
|
||||
|
|
126
src/graphsnbars.c
Normal file
126
src/graphsnbars.c
Normal file
|
@ -0,0 +1,126 @@
|
|||
/*
|
||||
* Treebird - Lightweight frontend for Pleroma
|
||||
* Copyright (C) 2022 Nekobit
|
||||
*
|
||||
* 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, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <string.h>
|
||||
#include <time.h>
|
||||
#include "graphsnbars.h"
|
||||
#include "easprintf.h"
|
||||
#include "string_helpers.h"
|
||||
|
||||
// Pages
|
||||
#include "../static/bar.chtml"
|
||||
#include "../static/bar_graph.chtml"
|
||||
|
||||
struct hashtags_graph_args
|
||||
{
|
||||
struct mstdnt_tag* tags;
|
||||
size_t tags_len;
|
||||
unsigned max;
|
||||
time_t rel_day;
|
||||
size_t days;
|
||||
};
|
||||
|
||||
char* construct_bar_graph_container(char* bars, size_t* size)
|
||||
{
|
||||
char* bar_graph_html;
|
||||
|
||||
size_t s = easprintf(&bar_graph_html, data_bar_graph_html, bars);
|
||||
|
||||
if (size) *size = s;
|
||||
return bar_graph_html;
|
||||
}
|
||||
|
||||
char* construct_bar(float value, int* size)
|
||||
{
|
||||
char* bar_html;
|
||||
|
||||
size_t s = easprintf(&bar_html, data_bar_html,
|
||||
value*100);
|
||||
|
||||
if (size) *size = s;
|
||||
return bar_html;
|
||||
}
|
||||
|
||||
static char* construct_hashgraph_voidwrap(void* passed, size_t index, int* res)
|
||||
{
|
||||
unsigned curr_sum = 0;
|
||||
struct hashtags_graph_args* args = passed;
|
||||
struct mstdnt_tag* tags = args->tags;
|
||||
size_t tags_len = args->tags_len;
|
||||
unsigned max = args->max;
|
||||
time_t rel_day = args->rel_day;
|
||||
size_t days = args->days;
|
||||
|
||||
for (int i = 0; i < tags_len; ++i)
|
||||
{
|
||||
for (int j = 0; j < tags[i].history_len; ++j)
|
||||
{
|
||||
if (tags[i].history[j].day == rel_day-((days-index-1)*86400))
|
||||
curr_sum += tags[i].history[j].uses;
|
||||
}
|
||||
}
|
||||
|
||||
return construct_bar((float)curr_sum / max, res);
|
||||
}
|
||||
|
||||
char* construct_hashtags_graph(struct mstdnt_tag* tags,
|
||||
size_t tags_len,
|
||||
size_t days,
|
||||
size_t* ret_size)
|
||||
{
|
||||
unsigned max_sum = 0;
|
||||
unsigned curr_sum = 0;
|
||||
size_t max_history_len = 0;
|
||||
|
||||
// Get current time at midnight for basis, copy over
|
||||
time_t t = time(NULL);
|
||||
struct tm* mn_ptr = gmtime(&t);
|
||||
struct tm mn;
|
||||
memcpy(&mn, mn_ptr, sizeof(mn));
|
||||
mn.tm_hour = 0;
|
||||
mn.tm_min = 0;
|
||||
mn.tm_sec = 0;
|
||||
time_t rel_day = timegm(&mn);
|
||||
|
||||
// Run a loop through all the hashtags, sum each set up,
|
||||
// then get the largest sum
|
||||
for (size_t i = 0; i < days; ++i)
|
||||
{
|
||||
for (size_t j = 0; j < tags_len && i < tags[j].history_len; ++j)
|
||||
{
|
||||
if (tags[j].history_len > max_history_len)
|
||||
max_history_len = tags[j].history_len;
|
||||
if (tags[j].history[i].day >= rel_day-(i*86400))
|
||||
curr_sum += tags[j].history[i].uses;
|
||||
}
|
||||
|
||||
if (curr_sum > max_sum)
|
||||
max_sum = curr_sum;
|
||||
curr_sum = 0;
|
||||
}
|
||||
|
||||
struct hashtags_graph_args args = {
|
||||
.tags = tags,
|
||||
.tags_len = tags_len,
|
||||
.max = max_sum,
|
||||
.rel_day = rel_day,
|
||||
.days = max_history_len,
|
||||
};
|
||||
|
||||
return construct_func_strings(construct_hashgraph_voidwrap, &args, max_history_len, ret_size);
|
||||
}
|
32
src/graphsnbars.h
Normal file
32
src/graphsnbars.h
Normal file
|
@ -0,0 +1,32 @@
|
|||
/*
|
||||
* Treebird - Lightweight frontend for Pleroma
|
||||
* Copyright (C) 2022 Nekobit
|
||||
*
|
||||
* 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, either version 3 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* 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 <https://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef GRAPHS_N_BARS_H
|
||||
#define GRAPHS_N_BARS_H
|
||||
#include <stddef.h>
|
||||
#include <mastodont.h>
|
||||
#include "session.h"
|
||||
|
||||
char* construct_bar_graph_container(char* bars, size_t* size);
|
||||
char* construct_bar(float value, int* size);
|
||||
char* construct_hashtags_graph(struct mstdnt_tag* tags,
|
||||
size_t tags_len,
|
||||
size_t days,
|
||||
size_t* ret_size);
|
||||
|
||||
#endif /* GRAPHS_N_BARS_H */
|
21
src/search.c
21
src/search.c
|
@ -26,6 +26,7 @@
|
|||
#include "hashtag.h"
|
||||
#include "error.h"
|
||||
#include "account.h"
|
||||
#include "graphsnbars.h"
|
||||
|
||||
// Pages
|
||||
#include "../static/search.chtml"
|
||||
|
@ -139,6 +140,9 @@ void content_search_accounts(struct session* ssn, mastodont_t* api, char** data)
|
|||
void content_search_hashtags(struct session* ssn, mastodont_t* api, char** data)
|
||||
{
|
||||
char* tags_html;
|
||||
char* tags_graph = NULL;
|
||||
char* tags_bars = NULL;
|
||||
char* tags_page;
|
||||
struct mstdnt_storage storage = { 0 };
|
||||
struct mstdnt_search_args args = {
|
||||
.account_id = NULL,
|
||||
|
@ -163,12 +167,25 @@ void content_search_hashtags(struct session* ssn, mastodont_t* api, char** data)
|
|||
tags_html = construct_hashtags(results.tags, results.tags_len, NULL);
|
||||
if (!tags_html)
|
||||
tags_html = construct_error("No hashtags", E_ERROR, 1, NULL);
|
||||
|
||||
tags_bars = construct_hashtags_graph(results.tags,
|
||||
results.tags_len,
|
||||
14,
|
||||
NULL);
|
||||
tags_graph = construct_bar_graph_container(tags_bars, NULL);
|
||||
if (tags_bars) free(tags_bars);
|
||||
}
|
||||
else
|
||||
tags_html = construct_error("An error occured.", E_ERROR, 1, NULL);
|
||||
|
||||
easprintf(&tags_page, "%s%s", STR_NULL_EMPTY(tags_graph), tags_html);
|
||||
|
||||
search_page(ssn, api, SEARCH_HASHTAGS, STR_NULL_EMPTY(tags_html));
|
||||
search_page(ssn, api, SEARCH_HASHTAGS, tags_page);
|
||||
|
||||
if (tags_html) free(tags_html);
|
||||
// TODO cleanup shit
|
||||
mastodont_storage_cleanup(&storage);
|
||||
if (tags_graph) free(tags_graph);
|
||||
free(tags_page);
|
||||
|
||||
// TODO Cleanup shit
|
||||
}
|
||||
|
|
|
@ -1,3 +1,3 @@
|
|||
<div class="bar">
|
||||
<div style="height: %d%%;"></div>
|
||||
<div style="max-height: %.1f%%;"></div>
|
||||
</div>
|
||||
|
|
Loading…
Reference in a new issue