DZone Snippets: integer code

Simple integer expression interpreter

scvalex (Alexandru Scvortov) — Thu, 30 Aug 2007 14:45:36 GMT

This is a simple integer expression interpreter.



#include 

#include 

#include 

#include 



char look;

std::map table;



void getChar() {

    look = std::cin.get();

}



void error(const std::string &s) {

    std::cout << std::endl;

    std::cout << "Error: " << s << "." << std::endl;

}



void abort(const std::string &s) {

    error(s);

    exit(1);

}



void expected(const std::string &s) {

    abort(s + " Expected");

}



bool isAlpha(char c) {

    return isalpha(c);

}



bool isDigit(char c) {

    return isdigit(c);

}



bool isAlNum(char c) {

    return isalnum(c);

}



bool isAddop(char c) {

    return ((c == '+') || (c == '-'));

}



bool isMulop(char c) {

    return (('*' == c) || ('/' == c));

}



bool isWhite(char c) {

    return ((' ' == c) || ('\t' == c));

}



void skipWhite() {

    while (isWhite(look))

        getChar();

}



void match(char x) {

    if (look != x)

        expected(std::string("\"") + x + "\"");

    else {

        getChar();

        skipWhite();

    }

}



void emit(const std::string &s) {

    std::cout << "\t"  << s;

}



void emitLn(const std::string &s) {

    emit(s);

    std::cout << std::endl;

}



void newLine() {

    if (look == '\n')

        getChar();

}



std::string getName() {

    if (!isAlpha(look))

        expected("Name");



    std::string name;

    while (isAlNum(look)) {

        name += look;

        getChar();

    }

    skipWhite();



    return name;

}



int getNum() {

    int value(0);



    if (!isDigit(look))

        expected("Integer");



    while (isDigit(look)) {

        value = value * 10 + look - '0';

        getChar();

    }

    skipWhite();



    return value;

}



int expression();



int factor() {

    int ret;



    if (look == '(') {

        match('(');

        ret = expression();

        match(')');

    } else if (isAlpha(look)) {

        std::string name = getName();

        if (table.count(name) == 0)

            table.insert(std::pair(name, 0));

        ret = table[name];

    } else

        ret = getNum();



    return ret;

}



int term() {

    int value = factor();



    while (isMulop(look)) {

        if (look == '*') {

            match('*');

            value *= factor();

        } else if (look == '/') {

            match('/');

            value /= factor();

        }

    }



    return value;

}



int expression() {

    int value(0);



    if (!isAddop(look))

        value = term();



    while (isAddop(look)) {

        if (look == '+') {

            match('+');

            value += term();

        } else if (look == '-') {

            match('-');

            value -= term();

        }

    }



    return value;

}



void assignment() {

    std::string name = getName();

    match('=');

    if (table.count(name) == 1)

        table[name] = expression();

    else

        table.insert(std::pair(name, expression()));



    std::cout << name << " = " << table[name] << std::endl;

}



void init() {

    getChar();

    skipWhite();

}



int main(int argc, char *argv[]) {

    init();



    do {

        assignment();

        newLine();

    } while ((look != '.') && (look != '\n'));



    return 0;

}

convert between characters and values

ovhaag (Oliver Haag) — Fri, 18 May 2007 15:34:49 GMT

// character to ASCII value: use ?



?a     # => 97

?\n    # => 10

// string to integer: use []



'a'[0]        # => 97

'hallo'[1]    # => 97

// integer / number to character: use .chr



97.chr     # => "a"

10.chr     # => "\n"

//more info: "Ruby Cookbook", O'Reilly

Javascript: convert integer to word (e.g. 18 -> "eighteen")

maximile (Max Williams) — Tue, 20 Mar 2007 22:15:23 GMT

// Convert a positive integer less than 1000 to its word representation.



var units = new Array ("Zero", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen");

var tens = new Array ("Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety");



function num(it) {

	var theword = "";

	var started;

	if (it>999) return "Lots";

	if (it==0) return units[0];

	for (var i = 9; i >= 1; i--){

		if (it>=i*100) {

			theword += units[i];

			started = 1;

			theword += " hundred";

			if (it!=i*100) theword += " and ";

			it -= i*100;

			i=0;

		}

	};

	

	for (var i = 9; i >= 2; i--){

		if (it>=i*10) {

			theword += (started?tens[i-2].toLowerCase():tens[i-2]);

			started = 1;

			if (it!=i*10) theword += "-";

			it -= i*10;

			i=0

		}

	};

	

	for (var i=1; i < 20; i++) {

		if (it==i) {

			theword += (started?units[i].toLowerCase():units[i]);

		}

	};

	return theword;

}

Integer Sqrt

jcongote (John Edgar Congote Calle) — Tue, 26 Sep 2006 02:05:15 GMT

This code calculate the square root of a integer.



unsigned int sqrt(unsigned int n){

    unsigned int a;

    for (a=0;n>=(2*a)+1;n-=(2*a++)+1);

    return a;

}

BigNumber //JavaScript Class

jonasraoni (Jonas Raoni Soares Silva) — Thu, 15 Jun 2006 20:19:36 GMT

Offers a extremely high precision level to make mathematical operations. For integers there is no limits and for floating point numbers, the class allows setting the maximum precision.

[UPDATED CODE AND HELP CAN BE FOUND HERE]

The class always returns new instances of BigNumber on the operations, so to the set value of a object, use the "set" method.



//+ Jonas Raoni Soares Silva

//@ http://jsfromhell.com/classes/bignumber [v1.0]



BigNumber = function(n, p, r){

    var o = this, i;

    if(n instanceof BigNumber){

        for(i in {precision: 0, roundType: 0, _sign: 0, _dec: 0}) o[i] = n[i];

        o._buffer = n._buffer.slice();

        return;

    }

    o.precision = isNaN(p = Math.abs(p)) ? BigNumber.defaultPrecision : p;

    o.roundType = isNaN(r = Math.abs(r)) ? BigNumber.defaultRoundType : r;

    o._sign = (n += "").charAt(0) == "-";

    o._dec = ((n = n.replace(/[^\d.]/g, "").split(".", 2))[0] = n[0].replace(/^0+/, "") || "0").length;

    for(i = (n = o._buffer = (n.join("") || "0").split("")).length; i; n[--i] = +n[i]);

    o.round();

};

with({$: BigNumber, o: BigNumber.prototype}){

    $.ROUND_HALF_EVEN = ($.ROUND_HALF_DOWN = ($.ROUND_HALF_UP = ($.ROUND_FLOOR = ($.ROUND_CEIL = ($.ROUND_DOWN = ($.ROUND_UP = 0) + 1) + 1) + 1) + 1) + 1) + 1;

    $.defaultPrecision = 40;

    $.defaultRoundType = $.ROUND_HALF_UP;

    o.add = function(n){

        if(this._sign != (n = new BigNumber(n))._sign) return n._sign = !n._sign, this.subtract(n);

        var o = new BigNumber(this), a = o._buffer, b = n._buffer, la = o._dec,

        lb = n._dec, n = Math.max(la, lb), i, r;

        la != lb && ((lb = la - lb) > 0 ? o._zeroes(b, lb, 1) : o._zeroes(a, -lb, 1));

        i = (la = a.length) == (lb = b.length) ? a.length : ((lb = la - lb) > 0 ? o._zeroes(b, lb) : o._zeroes(a, -lb)).length;

        for(r = 0; i; r = (a[--i] = a[i] + b[i] + r) / 10 >>> 0, a[i] %= 10);

        return r && ++n && a.unshift(r), o._dec = n, o.round();

    };

    o.subtract = function(n){

        if(this._sign != (n = new BigNumber(n))._sign) return n._sign = !n._sign, this.add(n);

        var o = new BigNumber(this), x = o.compare(n) + 1, a = x ? o : n, b = x ? n : o, la = a._dec, lb = b._dec, n = la, i, j;

        a = a._buffer, b = b._buffer, la != lb && ((lb = la - lb) > 0 ? o._zeroes(b, lb, 1) : o._zeroes(a, -lb, 1));

        for(i = (la = a.length) == (lb = b.length) ? a.length : ((lb = la - lb) > 0 ? o._zeroes(b, lb) : o._zeroes(a, -lb)).length; i;){

            if(a[--i] < b[i]){

                for(j = i; j && !a[--j]; a[j] = 9);

                --a[j], a[i] += 10;

            }

            b[i] = a[i] - b[i];

        }

        return o._sign = !x, o._dec = n, o._buffer = b, o.round();

    };

    o.multiply = function(n){

        var o = new BigNumber(this), r = o.compare(n = new BigNumber(n)) + 1, a = (r ? o : n)._buffer,

        b = (r ? n : o)._buffer, la = a.length, lb = b.length, x = new BigNumber, i, j, s;

        for(i = lb; i; x.set(x.add(new BigNumber(s.join("")))))

            for(s = (new Array(lb - --i)).join("0").split(""), r = 0, j = la; j;

            r += a[--j] * b[i], s.unshift(r % 10), r = r / 10 >>> 0);

        return r && x._buffer.unshift(r), o._dec = (o._buffer = x._buffer).length - la - lb + o._dec + n._dec, o.round();

    };

    o.divide = function(n){

        if((n = new BigNumber(n)) == "0") throw new Error("division by 0");

        var o = new BigNumber(this), a = o._buffer, b = n._buffer, la = a.length - o._dec,

        lb = b.length - n._dec, s = a._sign != b._sign, dec = 0, buffer = [], x = new BigNumber, y, i;

        la != lb && ((lb = la - lb) > 0 ? o._zeroes(b, lb) : o._zeroes(a, -lb));

        o._dec = a.length, n._dec = b.length;

        b = n, a._sign = false, b._sign = false;

        while(o != 0 && (buffer.length - dec) <= o.precision){

            x.set(0);

            for(i = 0; o.compare(y = x.add(b)) + 1 && ++i; x.set(y));

            if(!i){

                do ++i, o._buffer.push(0), ++o._dec;

                while(o.compare(b) < 0);

                !dec && (!buffer.length && buffer.push(0), dec = buffer.length);

                o._zeroes(buffer, --i);

                continue;

            }

            o.set(o.subtract(x)), buffer.push(i);

        }

        return o._buffer = buffer, o._dec = dec ? dec : buffer.length, o.round();

    };

    o.mod = function(n){

        return this.subtract(this.divide(n).intPart().multiply(n));

    };

    o.pow = function(n){

        var o = new BigNumber(this), i;

        if(n == 0) return o.set(1);

        for(i = Math.abs(n); --i; o.set(o.multiply(this)));

        return n < 0 ? o.set((new BigNumber(1)).divide(o)) : o;

    };

    o.set = function(n){

        return this.constructor(n), this;

    };

    o.compare = function(n){

        var a = this, la = this._dec, b = n, lb = n._dec, i, l;

        if(la != lb) return la > lb ? 1 : -1;

        for(la = (a = a._buffer).length, lb = (b = b._buffer).length, i = -1, l = Math.min(la, lb); ++i < l;)

            if(a[i] != b[i]) return a[i] > b[i] ? 1 : -1;

        return la != lb ? la > lb ? 1 : -1 : 0;

    }

    o.negate = function(){

        var n = new BigNumber(this); return n._sign ^= 1, n;

    };

    o.abs = function(){

        var n = new BigNumber(this); return n._sign = 0, n;

    };

    o.intPart = function(){

        return new BigNumber((this._sign ? "-" : "") + (this._buffer.slice(0, this._dec).join("") || "0"));

    };

    o.valueOf = o.toString = function(){

        var o = this;

        return (o._sign ? "-" : "") + (o._buffer.slice(0, o._dec).join("") || "0") + (o._dec != o._buffer.length ? "." + o._buffer.slice(o._dec).join("") : "");

    };

    o._zeroes = function(n, l, t){

        var s = ["push", "unshift"][t || 0];

        for(++l; --l;  n[s](0));

        return n;

    };

    o.round = function(){

        if("_rounding" in this) return this;

        var $ = BigNumber, r = this.roundType, b = this._buffer, d, p, n, x;

        for(this._rounding = true; this._dec > 1 && !b[0]; --this._dec, b.shift());

        for(d = this._dec, p = this.precision + d, n = b[p]; b.length > d && !b[b.length -1]; b.pop());

        x = (this._sign ? "-" : "") + (p - d ? "0." + this._zeroes([], p - d - 1).join("") : "") + 1;

        if(b.length > p){

            n && (r == $.DOWN ? false : r == $.UP ? true : r == $.CEIL ? !this._sign

            : r == $.FLOOR ? this._sign : r == $.HALF_UP ? n >= 5 : r == $.HALF_DOWN ? n > 5

            : r == $.HALF_EVEN ? n >= 5 && b[p - 1] & 1 : false) && this.add(x);

            b.splice(p, b.length - p);

        }

        return delete this._rounding, this;

    };

}

Usage

Splitting an integer list in TSQL

Will_Rickards (Will Rickards) — Sat, 01 Oct 2005 03:35:03 GMT

Revised: 2006-02-23 - fixed various bugs by using new algorithm
Often times I have a list of integers I need to pass to the database to get worked on. Such as checkboxes on a web page or some other list. I needed some TSQL that would take a text string and split it by a separator, in this case a comma. The following is the result of that need.
The way I normally use it is in a stored procedure like the one below with several text type arguments. Sometimes I use a variation designed to split a list of strings separated by a special character sequence. Image two lists, one of the ids and one of the data. You parse the first list to get a table of the ids and you parse the second list to get the data and insert/update as appropriate.



IF EXISTS (SELECT * FROM dbo.sysobjects WHERE id = object_id(N'[dbo].[uspSplitIntegerList]') AND OBJECTPROPERTY(id, N'IsProcedure') = 1)

   DROP PROCEDURE [dbo].[uspSplitIntegerList]

GO

                                      

SET QUOTED_IDENTIFIER ON 

GO

SET ANSI_NULLS ON 

GO





/* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ */

-- uspSplitIntegerList

--

-- Description:

--		splits a comma separated list of integers and returns the integer list

--

-- Arguments:

--		@list_integers					- list of integers

--

-- Notes:

-- 02/22/2006 - WSR : use DATALENGTH instead of LEN throughout because LEN doesn't count trailing blanks

--

-- History:

-- 02/22/2006 - WSR : revised algorithm to account for items crossing 8000 character boundary

--

CREATE PROCEDURE uspSplitIntegerList

	@list_integers			text

AS



SET NOCOUNT ON



DECLARE @InputLen			integer			-- input text length

DECLARE @TextPos			integer			-- current position within input text

DECLARE @Chunk				varchar(8000)	-- chunk within input text

DECLARE @ChunkPos			integer			-- current position within chunk

DECLARE @DelimPos			integer			-- position of delimiter

DECLARE @ChunkLen			integer			-- chunk length

DECLARE @DelimLen			integer			-- delimiter length

DECLARE @Delimiter      varchar(3)		-- delimiter

DECLARE @ItemBegPos		integer			-- item starting position in text

DECLARE @ItemOrder		integer			-- item order in list



-- create table to hold list items

-- actually their positions because we may want to scrub this list eliminating bad entries before substring is applied

CREATE TABLE #list_items ( item_order integer, item_begpos integer, item_endpos integer )



-- process list

IF @list_integers IS NOT NULL

   BEGIN



	-- initialize

   -- notice that this loop assumes a delimiter length of 1

   -- if the delimiter is longer we have to deal with stuff like delimiters straddling the chunk boundaries

   SET @InputLen = DATALENGTH(@list_integers)

   SET @TextPos = 1

	SET @Delimiter = ','

	SET @DelimLen = DATALENGTH(@Delimiter)

   SET @ItemBegPos = 1

   SET @ItemOrder = 1

   SET @ChunkLen = 1



   -- cycle through input processing chunks

   WHILE @TextPos <= @InputLen AND @ChunkLen <> 0

      BEGIN



      -- get current chunk

      SET @Chunk = SUBSTRING(@list_integers, @TextPos, 8000)



      -- setup initial variable values

      SET @ChunkPos = 1

      SET @ChunkLen = DATALENGTH(@Chunk)

      SET @DelimPos = CHARINDEX(@Delimiter, @Chunk, @ChunkPos)



      -- loop over the chunk, until the last delimiter

      WHILE @ChunkPos <= @ChunkLen AND @DelimPos <> 0

         BEGIN



			-- insert position

         INSERT INTO #list_items (item_order, item_begpos, item_endpos)

         VALUES (@ItemOrder, @ItemBegPos, (@TextPos + @DelimPos - 1) - 1)

         

         -- adjust positions

         SET @ItemOrder = @ItemOrder + 1

         SET @ItemBegPos = (@TextPos + @DelimPos - 1) + @DelimLen

         SET @ChunkPos = @DelimPos + @DelimLen

      

         -- find next delimiter      

         SET @DelimPos = CHARINDEX(@Delimiter, @Chunk, @ChunkPos)



         END



      -- adjust positions

      SET @TextPos = @TextPos + @ChunkLen



      END



	-- handle last item

   IF @ItemBegPos <= @InputLen

      BEGIN



      -- insert position

      INSERT INTO #list_items (item_order, item_begpos, item_endpos)

      VALUES (@ItemOrder, @ItemBegPos, @InputLen)



      END



	-- delete the bad items

   DELETE FROM #list_items

   WHERE item_endpos < item_begpos



   -- return list items

	SELECT CAST(SUBSTRING(@list_integers, item_begpos, (item_endpos - item_begpos + 1)) AS integer) AS item_integer, item_order, item_begpos, item_endpos

   FROM #list_items

   WHERE ISNUMERIC(SUBSTRING(@list_integers, item_begpos, (item_endpos - item_begpos + 1))) = 1

   ORDER BY item_order



   END



DROP TABLE #list_items



RETURN



/* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ */



GO

SET QUOTED_IDENTIFIER OFF 

GO

SET ANSI_NULLS ON 

GO

Javascript IntegerBoxControl

Will_Rickards (Will Rickards) — Tue, 13 Sep 2005 02:32:19 GMT

In input forms on web pages you often have to validate input as an integer or more precisely a positive integer greater than zero. Here is a control implementation of sorts.



// Integer Box Control

// 

// Notes

// To create an integer box control, call the SetupIntegerBoxControl function.

// It should be passed an input element with type of text.

// The onchange event of the input element will invoke the validation function.

// The validation function ensures only positive integer data is entered.

//

// History

// 09/08/2005 - WSR : created based on dateboxcontrol



// hooks functionality up to given textbox

function SetupIntegerBoxControl( ctlIntegerBox )

   {



   // if a valid object was given

   if (ctlIntegerBox)

      {



      // validate current contents

      IntegerBoxControl_Validate( ctlIntegerBox );



      // hook up event handlers

      ctlIntegerBox.onchange = function () { IntegerBoxControl_Validate(this); };

      

      }



   }





// validates the input

function IntegerBoxControl_Validate( ctlIntegerBox )

   {



   // parse the input as an integer

   var intValue = parseInt(ctlIntegerBox.value, 10);



   // if this is not an integer

   if (isNaN(intValue))

      {



      // clear text box

      ctlIntegerBox.value = '';



      }

   // if this is an integer

   else

      {

   

      switch (true)

         {

         case (intValue == 0) :



            // clear text box

            ctlIntegerBox.value = '';



            break;

         case (intValue > 0) :



            // put the parsed integer value in the text box

            ctlIntegerBox.value = intValue.toString();



            break;

         case (intValue < 0) :



            // put the positive parsed integer value in the text box

            ctlIntegerBox.value = (-1 * intValue).toString();



            break;

         }

      

      }



   }

I forgot to mention before how to hook it up in code.
I usually add an attribute bvr-datatype="integer" to the input element. bvr stands for behaviour. I hook up the control in the onload event. Here is a recent example.



// set window load event handler

window.onload = window_load;



// ----------------------------------------------------------------------------

// window_load

// Description: event handler for window load event

// Arguments: none

// Dependencies:

//    SetupDateBoxControl (dateboxcontrol.js)

//    SetupIntegerBoxControl (integerboxcontrol.js)

//    frmSearch_submit

//    cmdRequesting_click

//    txtRequesting_change

//    frmRecent_submit

//

function window_load()

   {



   // get input elements in document

   var arrInputs = document.getElementsByTagName('INPUT');



   // cycle through input elements

   for ( var i = 0; i < arrInputs.length; i++ ) 

      {



      // if this is a datebox control

      if ( 'date' == arrInputs[i].getAttribute('bvr-datatype') && 'text' == arrInputs[i].getAttribute('type') )

         {



         // setup the control

         SetupDateBoxControl( arrInputs[i] );



         }



      // if this is a integerbox control

      if ( 'integer' == arrInputs[i].getAttribute('bvr-datatype') && 'text' == arrInputs[i].getAttribute('type') )

         {



         // setup the control

         SetupIntegerBoxControl( arrInputs[i] );



         }



      }



   // get reference to search form

   var elForm = document.getElementById('frmSearch');

   if (elForm)

      {



      // set submit event handler

      elForm.onsubmit = frmSearch_submit;



      // set cmdTimekeeperLookup click event handler

      var elToWire = document.getElementById('cmdTimekeeperLookup');

      if (elToWire)

         {



         elToWire.onclick = cmdRequesting_click;

         elToWire.textbox = document.getElementById('txtRequestingTimekeeper');



         // set textbox change events

         if (elToWire.textbox)

            {



            elToWire.textbox.onchange = txtRequesting_change;

            elToWire.textbox.onblur = txtRequesting_change;

            elToWire.textbox.label = document.getElementById('lblTimekeeperName');



            if ( typeof window.strRequesting == 'undefined' )

               window.strRequesting = ''; 



            }



         }



      }



   // get reference to recent form

   elForm = document.getElementById('frmRecent');

   if (elForm)

      {



      // set submit event handler

      elForm.onsubmit = frmRecent_submit;



      }



   }

//

// window_load

// ----------------------------------------------------------------------------

Binary Data Parser //Javascript Class

jonasraoni (Jonas Raoni Soares Silva) — Fri, 09 Sep 2005 07:44:38 GMT

This is a prototyped class written to serialize and unserialize binary data, so you can read and write binary data files to exchange with programs written in languages like C and Pascal.

Currently the class is able to handle just the following types: signed integers (small 8 bits, short 16 bits, int 32 bits), unsigned integers (byte 8 bits, word 16 bits, dword 32 bits) and floating point (IEEE754 float 32 bits and double 64 bits).

The endianess of the binary values representation can also be configured with the class.

[UPDATED CODE AND HELP CAN BE FOUND HERE]

There's a php version right here.

Code



//+ Jonas Raoni Soares Silva

//@ http://jsfromhell.com/classes/binary-parser [v1.0]



BinaryParser = function( bigEndian, allowExceptions ){

	this.bigEndian = bigEndian;

	this.allowExceptions = allowExceptions;

};

with( { p: BinaryParser.prototype } ){

	with( {p: ( p.Buffer = function( bigEndian, buffer ){ this.bigEndian = bigEndian || 0; this.buffer = []; this.setBuffer( buffer ); } ).prototype } ){

		p.setBuffer = function( data ){

			if( data ){

				for( var l, i = l = data.length, b = this.buffer = new Array( l ); i; b[l - i] = data.charCodeAt( --i ) );

				this.bigEndian && b.reverse();

			}

		};

		p.hasNeededBits = function( neededBits ){

			return this.buffer.length >= -( -neededBits >> 3 );

		};

		p.checkBuffer = function( neededBits ){

			if( !this.hasNeededBits( neededBits ) )

				throw new Error( "checkBuffer::missing bytes" );

		};

		p.readBits = function( start, length ){

			//shl fix: Henri Torgemane ~1996 (compressed by Jonas Raoni)

			function shl( a, b ){

				for( ; b--; a = ( ( a %= 0x7fffffff + 1 ) & 0x40000000 ) == 0x40000000 ? a * 2 : ( a - 0x40000000 ) * 2 + 0x7fffffff + 1 );

				return a;

			}

			if( start < 0 || length <= 0 )

				return 0;

			this.checkBuffer( start + length );

			for( var offsetLeft, offsetRight = start % 8, curByte = this.buffer.length - ( start >> 3 ) - 1, lastByte = this.buffer.length + ( -( start + length ) >> 3 ), diff = curByte - lastByte, sum = ( ( this.buffer[ curByte ] >> offsetRight ) & ( ( 1 << ( diff ? 8 - offsetRight : length ) ) - 1 ) ) + ( diff && ( offsetLeft = ( start + length ) % 8 ) ? ( this.buffer[ lastByte++ ] & ( ( 1 << offsetLeft ) - 1 ) ) << ( diff-- << 3 ) - offsetRight : 0 ); diff; sum += shl( this.buffer[ lastByte++ ], ( diff-- << 3 ) - offsetRight ) );

			return sum;

		};

	}

	p.warn = function( msg ){

		if( this.allowExceptions )

			throw new Error( msg );

		return 1;

	};

	p.decodeFloat = function( data, precisionBits, exponentBits ){

		var b = new this.Buffer( this.bigEndian, data );

		b.checkBuffer( precisionBits + exponentBits + 1 );

		var bias = Math.pow( 2, exponentBits - 1 ) - 1, signal = b.readBits( precisionBits + exponentBits, 1 ), exponent = b.readBits( precisionBits, exponentBits ), significand = 0,

		divisor = 2, curByte = b.buffer.length + ( -precisionBits >> 3 ) - 1;

		do

			for( var byteValue = b.buffer[ ++curByte ], startBit = precisionBits % 8 || 8, mask = 1 << startBit; mask >>= 1; ( byteValue & mask ) && ( significand += 1 / divisor ), divisor *= 2 );

		while( precisionBits -= startBit );

		return exponent == ( bias << 1 ) + 1 ? significand ? NaN : signal ? -Infinity : +Infinity : ( 1 + signal * -2 ) * ( exponent || significand ? !exponent ? Math.pow( 2, -bias + 1 ) * significand : Math.pow( 2, exponent - bias ) * ( 1 + significand ) : 0 );

	};

	p.decodeInt = function( data, bits, signed ){

		var b = new this.Buffer( this.bigEndian, data ), x = b.readBits( 0, bits ), max = Math.pow( 2, bits );

		return signed && x >= max / 2 ? x - max : x;

	};

	p.encodeFloat = function( data, precisionBits, exponentBits ){

		var bias = Math.pow( 2, exponentBits - 1 ) - 1, minExp = -bias + 1, maxExp = bias, minUnnormExp = minExp - precisionBits,

		status = isNaN( n = parseFloat( data ) ) || n == -Infinity || n == +Infinity ? n : 0,

		exp = 0, len = 2 * bias + 1 + precisionBits + 3, bin = new Array( len ),

		signal = ( n = status !== 0 ? 0 : n ) < 0, n = Math.abs( n ), intPart = Math.floor( n ), floatPart = n - intPart,

		i, lastBit, rounded, j, result;

		for( i = len; i; bin[--i] = 0 );

		for( i = bias + 2; intPart && i; bin[--i] = intPart % 2, intPart = Math.floor( intPart / 2 ) );

		for( i = bias + 1; floatPart > 0 && i; ( bin[++i] = ( ( floatPart *= 2 ) >= 1 ) - 0 ) && --floatPart );

		for( i = -1; ++i < len && !bin[i]; );

		if( bin[( lastBit = precisionBits - 1 + ( i = ( exp = bias + 1 - i ) >= minExp && exp <= maxExp ? i + 1 : bias + 1 - ( exp = minExp - 1 ) ) ) + 1] ){

			if( !( rounded = bin[lastBit] ) )

				for( j = lastBit + 2; !rounded && j < len; rounded = bin[j++] );

			for( j = lastBit + 1; rounded && --j >= 0; ( bin[j] = !bin[j] - 0 ) && ( rounded = 0 ) );

		}

		for( i = i - 2 < 0 ? -1 : i - 3; ++i < len && !bin[i]; );

		if( ( exp = bias + 1 - i ) >= minExp && exp <= maxExp )

			++i;

		else if( exp < minExp ){

			exp != bias + 1 - len && exp < minUnnormExp && this.warn( "encodeFloat::float underflow" );

			i = bias + 1 - ( exp = minExp - 1 );

		}

		if( intPart || status !== 0 ){

			this.warn( intPart ? "encodeFloat::float overflow" : "encodeFloat::" + status );

			exp = maxExp + 1;

			i = bias + 2;

			if( status == -Infinity )

				signal = 1;

			else if( isNaN( status ) )

				bin[i] = 1;

		}

		for( n = Math.abs( exp + bias ), j = exponentBits + 1, result = ""; --j; result = ( n % 2 ) + result, n = n >>= 1 );

		for( n = 0, j = 0, i = ( result = ( signal ? "1" : "0" ) + result + bin.slice( i, i + precisionBits ).join( "" ) ).length, r = []; i; j = ( j + 1 ) % 8 ){

			n += ( 1 << j ) * result.charAt( --i );

			if( j == 7 ){

				r[r.length] = String.fromCharCode( n );

				n = 0;

			}

		}

		r[r.length] = n ? String.fromCharCode( n ) : "";

		return ( this.bigEndian ? r.reverse() : r ).join( "" );

	};

	p.encodeInt = function( data, bits, signed ){

		var max = Math.pow( 2, bits );

		( data >= max || data < -( max >> 1 ) ) && this.warn( "encodeInt::overflow" ) && ( data = 0 );

		data < 0 && ( data += max );

		for( var r = []; data; r[r.length] = String.fromCharCode( data % 256 ), data = Math.floor( data / 256 ) );

		for( bits = -( -bits >> 3 ) - r.length; bits--; r[r.length] = "\0" );

		return ( this.bigEndian ? r.reverse() : r ).join( "" );

	};

	p.toSmall    = function( data ){ return this.decodeInt( data,  8, true  ); };

	p.fromSmall  = function( data ){ return this.encodeInt( data,  8, true  ); };

	p.toByte     = function( data ){ return this.decodeInt( data,  8, false ); };

	p.fromByte   = function( data ){ return this.encodeInt( data,  8, false ); };

	p.toShort    = function( data ){ return this.decodeInt( data, 16, true  ); };

	p.fromShort  = function( data ){ return this.encodeInt( data, 16, true  ); };

	p.toWord     = function( data ){ return this.decodeInt( data, 16, false ); };

	p.fromWord   = function( data ){ return this.encodeInt( data, 16, false ); };

	p.toInt      = function( data ){ return this.decodeInt( data, 32, true  ); };

	p.fromInt    = function( data ){ return this.encodeInt( data, 32, true  ); };

	p.toDWord    = function( data ){ return this.decodeInt( data, 32, false ); };

	p.fromDWord  = function( data ){ return this.encodeInt( data, 32, false ); };

	p.toFloat    = function( data ){ return this.decodeFloat( data, 23, 8   ); };

	p.fromFloat  = function( data ){ return this.encodeFloat( data, 23, 8   ); };

	p.toDouble   = function( data ){ return this.decodeFloat( data, 52, 11  ); };

	p.fromDouble = function( data ){ return this.encodeFloat( data, 52, 11  ); };

}

change integer variables content

jonasraoni (Jonas Raoni Soares Silva) — Sat, 02 Jul 2005 04:02:49 GMT



//+ Jonas Raoni Soares Silva

//@ http://jsfromhell.com



#include

#include

void main(){

	int a, b;

	clrscr();



	printf( "Digite a= " );

	scanf( "%d", &a );



	printf( "Digite b= " );

	scanf( "%d", &b );



	a = b - a + ( b = a );



	printf( "a= %d\nb= %d", a, b);

	getch();

}

*