79 lines
2.3 KiB
JavaScript
79 lines
2.3 KiB
JavaScript
// -*- indent-tabs-mode: nil; js-indent-level: 2 -*-
|
|
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
|
|
|
var gTreeUtils = {
|
|
deleteAll: function (aTree, aView, aItems, aDeletedItems)
|
|
{
|
|
for (var i = 0; i < aItems.length; ++i)
|
|
aDeletedItems.push(aItems[i]);
|
|
aItems.splice(0, aItems.length);
|
|
var oldCount = aView.rowCount;
|
|
aView._rowCount = 0;
|
|
aTree.treeBoxObject.rowCountChanged(0, -oldCount);
|
|
},
|
|
|
|
deleteSelectedItems: function (aTree, aView, aItems, aDeletedItems)
|
|
{
|
|
var selection = aTree.view.selection;
|
|
selection.selectEventsSuppressed = true;
|
|
|
|
var rc = selection.getRangeCount();
|
|
for (var i = 0; i < rc; ++i) {
|
|
var min = { }; var max = { };
|
|
selection.getRangeAt(i, min, max);
|
|
for (var j = min.value; j <= max.value; ++j) {
|
|
aDeletedItems.push(aItems[j]);
|
|
aItems[j] = null;
|
|
}
|
|
}
|
|
|
|
var nextSelection = 0;
|
|
for (i = 0; i < aItems.length; ++i) {
|
|
if (!aItems[i]) {
|
|
var j = i;
|
|
while (j < aItems.length && !aItems[j])
|
|
++j;
|
|
aItems.splice(i, j - i);
|
|
nextSelection = j < aView.rowCount ? j - 1 : j - 2;
|
|
aView._rowCount -= j - i;
|
|
aTree.treeBoxObject.rowCountChanged(i, i - j);
|
|
}
|
|
}
|
|
|
|
if (aItems.length) {
|
|
selection.select(nextSelection);
|
|
aTree.treeBoxObject.ensureRowIsVisible(nextSelection);
|
|
aTree.focus();
|
|
}
|
|
selection.selectEventsSuppressed = false;
|
|
},
|
|
|
|
sort: function (aTree, aView, aDataSet, aColumn, aComparator,
|
|
aLastSortColumn, aLastSortAscending)
|
|
{
|
|
var ascending = (aColumn == aLastSortColumn) ? !aLastSortAscending : true;
|
|
if (aDataSet.length == 0)
|
|
return ascending;
|
|
|
|
var numericSort = !isNaN(aDataSet[0][aColumn]);
|
|
var sortFunction = null;
|
|
if (aComparator) {
|
|
sortFunction = function (a, b) { return aComparator(a[aColumn], b[aColumn]); };
|
|
}
|
|
aDataSet.sort(sortFunction);
|
|
if (!ascending)
|
|
aDataSet.reverse();
|
|
|
|
aTree.view.selection.clearSelection();
|
|
aTree.view.selection.select(0);
|
|
aTree.treeBoxObject.invalidate();
|
|
aTree.treeBoxObject.ensureRowIsVisible(0);
|
|
|
|
return ascending;
|
|
}
|
|
};
|
|
|