Java-Gaming.org Hi !
 Featured games (91) games approved by the League of Dukes Games in Showcase (808) Games in Android Showcase (239) games submitted by our members Games in WIP (872) games currently in development
 News: Read the Java Gaming Resources, or peek at the official Java tutorials
 Home Help Search Login Register
Pages: [1]
 ignore  |  Print
 Negative integer division  (Read 11352 times) 0 Members and 1 Guest are viewing this topic.
loom_weaver

JGO Coder

Medals: 17

 « Posted 2011-11-21 00:32:35 »

Here's a puzzler for you.

Given the following coordinates (same for x or y-axis):
 1 ...|-300 ... -201|-200 ... -101|-100 ... -1|0 ... 99|100 ... 199|200 ... 299|...

Can you come up with a simple function that given an int, returns the anchor point?  The anchor point is the left-hand number in the range and is a multiple of 100.  For example for any value between -200 ... -101 return -200.  For 100 ... 199 return 100.

The biggest problem for me is that integer division of negative values seems to be different from language to language!  (-1 / 100) gives me -1 in python but 0 in Java.

Otherwise I'd use f(x) = x / 100 * 100
Riven

« JGO Overlord »

Medals: 1371
Projects: 4
Exp: 16 years

 « Reply #1 - Posted 2011-11-21 00:38:45 »

 1 return (x - ( x<0 ? 99 : 0 )) / 100 * 100;

Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings!
SimonH
 « Reply #2 - Posted 2011-11-21 00:55:05 »

Another option would be to limit the play area to +ve coordinates only.
Integer.MAX_VALUE*Integer.MAX_VALUE is a quarter the size but it's still very, very big!

People make games and games make people
 Games published by our own members! Check 'em out!
theagentd
 « Reply #3 - Posted 2011-11-21 01:17:13 »

 1 return (x - ( x<0 ? 99 : 0 )) / 100 * 100;

... or just
 1 return (int)Math.floor(x/100.0);

It might be slower, though, but it's at least more readable.

Myomyomyo.
counterp

Senior Devvie

Medals: 11

 « Reply #4 - Posted 2011-11-21 02:00:02 »

 1  2  3 public static final int anchor(int in) {      return (in / 100 + (in >> 31)) * 100;   }

or

 1  2  3 public static final int anchor(int in) {      return (in / 100 - (in >>> 31)) * 100;   }

depending on if you want -100 to be -200 or -100
Riven

« JGO Overlord »

Medals: 1371
Projects: 4
Exp: 16 years

 « Reply #5 - Posted 2011-11-21 02:18:31 »

 1  2  3 public static final int anchor(int in) {      return (in / 100 + (in >> 31)) * 100;   }

or

 1  2  3 public static final int anchor(int in) {      return (in / 100 - (in >>> 31)) * 100;   }

depending on if you want -100 to be -200 or -100
both these examples are incorrect (partly because they are identical), loom_weaver is very clear about the spec. you're off by one for all negative multiples of 100. there is a reason i used 99 as opposed to 100 in my solution. both -1 and -100 should result in -100.

Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings!
loom_weaver

JGO Coder

Medals: 17

 « Reply #6 - Posted 2011-11-21 02:36:40 »

 1 return (x - ( x<0 ? 99 : 0 )) / 100 * 100;

f(-250) = -400.  Should be -300.

I think this is the best I can do.  I was hoping for a non-branching version:

 1  2  3  4  5  6  7 int anchor(int x) {    if (x < 0) {        return -((-x + 99) / 100 * 100)    } else {        return x / 100 * 100    }}
Riven

« JGO Overlord »

Medals: 1371
Projects: 4
Exp: 16 years

 « Reply #7 - Posted 2011-11-21 02:42:12 »

 1 return (x - ( x<0 ? 99 : 0 )) / 100 * 100;

f(-250) = -400.  Should be -300.
I don't know how you tested that, but it simply returns -300, as it should.

 1  2  3  4  5  6  7  8  9 public static final int anchor(int x)   {      return (x - ( x<0 ? 99 : 0 )) / 100 * 100;   }   public static void main(String[] args)   {      System.out.println(anchor(-250)); // "-300"   }

Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings!
loom_weaver

JGO Coder

Medals: 17

 « Reply #8 - Posted 2011-11-21 02:54:41 »

Oops... was testing in Python again.  Argh.  Oh well my lesson learned is be careful with division involving -ve integers.

In the old C standard it did not define what direction to round to (-ve INFINITY or 0) if dividing with a negative int.  In later standards, it rounds towards zero.

http://stackoverflow.com/questions/828092/python-style-integer-division-modulus-in-c
http://stackoverflow.com/questions/319880/integer-division-rounding-with-negatives-in-c
Riven

« JGO Overlord »

Medals: 1371
Projects: 4
Exp: 16 years

 « Reply #9 - Posted 2011-11-21 02:57:02 »

As you were hoping for one, here is a non-branching solution:

 1  2  3  4 public static final int anchor(int x)   {      return (x - ((x >>> 31) * 99)) / 100 * 100;   }

Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings!
 Games published by our own members! Check 'em out!
Riven

« JGO Overlord »

Medals: 1371
Projects: 4
Exp: 16 years

 « Reply #10 - Posted 2011-11-21 02:59:27 »

If you want the offset (relative to your anchor), in a non-branching way:

 1  2  3  4 public static final int offset(int x)   {      return (x%100+100)%100;   }

Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings!
loom_weaver

JGO Coder

Medals: 17

 « Reply #11 - Posted 2011-11-21 03:03:48 »

Dang... taking the high-order bit and multiplying by 99.

Thanks for the formulas guys!
Riven

« JGO Overlord »

Medals: 1371
Projects: 4
Exp: 16 years

 « Reply #12 - Posted 2011-11-21 03:06:10 »

it you really want to get it 'fast', you can take out the multiply...
 1 ((x >>> 31) * 99) == ((x >> 31) & 99)

Hi, appreciate more people! Σ ♥ = ¾
Learn how to award medals... and work your way up the social rankings!
ra4king

JGO Kernel

Medals: 508
Projects: 3
Exp: 5 years

I'm the King!

 « Reply #13 - Posted 2011-11-21 05:40:59 »

 1 return (x - ( x<0 ? 99 : 0 )) / 100 * 100;

... or just
 1 return (int)Math.floor(x/100.0);

It might be slower, though, but it's at least more readable.
Your example is completely incorrect

@Riven
That last one returns true or false, not a value. What is its purpose?
Hehe looked at it a bit more and realized that you mean to substitute the right-hand side for the left-hand side. Wow that is quite clever and much much faster!

Pages: [1]
 ignore  |  Print

 Riven (847 views) 2019-09-04 15:33:17 hadezbladez (5791 views) 2018-11-16 13:46:03 hadezbladez (2603 views) 2018-11-16 13:41:33 hadezbladez (6207 views) 2018-11-16 13:35:35 hadezbladez (1499 views) 2018-11-16 13:32:03 EgonOlsen (4734 views) 2018-06-10 19:43:48 EgonOlsen (5792 views) 2018-06-10 19:43:44 EgonOlsen (3276 views) 2018-06-10 19:43:20 DesertCoockie (4175 views) 2018-05-13 18:23:11 nelsongames (5501 views) 2018-04-24 18:15:36
 A NON-ideal modular configuration for Eclipse with JavaFXby philfrei2019-12-19 19:35:12Java Gaming Resourcesby philfrei2019-05-14 16:15:13Deployment and Packagingby philfrei2019-05-08 15:15:36Deployment and Packagingby philfrei2019-05-08 15:13:34Deployment and Packagingby philfrei2019-02-17 20:25:53Deployment and Packagingby mudlee2018-08-22 18:09:50Java Gaming Resourcesby gouessej2018-08-22 08:19:41Deployment and Packagingby gouessej2018-08-22 08:04:08
 java-gaming.org is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑gaming.org