📄 npc_manorsman.c
字号:
fmpks[fmpks_pos+1].dueltime = CHAR_getWorkInt(meindex, NPC_WORK_PEACEWAIT) + NowTime.tv_sec;
fmpks[fmpks_pos+1].flag = FMPKS_FLAG_NONE;
NPC_CleanPkList( fmpks_pos);
#ifndef _NEW_MANOR_LAW
NPC_ManorSavePKSchedule(meindex, -1, FMPKS_FLAG_NONE);
#else
NPC_ManorSavePKSchedule(meindex, -1, FMPKS_FLAG_NONE,fmpks[fmpks_pos+1].dueltime,tm1);
#endif
break;
}
CHAR_setWorkInt(meindex, NPC_WORK_PREVLOOPTIME, NowTime.tv_sec);
}
void NPC_ManorLoadPKSchedule(int meindex)
{
#ifdef _ACFMPK_LIST
int fmpks_pos = CHAR_getWorkInt(meindex, NPC_WORK_ID);
saacproto_ACLoadFmPk_send(acfd, fmpks_pos);
#else
char filename[256], tmp[4096], token[256];
FILE *f;
int fmpks_pos = CHAR_getWorkInt(meindex, NPC_WORK_ID)*MAX_SCHEDULE;
snprintf(filename,sizeof(filename), "%s%d_%d_%d",
SCHEDULEFILEDIR, CHAR_getInt(meindex, CHAR_FLOOR),
CHAR_getInt(meindex, CHAR_X),
CHAR_getInt(meindex, CHAR_Y) );
if( ! (f=fopen( filename, "r" )) ){ // create new schedule file
f = fopen( filename, "w" );
if( !f ){
print( "ERROR:Can't create Schedule file %s!\n",filename );
return;
}
strcpy(tmp,"0|-1|-1|-1|-1|-1|-1|-1|-1\n");
fwrite(tmp, strlen(tmp), 1, f);
}
fseek(f, 0, SEEK_SET); // 档案开头
fgets(tmp, sizeof(tmp), f);
fmpks[fmpks_pos].flag=-1;
// 时间
if (getStringFromIndexWithDelim(tmp,"|",1,token,sizeof(token))) {
fmpks[fmpks_pos+1].dueltime=atoi(token);
}
// 主队 familyindex
if (getStringFromIndexWithDelim(tmp,"|",2,token,sizeof(token))) {
fmpks[fmpks_pos+1].host_index=atoi(token);
}
// 主队 家族名
if (getStringFromIndexWithDelim(tmp,"|",3,token,sizeof(token))) {
strcpy(fmpks[fmpks_pos+1].host_name,makeStringFromEscaped(token));
}
// 客队 familyindex
if (getStringFromIndexWithDelim(tmp,"|",4,token,sizeof(token))) {
fmpks[fmpks_pos+1].guest_index=atoi(token);
}
// 客队 家族名
if (getStringFromIndexWithDelim(tmp,"|",5,token,sizeof(token))) {
strcpy(fmpks[fmpks_pos+1].guest_name,makeStringFromEscaped(token));
}
// 准备时间
if (getStringFromIndexWithDelim(tmp,"|",6,token,sizeof(token))) {
fmpks[fmpks_pos+1].prepare_time=atoi(token);
}
// 最大人数
if (getStringFromIndexWithDelim(tmp,"|",7,token,sizeof(token))) {
fmpks[fmpks_pos+1].max_player=atoi(token);
}
// 旗标
if (getStringFromIndexWithDelim(tmp,"|",8,token,sizeof(token))) {
fmpks[fmpks_pos+1].flag=atoi(token);
}
// 对战星球
if (getStringFromIndexWithDelim(tmp,"|",9,token,sizeof(token))) {
strcpy(fmpks[fmpks_pos+2].host_name,makeStringFromEscaped(token));
}
// no schedule
fmpks[fmpks_pos].flag=-1;
// prepare time expired?
if ((fmpks[fmpks_pos+1].flag==FMPKS_FLAG_MANOR_PREPARE) &&
(fmpks[fmpks_pos+1].dueltime<NowTime.tv_sec)) {
fmpks[fmpks_pos].flag=-1;
// Terry fix 要清为-1不能清为0
// fmpks[fmpks_pos].host_index=0;
fmpks[fmpks_pos].host_index=-1;
strcpy(fmpks[fmpks_pos].host_name,"");
// Terry fix 要清为-1不能清为0
// fmpks[fmpks_pos].guest_index=0;
fmpks[fmpks_pos].guest_index=-1;
strcpy(fmpks[fmpks_pos].guest_name,"");
fmpks[fmpks_pos+1].flag=-1;
fmpks[fmpks_pos+1].dueltime=0;
// fmpks[fmpks_pos+1].dueltime=NowTime.tv_sec+30*60; // add more 30 minutes
}
fclose(f);
#endif // end AC_SEND_FM_PK
}
#ifdef _ACFMPK_LIST
#ifndef _NEW_MANOR_LAW
void NPC_ManorSavePKSchedule(int meindex, int toindex, int flg)
#else
void NPC_ManorSavePKSchedule(int meindex, int toindex, int flg,int setTime,struct tm tm2)
#endif
{
int fmpks_pos, manorid, dueltime;
char msg[1024], n1[256], n2[256], n3[256];
char token[256], hadfmname[256];
int hadfmindex=0, hadfmpopular=0, tkfmindex=0;
int PkFlg=0;
if( toindex == -1 ){
#ifndef _NEW_MANOR_LAW
dueltime = CHAR_getWorkInt(meindex, NPC_WORK_PEACEWAIT) + NowTime.tv_sec;
sprintf(msg, "%d|%d|%s|%d|%s|%d|%d|%d|%s",
dueltime, 0, "", 0, "", 0, 0, flg, "");
#else
sprintf(msg, "%d|%d|%s|%d|%s|%d|%d|%d|%s",
setTime, 0, "", 0, "", 0, 0, flg, "");
#endif
PkFlg = 0;
}else{
struct tm tm1;
int index;
#ifndef _NEW_MANOR_LAW
tkfmindex = CHAR_getWorkInt(toindex, CHAR_WORKFMINDEXI);
#else
// toindex 变成 家族的index
tkfmindex = toindex;
#endif
fmpks_pos = CHAR_getWorkInt(meindex, NPC_WORK_ID) * MAX_SCHEDULE;
manorid = CHAR_getWorkInt(meindex, NPC_WORK_MANORID);
memcpy( &tm1, localtime( (time_t *)&NowTime.tv_sec), sizeof( tm1));
#ifndef _NEW_MANOR_LAW
dueltime = CHAR_getWorkInt(meindex, NPC_WORK_CHALLENGEWAIT) + NowTime.tv_sec - tm1.tm_min*60 + 1800;
#else
// 以挑战时的时间为开打的时间,中间所经过的时间为准备时间
dueltime = NowTime.tv_sec - tm1.tm_min * 60 + ((24 - tm1.tm_hour) * 3600) + 3600 * tm2.tm_hour;
// |-------------取整点-------------| |--------加到0000时-------| |挑战时的时间(算整点)|
#endif
getStringFromIndexWithDelim( fmpointlist.pointlistarray[manorid-1], "|", 5, token, sizeof(token));
hadfmindex = atoi( token);
getStringFromIndexWithDelim( fmpointlist.pointlistarray[manorid-1], "|", 7, token, sizeof(token));
hadfmpopular = atoi( token);
getStringFromIndexWithDelim( fmpointlist.pointlistarray[manorid-1], "|", 6, token, sizeof(token));
strcpy( hadfmname, token);
makeEscapeString( hadfmname, n1, sizeof(n1));
#ifndef _NEW_MANOR_LAW
makeEscapeString( CHAR_getChar(toindex, CHAR_FMNAME), n2, sizeof(n2));
#else
// 找出挑战家族中气势最高家族索引
index = ManorSchedule[manorid-1].iSort[0];
makeEscapeString(ManorSchedule[manorid-1].szFmName[index],n2,sizeof(n2));
#endif
makeEscapeString( getGameserverID(), n3, sizeof(n3));
sprintf(msg, "%d|%d|%s|%d|%s|%d|%d|%d|%s",
dueltime, hadfmindex-1, n1, tkfmindex, n2, 15, 50, FMPKS_FLAG_MANOR_OTHERPLANET, n3);
PkFlg = 1;
{
char buf1[256];
sprintf( buf1,"%d", CHAR_getWorkInt( meindex, NPC_WORK_ID) );
Logfmpk(
n1, hadfmindex-1, 0,
n2, tkfmindex, 0,
"", buf1, n3, 1);
}
}
#ifndef _NEW_MANOR_LAW
saacproto_ACSendFmPk_send( acfd, toindex, PkFlg, CHAR_getWorkInt( meindex, NPC_WORK_ID), msg);
#else
// toindex 用不到设为 -1
saacproto_ACSendFmPk_send( acfd, -1, PkFlg, CHAR_getWorkInt( meindex, NPC_WORK_ID), msg);
#endif
}
#endif
#ifdef _NEW_MANOR_LAW
// 加入挑战排程
void NPC_ManorAddToSchedule(int meindex,int charaindex)
{
int i,j,iEmpty = -1,iFmIndex,manorindex = CHAR_getWorkInt(meindex,NPC_WORK_MANORID) - 1;
struct tm tm1;
iFmIndex = CHAR_getWorkInt(charaindex,CHAR_WORKFMINDEXI);
// 检查是否已排入排程,检查所有的庄园约战
for(j=0;j<MANORNUM;j++){
for(i=0;i<10;i++){
if(ManorSchedule[j].iFmIndex[i] != -1){
if(ManorSchedule[j].iFmIndex[i] == iFmIndex){
lssproto_WN_send(getfdFromCharaIndex(charaindex),WINDOW_MESSAGETYPE_MESSAGE,WINDOW_BUTTONTYPE_OK,CHAR_WINDOWTYPE_CHECKMAN_END,
CHAR_getWorkInt(meindex, CHAR_WORKOBJINDEX),"你已经报名过挑战庄园了喔～");
return;
}
}
else{
if(j == manorindex) iEmpty = i; // 记录空的位置
}
}
}
// 如果程式执行到这里,表示没有加入排程,检查有没有空的位置
if(iEmpty != -1){ // 有空位置,把报名者加入
// 记录家族索引
ManorSchedule[manorindex].iFmIndex[iEmpty] = iFmIndex;
// 记录家族名称
sprintf(ManorSchedule[manorindex].szFmName[iEmpty],"%s",CHAR_getChar(charaindex,CHAR_FMNAME));
// 记录挑战时间
memcpy(&tm1,localtime((time_t *)&NowTime.tv_sec),sizeof(tm1));
memset(ManorSchedule[manorindex].szMemo[iEmpty],0,sizeof(ManorSchedule[manorindex].szMemo[iEmpty]));
memcpy(&ManorSchedule[manorindex].tm1[iEmpty],&tm1,sizeof(tm1));
lssproto_WN_send(getfdFromCharaIndex(charaindex),WINDOW_MESSAGETYPE_MESSAGE,WINDOW_BUTTONTYPE_OK,CHAR_WINDOWTYPE_CHECKMAN_END,
CHAR_getWorkInt(meindex, CHAR_WORKOBJINDEX),"加入挑战排程");
}
// 满了,和挑战排程的最後一名作比较,如果後来的气势比最後一名高,替换掉最後一名,否则通知目前气势无法挤进排程
else{
// 取得最後一名在ManorSchedule的位置
int index = ManorSchedule[manorindex].iSort[9];
for(i=0;i<FAMILY_MAXNUM;i++){
// 找出挑战家族的索引
if(fmdptop.fmtopid[i] == iFmIndex) break;
}
// 找不到此家族
if(i >= FAMILY_MAXNUM){
lssproto_WN_send(getfdFromCharaIndex(charaindex),WINDOW_MESSAGETYPE_MESSAGE,WINDOW_BUTTONTYPE_OK,CHAR_WINDOWTYPE_CHECKMAN_END,
CHAR_getWorkInt(meindex, CHAR_WORKOBJINDEX),"抱歉，找不到你的家族气势资料");
return;
}
// 比较气势
if(ManorSchedule[manorindex].iFmMomentum[index] < fmdptop.fmMomentum[i]){
int fmpks_pos,iPlayerNum = CHAR_getPlayerMaxNum();
char szMsg[256];
// 通知所有人
fmpks_pos = CHAR_getWorkInt(meindex,NPC_WORK_ID) * MAX_SCHEDULE;
sprintf(szMsg,"%s 家族被 %s 家族挤下挑战排程",ManorSchedule[manorindex].szFmName[index],CHAR_getChar(charaindex,CHAR_FMNAME));
for(i=0;i<iPlayerNum;i++){
if(CHAR_getCharUse(i) != FALSE){
CHAR_talkToCli(i,-1,szMsg,CHAR_COLORBLUE2);
}
}
// 最後一名被挤掉
ManorSchedule[manorindex].iFmIndex[index] = iFmIndex;
// 记录家族名称
sprintf(ManorSchedule[manorindex].szFmName[index],"%s",CHAR_getChar(charaindex,CHAR_FMNAME));
// 记录挑战时间
memcpy(&tm1,localtime((time_t *)&NowTime.tv_sec),sizeof(tm1));
memcpy(&ManorSchedule[manorindex].tm1[index],&tm1,sizeof(tm1));
lssproto_WN_send(getfdFromCharaIndex(charaindex),WINDOW_MESSAGETYPE_MESSAGE,WINDOW_BUTTONTYPE_OK,CHAR_WINDOWTYPE_CHECKMAN_END,
CHAR_getWorkInt(meindex, CHAR_WORKOBJINDEX),"加入挑战排程");
}
else{
lssproto_WN_send(getfdFromCharaIndex(charaindex),WINDOW_MESSAGETYPE_MESSAGE,WINDOW_BUTTONTYPE_OK,CHAR_WINDOWTYPE_CHECKMAN_END,
CHAR_getWorkInt(meindex, CHAR_WORKOBJINDEX),"抱歉，你的家族气势不足以排进挑战排程");
return;
}
}
// 排序
SortManorSchedule();
}
// 排序挑战排程
void SortManorSchedule()
{
int i,j,k;
// 先取得最新家族气势
for(k=0;k<MANORNUM;k++){
for(i=0;i<10;i++){
ManorSchedule[k].iSort[i] = i;
if(ManorSchedule[k].iFmIndex[i] != -1){
for(j=0;j<FAMILY_MAXNUM;j++){
// 找出挑战家族的索引
if(fmdptop.fmtopid[j] == ManorSchedule[k].iFmIndex[i]){
// 取得气势值
ManorSchedule[k].iFmMomentum[i] = fmdptop.fmMomentum[j];
// 作成memo
sprintf(ManorSchedule[k].szMemo[i],"%-16s %2d:%2d %12d",
ManorSchedule[k].szFmName[i],ManorSchedule[k].tm1[i].tm_hour,ManorSchedule[k].tm1[i].tm_min,
ManorSchedule[k].iFmMomentum[i]/100);
break;
}
}
}
}
}
// 排序
for(i=0;i<MANORNUM;i++){
g_iSortManor = i;
qsort(&ManorSchedule[g_iSortManor].iSort,10,sizeof(int),&SortManorScheduleMomentum);
}
}
int SortManorScheduleMomentum(const void *indexa, const void *indexb)
{
int momentumA,momentumB;
momentumA = ManorSchedule[g_iSortManor].iFmMomentum[*(int*)indexa];
momentumB = ManorSchedule[g_iSortManor].iFmMomentum[*(int*)indexb];
return (momentumA > momentumB) ? -1:1;
}
#endif
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -