btop/src/btop_draw.h

290 lines
9 KiB
C
Raw Normal View History

/* Copyright 2021 Aristocratos (jakob@qvantnet.com)
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
indent = tab
tab-size = 4
*/
#include <string>
#include <vector>
2021-05-30 12:15:09 +12:00
#include <array>
2021-06-01 07:47:41 +12:00
#include <map>
2021-05-29 12:32:36 +12:00
#include <robin_hood.h>
#include <ranges>
2021-05-28 08:29:36 +12:00
#include <algorithm>
#include <cmath>
#include <btop_config.h>
#include <btop_tools.h>
#ifndef _btop_draw_included_
#define _btop_draw_included_ 1
2021-05-30 12:15:09 +12:00
using std::string, std::vector, robin_hood::unordered_flat_map, std::round, std::views::iota,
std::string_literals::operator""s, std::clamp, std::array, std::floor;
2021-05-29 12:32:36 +12:00
namespace Symbols {
const string h_line = "";
const string v_line = "";
const string left_up = "";
const string right_up = "";
const string left_down = "";
const string right_down = "";
const string title_left = "";
const string title_right = "";
const string div_up = "";
const string div_down = "";
const string meter = "";
const array<string, 10> superscript = { "", "¹", "²", "³", "", "", "", "", "", "" };
2021-06-02 08:36:36 +12:00
const vector<string> graph_up = {
"", "", "", "", "",
"", "", "", "", "",
"", "", "", "", "",
"", "", "", "", "",
"", "", "", "", ""
2021-05-29 12:32:36 +12:00
};
2021-06-02 08:36:36 +12:00
const vector<string> graph_down = {
"", "", "", "", "",
"", "", "", "", "",
"", "", "", "", "",
"", "", "", "", "",
"", "", "", "", ""
2021-05-30 12:15:09 +12:00
};
2021-05-29 12:32:36 +12:00
}
2021-05-27 02:23:29 +12:00
namespace Draw {
2021-05-27 02:23:29 +12:00
struct BoxConf {
uint x=0, y=0;
uint width=0, height=0;
string line_color = "", title = "", title2 = "";
bool fill = true;
uint num=0;
};
2021-05-29 12:32:36 +12:00
//* Create a box using values from a BoxConf struct and return as a string
2021-05-27 02:23:29 +12:00
string createBox(BoxConf c){
string out;
string lcolor = (c.line_color.empty()) ? Theme::c("div_line") : c.line_color;
string numbering = (c.num == 0) ? "" : Theme::c("hi_fg") + Symbols::superscript[c.num];
out = Fx::reset + lcolor;
//* Draw horizontal lines
for (uint hpos : {c.y, c.y + c.height - 1}){
out += Mv::to(hpos, c.x) + Symbols::h_line * (c.width - 1);
}
//* Draw vertical lines and fill if enabled
for (uint hpos : iota(c.y + 1, c.y + c.height - 1)){
out += Mv::to(hpos, c.x) + Symbols::v_line +
((c.fill) ? string(c.width - 2, ' ') : Mv::r(c.width - 2)) +
Symbols::v_line;
}
//* Draw corners
out += Mv::to(c.y, c.x) + Symbols::left_up +
Mv::to(c.y, c.x + c.width) + Symbols::right_up +
Mv::to(c.y + c.height - 1, c.x) + Symbols::left_down +
Mv::to(c.y + c.height - 1, c.x + c.width) + Symbols::right_down;
//* Draw titles if defined
if (!c.title.empty()){
out += Mv::to(c.y, c.x + 2) + Symbols::title_left + Fx::b + numbering + Theme::c("title") + c.title +
Fx::ub + lcolor + Symbols::title_right;
}
if (!c.title2.empty()){
out += Mv::to(c.y + c.height - 1, c.x + 2) + Symbols::title_left + Theme::c("title") + c.title2 +
Fx::ub + lcolor + Symbols::title_right;
}
return out + Fx::reset + Mv::to(c.y + 1, c.x + 2);
}
2021-05-29 12:32:36 +12:00
//* Class holding a percentage meter
2021-05-27 02:23:29 +12:00
class Meter {
2021-05-28 08:29:36 +12:00
string out, color_gradient;
2021-05-30 12:15:09 +12:00
int width = 0;
2021-05-28 08:29:36 +12:00
bool invert = false;
vector<string> cache;
public:
2021-05-29 12:32:36 +12:00
//* Set meter options
2021-05-28 08:29:36 +12:00
void operator()(int width, string color_gradient, bool invert = false) {
this->width = width;
this->color_gradient = color_gradient;
this->invert = invert;
2021-05-29 12:32:36 +12:00
out.clear();
2021-05-28 08:29:36 +12:00
cache.clear();
cache.insert(cache.begin(), 101, "");
}
2021-05-29 12:32:36 +12:00
//* Return a string representation of the meter with given value
2021-05-28 08:29:36 +12:00
string operator()(int value) {
2021-05-29 12:32:36 +12:00
if (width < 1) return out;
value = clamp(value, 0, 100);
2021-05-28 08:29:36 +12:00
if (!cache.at(value).empty()) return out = cache.at(value);
out.clear();
int y;
for (int i : iota(1, width + 1)) {
y = round((double)i * 100.0 / width);
if (value >= y)
out += Theme::g(color_gradient)[invert ? 100 - y : y] + Symbols::meter;
else {
out += Theme::c("meter_bg") + Symbols::meter * (width + 1 - i);
break;
}
}
out += Fx::reset;
return cache.at(value) = out;
}
2021-05-27 02:23:29 +12:00
2021-05-28 08:29:36 +12:00
string operator()() {
return out;
}
2021-05-27 02:23:29 +12:00
};
2021-05-30 12:15:09 +12:00
//* Class holding a graph
class Graph {
string out, color_gradient;
int width = 0, height = 0, lowest = 0;
long long last = 0, max_value = 0, offset = 0;
2021-06-02 08:36:36 +12:00
bool current = true, no_zero = false, invert = false;
2021-05-30 12:15:09 +12:00
unordered_flat_map<bool, vector<string>> graphs = { {true, {}}, {false, {}}};
2021-06-02 08:36:36 +12:00
vector<string> graph_symbol;
2021-05-30 12:15:09 +12:00
2021-05-31 03:01:57 +12:00
//* Create two representations of the graph to switch between to represent two values for each braille character
2021-06-01 07:47:41 +12:00
void _create(const vector<long long>& data, int data_offset) {
const bool mult = (data.size() - data_offset > 1);
2021-05-31 03:01:57 +12:00
if (mult && (data.size() - data_offset) % 2 != 0) data_offset--;
2021-06-02 08:36:36 +12:00
array<int, 2> result;
2021-06-01 07:47:41 +12:00
const float mod = (height == 1) ? 0.3 : 0.1;
2021-05-30 12:15:09 +12:00
long long data_value = 0;
2021-05-31 03:01:57 +12:00
if (mult && data_offset > 0) {
last = data[data_offset - 1];
if (max_value > 0) last = clamp((last + offset) * 100 / max_value, 0ll, 100ll);
}
2021-06-02 08:36:36 +12:00
//? Horizontal iteration over values in <data>
for (int i = data_offset; i < (int)data.size(); i++) {
if (i == -1) { data_value = 0; last = 0; }
else data_value = data[i];
if (mult) current = !current;
if (max_value > 0) data_value = clamp((data_value + offset) * 100 / max_value, 0ll, 100ll);
//? Vertical iteration over height of graph
for (int horizon : iota(0, height)){
int cur_high = (height > 1) ? round(100.0 * (height - horizon) / height) : 100;
int cur_low = (height > 1) ? round(100.0 * (height - (horizon + 1)) / height) : 0;
//? Calculate previous + current value to fit two values in 1 braille character
int ai = 0;
2021-06-01 07:47:41 +12:00
for (auto value : {last, data_value}) {
2021-05-30 12:15:09 +12:00
if (value >= cur_high)
2021-06-02 08:36:36 +12:00
result[ai] = 4;
2021-06-01 07:47:41 +12:00
else if (value < cur_low)
2021-06-02 08:36:36 +12:00
result[ai] = 0;
2021-05-30 12:15:09 +12:00
else {
2021-06-02 08:36:36 +12:00
result[ai] = round((float)(value - cur_low) * 4 / (cur_high - cur_low) + mod);
if (no_zero && horizon == height - 1 && i != -1 && result[ai] == 0) result[ai] = 1;
2021-05-30 12:15:09 +12:00
}
2021-06-02 08:36:36 +12:00
ai++;
2021-05-30 12:15:09 +12:00
}
2021-06-02 08:36:36 +12:00
//? Generate braille symbol from 5x5 2D vector
graphs[current][horizon] += (height == 1 && result[0] + result[1] == 0) ? Mv::r(1) : graph_symbol[result[0] * 5 + result[1]];
2021-05-30 12:15:09 +12:00
}
2021-06-02 08:36:36 +12:00
if (mult && i > data_offset) last = data_value;
2021-05-30 12:15:09 +12:00
}
last = data_value;
if (height == 1)
2021-05-31 03:01:57 +12:00
out = (last < 1 ? Theme::c("inactive_fg") : Theme::g(color_gradient)[last]) + graphs[current][0];
2021-05-30 12:15:09 +12:00
else {
out.clear();
for (int i : iota(0, height)) {
if (i > 0) out += Mv::d(1) + Mv::l(width);
out += (invert) ? Theme::g(color_gradient)[i * 100 / (height - 1)] : Theme::g(color_gradient)[100 - (i * 100 / (height - 1))];
2021-05-31 03:01:57 +12:00
out += (invert) ? graphs[current][ (height - 1) - i] : graphs[current][i];
2021-05-30 12:15:09 +12:00
}
}
out += Fx::reset;
}
public:
//* Set graph options and initialize with data
2021-06-02 08:36:36 +12:00
void operator()(int width, int height, string color_gradient, const vector<long long>& data, bool invert = false, bool no_zero = false, long long max_value = 0, long long offset = 0) {
2021-05-30 12:15:09 +12:00
graphs[true].clear(); graphs[false].clear();
this->width = width; this->height = height;
this->invert = invert; this->offset = offset;
this->no_zero = no_zero; this->max_value = max_value;
this->color_gradient = color_gradient;
2021-06-02 08:36:36 +12:00
// if (height == 1) graph_symbol = (invert) ? Symbols::graph_down_small : Symbols::graph_up_small;
graph_symbol = (invert) ? Symbols::graph_down : Symbols::graph_up;
2021-05-30 12:15:09 +12:00
if (no_zero) lowest = 1;
2021-06-02 08:36:36 +12:00
// current = true;
2021-05-30 12:15:09 +12:00
int value_width = ceil((float)data.size() / 2);
int data_offset = 0;
if (value_width > width) data_offset = data.size() - width * 2;
2021-05-31 03:01:57 +12:00
//? Populate the two switching graph vectors and fill empty space if width > data size
2021-05-30 12:15:09 +12:00
for (int i : iota(0, height)) {
(void) i;
graphs[true].push_back((value_width < width) ? graph_symbol[0.0] * (width - value_width) : "");
graphs[false].push_back((value_width < width) ? graph_symbol[0.0] * (width - value_width) : "");
}
if (data.size() == 0) return;
this->_create(data, data_offset);
}
2021-06-02 08:36:36 +12:00
//* Add last value from back of <data> and return string representation of graph
string operator()(const vector<long long>& data, bool data_same = false) {
if (data_same) return out;
2021-05-30 12:15:09 +12:00
current = !current;
2021-05-31 03:01:57 +12:00
2021-06-02 08:36:36 +12:00
//? Make room for new characters on graph
2021-05-30 12:15:09 +12:00
for (int i : iota(0, height)) {
2021-06-02 08:36:36 +12:00
if (graphs[current][i].starts_with(Fx::e)) graphs[current][i].erase(0, 4);
else graphs[current][i].erase(0, 3);
2021-05-30 12:15:09 +12:00
}
2021-06-02 08:36:36 +12:00
this->_create(data, (int)data.size() - 1);
2021-05-30 12:15:09 +12:00
return out;
}
//* Return string representation of graph
string operator()() {
return out;
}
};
2021-05-27 02:23:29 +12:00
}
namespace Box {
}
namespace Proc {
2021-05-27 02:23:29 +12:00
// Draw::BoxConf box;
}
#endif