Urgent: Problem with client-side insertBefore; too slow

[Nicole Schenk]

Client-side problem scripting problem. I have a table of about 300 rows with
many columns. User chooses to sort on one column. Sort is very fast (I do
this by extracting the column data along with its index and then using the
array sort with). The problem is with the following code that I took from
MSDN's DHTML Dude's article:
//TheBody is is a tbody with id "TheBody". It is at the end of the table
//Â*Â*Â*andÂ*isÂ*whereÂ*weÂ*areÂ*insertingÂ*theÂ*sor tedÂ*rows.
//aSortedArray - contains a string with with "|" separators. The last one
is
//the index into the original rows to be sorted.

Â* Â* Â* Â* var i, r, b, d, s,j,a;

Â* Â* Â* Â* b = TheBody;
Â* Â* Â* Â* var rtr=ResultsTable.rows
Â* Â* Â* Â* var ri;
Â* Â* Â* Â* //Display the sorted rows
Â* Â* Â* Â* for (i=1; i<count; i++) {
Â* Â* Â* Â* Â* a=aSortedArray[i-1];
Â* Â* Â* Â* Â* j=a.lastIndexOf("|");
Â* Â* Â* Â* Â* ri=parseInt(a.substr(j+1,3).replace(^0*,""));
Â* Â* Â* Â* Â* r = rtr[ri].cloneNode(true);
Â* Â* Â* Â* Â* r.id = "NewRow" Â* Â* Â* Â* Â* Â* Â* //for convenience in finding all
new ones
Â* Â* Â* Â* Â* b.insertBefore(r, null); Â* //<<<<<<<<<<<this is very slow!
Â* Â* Â* Â* }
It takes about 20 seconds on a 2GHz machine to display the rows.

I would really appreciate any help

Thanks

[Nicole Schenk]

Nicole Schenk wrote:

Client-side problem scripting problem. I have a table of about 300 rows
with many columns. User chooses to sort on one column. Sort is very fast
(I do this by extracting the column data along with its index and then
using the array sort with). The problem is with the following code that I
took from MSDN's DHTML Dude's article:
//TheBody is is a tbody with id "TheBody". It is at the end of the table
//Â*Â*Â*andÂ*isÂ*whereÂ*weÂ*areÂ*insertingÂ*theÂ*sor tedÂ*rows.
//aSortedArray - contains a string with with "|" separators. The last one
is
//the index into the original rows to be sorted.

var i, r, b, d, s,j,a;

b = TheBody;
var rtr=ResultsTable.rows
var ri;
//Display the sorted rows
for (i=1; i<count; i++) {
a=aSortedArray[i-1];
j=a.lastIndexOf("|");
ri=parseInt(a.substr(j+1,3).replace(^0*,""));
r = rtr[ri].cloneNode(true);
r.id = "NewRow" Â* Â* Â* Â* Â* Â* Â* //for convenience in finding all
new ones
b.insertBefore(r, null); Â* //<<<<<<<<<<<this is very slow!
}
It takes about 20 seconds on a 2GHz machine to display the rows.

I would really appreciate any help

Thanks

Problem solved by not using insertBefore. Instead I create a fragment first,
insert into this fragment and then add the fragment after the loop.