修正排序有可能随机重排的问题
This commit is contained in:
parent
30291ac602
commit
b47ced3c62
@ -265,19 +265,25 @@
|
|||||||
var trs = table.find("tr:gt(0)");
|
var trs = table.find("tr:gt(0)");
|
||||||
var array = [];
|
var array = [];
|
||||||
for (var i = 0; i < trs.length; i += 3) {
|
for (var i = 0; i < trs.length; i += 3) {
|
||||||
array.push([trs.get(i), trs.get(i + 1), trs.get(i + 2)]);
|
var subArray = [trs.get(i), trs.get(i + 1), trs.get(i + 2)];
|
||||||
|
subArray.originalIndex = i;
|
||||||
|
array.push(subArray);
|
||||||
}
|
}
|
||||||
|
|
||||||
//排序
|
//排序
|
||||||
array.sort(function (x, y) {
|
array.sort(function (x, y) {
|
||||||
|
var offset = x.originalIndex - y.originalIndex;
|
||||||
|
|
||||||
var wx = parseInt(x[2].children[0].dataset.available) + parseInt(x[2].children[1].dataset.available);
|
var wx = parseInt(x[2].children[0].dataset.available) + parseInt(x[2].children[1].dataset.available);
|
||||||
if (isNaN(wx))
|
if (isNaN(wx))
|
||||||
return 0;
|
return offset;
|
||||||
var wy = parseInt(y[2].children[0].dataset.available) + parseInt(y[2].children[1].dataset.available);
|
var wy = parseInt(y[2].children[0].dataset.available) + parseInt(y[2].children[1].dataset.available);
|
||||||
if (isNaN(wy))
|
if (isNaN(wy))
|
||||||
return 0;
|
return offset;
|
||||||
|
|
||||||
return wy - wx;
|
if(wy !== wx)
|
||||||
|
return wy - wx;
|
||||||
|
return offset;
|
||||||
});
|
});
|
||||||
|
|
||||||
var df = document.createDocumentFragment();
|
var df = document.createDocumentFragment();
|
||||||
|
Loading…
Reference in New Issue
Block a user