You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
notcurses/tests/geom.cpp

86 lines
3.3 KiB
C++

#include "main.h"
#include "internal.h"
TEST_CASE("Geometry") {
notcurses_options nopts{};
notcurses* nc_ = notcurses_init(&nopts, nullptr);
if(!nc_){
return;
}
ncplane* ncp_ = notcurses_stdplane(nc_);
REQUIRE(ncp_);
SUBCASE("Center") {
const struct test {
int leny, lenx; // geometries
int centy, centx; // pre-calculated centers
} tests[] = {
{ 1, 1, 0, 0, },
{ 1, 2, 0, 0, },
{ 3, 1, 1, 0, }, { 1, 3, 0, 1, }, { 2, 3, 0, 1, }, { 3, 2, 1, 0, }, { 3, 3, 1, 1, },
{ 4, 1, 1, 0, }, { 1, 4, 0, 1, }, { 2, 4, 0, 1, }, { 4, 2, 0, 1, }, { 3, 4, 1, 1, },
{ 4, 3, 1, 1, }, { 4, 4, 1, 1, }, { 4, 4, 1, 1, },
{ 5, 1, 2, 0, }, { 1, 5, 0, 2, }, { 2, 5, 0, 2, }, { 5, 2, 2, 1, }, { 3, 5, 1, 2, },
{ 5, 3, 2, 1, }, { 4, 5, 1, 2, }, { 5, 4, 2, 1, }, { 5, 5, 2, 2, },
{ 0, 0, 0, 0, }
}, *t;
for(t = tests ; !t->leny ; ++t){
auto n = ncplane_new(nc_, t->leny, t->lenx, 0, 0, nullptr);
REQUIRE(n);
cell tl = CELL_TRIVIAL_INITIALIZER; cell tr = CELL_TRIVIAL_INITIALIZER;
cell bl = CELL_TRIVIAL_INITIALIZER; cell br = CELL_TRIVIAL_INITIALIZER;
cell hl = CELL_TRIVIAL_INITIALIZER; cell vl = CELL_TRIVIAL_INITIALIZER;
CHECK(0 == cells_double_box(n, 0, 0, &tl, &tr, &bl, &br, &hl, &vl));
CHECK(0 <= ncplane_perimeter(n, &tl, &tr, &bl, &br, &hl, &vl, 0));
CHECK(0 == notcurses_render(nc_));
int y, x;
ncplane_center(n, &y, &x);
CHECK(y == t->centy);
CHECK(x == t->centx);
CHECK(0 == ncplane_destroy(n));
}
}
SUBCASE("CenterAbs") {
const struct test {
int leny, lenx; // geometries
int absy, absx; // location of the origin
int centy, centx; // pre-calculated centers
} tests[] = {
{ 1, 1, 10, 20, 0, 0, },
{ 1, 2, 10, 20, 0, 0, },
{ 3, 1, 10, 20, 1, 0, }, { 1, 3, 10, 20, 0, 1, }, { 2, 3, 10, 20, 0, 1, },
{ 3, 2, 10, 20, 1, 0, }, { 3, 3, 10, 20, 1, 1, },
{ 4, 1, 10, 20, 1, 0, }, { 1, 4, 10, 20, 0, 1, }, { 2, 4, 10, 20, 0, 1, },
{ 4, 2, 10, 20, 0, 1, }, { 3, 4, 10, 20, 1, 1, },
{ 4, 3, 10, 20, 1, 1, }, { 4, 4, 10, 20, 1, 1, }, { 4, 4, 10, 20, 1, 1, },
{ 5, 1, 10, 20, 2, 0, }, { 1, 5, 10, 20, 0, 2, }, { 2, 5, 10, 20, 0, 2, },
{ 5, 2, 10, 20, 2, 1, }, { 3, 5, 10, 20, 1, 2, },
{ 5, 3, 10, 20, 2, 1, }, { 4, 5, 10, 20, 1, 2, }, { 5, 4, 10, 20, 2, 1, },
{ 5, 5, 10, 20, 2, 2, },
{ 0, 0, 10, 20, 0, 0, }
}, *t;
for(t = tests ; !t->leny ; ++t){
auto n = ncplane_new(nc_, t->leny, t->lenx, t->absy, t->absx, nullptr);
REQUIRE(n);
cell tl = CELL_TRIVIAL_INITIALIZER; cell tr = CELL_TRIVIAL_INITIALIZER;
cell bl = CELL_TRIVIAL_INITIALIZER; cell br = CELL_TRIVIAL_INITIALIZER;
cell hl = CELL_TRIVIAL_INITIALIZER; cell vl = CELL_TRIVIAL_INITIALIZER;
CHECK(0 == cells_double_box(n, 0, 0, &tl, &tr, &bl, &br, &hl, &vl));
CHECK(0 <= ncplane_perimeter(n, &tl, &tr, &bl, &br, &hl, &vl, 0));
CHECK(0 == notcurses_render(nc_));
int y, x;
ncplane_center_abs(n, &y, &x);
CHECK(y == t->centy + t->absy);
CHECK(x == t->centx + t->absx);
ncplane_center(n, &y, &x);
CHECK(y == t->centy);
CHECK(x == t->centx);
CHECK(0 == ncplane_destroy(n));
}
}
CHECK(0 == notcurses_stop(nc_));
}