Re: Bignumber conversion and arithmetic on unsigned operand pairs using +,-,* now work in anybase.

Newsgroups	comp.lang.javascript
Date	2015-06-29 05:13 -0700
References	(15 earlier) <5591291f$0$2899$e4fe514c@news.xs4all.nl> <a8e1a65e-5aa7-4d6f-88c4-1e83ed695a66@googlegroups.com> <782a8f27-612b-47eb-897c-7debb99a5ee7@googlegroups.com> <55913152$0$2853$e4fe514c@news.xs4all.nl> <a5e5d973-77c0-4cae-bef7-f23973e5832e@googlegroups.com>
Message-ID	<c85be777-3d76-4e40-a1aa-8181ea0975ad@googlegroups.com> (permalink)
Subject	Re: Bignumber conversion and arithmetic on unsigned operand pairs using +,-,* now work in anybase.
From	jonas.thornvall@gmail.com

Show all headers | View raw

Den måndag 29 juni 2015 kl. 14:08:59 UTC+2 skrev jonas.t...@gmail.com:
> Den måndag 29 juni 2015 kl. 13:52:32 UTC+2 skrev Silvio:
> > On 06/29/2015 01:45 PM, jonas.thornvall@gmail.com wrote:
> > > Den måndag 29 juni 2015 kl. 13:30:06 UTC+2 skrev jonas.t...@gmail.com:
> > >> Den måndag 29 juni 2015 kl. 13:16:53 UTC+2 skrev Silvio:
> > >>> On 06/29/2015 01:12 PM, jonas.thornvall@gmail.com wrote:
> > >>>> Den söndag 28 juni 2015 kl. 17:23:06 UTC+2 skrev jonas.t...@gmail.com:
> > >>>>> Den söndag 28 juni 2015 kl. 17:04:46 UTC+2 skrev Evertjan.:
> > >>>>>> jonas.thornvall@gmail.com wrote on 28 Jun 2015 in comp.lang.javascript:
> > >>>>>>
> > >>>>>>> Well it isn't broken anymore maybe you should flush the cache of your
> > >>>>>>> browser.
> > >>>>>>
> > >>>>>> I don't use a browser for usenet.
> > >>>>>>
> > >>>>>> --
> > >>>>>> Evertjan.
> > >>>>>> The Netherlands.
> > >>>>>> (Please change the x'es to dots in my emailaddress)
> > >>>>>
> > >>>>> Well i thought you did run the script, i was wrong.
> > >>>>>
> > >>>>> I made one further "?improvement" to increase speed, but somethings goes wrong in the GCD. It do quit faster for values in power range but the GCD do suddenly set wrong value, and i can't quite figure out why.
> > >>>>>
> > >>>>> Well there is no impromvent until this change also work, but it is a sketch, of an improvement.
> > >>>>> http://jt.node365.se/baseconversion6.html
> > >>>>
> > >>>>    if (looptwo==true){
> > >>>>            mycomp=false;
> > >>>>            myremainder = naiveSub(10, decArr, multarr);
> > >>>>            mycomp = arrCompareThree(myremainder,oldigmult[olddigits]);
> > >>>>            if(mycomp==true){break;}
> > >>>>            }
> > >>>> This code somehow manage to change the value of looptwo, but i do not see how.
> > >>>>
> > >>>
> > >>> Since you persist the stupid habit of using global variables everywhere
> > >>> (although being advised not to about a hundred times) my guess would be
> > >>> that looptwo is global and either naiveSub or arrCompareThree (or both)
> > >>> modify the variable.
> > >>
> > >> But the code within if clause have not been executed at the point the change occure, so how could that be. I have form **printouts** so i can see if that if clause executed before the flop of value in looptwo, it do seem it change because the insertion of the ***if clause itself*** inserted into the tree.
> > >>
> > >> And that must be something wrong.
> > >
> > > Could there be limitation upon how a tree structure allowed to look?
> > >
> > >   while(olddigits >= 0) {
> > >        while (looptwo == true)
> > >        {
> > >
> > >           for(y = 0; y < tOne.length; y ++ )
> > >           {
> > >           }
> > >               if (looptwo==true){
> > >
> > >           if(mycomp==true){break; }
> > >           }
> > >
> > >           if(found == true)
> > >           {
> > >                  break;
> > >           }
> > >           else
> > >           {
> > >
> > >              if(looptwo == true && mymax != mymin + 1)
> > >              {
> > >
> > >              }
> > >              else
> > >              {
> > >                 if (mymin + 1 == mymax)
> > >                 {
> > >
> > >                 }
> > >                 else
> > >                 {
> > >
> > >                }
> > >              }
> > >           }
> > >
> > >        }
> > >
> > 
> > You mean the limitation that braces should match?
> 
> I mean limitation to the actual complexity of branching structure in programming languages. I mean that for loop and those breaks isn't exactly beautiful. But it seem logically valid structure.

BASE 12 NUMBER 143
THIS IS CORRECT
Try digit ->6
2,7 = 2,1 * 6
COMPARE resultmult < decarr TRUE, IF resultmult >= decarr FALSE 
2,7 VS 3,4,1
RETURNED VALUE ->true
MyVal=6  ->MIN=0 ->MAX=12

Try digit ->9
8,0,1 = 2,1 * 9
COMPARE resultmult < decarr TRUE, IF resultmult >= decarr FALSE 
8,0,1 VS 3,4,1
RETURNED VALUE ->true
MyVal=9  ->MIN=6 ->MAX=12

Try digit ->10
0,2,1 = 2,1 * 0,1
COMPARE resultmult < decarr TRUE, IF resultmult >= decarr FALSE 
0,2,1 VS 3,4,1
RETURNED VALUE ->true
MyVal=0,1  ->MIN=9 ->MAX=12

Try digit ->11
2,3,1 = 2,1 * 1,1
COMPARE resultmult < decarr TRUE, IF resultmult >= decarr FALSE 
2,3,1 VS 3,4,1
RETURNED VALUE ->true
MyVal=1,1  ->MIN=10 ->MAX=12

Try digit ->11
2,3,1 = 2,1 * 1,1
COMPARE resultmult < decarr TRUE, IF resultmult >= decarr FALSE 
2,3,1 VS 3,4,1
RETURNED VALUE ->true
MyVal=1,1  ->MIN=11 ->MAX=12
***FOUND NEWDIGIT***  ->11
decArr- multarr  ->3,4,1 - 2,3,1 = 1,1


This is

Thread

csiph-web