1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356
|
/*
** Copyright (C) 2017-2025 Dirk-Jan C. Binnema <djcb@djcbsoftware.nl>
**
** This library is free software; you can redistribute it and/or
** modify it under the terms of the GNU Lesser General Public License
** as published by the Free Software Foundation; either version 2.1
** of the License, or (at your option) any later version.
**
** This library is distributed in the hope that it will be useful,
** but WITHOUT ANY WARRANTY; without even the implied warranty of
** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
** Lesser General Public License for more details.
**
** You should have received a copy of the GNU Lesser General Public
** License along with this library; if not, write to the Free
** Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
** 02110-1301, USA.
*/
#include <vector>
#include <glib.h>
#include <iostream>
#include <functional>
#include <array>
#include "mu-utils.hh"
#include "mu-utils-file.hh"
#include "mu-test-utils.hh"
using namespace Mu;
struct Case {
std::string expr;
bool is_first{};
std::string expected;
};
using CaseVec = std::vector<Case>;
using ProcFunc = std::function<std::string(std::string, bool)>;
static void
test_cases(const CaseVec& cases, ProcFunc proc)
{
for (const auto& casus : cases) {
const auto res = proc(casus.expr, casus.is_first);
//mu_println("'{}'\n'{}'", casus.expected, res);
assert_equal(casus.expected, res);
}
}
static void
test_date_basic()
{
const auto hki = "Europe/Helsinki";
// ensure we have the needed TZ or skip the test.
if (!timezone_available(hki)) {
g_test_skip("timezone Europe/Helsinki not available");
return;
}
g_setenv("TZ", hki, TRUE);
const std::vector<std::tuple<const char*, bool/*is_first*/, ::time_t>> cases = {{
{"2015-09-18T09:10:23", true, 1442556623},
{"1972-12-14T09:10:23", true, 93165023},
{"1972-12-14T09:10", true, 93165000},
{"1854-11-18T17:10:23", true, 0},
{"2000-02-31T09:10:23", true, 951861599},
{"2000-02-29T23:59:59", true, 951861599},
{"20220602", true, 1654117200},
{"20220605", false, 1654462799},
{"202206", true, 1654030800},
{"202206", false, 1656622799},
{"2016", true, 1451599200},
{"2016", false, 1483221599},
// {"fnorb", true, -1},
// {"fnorb", false, -1},
{"", false, time_t_max},
{"", true, time_t_min}
}};
for (auto& test: cases) {
if (g_test_verbose())
mu_debug("checking {}", std::get<0>(test));
g_assert_cmpuint(parse_date_time(std::get<0>(test),
std::get<1>(test)).value_or(-1),==,
std::get<2>(test));
}
}
static void
test_date_ymwdhMs()
{
struct testcase {
std::string expr;
int64_t diff;
int tolerance;
};
const std::array<testcase, 7> cases = {{
{"7s", 7, 1},
{"3M", 3 * 60, 1},
{"3h", 3 * 60 * 60, 1},
{"21d", 21 * 24 * 60 * 60, 3600 + 1},
{"2w", 2 * 7 * 24 * 60 * 60, 3600 + 1},
{"2y", 2 * 365 * 24 * 60 * 60, 24 * 3600 + 1},
{"3m", 3 * 30 * 24 * 60 * 60, 3 * 24 * 3600 + 1}
}};
for (auto&& tcase: cases) {
const auto date = parse_date_time(tcase.expr, true);
g_assert_true(date);
const auto diff = ::time({}) - *date;
if (g_test_verbose())
std::cerr << tcase.expr << ' ' << diff << ' ' << tcase.diff << '\n';
g_assert_true(tcase.diff - diff <= tcase.tolerance);
}
// note: perhaps it'd be nice if we'd detect this error;
// currently we're being rather tolerant
// g_assert_false(!!parse_date_time("25q", false));
}
static void
test_parse_size()
{
constexpr std::array<std::tuple<const char*, bool, int64_t>, 6> cases = {{
{ "456", false, 456 },
{ "", false, G_MAXINT64 },
{ "", true, 0 },
{ "2K", false, 2048 },
{ "2M", true, 2097152 },
{ "5G", true, 5368709120 }
}};
for(auto&& test: cases) {
g_assert_cmpint(parse_size(std::get<0>(test), std::get<1>(test))
.value_or(-1), ==, std::get<2>(test));
}
g_assert_false(!!parse_size("-1", true));
g_assert_false(!!parse_size("scoobydoobydoo", false));
}
static void
test_utf8_clean()
{
assert_equal(utf8_clean("James Holden"), "James Holden");
const std::array<char, 3> invalid_bytes ={ 'a' , static_cast<char>(0xff), 'c'};
std::string invalid{invalid_bytes.data(), invalid_bytes.size()};
g_assert_false(g_utf8_validate(invalid.c_str(), invalid.length(), nullptr));
const auto valid = utf8_clean(std::move(invalid));
g_assert_true(g_utf8_validate(valid.c_str(), valid.length(), {}));
assert_equal(valid, "a\357\277\275c"); // replacement char
}
static void
test_flatten()
{
CaseVec cases = {
{"Менделе́ев", true, "менделеев"},
{"", true, ""},
{"Ångström", true, "angstrom"},
{"đodø", true, "dodo"},
// don't touch combining characters in CJK etc.
{"スポンサーシップ募集", true, "スポンサーシップ募集"}
};
test_cases(cases, [](auto s, auto f) { return utf8_flatten(s); });
}
static void
test_remove_ctrl()
{
CaseVec cases = {
{"Foo\n\nbar", true, "Foo bar"},
{"", false, ""},
{" ", false, " "},
{"Hello World ", false, "Hello World "},
{"Ångström", false, "Ångström"},
};
test_cases(cases, [](auto s, auto f) { return remove_ctrl(s); });
}
static void
test_clean()
{
CaseVec cases = {
{"\t a\t\nb ", true, "a b"},
{"", true, ""},
{"Ångström", true, "Ångström"},
{"\345\245", true, ".."},
};
test_cases(cases, [](auto s, auto f) { return utf8_clean(s); });
}
static void
test_word_break()
{
CaseVec cases = {
{"aap+noot&mies", true, "aap noot mies"},
{"hallo", true, "hallo"},
{" foo-bar###cuux,fnorb ", true, "foo bar cuux fnorb"},
{"eyes\nof\tMedusa", true, "eyes of Medusa"},
};
test_cases(cases, [](auto s, auto f) { return utf8_wordbreak(s); });
}
static void
test_format()
{
g_assert_true(mu_format("hello {}", "world") == "hello world");
g_assert_true(mu_format("hello {}, {}", "world", 123) == "hello world, 123");
}
static void
test_split()
{
using svec = std::vector<std::string>;
auto assert_equal_svec=[](const svec& sv1, const svec& sv2) {
g_assert_cmpuint(sv1.size(),==,sv2.size());
for (auto i = 0U; i != sv1.size(); ++i)
g_assert_cmpstr(sv1[i].c_str(),==,sv2[i].c_str());
};
// string sepa
assert_equal_svec(split("axbxc", "x"), {"a", "b", "c"});
assert_equal_svec(split("axbxcx", "x"), {"a", "b", "c", ""});
assert_equal_svec(split("", "boo"), {});
assert_equal_svec(split("ayybyyc", "yy"), {"a", "b", "c"});
assert_equal_svec(split("abc", ""), {"a", "b", "c"});
assert_equal_svec(split("", "boo"), {});
// char sepa
assert_equal_svec(split("axbxc", 'x'), {"a", "b", "c"});
assert_equal_svec(split("axbxcx", 'x'), {"a", "b", "c", ""});
}
static void
test_join()
{
assert_equal(join({"a", "b", "c"}, "x"), "axbxc");
assert_equal(join({"a", "b", "c"}, ""), "abc");
assert_equal(join({},"foo"), "");
assert_equal(join({"d", "e", "f"}, "foo"), "dfooefoof");
}
enum struct Bits { None = 0, Bit1 = 1 << 0, Bit2 = 1 << 1 };
MU_ENABLE_BITOPS(Bits);
static void
test_define_bitmap()
{
g_assert_cmpuint((guint)Bits::None, ==, (guint)0);
g_assert_cmpuint((guint)Bits::Bit1, ==, (guint)1);
g_assert_cmpuint((guint)Bits::Bit2, ==, (guint)2);
g_assert_cmpuint((guint)(Bits::Bit1 | Bits::Bit2), ==, (guint)3);
g_assert_cmpuint((guint)(Bits::Bit1 & Bits::Bit2), ==, (guint)0);
g_assert_cmpuint((guint)(Bits::Bit1 & (~Bits::Bit2)), ==, (guint)1);
{
Bits b{Bits::Bit1};
b |= Bits::Bit2;
g_assert_cmpuint((guint)b, ==, (guint)3);
}
{
Bits b{Bits::Bit1};
b &= Bits::Bit1;
g_assert_cmpuint((guint)b, ==, (guint)1);
}
}
static void
test_to_from_lexnum()
{
assert_equal(to_lexnum(0), "g0");
assert_equal(to_lexnum(100), "h64");
assert_equal(to_lexnum(12345), "j3039");
g_assert_cmpuint(from_lexnum(to_lexnum(0)), ==, 0);
g_assert_cmpuint(from_lexnum(to_lexnum(7777)), ==, 7777);
g_assert_cmpuint(from_lexnum(to_lexnum(9876543)), ==, 9876543);
}
static void
test_locale_workaround()
{
g_assert_true(locale_workaround());
g_setenv("LC_ALL", "BOO", 1);
g_assert_true(locale_workaround());
}
static void
test_summarize()
{
const char *txt =
"Khiron was fortified and made the seat of a pargana during "
"the reign of Asaf-ud-Daula.\n\the headquarters had previously "
"been at Satanpur since its foundation and fortification by "
"the Bais raja Sathna.\n\nKhiron was also historically the seat "
"of a taluqdari estate belonging to a Janwar dynasty.\n"
"There were also several Kayasth qanungo families, "
"including many descended from Rai Sahib Rai, who had been "
"a chakladar under the Nawabs of Awadh.";
const auto summ = summarize(txt, 3);
g_assert_cmpstr(summ.c_str(), ==,
"Khiron was fortified and made the seat of a pargana "
"during the reign of Asaf-ud-Daula. he headquarters had "
"previously been at Satanpur since its foundation and "
"fortification by the Bais raja Sathna. ");
}
int
main(int argc, char* argv[])
{
mu_test_init(&argc, &argv);
g_test_add_func("/utils/date-basic", test_date_basic);
g_test_add_func("/utils/date-ymwdhMs", test_date_ymwdhMs);
g_test_add_func("/utils/parse-size", test_parse_size);
g_test_add_func("/utils/utf8-clean", test_utf8_clean);
g_test_add_func("/utils/flatten", test_flatten);
g_test_add_func("/utils/remove-ctrl", test_remove_ctrl);
g_test_add_func("/utils/clean", test_clean);
g_test_add_func("/utils/word-break", test_word_break);
g_test_add_func("/utils/format", test_format);
g_test_add_func("/utils/summarize", test_summarize);
g_test_add_func("/utils/split", test_split);
g_test_add_func("/utils/join", test_join);
g_test_add_func("/utils/define-bitmap", test_define_bitmap);
g_test_add_func("/utils/to-from-lexnum", test_to_from_lexnum);
g_test_add_func("/utils/locale-workaround", test_locale_workaround);
return g_test_run();
}
|