LoadRunner关联的高级应用

Action()
{
int array_len ,i=1;
char array_name[20];

  //通过关联找出所有的省市的连接地址

web_reg_save_param("outFlightVal",
"LB=\"http:\/\/a.lietou.com\/",
"RB=.shtml\">",
"ORD=ALL",
LAST);
web_url("a.lietou.com",
"URL=http://a.lietou.com",
"Resource=0",
"RecContentType=text/html",
"Referer=",
"Snapshot=t25.inf",
"Mode=HTML",
EXTRARES,
LAST);

  //计算获取省市的个数,为下面的循环访问做准备

array_len=atoi(lr_eval_string("{outFlightVal_count}"));
lr_output_message("%d",array_len);
for (i=1;i<=array_len;i++) {

  //拼接省市请求url

sprintf(array_name,"{outFlightVal_%d}",i);
lr_output_message("%s",lr_eval_string(array_name));
lr_save_string(lr_eval_string(array_name),"shen");

  //关联获取title字段内容

web_reg_save_param("title",
"LB=<title>",
"RB=</title>",
"ORD=1",
LAST);

  //关联获取content字段内容

web_reg_save_param("content",
"LB=content=",
"RB=\/>\r\n",
"ORD=1",
LAST);
web_url("a.lietou.com",
"URL=http://a.lietou.com/{shen}.shtml",
"Resource=0",
"RecContentType=text/html",
"Referer=",
"Snapshot=t25.inf",
"Mode=HTML",
EXTRARES,
LAST);
}
return 0;
}

   



最新内容请见作者的GitHub页:http://qaseven.github.io/

   

上一篇:蓝桥杯 算法提高 日期计算


下一篇:《领域驱动设计:软件核心复杂性应对之道(修订版)》—第1章 1.3节持续学习