The Tor Browser / file revision

 /* -*- 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:          11.4.8.js

    ECMA Section:       11.4.8 Bitwise NOT Operator

    Description:        flip bits up to 32 bits

    no special cases

    Author:             christine@netscape.com

    Date:               7 july 1997

    Data File Fields:

    VALUE           value passed as an argument to the ~ operator

    E_RESULT        expected return value of ~ VALUE;

    Static variables:

    none

 */

 var SECTION = "11.4.8";

 var VERSION = "ECMA_1";

 startTest();

 writeHeaderToLog( SECTION + " Bitwise Not operator");

 for ( var i = 0; i < 35; i++ ) {

   var p = Math.pow(2,i);

   new TestCase( SECTION, "~"+p,   Not(p),     ~p );

 }

 for ( i = 0; i < 35; i++ ) {

   var p = -Math.pow(2,i);

   new TestCase( SECTION, "~"+p,   Not(p),     ~p );

 }

 test();

 function ToInteger( n ) {

   n = Number( n );

   var sign = ( n < 0 ) ? -1 : 1;

   if ( n != n ) {

     return 0;

   }

   if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {

     return n;

   }

   return ( sign * Math.floor(Math.abs(n)) );

 }

 function ToInt32( n ) {

   n = Number( n );

   var sign = ( n < 0 ) ? -1 : 1;

   if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {

     return 0;

   }

   n = (sign * Math.floor( Math.abs(n) )) % Math.pow(2,32);

   n = ( n >= Math.pow(2,31) ) ? n - Math.pow(2,32) : n;

   return ( n );

 }

 function ToUint32( n ) {

   n = Number( n );

   var sign = ( n < 0 ) ? -1 : 1;

   if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {

     return 0;

   }

   n = sign * Math.floor( Math.abs(n) )

     n = n % Math.pow(2,32);

   if ( n < 0 ){

     n += Math.pow(2,32);

   }

   return ( n );

 }

 function ToUint16( n ) {

   var sign = ( n < 0 ) ? -1 : 1;

   if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY) {

     return 0;

   }

   n = ( sign * Math.floor( Math.abs(n) ) ) % Math.pow(2,16);

   if (n <0) {

     n += Math.pow(2,16);

   }

   return ( n );

 }

 function Mask( b, n ) {

   b = ToUint32BitString( b );

   b = b.substring( b.length - n );

   b = ToUint32Decimal( b );

   return ( b );

 }

 function ToUint32BitString( n ) {

   var b = "";

   for ( var p = 31; p >=0; p-- ) {

     if ( n >= Math.pow(2,p) ) {

       b += "1";

       n -= Math.pow(2,p);

     } else {

       b += "0";

     }

   }

   return b;

 }

 function ToInt32BitString( n ) {

   var b = "";

   var sign = ( n < 0 ) ? -1 : 1;

   b += ( sign == 1 ) ? "0" : "1";

   for ( var p = 30; p >=0; p-- ) {

     if ( (sign == 1 ) ? sign * n >= Math.pow(2,p) : sign * n > Math.pow(2,p) ) {

       b += ( sign == 1 ) ? "1" : "0";

       n -= sign * Math.pow( 2, p );

     } else {

       b += ( sign == 1 ) ? "0" : "1";

     }

   }

   return b;

 }

 function ToInt32Decimal( bin ) {

   var r = 0;

   var sign;

   if ( Number(bin.charAt(0)) == 0 ) {

     sign = 1;

     r = 0;

   } else {

     sign = -1;

     r = -(Math.pow(2,31));

   }

   for ( var j = 0; j < 31; j++ ) {

     r += Math.pow( 2, j ) * Number(bin.charAt(31-j));

   }

   return r;

 }

 function ToUint32Decimal( bin ) {

   var r = 0;

   for ( var l = bin.length; l < 32; l++ ) {

     bin = "0" + bin;

   }

   for ( var j = 0; j < 31; j++ ) {

     r += Math.pow( 2, j ) * Number(bin.charAt(31-j));

   }

   return r;

 }

 function Not( n ) {

   n = ToInt32(n);

   n = ToInt32BitString(n);

   var r = "";

   for( var l = 0; l < n.length; l++  ) {

     r += ( n.charAt(l) == "0" ) ? "1" : "0";

   }

   n = ToInt32Decimal(r);

   return n;

 }