递归算法

if request("action")="del" then
id=""
idzu=request.QueryString("id")
idzu=Split(idzu,",")
for i=0 to Ubound(idzu)
ids=""
idn=idzu(i)
call lids(idn)
ids=idn&ids
rs.open "delete * from "&table&" where id in("&ids&")",conn,1,3
rs.open "delete * from "&tables&" where lid in("&ids&")",conn,1,3
rs.open "delete * from "&config&" where lid in("&ids&")",conn,1,3
next
response.Write "<script>window.location.href='?fenleiid="&fenleiid&"';</script>"
end if
'分类向上移动
if request("action")="midup" then
pid=Cint(request.QueryString("pid"))
lid=Cint(request.QueryString("lid"))
p=0
rs.open "select * from "&table&" where  lid="&lid&" order by pid asc",conn,1,3
do while not rs.eof
p=p+1
rsf.open "select * from "&table&" where  id="&rs("id")&"",conn,1,3
if p=pid-1 then
rsf("pid")=p+1
elseif p>1 and p=pid then
rsf("pid")=p-1
else
rsf("pid")=p
end if
rsf.update
rsf.close
rs.movenext
loop
rs.close
response.Write "<script>window.location.href='?fenleiid="&lid&"';</script>"
end if
'分类向下移动
if request("action")="middown" then
pid=Cint(request.QueryString("pid"))
lid=Cint(request.QueryString("lid"))
p=0
rs.open "select * from "&table&" where  lid="&lid&" order by pid asc",conn,1,1
zongshu=rs.recordcount
do while not rs.eof
p=p+1
rsf.open "select * from "&table&" where  id="&rs("id")&"",conn,1,3
if p=pid  and p<zongshu then
rsf("pid")=p+1
elseif  p=pid+1 then
rsf("pid")=p-1
else
rsf("pid")=p
end if
rsf.update
rsf.close
rs.movenext
loop
rs.close
response.Write "<script>window.location.href='?fenleiid="&lid&"';</script>"
end if

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值