extern/boxes
1
0
Fork 0
mirror of https://github.com/ascii-boxes/boxes.git synced 2024-12-04 22:11:07 +01:00
Code Issues Packages Projects Releases Wiki Activity

Remove unused code from 'shape' module

Browse Source
This commit is contained in:
Thomas Jensen 2023-10-15 21:43:50 +02:00
parent 505b10b98f
commit 2a2111cfae
No known key found for this signature in database
GPG Key ID: A4ACEE270D0FB7DB
2 changed files with 0 additions and 54 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

52
src/shape.c
View File

@ -307,58 +307,6 @@ size_t widest(const sentry_t *sarr, const int n, ...)
shape_t leftmost(const int aside, const int cnt)
/*
* Return leftmost existing shape in specification for side aside
* (BTOP or BBOT), skipping cnt shapes. Corners are not considered.
*
* RETURNS: shape if shape was found
* NUM_SHAPES on error (e.g. cnt too high)
*
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
*/
{
int c = 0;
int s;
if (cnt < 0) {
return NUM_SHAPES;
}
if (aside == BTOP) {
s = 0;
do {
++s;
while (s < SHAPES_PER_SIDE - 1 &&
isempty(opt.design->shape + north_side[s])) {
++s;
}
if (s == SHAPES_PER_SIDE - 1) {
return NUM_SHAPES;
}
} while (c++ < cnt);
return north_side[s];
}
else if (aside == BBOT) {
s = SHAPES_PER_SIDE - 1;
do {
--s;
while (s && isempty(opt.design->shape + south_side[s])) {
--s;
}
if (!s) {
return NUM_SHAPES;
}
} while (c++ < cnt);
return south_side[s];
}
return NUM_SHAPES;
}
/**
* Return true if the shapes on the given side consist entirely of spaces - and spaces only, tabs are considered
* non-empty.

2
src/shape.h
View File

@ -69,8 +69,6 @@ int isdeepempty (const sentry_t *shape);
size_t highest (const sentry_t *sarr, const int n, ...);
size_t widest (const sentry_t *sarr, const int n, ...);
shape_t leftmost (const int aside, const int cnt);
int empty_side (sentry_t *sarr, const int aside);