The Tor Browser: js/src/tests/ecma/GlobalObject/15.1.2.5-1.js@6474c204b198 (annotated)

js/src/tests/ecma/GlobalObject/15.1.2.5-1.js@6474c204b198 (annotated)

js/src/tests/ecma/GlobalObject/15.1.2.5-1.js

Wed, 31 Dec 2014 06:09:35 +0100

author: Michael Schloh von Bennewitz <michael@schloh.com>
date: Wed, 31 Dec 2014 06:09:35 +0100
changeset 0: 6474c204b198
permissions: -rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 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/. */
 /**
    File Name:          15.1.2.5-1.js
    ECMA Section:       15.1.2.5  Function properties of the global object
    unescape( string )
    Description:
    The unescape function computes a new version of a string value in which
    each escape sequences of the sort that might be introduced by the escape
    function is replaced with the character that it represents.
    When the unescape function is called with one argument string, the
    following steps are taken:
 .  Call ToString(string).
 .  Compute the number of characters in Result(1).
 .  Let R be the empty string.
 .  Let k be 0.
 .  If k equals Result(2), return R.
 .  Let c be the character at position k within Result(1).
 .  If c is not %, go to step 18.
 .  If k is greater than Result(2)-6, go to step 14.
 .  If the character at position k+1 within result(1) is not u, go to step
 .
 . If the four characters at positions k+2, k+3, k+4, and k+5 within
    Result(1) are not all hexadecimal digits, go to step 14.
 . Let c be the character whose Unicode encoding is the integer represented
    by the four hexadecimal digits at positions k+2, k+3, k+4, and k+5
    within Result(1).
 . Increase k by 5.
 . Go to step 18.
 . If k is greater than Result(2)-3, go to step 18.
 . If the two characters at positions k+1 and k+2 within Result(1) are not
    both hexadecimal digits, go to step 18.
 . Let c be the character whose Unicode encoding is the integer represented
    by two zeroes plus the two hexadecimal digits at positions k+1 and k+2
    within Result(1).
 . Increase k by 2.
 . Let R be a new string value computed by concatenating the previous value
    of R and c.
 . Increase k by 1.
 . Go to step 5.
    Author:             christine@netscape.com
    Date:               28 october 1997
 */
 var SECTION = "15.1.2.5-1";
 var VERSION = "ECMA_1";
 startTest();
 var TITLE   = "unescape(string)";
 writeHeaderToLog( SECTION + " "+ TITLE);
 new TestCase( SECTION, "unescape.length",       1,               unescape.length );
 new TestCase( SECTION, "unescape.length = null; unescape.length",   1,      eval("unescape.length=null; unescape.length") );
 new TestCase( SECTION, "delete unescape.length",                    false,  delete unescape.length );
 new TestCase( SECTION, "delete unescape.length; unescape.length",   1,      eval("delete unescape.length; unescape.length") );
 new TestCase( SECTION, "var MYPROPS=''; for ( var p in unescape ) { MYPROPS+= p }; MYPROPS",    "", eval("var MYPROPS=''; for ( var p in unescape ) { MYPROPS+= p }; MYPROPS") );
 new TestCase( SECTION, "unescape()",              "undefined",    unescape() );
 new TestCase( SECTION, "unescape('')",            "",             unescape('') );
 new TestCase( SECTION, "unescape( null )",        "null",         unescape(null) );
 new TestCase( SECTION, "unescape( void 0 )",      "undefined",    unescape(void 0) );
 new TestCase( SECTION, "unescape( true )",        "true",         unescape( true ) );
 new TestCase( SECTION, "unescape( false )",       "false",        unescape( false ) );
 new TestCase( SECTION, "unescape( new Boolean(true) )",   "true", unescape(new Boolean(true)) );
 new TestCase( SECTION, "unescape( new Boolean(false) )",  "false",    unescape(new Boolean(false)) );
 new TestCase( SECTION, "unescape( Number.NaN  )",                 "NaN",      unescape(Number.NaN) );
 new TestCase( SECTION, "unescape( -0 )",                          "0",        unescape( -0 ) );
 new TestCase( SECTION, "unescape( 'Infinity' )",                  "Infinity", unescape( "Infinity" ) );
 new TestCase( SECTION, "unescape( Number.POSITIVE_INFINITY )",    "Infinity", unescape( Number.POSITIVE_INFINITY ) );
 new TestCase( SECTION, "unescape( Number.NEGATIVE_INFINITY )",    "-Infinity", unescape( Number.NEGATIVE_INFINITY ) );
 var ASCII_TEST_STRING = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789@*_+-./";
 new TestCase( SECTION, "unescape( " +ASCII_TEST_STRING+" )",    ASCII_TEST_STRING,  unescape( ASCII_TEST_STRING ) );
 // escaped chars with ascii values less than 256
 for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE++ ) {
   new TestCase( SECTION,
 		"unescape( %"+ ToHexString(CHARCODE)+" )",
 		String.fromCharCode(CHARCODE),
 		unescape( "%" + ToHexString(CHARCODE) )  );
 }
 // unicode chars represented by two hex digits
 for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE++ ) {
   new TestCase( SECTION,
 		"unescape( %u"+ ToHexString(CHARCODE)+" )",
 		"%u"+ToHexString(CHARCODE),
 		unescape( "%u" + ToHexString(CHARCODE) )  );
 }
 /*
   for ( var CHARCODE = 0; CHARCODE < 256; CHARCODE++ ) {
   new TestCase( SECTION,
   "unescape( %u"+ ToUnicodeString(CHARCODE)+" )",
   String.fromCharCode(CHARCODE),
   unescape( "%u" + ToUnicodeString(CHARCODE) )  );
   }
   for ( var CHARCODE = 256; CHARCODE < 65536; CHARCODE+= 333 ) {
   new TestCase( SECTION,
   "unescape( %u"+ ToUnicodeString(CHARCODE)+" )",
   String.fromCharCode(CHARCODE),
   unescape( "%u" + ToUnicodeString(CHARCODE) )  );
   }
 */
 test();
 function ToUnicodeString( n ) {
   var string = ToHexString(n);
   for ( var PAD = (4 - string.length ); PAD > 0; PAD-- ) {
     string = "0" + string;
   }
   return string;
 }
 function ToHexString( n ) {
   var hex = new Array();
   for ( var mag = 1; Math.pow(16,mag) <= n ; mag++ ) {
     ;
   }
   for ( index = 0, mag -= 1; mag > 0; index++, mag-- ) {
     hex[index] = Math.floor( n / Math.pow(16,mag) );
     n -= Math.pow(16,mag) * Math.floor( n/Math.pow(16,mag) );
   }
   hex[hex.length] = n % 16;
   var string ="";
   for ( var index = 0 ; index < hex.length ; index++ ) {
     switch ( hex[index] ) {
     case 10:
       string += "A";
       break;
     case 11:
       string += "B";
       break;
     case 12:
       string += "C";
       break;
     case 13:
       string += "D";
       break;
     case 14:
       string += "E";
       break;
     case 15:
       string += "F";
       break;
     default:
       string += hex[index];
     }
   }
   if ( string.length == 1 ) {
     string = "0" + string;
   }
   return string;
 }