Magic-Mirror/gecko-dev
1
0
Fork 0
mirror of https://github.com/mozilla/gecko-dev.git synced 2025-03-01 05:48:26 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

202131 patch by dwitte@stanford.edu r=mvl@exedo.nl sr=darin BubbleSort is too slow

Browse Source
This commit is contained in:
cbiesinger%web.de 2003-04-18 17:34:02 +00:00
parent dbd672f841
commit bdfabf0708
3 changed files with 57 additions and 66 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

41
extensions/wallet/cookieviewer/nsWalletTreeUtils.js
View File

@ -123,7 +123,25 @@ function SortTree(tree, view, table, column, lastSortColumn, lastSortAscending)
var ascending = (column == lastSortColumn) ? !lastSortAscending : true;
// do the sort
BubbleSort(column, ascending, table);
var compareFunc;
if (ascending) {
compareFunc = function compare(first, second) {
if (first[column] < second[column])
return 1;
if (first[column] > second[column])
return -1;
return 0;
}
} else {
compareFunc = function compare(first, second) {
if (first[column] < second[column])
return -1;
if (first[column] > second[column])
return 1;
return 0;
}
}
table.sort(compareFunc);
// restore the selection
var selectedRow = -1;
@ -148,24 +166,3 @@ function SortTree(tree, view, table, column, lastSortColumn, lastSortAscending)
return ascending;
}
function BubbleSort(columnName, ascending, table) {
var len = table.length, len_1 = len - 1;
for (var i = 0; i < len_1; i++) {
var key = table[i][columnName];
var winner = -1;
for (var j = i + 1; j < len; j++) {
var nextKey = table[j][columnName];
if (ascending ? key > nextKey : key < nextKey) {
key = nextKey;
winner = j;
}
}
if (winner != -1){
var temp = table[i];
table[i] = table[winner];
table[winner] = temp;
}
}
}

41
extensions/wallet/cookieviewer/resources/content/nsWalletTreeUtils.js
View File

@ -123,7 +123,25 @@ function SortTree(tree, view, table, column, lastSortColumn, lastSortAscending)
var ascending = (column == lastSortColumn) ? !lastSortAscending : true;
// do the sort
BubbleSort(column, ascending, table);
var compareFunc;
if (ascending) {
compareFunc = function compare(first, second) {
if (first[column] < second[column])
return 1;
if (first[column] > second[column])
return -1;
return 0;
}
} else {
compareFunc = function compare(first, second) {
if (first[column] < second[column])
return -1;
if (first[column] > second[column])
return 1;
return 0;
}
}
table.sort(compareFunc);
// restore the selection
var selectedRow = -1;
@ -148,24 +166,3 @@ function SortTree(tree, view, table, column, lastSortColumn, lastSortAscending)
return ascending;
}
function BubbleSort(columnName, ascending, table) {
var len = table.length, len_1 = len - 1;
for (var i = 0; i < len_1; i++) {
var key = table[i][columnName];
var winner = -1;
for (var j = i + 1; j < len; j++) {
var nextKey = table[j][columnName];
if (ascending ? key > nextKey : key < nextKey) {
key = nextKey;
winner = j;
}
}
if (winner != -1){
var temp = table[i];
table[i] = table[winner];
table[winner] = temp;
}
}
}

41
xpfe/components/permissions/content/treeUtils.js
View File

@ -123,7 +123,25 @@ function SortTree(tree, view, table, column, lastSortColumn, lastSortAscending)
var ascending = (column == lastSortColumn) ? !lastSortAscending : true;
// do the sort
BubbleSort(column, ascending, table);
var compareFunc;
if (ascending) {
compareFunc = function compare(first, second) {
if (first[column] < second[column])
return 1;
if (first[column] > second[column])
return -1;
return 0;
}
} else {
compareFunc = function compare(first, second) {
if (first[column] < second[column])
return -1;
if (first[column] > second[column])
return 1;
return 0;
}
}
table.sort(compareFunc);
// restore the selection
var selectedRow = -1;
@ -148,24 +166,3 @@ function SortTree(tree, view, table, column, lastSortColumn, lastSortAscending)
return ascending;
}
function BubbleSort(columnName, ascending, table) {
var len = table.length, len_1 = len - 1;
for (var i = 0; i < len_1; i++) {
var key = table[i][columnName];
var winner = -1;
for (var j = i + 1; j < len; j++) {
var nextKey = table[j][columnName];
if (ascending ? key > nextKey : key < nextKey) {
key = nextKey;
winner = j;
}
}
if (winner != -1){
var temp = table[i];
table[i] = table[winner];
table[winner] = temp;
}
}
}