3,036 reputation
11222
bio website
location
age
visits member for 4 years, 3 months
seen Apr 2 at 19:28

Mar
19
comment Card deck and sparse matrix interview questions
@supercat, yes, exactly. The point of the upper bits is that after ORing the masks of the cards the lookup table for detecting a straight only requires 2^13 entries rather than 2^39.
Jan
14
awarded  Yearling
Nov
28
comment Where is it specified that Java is call by value?
"This gives the appearance to people familiar with C, that Java does in fact always pass around references" suggests to me that you're claiming that Java doesn't pass around references. In the language of Java's type system, the values that it passes are all either primitives of references. I'm not sure whether there's a different wording which is less likely to mislead people, though, because the problem is that different communities use the same word with different connotations.
Oct
23
answered Is it possible to make a printable 'template' document?
Oct
1
comment Are long compiles a thing of the past?
javac isn't "skipping the upfront compilation and linking costs altogether". It skips a lot of optimisation costs, but it's still transforming source to bytecode and doing lots of static checks in the process. It does about as much linking as a C compiler. The real performance difference is that Java's compilation process was designed in an era when it was assumed possible to load the entire program and its dependencies into memory at once rather than having to break it down into tiny chunks and reprocess the same files thousands of times.
Sep
30
awarded  Explainer
Aug
1
comment Why should i write a commit message?
@iSid, user1249 beat you to that comment by 3.5 years.
Feb
3
comment Selecting a point inside a non-convex polygon
That's why "triangulate" is the first step.
Feb
3
answered Selecting a point inside a non-convex polygon
Feb
3
comment Selecting a point inside a non-convex polygon
When you ask for a "better" approach, how are you weighting computational complexity vs distance from boundary?
Jan
14
awarded  Yearling
Jan
13
awarded  Nice Answer
Jan
13
answered Questions about God's algorithm and Rubik's cube
Jan
13
comment Questions about God's algorithm and Rubik's cube
Nonsense. There's already a standard method which improves on breadth-first search in a permutation space: it's variously called meet-in-the-middle, bidirectional search, and probably one or two other names.
Nov
29
awarded  Enlightened
Nov
29
awarded  Nice Answer
Oct
15
answered What's wrong with this approach to CSS?
Sep
27
revised How to solve binary labeling with graph cut?
Emphasise the key point which justifies the summation
Sep
27
comment How to solve binary labeling with graph cut?
@RifatRousseau, sum them. That's the sum in my "Putting it all together".
Sep
27
revised How to solve binary labeling with graph cut?
We're minimising energy, not maximising it! That simplifies things