Armor.h

#pragma once
#include "Common.h"
#include "Skill.h"

ref struct Query;

ref struct Armor : public AdvancedSearchOptions
{
	enum class ArmorType { HEAD = 0, BODY, ARMS, WAIST, LEGS, NumArmorTypes };
	System::String^ name;
	System::String^ jap_name;
	unsigned hr, elder_star, num_slots, defence, max_defence, rarity, difficulty, index, family, ping_index, male_image, female_image;
	int ice_res, water_res, fire_res, thunder_res, dragon_res;
	Gender gender;
	HunterType type;
	bool torso_inc, no_skills, is_event, jap_only, arena, chakra, jap_genders_only, nonjap, relic, gunner_def;
	Ability^ danger;
	List_t< AbilityPair^ > abilities;
	List_t< MaterialComponent^ > components;

	bool IsBetterThan( Armor^ other, List_t< Ability^ >^ rel_abilities, const bool want_taunt );
	bool IsBetterAtNonSkills( Armor^ other );
	int GetSkillAt( Ability^ ability );

	bool MatchesQuery( Query^ query, List_t< Ability^ >^ danger_skills, const unsigned max_slots );

	bool ContainsAnyAbility( List_t< Ability^ >% to_search );

	void SetExName( const int type );

	static void Load( System::String^ filename, ArmorType armor_type );
	static void LoadLanguage( System::String^ filename, ArmorType armor_type );
	static array< List_t< Armor^ >^ >^ static_armors;
};

ref struct Weapon
{
	Ability^ ability;
	unsigned ability_amount, index, defence;
	HunterType type;

	System::String^ GetName();
	bool IsBetterThan( Weapon^ other, List_t< Ability^ >^ rel_abilities );
};

ref struct Family
{
	static unsigned count = 0;
	static Map_t< System::String^, unsigned > map;
	static List_t< List_t< Armor^ >^ > families;
};

ref struct Charm
{
	List_t< AbilityPair^ > abilities;
	unsigned num_slots;
	bool custom, optimal, hacked;

	Charm() : num_slots( 0 ), custom( false ), optimal( false ), hacked( false ) {}
	Charm( Charm^ other );
	Charm( const unsigned num_slots );

	int GetSkillPointsFor( Ability^ a );
	bool StrictlyBetterThan( Charm^ other );
	bool BasicallyTheSameAs( Charm^ other );
	bool operator == ( Charm^ other );

	System::String^ GetName();
	unsigned GetHash();

	static unsigned HashFunction( const unsigned num_slots, const int a1, const int p1, const int a2, const int p2 );
	static unsigned HashFunction( const unsigned num_slots, Ability^ a1, const int p1, Ability^ a2, const int p2 );
	static void AddToOptimalList( List_t< Charm^ >% lst, Charm^ new_charm );
};

//by first skill
int CompareCharms1( Charm^ a, Charm^ b );
int CompareCharms1Alphabetically( Charm^ a, Charm^ b );

//by second skill, if any
int CompareCharms2( Charm^ a, Charm^ b );
int CompareCharms2Alphabetically( Charm^ a, Charm^ b );