-
Notifications
You must be signed in to change notification settings - Fork 3
/
Decoration.cpp
195 lines (183 loc) · 13.2 KB
/
Decoration.cpp
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
#include "stdafx.h"
#include "Decoration.h"
#include "Skill.h"
#include "Solution.h"
using namespace System;
void Decoration::Load( System::String^ filename )
{
static_decoration_map.Clear();
static_decoration_ability_map.Clear();
static_decorations.Clear();
static_decorations.Capacity = 256;
IO::StreamReader fin( filename );
//IO::StreamWriter fout( L"extra.txt" );
while( !fin.EndOfStream )
{
String^ line = fin.ReadLine();
if( line == L"" || line[ 0 ] == L'#' )
continue;
List_t< String^ > split;
Utility::SplitString( %split, line, L',' );
Decoration^ decoration = gcnew Decoration;
decoration->is_event = false;
//name,rarity,slots,hr,ve,skill1,#,skill2,#,mat1,#,mat2,#,mat3,#,mat4,#
decoration->name = split[ 0 ];
const unsigned data_start = 1;
decoration->rarity = Convert::ToUInt32( split[ data_start ] );
decoration->slots_required = Convert::ToUInt32( split[ data_start + 1 ] );
decoration->hr = Convert::ToUInt32( split[ data_start + 2 ] );
decoration->elder_star = Convert::ToUInt32( split[ data_start + 3 ] );
decoration->difficulty = 0;
for( int i = 0; i < 2; ++i )
{
if( split[ data_start + 4 + i * 2 ] == L"" ) continue;
AbilityPair^ apair = gcnew AbilityPair( Ability::FindAbility( split[ data_start + 4 + i * 2 ] ), Convert::ToInt32( split[ data_start + 5 + i * 2 ] ) );
Assert( apair->ability, L"No such ability found" );
decoration->abilities.Add( apair );
}
for( unsigned i = 0; i < 4; ++i )
{
String^% name = split[ data_start + 8 + i * 2 ];
if( name != L"" && !name->StartsWith( L"※" ) )
{
MaterialComponent^ mc = gcnew MaterialComponent;
mc->amount = Convert::ToUInt32( split[ data_start + 9 + i * 2 ] );
//Assert( name != L"狂走エキス", L"hey" );
mc->material = Material::FindMaterial( name );
Assert( mc->material, L"No such material found: " + name );
/*if( !mc->material )
{
Material^ mat = gcnew Material;
mat->name = split[ data_start + 8 + i * 2 ];
Material::static_materials.Add( mat );
Material::static_material_map[ mat->name ] = mat;
mc->material = mat;
}*/
decoration->components.Add( mc );
decoration->is_event |= mc->material->event_only;
decoration->difficulty += mc->material->difficulty;
}
if( split[ data_start + 16 + i * 2 ] != L"" && !split[ data_start + 6 + i * 2 ]->StartsWith( L"※" ) )
{
MaterialComponent^ mc = gcnew MaterialComponent;
mc->amount = Convert::ToUInt32( split[ data_start + 17 + i * 2 ] );
mc->material = Material::FindMaterial( split[ data_start + 16 + i * 2 ] );
//Assert( mc->material->name != L"狂走エキス", L"hey" );
Assert( mc->material, L"No such material found" );
/*if( !mc->material )
{
Material^ mat = gcnew Material;
mat->name = split[ data_start + 16 + i * 2 ];
Material::static_materials.Add( mat );
Material::static_material_map[ mat->name ] = mat;
mc->material = mat;
}*/
decoration->components2.Add( mc );
}
decoration->ping_index = Convert::ToUInt32( split[ data_start + 24 ] );
}
decoration->index = static_decorations.Count;
static_decorations.Add( decoration );
if( !static_decoration_ability_map.ContainsKey( decoration->abilities[ 0 ]->ability ) )
static_decoration_ability_map.Add( decoration->abilities[ 0 ]->ability, gcnew List_t< Decoration^ > );
static_decoration_ability_map[ decoration->abilities[ 0 ]->ability ]->Add( decoration );
static_decoration_map.Add( decoration->name, decoration );
}
static_decorations.TrimExcess();
}
int Decoration::GetSkillAt( Ability^ ability )
{
for( int i = 0; i < abilities.Count; ++i )
if( abilities[ i ]->ability == ability )
return abilities[ i ]->amount;
return 0;
}
inline bool NotWorse( Decoration^ a, Decoration^ b )
{
return b->abilities.Count == 2 && ( a->abilities.Count == 1 || a->abilities[ 1 ]->amount * b->slots_required < b->abilities[ 1 ]->amount * a->slots_required );
}
bool Decoration::IsBetterThan( Decoration^ other, List_t< Ability^ >^ rel_abilities )
{
if( slots_required < other->slots_required || abilities[ 0 ]->ability != other->abilities[ 0 ]->ability )
return true;
const int a = abilities[ 0 ]->amount * other->slots_required,
b = other->abilities[ 0 ]->amount * slots_required;
return a != b ? a > b : NotWorse( this, other );
}
Decoration^ Decoration::GetBestDecoration( Ability^ ability, const unsigned max_slots, const unsigned hr, const unsigned elder_star )
{
Assert( !ability->relevant, L"Ability is relevant here!?" );
if( !static_decoration_ability_map.ContainsKey( ability ) )
return nullptr;
Decoration^ best = nullptr;
List_t< Ability^ > rel;
rel.Add( ability );
for each( Decoration^ dec in static_decoration_ability_map[ ability ] )
{
if( dec->hr > hr && dec->elder_star > elder_star || dec->slots_required > max_slots )
continue;
for each( AbilityPair^ ap in dec->abilities )
{
if( ap->amount > 0 && ap->ability == ability )
{
if( !best || dec->IsBetterThan( best, %rel ) )
best = dec;
}
}
}
return best;
}
bool Decoration::MatchesQuery( Query^ query )
{
//check requirements
if( hr > query->hr && elder_star > query->elder_star ||
is_event && !query->allow_event )
return false;
//check for relevant skills
for each( Skill^ skill in query->skills )
if( skill->ability == abilities[ 0 ]->ability )
return true;
return false;
}
Decoration^ Decoration::FindDecoration( System::String^ name )
{
if( static_decoration_map.ContainsKey( name ) )
return static_decoration_map[ name ];
return nullptr;
}
Decoration^ Decoration::FindDecoration( System::String^ ability_name, const unsigned points )
{
for each( Decoration^ dec in static_decorations )
{
if( dec->abilities[ 0 ]->ability->name == ability_name &&
dec->abilities[ 0 ]->amount == points )
return dec;
}
return nullptr;
}
Decoration^ Decoration::GetBestDecoration( Ability^ ability, const unsigned max_slots, List_t< List_t< Decoration^ >^ >% rel_deco_map )
{
for( int i = max_slots + 1; i --> 0; )
{
for each( Decoration^ deco in rel_deco_map[ i ] )
{
if( deco->abilities[ 0 ]->ability == ability )
return deco;
}
}
return nullptr;
}
void Decoration::LoadLanguage( System::String^ filename )
{
static_decoration_map.Clear();
IO::StreamReader fin( filename );
for( int i = 0; i < static_decorations.Count; )
{
String^ line = fin.ReadLine();
if( line == L"" || line[ 0 ] == L'#' )
continue;
static_decorations[ i ]->name = line;
static_decoration_map.Add( line, static_decorations[ i ] );
i++;
}
}