Files
Dreierpack-Manager/tests/modern_shirt_number_tests.cpp
T
MichaelandClaude Fable 5.2 72e06aabdb Players wear shirt numbers the manager can change
Every player keeps a number from 1 to 99, unique within his squad. The
line-up shows it and changes it by a click; the tactics sketch and the
match sheet wear it too.

Engine: shirt_numbers.hpp, squad read player.shirtNumber, command
lineup.setNumber; saved in state/modern.json.

Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com>
2026-11-17 16:58:34 +01:00

75 lines
3.0 KiB
C++

// SPDX-License-Identifier: GPL-3.0-only
// Shirt numbers (docs/new_engine/rueckennummern.md) on a synthetic squad: the lowest free
// numbers, kept numbers, the swap, and that numbers stay with players when rows change.
#include <cstdio>
#include <set>
#include "modern/game/shirt_numbers.hpp"
using namespace bmh;
using namespace bmh::modern;
namespace {
int failures = 0;
void check(bool ok, const char* what) {
if (!ok) {
std::fprintf(stderr, "FAIL: %s\n", what);
++failures;
}
}
// Manager 0 runs club 0 with players 0-19 in its first twenty rows.
ModernState squad() {
ModernState g;
g.manager_teams = {0};
g.manager_records.assign(5 * 0xb0c, 0);
g.squad_slots.assign(3150, kEmptySlot);
for (int i = 0; i < 20; ++i) {
g.players.push_back(Player{});
g.squad_slots[size_t(i)] = uint16_t(i);
}
return g;
}
} // namespace
int main() {
{
ModernState g = squad();
const auto numbers = squad_shirt_numbers(g, 0);
bool in_order = numbers.size() >= 20;
for (int i = 0; in_order && i < 20; ++i) in_order = numbers[size_t(i)] == i + 1;
check(in_order && numbers[20] == 0, "without kept numbers the squad wears 1 to 20 in row order, empty rows none");
check(set_shirt_number(g, 0, 5, 33) && squad_shirt_numbers(g, 0)[5] == 33, "a free number is given");
check(set_shirt_number(g, 0, 0, 10), "a worn number is given");
const auto swapped = squad_shirt_numbers(g, 0);
check(swapped[0] == 10 && swapped[9] == 1, "the two players swap their numbers");
std::set<int> worn;
bool unique = true;
for (int i = 0; i < 20; ++i) unique = unique && worn.insert(swapped[size_t(i)]).second;
check(unique, "every number is worn once");
check(!set_shirt_number(g, 0, 5, 0) && !set_shirt_number(g, 0, 5, 100) && !set_shirt_number(g, 0, 30, 7) && !set_shirt_number(g, 1, 5, 7) &&
squad_shirt_numbers(g, 0)[5] == 33,
"a number out of range, a player outside the squad and a missing manager are refused");
// rows change (a new line-up): the numbers go with the players
std::swap(g.squad_slots[0], g.squad_slots[15]);
const auto moved = squad_shirt_numbers(g, 0);
check(moved[15] == 10 && moved[0] == 16, "numbers stay with the players when rows change");
}
// a newcomer whose number is taken gets the lowest free one
{
ModernState g = squad();
fix_shirt_numbers(g, 0);
g.players.push_back(Player{});
g.shirt_numbers.resize(g.players.size(), 0);
g.shirt_numbers[20] = 7;
g.squad_slots[20] = 20;
check(squad_shirt_numbers(g, 0)[20] == 21 && squad_shirt_numbers(g, 0)[6] == 7, "a taken number: the newcomer gets the lowest free one");
g.squad_slots[6] = kEmptySlot;
check(squad_shirt_numbers(g, 0)[20] == 7, "once the number is free he wears his own");
}
if (failures) return 1;
std::puts("modern_shirt_number_tests: ok");
return 0;
}