Editing comments.

git-svn-id: svn://10.0.0.236/trunk@127998 18797224-902f-48f8-a5cc-f745e15eee43
This commit is contained in:
pschwartau%netscape.com 2002-08-23 22:48:38 +00:00
parent 8893553e7c
commit 64da969ea3

View File

@ -55,8 +55,10 @@
*
*
* We'll try the largest possible array first, then a couple others.
* Try to be good about memory by nulling each array variable afterwards.
* This will tell the garbage collector the memory is no longer needed.
* We're just testing that we don't crash on Array.sort().
*
* Try to be good about memory by nulling each array variable after it is
* used. This will tell the garbage collector the memory is no longer needed.
*/
//-----------------------------------------------------------------------------
var bug = 157652;
@ -74,15 +76,15 @@ printStatus(summary);
* Note this terminates the test with exit code 1 in Rhino
* and exit code 3 in SpiderMonkey.
*
* Therefore we include |expectExitCode(n = 1,3)| below.
* Therefore we put |expectExitCode(n = 1,3)| below.
*
* The only problem will arise when the JS shell ever DOES
* The only problem will arise if the JS shell ever DOES
* have enough memory to do the sort. Then this test will
* terminate with the normal exit code 0 and fail.
*
* Right now, I can't see any other way to do this, because
* "out of memory" is not a catchable error: it cannot be
* caught with try...catch.
* trapped with try...catch.
*/
if (inRhino())
expectExitCode(1);
@ -90,7 +92,6 @@ else
expectExitCode(3);
/*
* Rhino can't seem to handle the largest array: it hangs...
* So we'll skip this case in Rhino -