日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

js 排序

發布時間:2025/4/16 编程问答 42 豆豆
生活随笔 收集整理的這篇文章主要介紹了 js 排序 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

html代碼:

<th class="sork" id="totalSork" οnclick="clickSork(0, $(this))">當日接入數據總量&nbsp;<img src="~/Images/descending.png" style="width:25px;" /></th>
<th class="sork" id="overSork" οnclick="clickSork(2, $(this))">當日超限數據量&nbsp;<img src="~/Images/descending.png" style="width:25px;" /></th>
<th class="sork" id="timeSork" οnclick="clickSork(4, $(this))">上一次接入數據時間&nbsp;<img src="~/Images/descending.png" style="width:25px;" /></th>

js代碼:

給你所要排序的字段賦值:

var total = [], acTime = [], over = [],dataSork = 0;

function chart(){//賦值方法

$.ajax({

url: "/aa/QueryData",
data: {
pageIndex: pageIndex,
sork: dataSork//排序參數
},
type: "POST",
dataType: "JSON",
beforeSend: function () {
layer.load(1, {
offset: ['50%', "50%"], shade: false
});
},
success: function (data) {

?showloading(false);

??total = [], acTime = [], over = [];

if (data.infoList.length > 0) {
for (var i = 0; i < data.infoList.length; i++) {

total.push(data.infoList[i].totalCarNum);
over.push(data.infoList[i].overCarNum);
acTime.push(data.infoList[i].dcAcceptTime);

}

}

}

})

}

排序方法:

?List<OverCaseData> listdata = new List<OverCaseData>();

//排序
function clickSork(val, e) {
if (!isSork) {
isSork = true;
if (e.children()[0].src.indexOf('descending_pitch') > 0) {
e.children()[0].src = "../Images/ascending_pitch.png";
dataSork = val + 1;
}
else if (e.children()[0].src.indexOf('descending') > 0) {
e.children()[0].src = "../Images/descending_pitch.png";
dataSork = val;
}
else {
e.children()[0].src = "../Images/descending_pitch.png";
dataSork = val;
}
var sork = document.getElementsByClassName("sork");
for (var i = 0; i < sork.length; i++) {
if (sork[i].id != e[0].id) {
sork[i].children[0].src = "../Images/descending.png";
}
}
chart(0, 1);//刷新
}
else {
layer.msg('請稍后再試...');
}
}

后臺代碼:

switch (param.Sork)
{
case 1://過車總數升序
listdata = dataList.OrderBy(v => v.totalCarNum).ToList();
break;
case 2://超限總數升序
listdata = dataList.OrderBy(v => v.overCarNum).ToList();
break;
case 3://超限總數降序
listdata = dataList.OrderByDescending(v => v.overCarNum).ToList();
break;
case 4://接收時間升序
listdata = dataList.OrderBy(v => v.dcAcceptTime).ToList();
break;
case 5://接收時間降序
listdata = dataList.OrderByDescending(v => v.dcAcceptTime).ToList();
break;
default:
listdata = dataList.OrderByDescending(v => v.totalCarNum).ThenByDescending(v => v.overCarNum).ThenByDescending(v => v.dcAcceptTime).ThenByDescending(v => v.timeState).ThenByDescending(v => v.onLineTime).ThenByDescending(v => v.offLineTime).ToList();
break;
}

轉載于:https://www.cnblogs.com/-lile/p/11262675.html

總結

以上是生活随笔為你收集整理的js 排序的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。