porterskyandQwen 3.8 27B
e09540c2b2
Add a CMakeLists.txt to each exercise directory, included from cmat/CMakeLists.txt, so every exercise and solution becomes a buildable target. GUI exercises link the curses-based DOS_Unix implementations on Unix-like systems; the Windows-specific DOS variants are not compiled. Exercises without a portable path or with missing dependencies (Boost) are reported as not available at configure time. Targets are excluded from the default build and built by name, e.g. `cmake --build build --target Ex11`, so intentionally buggy exercises such as Ex21 do not break the default build. Also fix two portability issues: rename Ex11bug/pole.h to Pole.h for case-sensitive filesystems and drop the extra Light:: qualification in SolutionEx71A/Light.h. Document build commands and layout in AGENTS.md. Co-authored-by: Qwen 3.8 27B <qwen3.8_27b-q3_k_xl@lmstudio.local>
67 lines
1.7 KiB
C++
67 lines
1.7 KiB
C++
#include "Screen.h"
|
|
#include "CursesObj.h"
|
|
#include "curses.h"
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
|
|
// Forward declarations
|
|
int ConvertColour(int);
|
|
|
|
void Screen::write(std::string s, int x, int y, int color) {
|
|
CursesObj::Instance(); // Force initialization
|
|
|
|
if (color >= 128)
|
|
color -= 128; // Remove gray background - does not work on Linux
|
|
|
|
std::string blank_str(s.length(), ' ');
|
|
|
|
mvaddstr(y, x, blank_str.c_str()); // Always draw a black
|
|
refresh();
|
|
|
|
if (color != Screen::BLACK) // If colour is not black, also draw the color
|
|
{
|
|
printf("\e[%i;3%im", 0, ConvertColour(color));
|
|
|
|
fflush(stdout);
|
|
|
|
mvaddstr(y, x, s.c_str());
|
|
refresh();
|
|
}
|
|
}
|
|
|
|
typedef struct {
|
|
int pelio_colour;
|
|
int curses_color_pair;
|
|
} Entry;
|
|
|
|
// Entry null pointer
|
|
const Entry *ENTRY_NP = (Entry *)0;
|
|
|
|
typedef Entry Table[];
|
|
|
|
Table ColourTable = {{Screen::GRAY, 8}, // Display as white
|
|
{Screen::BLUE, 4}, {Screen::GREEN, 2}, {Screen::RED, 1}, {Screen::YELLOW, 3}, {Screen::WHITE, 7}};
|
|
|
|
const int LEN_TAB = sizeof ColourTable / sizeof ColourTable[0];
|
|
|
|
const Entry *TabSearch(Table t, int nEntries, int colour) {
|
|
Entry *p;
|
|
|
|
for (p = t; p < t + nEntries && p->pelio_colour != colour; p++)
|
|
; // EMPTY BODY
|
|
|
|
return (p < t + nEntries) ? p : ENTRY_NP;
|
|
}
|
|
|
|
int ConvertColour(int colour) {
|
|
int result = 0;
|
|
const Entry *p;
|
|
|
|
p = TabSearch(ColourTable, LEN_TAB, colour); // Search the table for the colour specified
|
|
|
|
if (p != ENTRY_NP) // If the colour is in the table ...
|
|
result = p->curses_color_pair; // ... return the 'int' for the associated
|
|
// curses colour pair
|
|
return result;
|
|
}
|