判断会员等级的一个本方法
2016-04-16 22:21
344 查看
//测试方法
function test(){
$data1 = M('point')->select();
$data2 = M('group')->order('point asc')->select();dump($data2);dump($data1);
foreach($data2 as $k=>$v){
$data2[$k]['n_point'] = $data2[$k+1]['point'];
}
$data2[count($data2)-1]['n_point'] = 100000000;
//dump($data1);
//dump($data2);
foreach($data1 as $k=>$v){
//dump($v);
foreach($data2 as $kk=>$vv){
if($data2[$kk]['point'] <= $data1[$k]['point'] && $data1[$k]['point'] < $data2[$kk]['n_point']){
$data1[$k]['group_name'] = $data2[$kk]['group_name'];
break;
}
}
}
dump($data1);
}
function test(){
$data1 = M('point')->select();
$data2 = M('group')->order('point asc')->select();dump($data2);dump($data1);
foreach($data2 as $k=>$v){
$data2[$k]['n_point'] = $data2[$k+1]['point'];
}
$data2[count($data2)-1]['n_point'] = 100000000;
//dump($data1);
//dump($data2);
foreach($data1 as $k=>$v){
//dump($v);
foreach($data2 as $kk=>$vv){
if($data2[$kk]['point'] <= $data1[$k]['point'] && $data1[$k]['point'] < $data2[$kk]['n_point']){
$data1[$k]['group_name'] = $data2[$kk]['group_name'];
break;
}
}
}
dump($data1);
}
相关文章推荐
- hadoop平台搭建(3)--hadoop安装、环境配置、单机运行
- 使用SPM(sql plan management,sql计划管理)
- Web安全漏洞
- hdu 1080(LCS变形)
- 出差(2~九)
- utf_8 和 GBK 不搭出现乱码(转)
- PHP配置限制文件大小上传
- 2.4-docker网络-容器互联
- day08软件系统体系结构和WEB资源和web服务器
- 2.3-docker网络-如何让外部网络访问容器资源
- 关于接口的实现和继承的问题
- Jersey(1.19.1) - WebApplicationException and Mapping Exceptions to Responses
- hdu 3397 线段树双标记
- org graphvize 编译 自动关闭*compilation* buffer
- Near Field Communication(nfc近场通信)——翻译自developer.android.com
- 新iOS系统如何允许加载HTTP链接
- hdu 3397 线段树双标记
- WebView的用法
- Animation制作动画组件效果
- 对时间的时分秒分别加上n