void BranchSearch(GameState *gs, int player, int x, int y, PieceColor color, std::vector<Piece*> &involved, std::vector<Piece*> &touched)
{
if(x<0 || y<0 || y >= gs->board[player].height_in_pieces || x >= gs->board[player].width_in_pieces)
return;
Piece *p = gs->board[player].b[x][y];
if(p == NULL)
return;
if(std::find(touched.begin(), touched.end(), p) != touched.end())
return;
else
touched.push_back(p);
if(p->color == color) {
involved.push_back(p);
}
else if(p->color == OJAMM){
involved.push_back(p);
return;
}
else{
return;
}
BranchSearch(gs,player,x,y-1,color,involved,touched);
BranchSearch(gs,player,x-1,y,color,involved,touched);
BranchSearch(gs,player,x+1,y,color,involved,touched);
BranchSearch(gs,player,x,y+1,color,involved,touched);
return;
}
bool CheckForCombos(GameState *gs, int player)
{
bool found = false;
for(unsigned x = 0; x < gs->board[player].width_in_pieces; x++){
for(unsigned y = 0; y < gs->board[player].height_in_pieces; y++){
Piece *piece = gs->board[player].b[x][y];
if(piece == NULL)
continue;
std::vector<Piece*> involved;
std::vector<Piece*> touched;
BranchSearch(gs, player, x, y, piece->color, involved, touched);
int ojamms_amongst_them = 0;
if(involved.size() >= 4) // C-C-C-C-COMBO!
{
for(unsigned o_search = 0; o_search < involved.size(); o_search++)
{
if(involved[o_search]->color == OJAMM)
ojamms_amongst_them++;
}
if(involved.size() - ojamms_amongst_them < 4)
goto no_chain;
for(unsigned i = 0; i < involved.size(); i++){
if(involved[i]){
int x1 = involved[i]->x;
int y1 = involved[i]->y;
/* Generate particles. */
int particle_count = 4;
for(unsigned pi = 0; pi < particle_count; pi++)
{
int px = gs->board[player].x_offset + (x1 * gs->board[player].piece_width) + (player * gs->board[player].width_in_px);
int py = gs->board[player].y_offset + (y1 * gs->board[player].piece_height);
int pxvel = rand()%15+5 * (rand()%2) * -1;
int pyvel = rand()%15+5 * (rand()%2) * -1;
Particle pc = {0xFFFFFFFF, SDL_GetTicks(), 500, px, py, pxvel, pyvel};
gs->particles.push_back(pc);
}
delete involved[i];
gs->board[player].b[x1][y1] = NULL;
}
}
int ojamms = 0;
switch(involved.size()){
case 4:
ojamms = 1;
break;
case 5:
ojamms = 3;
break;
case 6:
ojamms = 5;
break;
case 7:
ojamms = 6;
break;
default:
ojamms = 1;
break;
}
/* OJAMMS, AHOY! */
if(gs->board[player].ojamms_pending - ojamms <= 0)
gs->board[player].ojamms_pending = 0;
else
gs->board[player].ojamms_pending -= ojamms;
gs->board[getnext(player,gs->player_count)].ojamms_pending += ojamms;
if(mixer_on)
Mix_PlayChannel(-1, gs->chain, 0);
found = true;
}
no_chain:;
}
}
return found;
}
int BPA_DYNAMICMODELINFO::Net_ReadBPALine(char*tFileName)
{
char Line[_MaxBPALineLen_];
char(*LineST)[_MaxBPALineLen_]; int *IsRead = NULL; int *IsChange = NULL;
int i, j, flag, LineTotal = 0;//增加该功能，支持一行读到尾，并舍弃
//第一步，将文件读入到LineST数组中
FILE* fpPFfile;
fpPFfile = fopen(tFileName, "rb");
if (fpPFfile == NULL)
return 0;
while (fgets(Line, _MaxBPALineLen_, fpPFfile))
LineTotal++;
rewind(fpPFfile);
MallocCharArray(LineST, (LineTotal + 4), _MaxBPALineLen_);
i = 0;
int flagAddLine = 0;
while (fgets(Line, _MaxBPALineLen_, fpPFfile))
{
if (flagAddLine == 1)
{
if (strlen(Line) < _MaxBPALineLen_ - 1)
flagAddLine = 0;
continue;
}
if (strlen(Line) >= _MaxBPALineLen_ - 1)
{
if (Line[_MaxBPALineLen_ - 2] != 10 && Line[_MaxBPALineLen_ - 2] != 13)
{//这里考虑到有些刚好_MaxBPALineLen_-2个字符的行
flagAddLine = 1;//表示该行还未读完
}
}
if (strlen(Line) > 3 && Line[0] == '(' && Line[1] == 'E' && Line[2] == 'N' && Line[3] == 'D')
break;//终止符(END)
if (strlen(Line) > 3 && Line[0] == '/' && (Line[1] == 'M' && Line[2] == 'V' && Line[3] == 'A'
|| Line[1] == ' ' && Line[2] == 'M' && Line[3] == 'V' && Line[4] == 'A'))
{//读入"/MVA_BASE = 1000\"卡//problem此处还存在问题
char *ex;
if ((ex = strrchr(Line, '=')) != NULL)
{
SetBMVA((float)atof(++ex));
}
}
if (strlen(Line) == 0
|| Line[0] == '-'
|| Line[0] == 'C' || Line[0] == 'H' || Line[0] == '.' || Line[0] == ' '//注释 空行
|| Line[0] == '(' || Line[0] == '[' || Line[0] == '/' || Line[0] == '\\' || Line[0] == '>'//控制命令
|| Line[0] == 10 || Line[0] == 13)//换行符 回车符
continue;
strncpy(LineST[i], Line, _MaxBPALineLen_);
i++;
}
fclose(fpPFfile);
LineTotal = i;
MallocNew(IsRead, int, LineTotal); memset(IsRead, 0, LineTotal*sizeof(int));
MallocNew(IsChange, int, LineTotal); memset(IsChange, 0, LineTotal*sizeof(int));
for (i = 0; i < LineTotal; i++)
{
if (LineST[i][2] == 'D' || LineST[i][2] == 'A' || LineST[i][2] == 'R')
{
IsChange[i] = 1;
}
if (LineST[i][0] == 'P' || LineST[i][0] == 'Z' || LineST[i][0] == 'D')
{
IsChange[i] = 1;
}
}
//读入数据
BPABUS *tempBus;
BPABRANCH *tempBranchBase;
for (i = 0; i < LineTotal; i++)
//for (i = LineTotal-1; i >=0; i--)
{
if (IsRead[i] != 0)continue;
if (IsChange[i] != 0)continue;//这里输入的是常规数据，不包含修改卡
flag = 0;
switch (LineST[i][0])
{
case 'A':
flag = Area_ReadBPALine(LineST[i]);
break;
case 'B':
tempBus = new BPABUS();
flag = tempBus->ReadLine(LineST[i]);
if (flag != 1)
{
delete tempBus;
flag = 0;
}
else{
flag = cpGetBusInfo()->AddNewBus(tempBus);
if (flag < 0)
{
delete tempBus;
flag = 0;
}
else{
BPABus[flag] = tempBus;
flag = 1;
}
}
break;
case 'L':
if (LineST[i][1] == '+')
break;//跳过L+卡
if (LineST[i][1] == ' ')
{
tempBranchBase = new LBRANCH();
flag = tempBranchBase->ReadLine(LineST[i]);
if (flag != 1)
{
delete tempBranchBase;
flag = 0;
}
else{
flag = cpGetBranchInfo()->AddNewBranch(tempBranchBase);
if (flag < 0)
{
delete tempBranchBase;
flag = 0;
}
else{
BPABranch[flag] = tempBranchBase;
flag = 1;
}
}
}
break;
case 'E':
tempBranchBase = new EBRANCH();
flag = tempBranchBase->ReadLine(LineST[i]);
if (flag != 1)
{
delete tempBranchBase;
flag = 0;
}
else{
flag = cpGetBranchInfo()->AddNewBranch(tempBranchBase);
if (flag < 0)
{
delete tempBranchBase;
flag = 0;
}
else
flag = 1;
}
break;
case 'T':
if (LineST[i][1] == 'P')
tempBranchBase = new TPBRANCH();
else
tempBranchBase = new TBRANCH();
flag = tempBranchBase->ReadLine(LineST[i]);
if (flag != 1)
{
delete tempBranchBase;
flag = 0;
}
else{
flag = cpGetBranchInfo()->AddNewBranch(tempBranchBase);
if (flag < 0)
{
delete tempBranchBase;
flag = 0;
}
else
flag = 1;
}
break;
}
if (flag == 1)IsRead[i] = 1;
}
SortBusByName tSort(this);
tSort.QikSort(iGetBusTotal());
cpGetBusInfo()->ResetHashTable();
NetLink();
char Name1[_MaxNameLen], Name2[_MaxNameLen], BranchName[_MaxNameLen], ID;
float BaseKv1, BaseKv2;
char CID[2];
int BusIndex, BranchIndex;
char Zone[_MaxNameLen]; int tZoneNo; float LoadPper, LoadQper, GenPper, GenQper;
for (i = 0; i < LineTotal; i++)
{
if (IsRead[i] != 0)continue;
//if(IsChange[i]!=1)continue;
flag = 0;
switch (LineST[i][0])
{
case '+':
GetItemFromLine(LineST[i], Name1, PLUS_Para[1], PLUS_Loca[1]); ReplaceName(Name1, _MaxNameLen);
GetItemFromLine(LineST[i], (void*)(&BaseKv1), PLUS_Para[2], PLUS_Loca[2]);
BusIndex = BPABusSearch(Name1, BaseKv1);
if (BusIndex < 0)
{
sprintf(ErrorMessage[0], "找不到母线：%s", LineST[i]);
cpGetErrorInfo()->PrintWarning(1, 1);
break;
}
flag = cpGetBus(BusIndex)->ReadLine(LineST[i]);
break;
case 'L':
if (LineST[i][1] == '+')
{
GetItemFromLine(LineST[i], (void*)(Name1), LPLUS_Para[1], LPLUS_Loca[1]);
GetItemFromLine(LineST[i], (void*)(&BaseKv1), LPLUS_Para[2], LPLUS_Loca[2]);
GetItemFromLine(LineST[i], (void*)(Name2), LPLUS_Para[4], LPLUS_Loca[4]);
GetItemFromLine(LineST[i], (void*)(&BaseKv2), LPLUS_Para[5], LPLUS_Loca[5]);
GetItemFromLine(LineST[i], (void*)(&CID), LPLUS_Para[6], LPLUS_Loca[6]);
ID = CID[0];
GenerateBPABranchName(BranchName, Name1, BaseKv1, Name2, BaseKv2, ID);
BranchIndex = BranchSearch(BranchName);
if (BranchIndex < 0)
{
sprintf(ErrorMessage[0], "找不到线路：%s", LineST[i]);
cpGetErrorInfo()->PrintWarning(1, 1);
break;
}
flag = cpGetBranch(BranchIndex)->ReadLine(LineST[i]);
}
break;
case 'P':
if (LineST[i][1] == 'Z')
{
GetItemFromLine(LineST[i], Zone, PZ_Para[0], PZ_Loca[0]); ReplaceName(Zone, _MaxNameLen);
GetItemFromLine(LineST[i], &LoadPper, PZ_Para[1], PZ_Loca[1]);
GetItemFromLine(LineST[i], &LoadQper, PZ_Para[2], PZ_Loca[2]);
GetItemFromLine(LineST[i], &GenPper, PZ_Para[3], PZ_Loca[3]);
GetItemFromLine(LineST[i], &GenQper, PZ_Para[4], PZ_Loca[4]);
if (fabs(GenPper - 1.0) > 0.0001 || fabs(GenQper - 1.0) > 0.0001
|| LoadPper<-0.0001 || LoadPper>1.0001
|| LoadQper<-0.0001 || LoadQper>1.0001)
{
flag = 0;
break;
}
if (fabs(GenPper) < 0.0001)GenPper = 1.f;
if (fabs(GenQper) < 0.0001)GenQper = 1.f;
if (fabs(GenPper - 1.0) > 0.0001 || fabs(GenQper - 1.0) > 0.0001
|| LoadPper < -0.0001 || LoadQper < -0.0001)
{
sprintf(ErrorMessage[0], "PZ卡目前无法处理发电机的修改，忽略卡片：%s", LineST[i]);
cpGetErrorInfo()->PrintWarning(1, 1);
flag = 0;
break;
}
tZoneNo = cpGetAreaInfo()->iGetZoneNo(Zone);
if (tZoneNo < 0)
{
sprintf(ErrorMessage[0], "找不到区域名%s, 忽略卡片: %s", Zone, LineST[i]);
cpGetErrorInfo()->PrintWarning(-1, 1);
flag = 1;
break;
}
for (j = 0; j < iGetBusTotal(); j++)
{
if (cpGetBus(j)->ZoneNo == tZoneNo)
{
if (cpGetBus(j)->cBusType == 'B')
{
((BPABUS*)cpGetBus(j))->m_fBusPLoadPer = LoadPper;
((BPABUS*)cpGetBus(j))->m_fBusQLoadPer = LoadQper;
}
}
}
flag = 1;
}
break;
}
if (flag == 1)IsRead[i] = 1;
}
#ifdef _DEBUG
for (i = 0; i < LineTotal; i++)
{
if (IsRead[i]>0)continue;
sprintf(ErrorMessage[0], " 不能识别的数据卡：%s", LineST[i]);
cpGetErrorInfo()->PrintWarning(8, 1);
}
#endif
free(LineST); FreeArray(IsRead); FreeArray(IsChange);
//cpGetErrorInfo()->CheckMessageType(8);//查看未识别卡片数
cpGetErrorInfo()->CheckMessageType(1);//查看错误数据数
cpGetErrorInfo()->CheckMessageType(6);//检查越限错误
m_ChangeCode++;
NetLink();
return 1;
}
