simono41/TerminalImageViewer
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

try to help #132

Browse source 
also added a bit of docs
This commit is contained in:
Aaron Liu 2023-12-06 15:57:55 -05:00
parent c29bdc7645
commit 11d82bde63
No known key found for this signature in database
GPG key ID: 2D4DA57B12065A35
1 changed files with 11 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
src/tiv.cpp
View file

@ -77,10 +77,10 @@
// Implementation of flag representation for flags in the main() method // Implementation of flag representation for flags in the main() method
constexpr int FLAG_FG = 1; constexpr int FLAG_FG = 1;
constexpr int FLAG_BG = 2; constexpr int FLAG_BG = 2;
constexpr int FLAG_MODE_256 = 4; constexpr int FLAG_MODE_256 = 4; // Limit colors to 256-color mode
constexpr int FLAG_24BIT = 8; constexpr int FLAG_24BIT = 8; // 24-bit color mode
constexpr int FLAG_NOOPT = 16; constexpr int FLAG_NOOPT = 16; // Only use the same half-block character
constexpr int FLAG_TELETEXT = 32; constexpr int FLAG_TELETEXT = 32; // Use teletext characters
// Steps (@TODO: Figure out what exactly they represent) // Steps (@TODO: Figure out what exactly they represent)
constexpr int COLOR_STEP_COUNT = 6; constexpr int COLOR_STEP_COUNT = 6;
@ -212,6 +212,12 @@ constexpr unsigned int BITMAPS[] = {
0, 1 // End marker for extended TELETEXT mode. 0, 1 // End marker for extended TELETEXT mode.
}; };
/**
* @brief Struct to represent a character to be drawn.
* @param fgColor RGB
* @param bgColor RGB
* @param codePoint The code point of the character to be drawn.
*/
struct CharData { struct CharData {
std::array<int, 3> fgColor = std::array<int, 3>{0, 0, 0}; std::array<int, 3> fgColor = std::array<int, 3>{0, 0, 0};
std::array<int, 3> bgColor = std::array<int, 3>{0, 0, 0}; std::array<int, 3> bgColor = std::array<int, 3>{0, 0, 0};
@ -399,7 +405,7 @@ int clamp_byte(int value) {
double sqr(double n) { return n * n; } double sqr(double n) { return n * n; }
int best_index(int value, const int (&STEPS)[], int count) { int best_index(int value, const int STEPS[], int count) {
int best_diff = std::abs(STEPS[0] - value); int best_diff = std::abs(STEPS[0] - value);
int result = 0; int result = 0;
for (int i = 1; i < count; i++) { for (int i = 1; i < count; i++) {