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.
471 lines
15 KiB
C++
471 lines
15 KiB
C++
#include "main.h"
|
|
#include <cfenv>
|
|
#include <iostream>
|
|
|
|
#define BUFSIZE (NCPREFIXSTRLEN + 1)
|
|
|
|
// run ncmetric, and then change any localized decimal separator into our
|
|
// proud imperial yankee capitalist democratic one dot under god period.
|
|
// manifest destiny, bitchhhhhhhezzzz!
|
|
char* impericize_ncmetric(uintmax_t val, uintmax_t decimal, char* buf,
|
|
int omitdec, unsigned mult, int uprefix) {
|
|
const char* decisep = localeconv()->decimal_point;
|
|
REQUIRE(decisep);
|
|
REQUIRE(1 == strlen(decisep));
|
|
REQUIRE(ncnmetric(val, BUFSIZE, decimal, buf, omitdec, mult, uprefix));
|
|
char* commie = buf;
|
|
while( (commie = strstr(commie, decisep)) ){
|
|
*commie = '.'; // https://dank.qemfd.net/images/16whcc.jpg
|
|
++commie;
|
|
}
|
|
return buf;
|
|
}
|
|
|
|
TEST_CASE("Metric") {
|
|
const char* decisep = localeconv()->decimal_point;
|
|
REQUIRE(decisep);
|
|
REQUIRE(1 == strlen(decisep));
|
|
REQUIRE(0 == fesetround(FE_TONEAREST));
|
|
|
|
SUBCASE("CornerInts") {
|
|
char buf[BUFSIZE];
|
|
impericize_ncmetric(0, 1, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("0.00", buf));
|
|
impericize_ncmetric(0, 1, buf, 0, 1024, 'i');
|
|
CHECK(!strcmp("0.00", buf)); // no suffix on < mult
|
|
impericize_ncmetric(1, 1, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("1.00", buf));
|
|
impericize_ncmetric(1, 1, buf, 0, 1024, 'i');
|
|
CHECK(!strcmp("1.00", buf));
|
|
impericize_ncmetric(0, 1, buf, 1, 1000, '\0');
|
|
CHECK(!strcmp("0", buf));
|
|
impericize_ncmetric(0, 1, buf, 1, 1024, 'i');
|
|
CHECK(!strcmp("0", buf)); // no suffix on < mult
|
|
impericize_ncmetric(1, 1, buf, 1, 1000, '\0');
|
|
CHECK(!strcmp("1", buf));
|
|
impericize_ncmetric(1, 1, buf, 1, 1024, 'i');
|
|
CHECK(!strcmp("1", buf));
|
|
impericize_ncmetric(999, 1, buf, 1, 1000, '\0');
|
|
CHECK(!strcmp("999", buf));
|
|
impericize_ncmetric(1000, 1, buf, 1, 1000, '\0');
|
|
CHECK(!strcmp("1K", buf));
|
|
impericize_ncmetric(1000, 1, buf, 1, 1000, 'i');
|
|
CHECK(!strcmp("1Ki", buf));
|
|
impericize_ncmetric(1000, 1, buf, 1, 1024, 'i');
|
|
CHECK(!strcmp("1000", buf)); // FIXME should be 0.977Ki
|
|
impericize_ncmetric(1023, 1, buf, 1, 1000, '\0');
|
|
CHECK(!strcmp("1.02K", buf));
|
|
impericize_ncmetric(1023, 1, buf, 1, 1024, 'i');
|
|
CHECK(!strcmp("1023", buf));
|
|
impericize_ncmetric(1024, 1, buf, 1, 1000, '\0');
|
|
CHECK(!strcmp("1.02K", buf));
|
|
impericize_ncmetric(1024, 1, buf, 1, 1024, 'i');
|
|
CHECK(!strcmp("1Ki", buf));
|
|
impericize_ncmetric(1025, 1, buf, 1, 1000, '\0');
|
|
CHECK(!strcmp("1.02K", buf));
|
|
impericize_ncmetric(1025, 1, buf, 0, 1024, 'i');
|
|
CHECK(!strcmp("1.00Ki", buf));
|
|
impericize_ncmetric(1025, 1, buf, 1, 1024, 'i');
|
|
CHECK(!strcmp("1.00Ki", buf));
|
|
impericize_ncmetric(4096, 1, buf, 1, 1000, '\0');
|
|
CHECK(!strcmp("4.10K", buf));
|
|
impericize_ncmetric(4096, 1, buf, 0, 1024, 'i');
|
|
CHECK(!strcmp("4.00Ki", buf));
|
|
impericize_ncmetric(4096, 1, buf, 1, 1024, 'i');
|
|
CHECK(!strcmp("4Ki", buf));
|
|
}
|
|
|
|
SUBCASE("Maxints") {
|
|
char buf[BUFSIZE];
|
|
// FIXME these will change based on the size of intmax_t and uintmax_t
|
|
impericize_ncmetric(INTMAX_MAX - 1, 1, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("9.22E", buf));
|
|
impericize_ncmetric(INTMAX_MAX, 1, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("9.22E", buf));
|
|
impericize_ncmetric(UINTMAX_MAX - 1, 1, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("18.45E", buf));
|
|
impericize_ncmetric(UINTMAX_MAX, 1, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("18.45E", buf));
|
|
}
|
|
|
|
SUBCASE("Maxints1024") {
|
|
char buf[BUFSIZE], gold[BUFSIZE];
|
|
// FIXME these will change based on the size of intmax_t and uintmax_t
|
|
REQUIRE(ncbprefix(((double)(INTMAX_MAX - 1ull)), 1, buf, 0));
|
|
sprintf(gold, "%.2fEi", ((double)(INTMAX_MAX - 1ull)) / (1ull << 60));
|
|
CHECK(!strcmp(gold, buf));
|
|
REQUIRE(ncbprefix(((double)(INTMAX_MAX - (1ull << 53))), 1, buf, 0));
|
|
sprintf(gold, "%.2fEi", ((double)(INTMAX_MAX - (1ull << 53))) / (1ull << 60));
|
|
CHECK(!strcmp(gold, buf));
|
|
REQUIRE(ncbprefix(INTMAX_MAX + 1ull, 1, buf, 0));
|
|
sprintf(gold, "%.2fEi", ((double)(INTMAX_MAX + 1ull)) / (1ull << 60));
|
|
CHECK(!strcmp(gold, buf));
|
|
impericize_ncmetric(UINTMAX_MAX - 1, 1, buf, 0, 1024, 'i');
|
|
CHECK(!strcmp("16.00Ei", buf));
|
|
impericize_ncmetric(UINTMAX_MAX, 1, buf, 0, 1024, 'i');
|
|
CHECK(!strcmp("16.00Ei", buf));
|
|
ncbprefix(UINTMAX_MAX - (1ull << 53), 1, buf, 0);
|
|
sprintf(gold, "%.2fEi", ((double)UINTMAX_MAX - (1ull << 53)) / (1ull << 60));
|
|
CHECK(!strcmp(gold, buf));
|
|
}
|
|
|
|
const char suffixes[] = "\0KMGTPE";
|
|
|
|
SUBCASE("PowersOfTen") {
|
|
char gold[BUFSIZE];
|
|
char buf[BUFSIZE];
|
|
uintmax_t goldval = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
ncqprefix(val, 1, buf, 0);
|
|
const int sidx = i / 3;
|
|
snprintf(gold, sizeof(gold), "%ju%s00%c", goldval, decisep, suffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 10;
|
|
if((goldval *= 10) == 1000){
|
|
goldval = 1;
|
|
}
|
|
}while(++i < sizeof(suffixes) * 3);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(sizeof(suffixes) * 3 > i);
|
|
}
|
|
|
|
SUBCASE("PowersOfTenNoDec") {
|
|
char gold[BUFSIZE];
|
|
char buf[BUFSIZE];
|
|
uintmax_t goldval = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
ncqprefix(val, 1, buf, 1);
|
|
const int sidx = i / 3;
|
|
snprintf(gold, sizeof(gold), "%ju%c", goldval, suffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 10;
|
|
if((goldval *= 10) == 1000){
|
|
goldval = 1;
|
|
}
|
|
}while(++i < sizeof(suffixes) * 3);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(sizeof(suffixes) * 3 > i);
|
|
}
|
|
|
|
SUBCASE("PowersOfTwo") {
|
|
char gold[NCBPREFIXSTRLEN + 1];
|
|
char buf[NCBPREFIXSTRLEN + 1];
|
|
uintmax_t goldval = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
ncbprefix(val, 1, buf, 0);
|
|
const int sidx = i / 10;
|
|
snprintf(gold, sizeof(gold), "%ju%s00%ci", goldval, decisep, suffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 2;
|
|
if((goldval *= 2) == 1024){
|
|
goldval = 1;
|
|
}
|
|
}while(++i < sizeof(suffixes) * 10);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(sizeof(suffixes) * 10 > i);
|
|
}
|
|
|
|
SUBCASE("PowersOfTwoNoDec") {
|
|
char gold[NCBPREFIXSTRLEN + 1];
|
|
char buf[NCBPREFIXSTRLEN + 1];
|
|
uintmax_t goldval = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
ncbprefix(val, 1, buf, 1);
|
|
const int sidx = i / 10;
|
|
snprintf(gold, sizeof(gold), "%ju%ci", goldval, suffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 2;
|
|
if((goldval *= 2) == 1024){
|
|
goldval = 1;
|
|
}
|
|
}while(++i < sizeof(suffixes) * 10);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(sizeof(suffixes) * 10 > i);
|
|
}
|
|
|
|
SUBCASE("PowersOfTwoAsTens") {
|
|
char gold[BUFSIZE];
|
|
char buf[BUFSIZE];
|
|
uintmax_t vfloor = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
ncqprefix(val, 1, buf, 0);
|
|
const int sidx = i / 10;
|
|
snprintf(gold, sizeof(gold), "%.2f%c", ((double)val) / vfloor, suffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 2;
|
|
if(i % 10 == 9){
|
|
vfloor *= 1000;
|
|
}
|
|
}while(++i < sizeof(suffixes) * 10);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(sizeof(suffixes) * 10 > i);
|
|
}
|
|
|
|
SUBCASE("PowersOfTenAsTwos") {
|
|
char gold[NCBPREFIXSTRLEN + 1];
|
|
char buf[NCBPREFIXSTRLEN + 1];
|
|
uintmax_t vfloor = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
ncbprefix(val, 1, buf, 0);
|
|
const int sidx = i ? (i - 1) / 3 : 0;
|
|
snprintf(gold, sizeof(gold), "%.2f%ci", ((double)val) / vfloor, suffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 10;
|
|
if(i && i % 3 == 0){
|
|
vfloor *= 1024;
|
|
}
|
|
}while(++i < sizeof(suffixes) * 10);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(sizeof(suffixes) * 10 > i);
|
|
}
|
|
|
|
SUBCASE("PowersOfTenMinusOne") {
|
|
char gold[BUFSIZE];
|
|
char buf[BUFSIZE];
|
|
uintmax_t vfloor = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
ncqprefix(val - 1, 1, buf, 0);
|
|
const int sidx = i ? (i - 1) / 3 : 0;
|
|
snprintf(gold, sizeof(gold), "%.2f%c", ((double)(val - 1)) / vfloor, suffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 10;
|
|
if(i && i % 3 == 0){
|
|
vfloor *= 1000;
|
|
}
|
|
}while(++i < sizeof(suffixes) * 3);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(sizeof(suffixes) * 3 > i);
|
|
}
|
|
|
|
SUBCASE("PowersOfTenPlusOne") {
|
|
char gold[BUFSIZE];
|
|
char buf[BUFSIZE];
|
|
uintmax_t vfloor = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
ncqprefix(val + 1, 1, buf, 0);
|
|
const int sidx = i / 3;
|
|
snprintf(gold, sizeof(gold), "%.2f%c", ((double)(val + 1)) / vfloor, suffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 10;
|
|
if(i % 3 == 2){
|
|
vfloor *= 1000;
|
|
}
|
|
}while(++i < sizeof(suffixes) * 3);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(sizeof(suffixes) * 3 > i);
|
|
}
|
|
|
|
SUBCASE("PowersOfTenMinusOneAsTwos") {
|
|
char gold[NCBPREFIXSTRLEN + 1];
|
|
char buf[NCBPREFIXSTRLEN + 1];
|
|
uintmax_t vfloor = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
ncbprefix(val - 1, 1, buf, 0);
|
|
const int sidx = i ? (i - 1) / 3 : 0;
|
|
snprintf(gold, sizeof(gold), "%.2f%ci", ((double)(val - 1)) / vfloor, suffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 10;
|
|
if(i && i % 3 == 0){
|
|
vfloor *= 1024;
|
|
}
|
|
}while(++i < sizeof(suffixes) * 10);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(sizeof(suffixes) * 10 > i);
|
|
}
|
|
|
|
constexpr auto GIG = 1000000000ull;
|
|
|
|
// Output ought be scaled down for output while maintaining precision during
|
|
// computation of that output. For instance, we might feed a number of
|
|
// nanoseconds, but want output in seconds.
|
|
// This requires 'decimal' = GIG.
|
|
SUBCASE("ScaledGigSupra") {
|
|
char gold[BUFSIZE];
|
|
snprintf(gold, sizeof(gold), "%.2f", 9.029); // 9.02
|
|
char buf[BUFSIZE];
|
|
uintmax_t val = 9027854993;
|
|
uintmax_t decimal = GIG;
|
|
REQUIRE(ncqprefix(val, decimal, buf, 0));
|
|
CHECK(!strcmp(buf, gold));
|
|
}
|
|
|
|
SUBCASE("ScaledGigUnity") {
|
|
char gold[BUFSIZE];
|
|
snprintf(gold, sizeof(gold), "%.2f", 1.0); // 1.00
|
|
char buf[BUFSIZE];
|
|
uintmax_t decimal = GIG;
|
|
uintmax_t val = decimal;
|
|
REQUIRE(ncqprefix(val, decimal, buf, 0));
|
|
CHECK(!strcmp(buf, gold));
|
|
}
|
|
|
|
SUBCASE("ScaledGigJustAbove") {
|
|
char gold[BUFSIZE];
|
|
snprintf(gold, sizeof(gold), "%.2f", 1.0); // 1.00
|
|
char buf[BUFSIZE];
|
|
uintmax_t val = 1000000001;
|
|
uintmax_t decimal = GIG;
|
|
REQUIRE(ncqprefix(val, decimal, buf, 0));
|
|
CHECK(!strcmp(buf, gold));
|
|
}
|
|
|
|
SUBCASE("ScaledGigJustBelow") {
|
|
char gold[BUFSIZE];
|
|
snprintf(gold, sizeof(gold), "%.2fm", 999.999); //999.99
|
|
char buf[BUFSIZE];
|
|
uintmax_t val = 999999999;
|
|
uintmax_t decimal = GIG;
|
|
REQUIRE(ncqprefix(val, decimal, buf, 0));
|
|
CHECK(!strcmp(buf, gold));
|
|
}
|
|
|
|
SUBCASE("ScaledGigSub") {
|
|
char gold[BUFSIZE];
|
|
snprintf(gold, sizeof(gold), "%.2fm", 27.85); // 27.85
|
|
char buf[BUFSIZE];
|
|
uintmax_t val = 27854993;
|
|
uintmax_t decimal = GIG;
|
|
REQUIRE(ncqprefix(val, decimal, buf, 0));
|
|
CHECK(!strcmp(buf, gold));
|
|
}
|
|
|
|
SUBCASE("ScaledGigSubSub") {
|
|
char gold[BUFSIZE];
|
|
snprintf(gold, sizeof(gold), "%.2fm", 7.85); // 7.85
|
|
char buf[BUFSIZE];
|
|
uintmax_t val = 7854993;
|
|
uintmax_t decimal = GIG;
|
|
REQUIRE(ncqprefix(val, decimal, buf, 0));
|
|
CHECK(!strcmp(buf, gold));
|
|
}
|
|
|
|
SUBCASE("SmallCorners") {
|
|
char buf[BUFSIZE];
|
|
impericize_ncmetric(1, 1000, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("1.00m", buf));
|
|
impericize_ncmetric(1, 1024, buf, 0, 1024, 'i');
|
|
CHECK(!strcmp("1.00mi", buf));
|
|
|
|
impericize_ncmetric(1, 1000000000000000000ull, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("1.00a", buf));
|
|
|
|
impericize_ncmetric(19, 10000000000000000ull, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("1.90f", buf));
|
|
impericize_ncmetric(99, 10000000000000000ull, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("9.90f", buf));
|
|
|
|
impericize_ncmetric(100, 10000000000000000ull, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("10.00f", buf));
|
|
|
|
impericize_ncmetric(1, 10, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("100.00m", buf));
|
|
impericize_ncmetric(1, 100, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("10.00m", buf));
|
|
impericize_ncmetric(10, 100, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("100.00m", buf));
|
|
impericize_ncmetric(10, 1000, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("10.00m", buf));
|
|
impericize_ncmetric(100, 1000, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("100.00m", buf));
|
|
impericize_ncmetric(1000, 1000, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("1.00", buf));
|
|
|
|
impericize_ncmetric(100, 1000000000000000ull, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("100.00f", buf));
|
|
|
|
impericize_ncmetric(100, 1000000000000ull, buf, 0, 1000, '\0');
|
|
CHECK(!strcmp("100.00p", buf));
|
|
}
|
|
|
|
SUBCASE("NegativePowersOfTen") {
|
|
auto nc_ = testing_notcurses();
|
|
if(!nc_){
|
|
return;
|
|
}
|
|
const wchar_t* smallsuffixes;
|
|
if(notcurses_canutf8(nc_)){
|
|
smallsuffixes = L"yzafpnµm";
|
|
}else{
|
|
smallsuffixes = L"yzafpnum";
|
|
}
|
|
char gold[BUFSIZE];
|
|
char buf[BUFSIZE];
|
|
uintmax_t goldval = 1;
|
|
uintmax_t val = 1;
|
|
size_t i = 0;
|
|
do{
|
|
REQUIRE(ncqprefix(val, 1000000000000000ull, buf, '\0'));
|
|
const int sidx = i / 3 + 3;
|
|
snprintf(gold, sizeof(gold), "%ju%s00%lc", goldval, decisep, smallsuffixes[sidx]);
|
|
CHECK(!strcmp(gold, buf));
|
|
if(UINTMAX_MAX / val < 10){
|
|
break;
|
|
}
|
|
val *= 10;
|
|
if((goldval *= 10) == 1000){
|
|
goldval = 1;
|
|
}
|
|
}while(++i < (wcslen(smallsuffixes) - 3) * 3);
|
|
// If we ran through all our suffixes, that's a problem
|
|
CHECK(wcslen(smallsuffixes) * 3 > i);
|
|
CHECK(0 == notcurses_stop(nc_));
|
|
}
|
|
|
|
// inspired by #929
|
|
SUBCASE("BigMult") {
|
|
char qbuf[NCIPREFIXSTRLEN + 1];
|
|
CHECK(nullptr != impericize_ncmetric(1115614, 1000, qbuf, 0, 1000, '\0'));
|
|
CHECK(0 == strcmp("1.11K", qbuf));
|
|
CHECK(nullptr != impericize_ncmetric(372688, 1024, qbuf, 0, 1024, '\0'));
|
|
CHECK(0 == strcmp("363.95", qbuf));
|
|
CHECK(nullptr != impericize_ncmetric(372688, 1, qbuf, 0, 1024, '\0'));
|
|
CHECK(0 == strcmp("363.95K", qbuf));
|
|
}
|
|
|
|
}
|