Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.javascript > #27186
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Newsgroups | comp.lang.javascript |
| Subject | Re: Javascript comparissons cause overflow |
| Date | 2015-04-04 16:01 +0100 |
| Organization | A noiseless patient Spider |
| Message-ID | <877fts0wfq.fsf@bsb.me.uk> (permalink) |
| References | <5e062687-8e2f-4bc3-94ce-e42df1cb1288@googlegroups.com> <22e81bec-1e4d-4022-9e14-f72074c17015@googlegroups.com> |
jonas.thornvall@gmail.com writes: > Den lördag 4 april 2015 kl. 09:35:04 UTC+2 skrev jonas.t...@gmail.com: >> After i managed to write some functions actually doing arithmetic in >> bignumbers, basicly by handling them as strings where digit places >> read into an array. >> >> I decided to try change a previously written basechanger into also >> handling bignumbs. And it proved to be a much harder task than i >> origially thought. >> >> How do you go from compare size of integers to compare size of >> stored digitplaces in arrays? I can't interpret this question. Comparing bignums should not be hard. <snip> > This is probably why bignumb should be supported right out of the box > in programming languages. Many languages have unbounded integers and/or some other form of bignum built-in (even more have them as a library extension but that can be less convenient). Is there a reason you have to use javascript? <snip> -- Ben.
Back to comp.lang.javascript | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Javascript comparissons cause overflow jonas.thornvall@gmail.com - 2015-04-04 00:34 -0700
Re: Javascript comparissons cause overflow jonas.thornvall@gmail.com - 2015-04-04 00:47 -0700
Re: Javascript comparissons cause overflow Ben Bacarisse <ben.usenet@bsb.me.uk> - 2015-04-04 16:01 +0100
Re: Javascript comparissons cause overflow John Harris <niam@jghnorth.org.uk.invalid> - 2015-04-04 17:44 +0100
csiph-web