mirror of
https://github.com/rn10950/RetroZilla.git
synced 2024-11-11 02:10:17 +01:00
179 lines
5.7 KiB
JavaScript
179 lines
5.7 KiB
JavaScript
|
/* -*- Mode: Java; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*-
|
||
|
*
|
||
|
* ***** BEGIN LICENSE BLOCK *****
|
||
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
||
|
*
|
||
|
* The contents of this file are subject to the Mozilla Public License Version
|
||
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
||
|
* the License. You may obtain a copy of the License at
|
||
|
* http://www.mozilla.org/MPL/
|
||
|
*
|
||
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
||
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
||
|
* for the specific language governing rights and limitations under the
|
||
|
* License.
|
||
|
*
|
||
|
* The Original Code is mozilla.org code.
|
||
|
*
|
||
|
* The Initial Developer of the Original Code is
|
||
|
* Netscape Communications Corporation.
|
||
|
* Portions created by the Initial Developer are Copyright (C) 1998
|
||
|
* the Initial Developer. All Rights Reserved.
|
||
|
*
|
||
|
* Contributor(s):
|
||
|
*
|
||
|
* Alternatively, the contents of this file may be used under the terms of
|
||
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
||
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
||
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
||
|
* of those above. If you wish to allow use of your version of this file only
|
||
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
||
|
* use your version of this file under the terms of the MPL, indicate your
|
||
|
* decision by deleting the provisions above and replace them with the notice
|
||
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
||
|
* the provisions above, a recipient may use your version of this file under
|
||
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
||
|
*
|
||
|
* ***** END LICENSE BLOCK ***** */
|
||
|
|
||
|
function DeleteAllFromTree
|
||
|
(tree, view, table, deletedTable, removeButton, removeAllButton) {
|
||
|
|
||
|
// remove all items from table and place in deleted table
|
||
|
for (var i=0; i<table.length; i++) {
|
||
|
deletedTable[deletedTable.length] = table[i];
|
||
|
}
|
||
|
table.length = 0;
|
||
|
|
||
|
// redisplay
|
||
|
var oldCount = view.rowCount;
|
||
|
view.rowCount = 0;
|
||
|
tree.treeBoxObject.rowCountChanged(0, -oldCount);
|
||
|
|
||
|
|
||
|
// disable buttons
|
||
|
document.getElementById(removeButton).setAttribute("disabled", "true")
|
||
|
document.getElementById(removeAllButton).setAttribute("disabled","true");
|
||
|
}
|
||
|
|
||
|
function DeleteSelectedItemFromTree
|
||
|
(tree, view, table, deletedTable, removeButton, removeAllButton) {
|
||
|
|
||
|
// Turn off tree selection notifications during the deletion
|
||
|
tree.view.selection.selectEventsSuppressed = true;
|
||
|
|
||
|
// remove selected items from list (by setting them to null) and place in deleted list
|
||
|
var selections = GetTreeSelections(tree);
|
||
|
for (var s=selections.length-1; s>= 0; s--) {
|
||
|
var i = selections[s];
|
||
|
deletedTable[deletedTable.length] = table[i];
|
||
|
table[i] = null;
|
||
|
}
|
||
|
|
||
|
// collapse list by removing all the null entries
|
||
|
for (var j=0; j<table.length; j++) {
|
||
|
if (table[j] == null) {
|
||
|
var k = j;
|
||
|
while ((k < table.length) && (table[k] == null)) {
|
||
|
k++;
|
||
|
}
|
||
|
table.splice(j, k-j);
|
||
|
view.rowCount -= k - j;
|
||
|
tree.treeBoxObject.rowCountChanged(j, j - k);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// update selection and/or buttons
|
||
|
if (table.length) {
|
||
|
|
||
|
// update selection
|
||
|
var nextSelection = (selections[0] < table.length) ? selections[0] : table.length-1;
|
||
|
tree.view.selection.select(nextSelection);
|
||
|
tree.treeBoxObject.ensureRowIsVisible(nextSelection);
|
||
|
|
||
|
} else {
|
||
|
|
||
|
// disable buttons
|
||
|
document.getElementById(removeButton).setAttribute("disabled", "true")
|
||
|
document.getElementById(removeAllButton).setAttribute("disabled","true");
|
||
|
|
||
|
}
|
||
|
|
||
|
tree.view.selection.selectEventsSuppressed = false;
|
||
|
}
|
||
|
|
||
|
function GetTreeSelections(tree) {
|
||
|
var selections = [];
|
||
|
var select = tree.view.selection;
|
||
|
if (select) {
|
||
|
var count = select.getRangeCount();
|
||
|
var min = new Object();
|
||
|
var max = new Object();
|
||
|
for (var i=0; i<count; i++) {
|
||
|
select.getRangeAt(i, min, max);
|
||
|
for (var k=min.value; k<=max.value; k++) {
|
||
|
if (k != -1) {
|
||
|
selections[selections.length] = k;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
return selections;
|
||
|
}
|
||
|
|
||
|
function SortTree(tree, view, table, column, lastSortColumn, lastSortAscending, updateSelection) {
|
||
|
|
||
|
// remember which item was selected so we can restore it after the sort
|
||
|
var selections = GetTreeSelections(tree);
|
||
|
var selectedNumber = selections.length ? table[selections[0]].id : -1;
|
||
|
|
||
|
// determine if sort is to be ascending or descending
|
||
|
var ascending = (column == lastSortColumn) ? !lastSortAscending : true;
|
||
|
|
||
|
// do the sort or re-sort
|
||
|
// this is a temporary hack for 1.7, we should implement
|
||
|
// display and sort variables here for trees in general
|
||
|
var compareFunc;
|
||
|
if (column == "expires") {
|
||
|
compareFunc = function compare(first, second) {
|
||
|
if (first.expiresSortValue > second.expiresSortValue)
|
||
|
return 1;
|
||
|
else if (first.expiresSortValue < second.expiresSortValue)
|
||
|
return -1;
|
||
|
else
|
||
|
return 0;
|
||
|
}
|
||
|
} else {
|
||
|
compareFunc = function compare(first, second) {
|
||
|
return first[column].toLowerCase().localeCompare(second[column].toLowerCase());
|
||
|
}
|
||
|
}
|
||
|
table.sort(compareFunc);
|
||
|
if (!ascending)
|
||
|
table.reverse();
|
||
|
|
||
|
// restore the selection
|
||
|
var selectedRow = -1;
|
||
|
if (selectedNumber>=0 && updateSelection) {
|
||
|
for (var s=0; s<table.length; s++) {
|
||
|
if (table[s].id == selectedNumber) {
|
||
|
// update selection
|
||
|
// note: we need to deselect before reselecting in order to trigger ...Selected()
|
||
|
tree.view.selection.select(-1);
|
||
|
tree.view.selection.select(s);
|
||
|
selectedRow = s;
|
||
|
break;
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// display the results
|
||
|
tree.treeBoxObject.invalidate();
|
||
|
if (selectedRow >= 0) {
|
||
|
tree.treeBoxObject.ensureRowIsVisible(selectedRow)
|
||
|
}
|
||
|
|
||
|
return ascending;
|
||
|
}
|
||
|
|