code: function rotl_64(x, n)
  	{
  		if (n > 32)
  		{
  			n = n - 32;
  			return new Int_64(
  				x.lowOrder << n | x.highOrder >>> (32 - n),
  				x.highOrder << n | x.lowOrder >>> (32 - n)
  			);
  		}
  		else if (0 !== n)
  		{
  			return new Int_64(
  				x.highOrder << n | x.lowOrder >>> (32 - n),
  				x.lowOrder << n | x.highOrder >>> (32 - n)
  			);
  		}
  		else
  		{
  			return x;
  		}
  	}
docs: The 64-bit implementation of circular rotate left
  
  @private
  @param {Int_64} x The 64-bit integer argument
  @param {number} n The number of bits to shift
  @return {Int_64} The x shifted circularly by n bits