zoukankan      html  css  js  c++  java
  • 程序记录3(设置机器人2,新)

    std::vector<std::vector<ActorLevelInfo> > level_info_vec;
    i->load_level_info(level_info_vec);

    ActorLevelInfo levelInfo = {0};
    levelInfo = level_info_vec[0][1];

    //int userID = 10000;
    //int mapID = 1001;
    //for (int per = 0; per < 10; ++per)
    //{
    // for (int j = 0; j < 10000; ++j)
    // {
    // UserInfo uinfo = {0};
    // uinfo.userID = userID + j;
    // sprintf_s(uinfo.userName, MAX_NAME_LENGTH, "map%duser%04d", mapID, j);
    // strcpy(uinfo.userPwd, "123");
    // i->addUser_(uinfo);
    // if(j < 5000)
    // {
    // ActorInfo ainfo = {0};
    // ainfo.id = userID + uinfo.userID % userID * 2;
    // sprintf_s(ainfo.name, "map%dplayer%04d", mapID, j * 2);
    // ainfo.prof = Role_DS;
    // ainfo.sex = DB::sex::MAN;
    // i->addActor_(uinfo.userID, ainfo, levelInfo);

    // memset(&ainfo, 0, sizeof(ActorInfo));
    // ainfo.id = userID + uinfo.userID % userID * 2 + 1;
    // sprintf_s(ainfo.name, "map%dplayer%04d", mapID, j * 2 + 1);
    // ainfo.prof = Role_DS;
    // ainfo.sex = DB::sex::MAN;
    // i->addActor_(uinfo.userID, ainfo, levelInfo);
    // }
    // }
    // userID += 10000;
    // mapID++;
    //}

    //设置MapID
    int actidStart = 10000;
    int mapID = 1001;
    for (int per = 0; per < 10; ++per)
    {
    for (int j = actidStart; j < actidStart + 10000; ++j)
    {
    i->setActorMap(j, mapID);
    }
    actidStart += 10000;
    mapID++;
    }

    1:修改机器人
    2:修改递增器
    3:加索引
    4:加入用户

  • 相关阅读:
    js 数组详解(javascript array)
    CentOS 修改IP地址, DNS, 网关
    Leetcode 652.寻找重复的子树
    Leetcode 650.只有两个键的键盘
    Leetcode 649.Dota2参议院
    Leetcode 648.单词替换
    Leetcode 647.回文子串
    Leetcode 645.最长数对链
    Leetcode 643.子数组最大平均数I
    Leetcode 640.求解方程
  • 原文地址:https://www.cnblogs.com/zzyoucan/p/3728730.html
Copyright © 2011-2022 走看看