利用堆栈方式对grid进行行排序的具体操作

最新推荐文章于 2024-07-22 08:55:10 发布

happywinds

最新推荐文章于 2024-07-22 08:55:10 发布

阅读量1.2k

点赞数

文章标签： javascript function null border table email

本文链接：https://blog.csdn.net/happywinds/article/details/338505

版权

<html>
<head>
<meta http-equiv="Content-type" content="text/html; charset=gb2312">
<title> 利用堆栈方式对grid进行行排序的具体操作</title>
<style>
body,table
{
font-size:9pt;
}
.grid
{
border:1 solid #6666FF;
width:460;
}
.grid tr
{
cursor:hand;
}
.grid td
{
border:1 solid #6666FF;
}
</style>
<script language="javascript">
<!--
function select(tr)
{
if(grid.selectedTr!=null)
{
grid.selectedTr.style.backgroundColor="";
}

grid.selectedTr=tr;
tr.style.backgroundColor="#FFCC00";
}
function isselected()
{
if(grid.selectedTr==null)
  return false;

return true;
}
function push(s)
{
if(grid.stack==null)
  grid.stack=[];

grid.stack.push(s);
}
function pop()
{
if(grid.stack==null)
  return null;

return grid.stack.pop();
}
function movetop()
{
if(!isselected()) return;

var s=[];
s.push(grid.selectedTr.rowIndex);
s.push(0);
push(s);

grid.moveRow(grid.selectedTr.rowIndex, 0);
}
function moveup()
{
if(!isselected()) return;

var s=[];
s.push(grid.selectedTr.rowIndex);
s.push(Math.max(grid.selectedTr.rowIndex-1,0));
push(s);

grid.moveRow(grid.selectedTr.rowIndex, Math.max(grid.selectedTr.rowIndex-1,0));
}
function movedown()
{
if(!isselected()) return;

var s=[];
s.push(grid.selectedTr.rowIndex);
s.push(Math.min(grid.selectedTr.rowIndex+1,grid.rows.length-1));
push(s);

grid.moveRow(grid.selectedTr.rowIndex, Math.min(grid.selectedTr.rowIndex+1,grid.rows.length-1));
}
function movebottom()
{
if(!isselected()) return;

var s=[];
s.push(grid.selectedTr.rowIndex);
s.push(grid.rows.length-1);
push(s);

grid.moveRow(grid.selectedTr.rowIndex, grid.rows.length-1);
}
function cancelmove()
{
if(grid.stack==null || grid.stack.length==0)
  return;

var s=pop();
if(s!=null)
{
  select(grid.rows[s[1]]);
  grid.moveRow(s[1],s[0]);
}
}
function cancelall()
{
if(grid.stack!=null && grid.stack.length>0)
{
  cancelmove();
  window.setTimeout(cancelall, 2000);
}
else if(grid.stack!=null)
{
  alert("over!!!");
}
}
//-->
</script>
</head>

<body>
<table id="grid" class="grid">
<tr οnclick="select(this);">
  <td>1</td>
  <td>Lonsan21@163.com</td>
  <td>蓝山</td>
  <td>Asp.Net</td>
  <td>JS</td>
</tr>
<tr οnclick="select(this);">
  <td>2</td>
  <td>Lonsan21@163.com</td>
  <td>蓝山</td>
  <td>Asp.Net</td>
  <td>JS</td>
</tr>
<tr οnclick="select(this);">
  <td>3</td>
  <td>Lonsan21@163.com</td>
  <td>蓝山</td>
  <td>Asp.Net</td>
  <td>JS</td>
</tr>
<tr οnclick="select(this);">
  <td>4</td>
  <td>Lonsan21@163.com</td>
  <td>蓝山</td>
  <td>Asp.Net</td>
  <td>JS</td>
</tr>
<tr οnclick="select(this);">
  <td>5</td>
  <td>Lonsan21@163.com</td>
  <td>蓝山</td>
  <td>Asp.Net</td>
  <td>JS</td>
</tr>
<tr οnclick="select(this);">
  <td>6</td>
  <td>Lonsan21@163.com</td>
  <td>蓝山</td>
  <td>Asp.Net</td>
  <td>JS</td>
</tr>
</table>
<br>
<a href="javascript:movetop();">Top</a>
<a href="javascript:moveup();">Up</a>
<a href="javascript:movedown();">Down</a>
<a href="javascript:movebottom();">Bottom</a>
      
<a href="javascript:cancelmove();">Cancel</a>
<a href="javascript:cancelall();">CancelAll</a>
</body>
</html>

happywinds

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
利用堆栈方式对grid进行行排序的具体操作

all rights by Lonsan on 2005 email:Lonsan21@163.com--> 利用堆栈方式对grid进行行排序的具体操作body,table{ font-size:9pt;}.grid{ border:1 solid #6666FF; width:460;}.grid tr{ cursor:hand;}.grid td{ border:1 solid #6666F
复制链接

扫一扫