forked from AthenaADP/MH4U-ASS
-
Notifications
You must be signed in to change notification settings - Fork 0
/
CharmDatabase.cpp
1694 lines (1513 loc) · 108 KB
/
CharmDatabase.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
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
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "stdafx.h"
#include "CharmDatabase.h"
#include "Solution.h"
#include "Armor.h"
#include "Skill.h"
#include <fstream>
#include <cmath>
using namespace System;
//not sure what this is. ordering?
/*"刀匠",
"射手",
"状態耐性",
"怒",
"細菌学",
"回避術",
"居合",
"頑強",
"剛撃",
"一心",
"盾持",
"潔癖",
"増幅",
"護石収集",
"強欲",
"属性解放",
"剣術",
"匠",
"抜刀会心",
"抜刀減気",
"装填速度",
"反動",
"速射",
"本気",
"闘魂",
"不動",
"護石王",
"痛撃",
"属性耐性",
"攻撃",
"防御",
"採取",
"剥ぎ取り",
"運気",
"捕獲",
"達人",
"砲術",
"回避性能",
"体力",
"聴覚保護",
"斬れ味",
"ガード性能",
"ガード強化",
"研ぎ師",
"底力",
"爆弾強化",
"特殊攻撃",
"スタミナ",
"重撃",
"回避距離",
"納刀",
"溜め短縮",
"減気攻撃",
"無傷",
"根性",
"装填数",
"通常弾強化",
"貫通弾強化",
"散弾強化",
"KO",
"対防御DOWN",
"効果持続",
"通常弾追加",
"貫通弾追加",
"散弾追加",
"榴弾追加",
"拡散弾追加",
"斬裂弾追加",
"爆破弾追加",
"毒瓶追加",
"麻痺瓶追加",
"睡眠瓶追加",
"強撃瓶追加",
"接撃瓶追加",
"減気瓶追加",
"爆破瓶追加",
"精密射撃",
"火属性攻撃",
"水属性攻撃",
"雷属性攻撃",
"氷属性攻撃",
"龍属性攻撃",
"属性攻撃",
"火耐性",
"水耐性",
"雷耐性",
"氷耐性",
"龍耐性",
"高速収集",
"千里眼",
"観察眼",
"回復量",
"広域",
"笛",
"逆境",
"肉食",
"食いしん坊",
"体術",
"気力回復",
"風圧",
"食事",
"調合成功率",
"調合数",
"狩人",
"耐暑",
"耐寒",
"指揮",
"采配",
"号令",
"回復速度",
"気まぐれ",
"加護",
"腹減り",
"運搬",
"高速設置",
"ハチミツ",
"毒",
"麻痺",
"睡眠",
"気絶",
"耐泥耐雪",
"耐震",
"盗み無効",
"気配",
"燃鱗",
"自動防御",
"狂撃耐性",
"乗り",
"属性会心",
"特殊会心",
"射法",
"茸食",
"節食",
"裂傷",
"耐粘",
"斬術",
"食欲",
"北辰納豆流",
"秘伝",
"職工",
"剛腕",
"祈願",
"裏稼業"*/
unsigned CalcMaxCharmType( Query^ query )
{
int hr_to_charm_type[] =
{
0, // HR0+ mystery
0,
0,
0,
1, // HR4+ shining
2, // HR5+ timeworn
2,
2,
4, // HR8+ enduring & distorted (G-rank)
4, // G1
4, // G2
4, // G3
5, // All (special permit) graven charms (Lv140 Guild Quests etc.)
5,
5,
};
int effective_hr = query->hr;
if( effective_hr < 4 && query->elder_star > 6 )
effective_hr = 4;
if( effective_hr < 5 && query->elder_star > 7 )
effective_hr = 5;
return hr_to_charm_type[ effective_hr ];
}
String^ FixTypos( String^ input )
{
if( input == L"Faint" )
return L"Stun";
else if( input == L"Snow/Mud Res" )
return L"Mud/Snow";
else if( input == L"Defense Lock" )
return L"Def Lock";
else if( input == L"Fast Charge" )
return L"FastCharge";
else if( input == L"Stamina Drain" )
return L"Stam Drain";
else if( input == L"Constitution" )
return L"Constitutn";
else if( input == L"Stamina Recovery" )
return L"Stam Recov";
else if( input == L"Evade Distance" )
return L"Evade Dist";
else if( input == L"Elemental Attack" )
return L"Elemental";
else if( input == L"Fire Attack" )
return L"Fire Atk";
else if( input == L"Water Attack" )
return L"Water Atk";
else if( input == L"Thunder Attack" )
return L"ThunderAtk";
else if( input == L"Ice Attack" )
return L"Ice Atk";
else if( input == L"Dragon Attack" )
return L"Dragon Atk";
else if( input == L"Thunder Res" )
return L"ThunderRes";
else if( input == L"Sharpening Speed" )
return L"Sharpener";
else if( input == L"Punishing Draw" )
return L"PunishDraw";
else if( input == L"Critical Draw" )
return L"Crit Draw";
else if( input == L"Reload Speed" )
return L"Reload Spd";
else if( input == L"Slime S+" )
return L"Blast S+";
else if( input == L"Paralysis C+" )
return L"Para C+";
else if( input == L"Slime C+" )
return L"Blast C+";
else if( input == L"Recovery Level" )
return L"Rec Level";
else if( input == L"Wide Range" )
return L"Wide-Range";
else if( input == L"Lasting Power" )
return L"LastingPwr";
else if( input == L"Speed Gather" )
return L"Spd Gather";
else if( input == L"Tranquilizer" )
return L"Tranquilzr";
else if( input == L"Transporter" )
return L"Transportr";
else if( input == L"Speed Setup" )
return L"SpeedSetup";
else if( input == L"Free Element" )
return L"FreeElemnt";
else if( input == L"Team Player" )
return L"TeamPlayer";
else if( input == L"Team Leader" )
return L"TeamLeader";
else if( input == L"Steadyhand" )
return L"SteadyHand";
else if( input == L"Single-Minded" )
return L"Ferocity";
else if( input == L"Firm Defence" )
return L"Resilience";
else if( input == L"Greedy" )
return L"Avarice";
else if( input == L"Infection Res" )
return L"Frenzy Res";
else if( input == L"Precise Attack" )
return L"Brutality";
else if( input == L"Rider" )
return L"Mounting";
else if( input == L"Martial Arts" )
return L"Readiness";
else if( input == L"Acrobat" )
return L"Nimbleness";
else if( input == L"Shielder" )
return L"Stalwart";
else if( input == L"Finesse" )
return L"Prudence";
else if( input == L"Charm Collector" )
return L"Hoarding";
else if( input == L"Amplifier" )
return L"Amplify";
else if( input == L"Bleed Res" )
return L"Bleeding";
else if( input == L"Diet" )
return L"LightEater";
else if( input == L"Mushrooms" )
return L"Mycology";
else if( input == L"Appetite" )
return L"PowerEater";
else if( input == L"Range Extend" )
return L"Dead Eye";
else if( input == L"Tricksy" )
return L"Covert";
else if( input == L"Blade" )
return L"Edge Lore";
else if( input == L"Status Crit" )
return L"CritStatus";
else if( input == L"Elemental Crit" )
return L"CritElemnt";
else if( input == L"Sticky Fighter" )
return L"D. Fencing";
else if( input == L"Hidden Power" )
return L"Arcana";
else if( input == L"Trap Master" )
return L"Mechanic";
else if( input == L"Hard Hitting" )
return L"Brawn";
else return input;
}
#pragma region Custom charms/gear
#define CUSTOM_GEAR_TXT L"Data/mygear.txt"
void ExcavatedGear::SaveCustom()
{
IO::StreamWriter fout( CUSTOM_GEAR_TXT );
for each( Weapon^ wep in weapons )
{
fout.Write( "5," );
fout.Write( Convert::ToString( (int)wep->type ) + "," );
fout.Write( Convert::ToString( wep->ability_amount ) + "," );
fout.Write( Convert::ToString( wep->ability->name ) + "," );
fout.Write( Convert::ToString( wep->defence ) );
fout.WriteLine();
}
for( int i = 0; i < armor->Length; ++i )
{
for( int j = 0; j < armor[ i ]->Count; ++j )
{
Armor^ arm = armor[ i ][ j ];
fout.Write( Convert::ToString( i ) + L"," );
fout.Write( Convert::ToString( (int)arm->type ) + L"," );
fout.Write( Convert::ToString( arm->abilities[ 0 ]->amount ) + "," );
fout.Write( Convert::ToString( arm->abilities[ 0 ]->ability->name ) + L"," );
fout.Write( Convert::ToString( arm->defence ) + L"," );
fout.Write( Convert::ToString( arm->fire_res ) + L"," );
fout.Write( Convert::ToString( arm->water_res ) + L"," );
fout.Write( Convert::ToString( arm->ice_res ) + L"," );
fout.Write( Convert::ToString( arm->thunder_res ) + L"," );
fout.Write( Convert::ToString( arm->dragon_res ) + L"," );
fout.WriteLine();
}
}
}
bool ExcavatedGear::LoadCustom()
{
weapons.Clear();
armor = gcnew array< List_t< Armor^ >^ >( (int)Armor::ArmorType::NumArmorTypes );
for( int i = 0; i < armor->Length; ++i )
armor[ i ] = gcnew List_t< Armor^ >();
if( !IO::File::Exists( CUSTOM_GEAR_TXT ) )
{
return true;
}
IO::StreamReader fin( CUSTOM_GEAR_TXT );
String^ temp;
while( !fin.EndOfStream )
{
temp = fin.ReadLine();
if( temp == L"" || temp[ 0 ] == L'#' )
continue;
try
{
List_t< String^ > split;
Utility::SplitString( %split, temp, L',' );
if( StringTable::english )
split[ 3 ] = FixTypos( split[ 3 ] );
const int type = Convert::ToUInt32( split[ 0 ] );
if( type == (int)Armor::ArmorType::NumArmorTypes )
{
Weapon^ wep = gcnew Weapon();
wep->type = (HunterType)Convert::ToUInt32( split[ 1 ] );
wep->ability_amount = Convert::ToUInt32( split[ 2 ] );
wep->ability = Ability::FindAbility( split[ 3 ] );
wep->defence = split.Count > 4 ? Convert::ToUInt32( split[ 4 ] ) : 0;
wep->index = weapons.Count;
if( wep->ability )
weapons.Add( wep );
else
return false;
}
else
{
Armor^ arm = gcnew Armor();
arm->relic = true;
arm->type = (HunterType)Convert::ToUInt32( split[ 1 ] );
int amount = Convert::ToUInt32( split[ 2 ] );
Ability^ ability = Ability::FindAbility( split[ 3 ] );
if( ability )
{
arm->abilities.Add( gcnew AbilityPair( ability, amount ) );
arm->defence = arm->max_defence = Convert::ToUInt32( split[ 4 ] );
arm->fire_res = Convert::ToInt32( split[ 5 ] );
arm->water_res = Convert::ToInt32( split[ 6 ] );
arm->ice_res = Convert::ToInt32( split[ 7 ] );
arm->thunder_res = Convert::ToInt32( split[ 8 ] );
arm->dragon_res = Convert::ToInt32( split[ 9 ] );
arm->SetExName( type );
arm->index = armor[ type ]->Count;
arm->gender = Gender::BOTH_GENDERS;
armor[ type ]->Add( arm );
}
else return false;
}
}
catch( Exception^ )
{
return false;
}
}
return true;
}
#define CUSTOM_CHARM_TXT L"Data/mycharms.txt"
void CharmDatabase::SaveCustom()
{
//slots,skill1,num,skill2,num
IO::StreamWriter fout( CUSTOM_CHARM_TXT );
fout.WriteLine( L"#Format: Slots,Skill1,Points1,Skill2,Points2" );
for each( Charm^ ch in mycharms )
{
fout.Write( Convert::ToString( ch->num_slots ) );
for( int i = 0; i < 2; ++i )
{
if( i < ch->abilities.Count )
fout.Write( L"," + ch->abilities[ i ]->ability->name + L"," + Convert::ToString( ch->abilities[ i ]->amount ) );
else fout.Write( L",," );
}
fout.WriteLine();
}
}
bool CharmDatabase::CreateNewCustom()
{
if( !IO::File::Exists( CUSTOM_CHARM_TXT ) )
{
mycharms.Clear();
Charm^ charm = gcnew Charm( 0 );
charm->abilities.Add( gcnew AbilityPair( SpecificAbility::auto_guard, 10 ) );
mycharms.Add( charm );
return true;
}
return false;
}
List_t< Charm^ >^ CharmDatabase::LoadCharms( System::String^ filename )
{
List_t< Charm^ >^ results = gcnew List_t< Charm^ >();
IO::StreamReader fin( filename );
String^ temp;
while( !fin.EndOfStream )
{
temp = fin.ReadLine();
if( temp == L"" || temp[ 0 ] == L'#' ) continue;
List_t< String^ > split;
Utility::SplitString( %split, temp, L',' );
if( split.Count != 5 )
{
//MessageBox::Show( L"Failed to load mycharms.txt: Wrong number of commas" );
results->Clear();
return results;
}
//slots,skill1,num,skill2,num
Charm^ charm = gcnew Charm();
charm->num_slots = Convert::ToUInt32( split[ 0 ] );
try
{
if( split[ 1 ] != L"" )
{
if( StringTable::english )
split[ 1 ] = FixTypos( split[ 1 ] );
Ability^ ab = Ability::FindAbility( split[ 1 ] );
if( !ab )
{
results->Clear();
return results;
}
charm->abilities.Add( gcnew AbilityPair( ab, Convert::ToInt32( split[ 2 ] ) ) );
}
if( split[ 3 ] != L"" )
{
if( StringTable::english )
split[ 3 ] = FixTypos( split[ 3 ] );
Ability^ ab = Ability::FindAbility( split[ 3 ] );
if( !ab )
{
results->Clear();
return results;
}
charm->abilities.Add( gcnew AbilityPair( ab, Convert::ToInt32( split[ 4 ] ) ) );
}
}
catch( Exception^ )
{
results->Clear();
return results;
}
results->Add( charm );
}
return results;
}
bool CharmDatabase::LoadCustom()
{
if( !IO::File::Exists( CUSTOM_CHARM_TXT ) )
{
Charm^ charm = gcnew Charm( 0 );
charm->abilities.Add( gcnew AbilityPair( SpecificAbility::auto_guard, 10 ) );
mycharms.Clear();
mycharms.Add( charm );
return true;
}
List_t< Charm^ >^ charms = LoadCharms( CUSTOM_CHARM_TXT );
if( charms->Count == 0 )
return false;
mycharms.Clear();
bool cheats = false;
for each( Charm^ charm in charms )
{
if( CharmDatabase::CharmIsLegal( charm ) )
{
charm->custom = true;
mycharms.Add( charm );
}
else
{
cheats = true;
}
}
if( cheats )
System::Windows::Forms::MessageBox::Show( StaticString( Cheater ) );
return true;
}
#pragma endregion
#pragma region Charm Generation
ref struct StaticData
{
static array< array< unsigned char >^ >^ skill1_table;
static array< array< signed char >^ >^ skill2_table; // [type][skill]
static array< array< unsigned char >^ >^ slot_table;
static array< unsigned char >^ skill2_chance_table =
{
100,
35,
25,
20,
15,
25
};
};
int rnd( const int n )
{
Assert( n < 65536 && n >= 0, L"Bad RND" );
if( n == 0 ) return 176;
return ( n * 176 ) % 65363;
}
int reverse_rnd( const int n )
{
return ( n * 7799 ) % 65363;
}
unsigned GetNumSlots( const unsigned charm_type, const int slot_table, const unsigned roll )
{
Assert( (int)charm_type < StaticData::slot_table->Length, L"Bad charm type" );
const unsigned table_index = Math::Min( slot_table, StaticData::slot_table[ charm_type ]->Length / 3 ) - 1;
const unsigned for2 = StaticData::slot_table[ charm_type ][ table_index * 3 + 1 ];
const unsigned for3 = StaticData::slot_table[ charm_type ][ table_index * 3 + 2 ];
const unsigned for1 = StaticData::slot_table[ charm_type ][ table_index * 3 + 0 ];
if( roll >= for2 )
{
return ( roll >= for3 ) ? 3 : 2;
}
else
{
return ( roll >= for1 ) ? 1 : 0;
}
}
bool TryTwoSkillCharm( const unsigned charm_type, int n, int m, array< List_t< unsigned >^ >^ charms )
{
array< unsigned char >^ skill1_table = StaticData::skill1_table[ charm_type ];
array< signed char >^ skill2_table = StaticData::skill2_table[ charm_type ];
const unsigned num_skills1 = skill1_table->Length / 3;
const unsigned num_skills2 = skill2_table == nullptr ? 0 : skill2_table->Length / 3;
//skill 1
const int skill1_index = n % num_skills1;
const int skill1_name = skill1_table[ skill1_index * 3 ];
const int skill1_min = skill1_table[ skill1_index * 3 + 1 ];
const int skill1_max = skill1_table[ skill1_index * 3 + 2 ];
//skill 1 point
n = rnd( n );
const int point1 = skill1_min + (n^m) % ( skill1_max - skill1_min + 1 );
//has skill 2?
int skill2_index = -1, point2 = 0, skill2_min = 0, skill2_max = 0, skill2_name = 0;
n = rnd( n );
m = rnd( m );
if( (n^m) % 100 >= StaticData::skill2_chance_table[ charm_type ] )
{
//skill 2
m = rnd( m );
skill2_index = m % num_skills2;
skill2_name = skill2_table[ skill2_index * 3 ];
skill2_min = skill2_table[ skill2_index * 3 + 1 ];
skill2_max = skill2_table[ skill2_index * 3 + 2 ];
//skill 2 point
if( skill2_min > 0 ) //positive number
{
n = rnd( n );
m = rnd( m );
point2 = ( (n^m) % ( skill2_max - skill2_min + 1 ) ) + skill2_min;
}
else //check for negative
{
n = rnd( n );
if( n % 2 == 1 ) //positive
{
n = rnd( n );
m = rnd( m );
point2 = (n^m) % skill2_max + 1;
}
else //negative
{
n = rnd( n );
m = rnd( m );
point2 = skill2_min + (n^m) % ( -skill2_min );
}
}
if( point2 < 0 )
return false;
if( skill1_name == skill2_name )
{
skill2_min = skill2_max = point2 = 0;
skill2_name = skill2_index = Ability::static_abilities.Count;
}
}
const int slot_table = (int)Math::Floor( point1*10.0 / skill1_max + ( (point2 > 0) ? point2*10.0 / skill2_max : 0 ) );
//slots
n = rnd( n );
int slot_roll = 0;
if( n & 128 )
{
n = rnd( n );
slot_roll = n % 100;
}
else
{
m = rnd( m );
slot_roll = m % 100;
}
const int num_slots = GetNumSlots( charm_type, slot_table, slot_roll );
List_t< unsigned >^ list = charms[ num_slots ];
for( int i = 0; i < list->Count; ++i )
{
const unsigned hash = list[i];
const int p1 = hash >> 16;
const int p2 = hash & 0xFFFF;
if( p1 >= point1 && p2 >= point2 )
return false;
}
list->Add( point1 << 16 | point2 );
return num_slots == Math::Min( 3u, charm_type + 1 ) && slot_table == 20;
}
String^ CanGenerateCharm1( const unsigned charm_type, int n, int m, Charm^ charm )
{
Assert( charm->abilities.Count == 1, "Too many abilities for charm" );
Assert( (int)charm_type < StaticData::skill1_table->Length && (int)charm_type < StaticData::skill2_table->Length, "Charm type is invalid" );
array< unsigned char >^ skill1_table = StaticData::skill1_table[ charm_type ];
array< signed char >^ skill2_table = StaticData::skill2_table[ charm_type ];
const unsigned num_skills1 = skill1_table->Length / 3;
const unsigned num_skills2 = skill2_table->Length / 3;
//skill 1
const int skill1_index = n % num_skills1;
const int skill1_name = skill1_table[ skill1_index * 3 ];
const int skill1_min = skill1_table[ skill1_index * 3 + 1 ];
const int skill1_max = skill1_table[ skill1_index * 3 + 2 ];
//skill 1 point
n = rnd( n );
const int point1 = skill1_min + (n^m) % ( skill1_max - skill1_min + 1 );
if( skill1_name == charm->abilities[0]->ability->static_index && point1 < charm->abilities[0]->amount )
return nullptr;
//has skill 2?
int skill2_index = -1, point2 = 0, skill2_min = 0, skill2_max = 0, skill2_name = 0;
n = rnd( n );
m = rnd( m );
if( (n^m) % 100 >= StaticData::skill2_chance_table[ charm_type ] )
{
//skill 2
m = rnd( m );
skill2_index = m % num_skills2;
skill2_name = skill2_table[ skill2_index * 3 ];
skill2_min = skill2_table[ skill2_index * 3 + 1 ];
skill2_max = skill2_table[ skill2_index * 3 + 2 ];
//skill 2 point
if( skill2_min > 0 ) //positive number
{
n = rnd( n );
m = rnd( m );
point2 = ( (n^m) % ( skill2_max - skill2_min + 1 ) ) + skill2_min;
}
else //check for negative
{
n = rnd( n );
if( n % 2 == 1 ) //positive
{
n = rnd( n );
m = rnd( m );
point2 = (n^m) % skill2_max + 1;
}
else //negative
{
n = rnd( n );
m = rnd( m );
point2 = skill2_min + (n^m) % ( -skill2_min );
}
}
if( skill1_name == skill2_name )
{
skill2_name = point2 = 0;
skill2_index = -1;
}
if( skill1_name != charm->abilities[0]->ability->static_index && skill2_name != charm->abilities[0]->ability->static_index ||
point2 < charm->abilities[0]->amount )
return nullptr;
}
const int slot_table = (int)Math::Floor( point1*10.0 / skill1_max + ( (point2 > 0) ? point2*10.0 / skill2_max : 0 ) );
//slots
n = rnd( n );
int slot_roll = 0;
if( n & 128 )
{
n = rnd( n );
slot_roll = n % 100;
}
else
{
m = rnd( m );
slot_roll = m % 100;
}
const unsigned num_slots = GetNumSlots( charm_type, slot_table, slot_roll );
if( num_slots < charm->num_slots )
return nullptr;
Charm c( num_slots );
c.abilities.Add( gcnew AbilityPair( Ability::static_abilities[ skill1_name ], point1 ) );
if( point2 )
c.abilities.Add( gcnew AbilityPair( Ability::static_abilities[ skill2_name ], point2 ) );
return c.GetName();
}
String^ CanGenerateCharm2( const unsigned charm_type, int n, int m, Charm^ charm )
{
Assert( charm->abilities.Count == 2, "Too few abilities for charm" );
Assert( (int)charm_type < StaticData::skill1_table->Length && (int)charm_type < StaticData::skill2_table->Length, "Charm type is invalid" );
array< unsigned char >^ skill1_table = StaticData::skill1_table[ charm_type ];
array< signed char >^ skill2_table = StaticData::skill2_table[ charm_type ];
const unsigned num_skills1 = skill1_table->Length / 3;
const unsigned num_skills2 = skill2_table->Length / 3;
//skill 1
const int skill1_index = n % num_skills1;
const int skill1_name = skill1_table[ skill1_index * 3 ];
const int skill1_min = skill1_table[ skill1_index * 3 + 1 ];
const int skill1_max = skill1_table[ skill1_index * 3 + 2 ];
//skill 1 point
n = rnd( n );
const int point1 = skill1_min + (n^m) % ( skill1_max - skill1_min + 1 );
if( point1 < charm->abilities[0]->amount )
return nullptr;
//has skill 2?
int skill2_index = -1, point2 = 0, skill2_min = 0, skill2_max = 0, skill2_name = 0;
n = rnd( n );
m = rnd( m );
if( (n^m) % 100 >= StaticData::skill2_chance_table[ charm_type ] )
{
//skill 2
m = rnd( m );
skill2_index = m % num_skills2;
skill2_name = skill2_table[ skill2_index * 3 ];
skill2_min = skill2_table[ skill2_index * 3 + 1 ];
skill2_max = skill2_table[ skill2_index * 3 + 2 ];
//skill 2 point
if( skill2_min > 0 ) //positive number
{
n = rnd( n );
m = rnd( m );
point2 = ( (n^m) % ( skill2_max - skill2_min + 1 ) ) + skill2_min;
}
else //check for negative
{
n = rnd( n );
if( n % 2 == 1 ) //positive
{
n = rnd( n );
m = rnd( m );
point2 = (n^m) % skill2_max + 1;
}
else //negative
{
n = rnd( n );
m = rnd( m );
point2 = skill2_min + (n^m) % ( -skill2_min );
}
}
if( skill1_name == skill2_name || point2 < charm->abilities[1]->amount )
return nullptr;
}
else return nullptr;
const int slot_table = (int)Math::Floor( point1*10.0 / skill1_max + ( (point2 > 0) ? point2*10.0 / skill2_max : 0 ) );
//slots
n = rnd( n );
int slot_roll = 0;
if( n & 128 )
{
n = rnd( n );
slot_roll = n % 100;
}
else
{
m = rnd( m );
slot_roll = m % 100;
}
const unsigned num_slots = GetNumSlots( charm_type, slot_table, slot_roll );
if( num_slots < charm->num_slots )
return nullptr;
Charm c( num_slots );
c.abilities.Add( gcnew AbilityPair( Ability::static_abilities[ skill1_name ], point1 ) );
c.abilities.Add( gcnew AbilityPair( Ability::static_abilities[ skill2_name ], point2 ) );
return c.GetName();
}
bool CanGenerate2SkillCharm( const unsigned charm_type, int n, int m, Charm^ charm )
{
Assert( charm->abilities.Count == 2, "Charm has too few abilities" );
Assert( charm_type > 0 && (int)charm_type < StaticData::skill1_table->Length && (int)charm_type < StaticData::skill2_table->Length, "Charm type is invalid" );
array< unsigned char >^ skill1_table = StaticData::skill1_table[ charm_type ];
array< signed char >^ skill2_table = StaticData::skill2_table[ charm_type ];
const unsigned num_skills1 = skill1_table->Length / 3;
const unsigned num_skills2 = skill2_table->Length / 3;
//skill 1
//n = rnd( n );
const int skill1_index = n % num_skills1;
const int skill1_name = skill1_table[ skill1_index * 3 ];
Assert( skill1_name == charm->abilities[ 0 ]->ability->static_index, "Skill1 failed" );
const int skill1_min = skill1_table[ skill1_index * 3 + 1 ];
const int skill1_max = skill1_table[ skill1_index * 3 + 2 ];
//skill 1 point
n = rnd( n );
//m = rnd( m );
const int point1 = skill1_min + (n^m) % ( skill1_max - skill1_min + 1 );
if( point1 < charm->abilities[0]->amount )
return false;
//has skill 2?
int skill2_index = -1, point2 = 0, skill2_min = 0, skill2_max = 0, skill2_name = 0;
n = rnd( n );
m = rnd( m );
if( (n^m) % 100 >= StaticData::skill2_chance_table[ charm_type ] )
{
//skill 2
m = rnd( m );
skill2_index = m % num_skills2;
skill2_name = (unsigned char)skill2_table[ skill2_index * 3 ];
Assert( skill2_name == charm->abilities[1]->ability->static_index, "Skill2 failed" );
skill2_min = skill2_table[ skill2_index * 3 + 1 ];
skill2_max = skill2_table[ skill2_index * 3 + 2 ];
//skill 2 point
if( skill2_min > 0 ) //positive number
{
n = rnd( n );
m = rnd( m );
point2 = ( (n^m) % ( skill2_max - skill2_min + 1 ) ) + skill2_min;
}
else //check for negative
{
n = rnd( n );
if( n % 2 == 1 ) //positive
{
n = rnd( n );
m = rnd( m );
point2 = (n^m) % skill2_max + 1;
}
else //negative
{
n = rnd( n );
m = rnd( m );
point2 = skill2_min + (n^m) % ( -skill2_min );
}
}
if( skill1_name == skill2_name || point2 < charm->abilities[1]->amount )
{
return false;
}
}
else return false;
const int slot_table = (int)Math::Floor( point1*10.0 / skill1_max + ( (point2 > 0) ? point2*10.0 / skill2_max : 0 ) );
//slots
n = rnd( n );
int slot_roll = 0;
if( n & 128 )
{
n = rnd( n );
slot_roll = n % 100;
}
else
{
m = rnd( m );
slot_roll = m % 100;
}
const unsigned num_slots = GetNumSlots( charm_type, slot_table, slot_roll );
return num_slots >= charm->num_slots;
}
bool GenerateCharm3( const unsigned charm_type, const unsigned table, int n, int m, Charm^ charm )
{
//check charm_type < StaticData::skill1_table->Length
array< unsigned char >^ skill1_table = StaticData::skill1_table[ charm_type ];
const unsigned num_skills1 = skill1_table->Length / 3;
//check charm_type < StaticData::skill2_table->Length
array< signed char >^ skill2_table = StaticData::skill2_table[ charm_type ];
const unsigned num_skills2 = skill2_table == nullptr ? 0 : skill2_table->Length / 3;
//skill 1
//n = rnd( n );
const int skill1_index = n % num_skills1;
const int skill1_name = skill1_table[ skill1_index * 3 ];
const int skill1_min = skill1_table[ skill1_index * 3 + 1 ];
const int skill1_max = skill1_table[ skill1_index * 3 + 2 ];
//skill 1 point
n = rnd( n );
//m = rnd( m );
const int point1 = skill1_min + (n^m) % ( skill1_max - skill1_min + 1 );