tuiliji/GenAlogrithm/relus/datadef_ruls.h

65 lines
1.1 KiB
C
Raw Normal View History

#pragma once
#include<iostream>
#include<math.h>
#include<string>
#include<list>
#include<vector>
#include<map>
#include <algorithm>
using namespace std;
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
struct Save_str;
typedef struct MAPing
{
MAPing(string n = "") :
value1(n)
{}
string value1;//<2F><><EFBFBD><EFBFBD>f() <20><>д;
list<Save_str> outmaping;
list<list<Save_str>> inmaping;
};
struct Save_str
{
string name;
MAPing* address;
};
struct Detail_in_out
{
string model;
string type;
vector<string> T_in;
vector<string> R_out;
map<string , vector<string>> R_C_out;
};
struct ALT_Classs
{
string name;
int num;
int num_model;
double DetectAbility; // ̽<><CCBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ
double AttackAbility; // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ
double SurAbility; // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ
double InterfereAbility; // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ
ALT_Classs() : name(""), num(0), num_model(0), DetectAbility(0), AttackAbility(0), SurAbility(0), InterfereAbility(0) {}
};
struct Individual1 {
int kj500, j16d, j20, wg2, gj11, h6k, j11, yg9, wuzhen10, kj2000;
double fitness;
Individual1() : kj500(0), j16d(0), j20(0), wg2(0), gj11(0), h6k(0), j11(0), yg9(0), wuzhen10(0), kj2000(0), fitness(0.0) {}
};