1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
// -*- 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(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.rowCountChanged(0, -oldCount);
},
deleteSelectedItems(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 (let 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]) {
let 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.rowCountChanged(i, i - j);
}
}
if (aItems.length) {
selection.select(nextSelection);
aTree.ensureRowIsVisible(nextSelection);
aTree.focus();
}
selection.selectEventsSuppressed = false;
},
sort(
aTree,
aView,
aDataSet,
aColumn,
aComparator,
aLastSortColumn,
aLastSortAscending
) {
var ascending = aColumn == aLastSortColumn ? !aLastSortAscending : true;
if (!aDataSet.length) {
return ascending;
}
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.invalidate();
aTree.ensureRowIsVisible(0);
return ascending;
},
};
|
