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
|
#include <sstream>
#include "catch/catch.hpp"
#include "game.h"
#include "mutation.h"
#include "npc.h"
#include "player.h"
std::string get_mutations_as_string( const player &p );
// Note: If a category has two mutually-exclusive mutations (like pretty/ugly for Lupine), the
// one they ultimately end up with depends on the order they were loaded from JSON
void give_all_mutations( player &p, const mutation_category_trait &category,
const bool include_postthresh )
{
const std::vector<trait_id> category_mutations = mutations_category[category.id];
// Add the threshold mutation first
if( include_postthresh && !category.threshold_mut.is_empty() ) {
p.set_mutation( category.threshold_mut );
}
for( auto &m : category_mutations ) {
const auto &mdata = m.obj();
if( include_postthresh || ( !mdata.threshold && mdata.threshreq.empty() ) ) {
int mutation_attempts = 10;
while( mutation_attempts > 0 && p.mutation_ok( m, false, false ) ) {
INFO( "Current mutations: " << get_mutations_as_string( p ) );
INFO( "Mutating towards " << m.c_str() );
if( !p.mutate_towards( m ) ) {
--mutation_attempts;
}
CHECK( mutation_attempts > 0 );
}
}
}
}
int get_total_category_strength( const player &p )
{
int total = 0;
for( auto &i : p.mutation_category_level ) {
total += i.second;
}
return total;
}
// Returns the list of mutations a player has as a string, for debugging
std::string get_mutations_as_string( const player &p )
{
std::ostringstream s;
for( auto &m : p.get_mutations() ) {
s << static_cast<std::string>( m ) << " ";
}
return s.str();
}
TEST_CASE( "Having all mutations give correct highest category", "[mutations]" )
{
for( auto &cat : mutation_category_trait::get_all() ) {
const auto &cur_cat = cat.second;
const auto &cat_id = cur_cat.id;
if( cat_id == "ANY" ) {
continue;
}
GIVEN( "The player has all pre-threshold mutations for " + cat_id ) {
npc dummy;
give_all_mutations( dummy, cur_cat, false );
THEN( cat_id + " is the strongest category" ) {
INFO( "MUTATIONS: " << get_mutations_as_string( dummy ) );
CHECK( dummy.get_highest_category() == cat_id );
}
}
GIVEN( "The player has all mutations for " + cat_id ) {
npc dummy;
give_all_mutations( dummy, cur_cat, true );
THEN( cat_id + " is the strongest category" ) {
INFO( "MUTATIONS: " << get_mutations_as_string( dummy ) );
CHECK( dummy.get_highest_category() == cat_id );
}
}
}
}
TEST_CASE( "Having all pre-threshold mutations gives a sensible threshold breach chance",
"[mutations]" )
{
const float BREACH_CHANCE_MIN = 0.2f;
const float BREACH_CHANCE_MAX = 0.4f;
for( auto &cat : mutation_category_trait::get_all() ) {
const auto &cur_cat = cat.second;
const auto &cat_id = cur_cat.id;
if( cat_id == "ANY" ) {
continue;
}
GIVEN( "The player has all pre-threshold mutations for " + cat_id ) {
npc dummy;
give_all_mutations( dummy, cur_cat, false );
const int category_strength = dummy.mutation_category_level[cat_id];
const int total_strength = get_total_category_strength( dummy );
float breach_chance = category_strength / static_cast<float>( total_strength );
THEN( "Threshold breach chance is at least 0.2" ) {
INFO( "MUTATIONS: " << get_mutations_as_string( dummy ) );
CHECK( breach_chance >= BREACH_CHANCE_MIN );
}
THEN( "Threshold breach chance is at most 0.4" ) {
INFO( "MUTATIONS: " << get_mutations_as_string( dummy ) );
CHECK( breach_chance <= BREACH_CHANCE_MAX );
}
}
}
}
|
