Reputation
11,380
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
1 25 56
Newest
 Nice Answer
Impact
~351k people reached

2d
comment What is the best way to install Django app on a client's PC?
By "PC", do you mean a Windows machine?
2d
revised Sacrifice server validation in pos of performance with Rich Client validation?
edited body
2d
answered Sacrifice server validation in pos of performance with Rich Client validation?
Jul
30
comment Can fast, optimized server calls collapse a server?
@Korcholis: this should be enough. You can see how many requests the server can process in a few minutes of intense (simulated) load: this is throughput. You can see how long it takes for one request to complete; this is latency. The former should grow, the latter shrink. (Also, you should be able to decide which of the two is more important for you.)
Jul
29
comment Can fast, optimized server calls collapse a server?
Where I/O was previously a bottleneck (load < 1, threads waiting), now CPU is a bottleneck (load > 1 per CPU). The real question is, how did your throughput and average call latency change? Without these numbers, it's hard to tell if the optimization made sense at all.
Jul
28
comment Is it possible to miss a connection?
Your waitForConnections can die of stack overflow because you keep calling it recursively. With enough short-lived connections you'll exceed the stack depth. Since Java does not support tail-call elimination, I'd write an explicit loop.
Jul
28
comment Fast fixed-size (256 bit) integer modulo/division
Is the problem in efficient unpacking the 26-bit words?
Jul
28
answered Why is it so difficult to read code?
Jul
24
comment Does the MIT open source license implies work derivatives to be made public (under MIT license)?
Should 'dual license' look like 'if you use this software in a GPL'd product, this software is licensed to you under GPL, else, under MPL'? Are there any projects that do such a thing?
Jul
24
comment Algorithm for calculating a bullet path to a target with max. 2 ricochets
Upvoted @amon's answer; I like the idea of straight-line mirroring. Also I suppose that the algorithm should check that the hitting path is actually passable after finding it in this simplified way. Even more interesting is a possibility where the target is only partially occluded (possibly even separated into two visible regions). Amon's method is more amenable to handling it.
Jul
23
revised Algorithm for calculating a bullet path to a target with max. 2 ricochets
added 264 characters in body
Jul
23
answered Algorithm for calculating a bullet path to a target with max. 2 ricochets
Jul
23
comment Why do drawing applications use handles to connect lines to shapes?
Consider lines connecting to different sides, different 'ports' of a shape having different meaning. This might be one of the reasons.
Jul
21
comment Can programs of different languages communicate information without file io?
Note how your browser (likely a C++ program) can exchange data with StackOverflow servers that are written in C# and located half the world from you. OTOH socket I/O APIs look very similar to file I/O APIs.
Jul
17
comment Using variable + method invocation or repeating invocation?
@JoshuaTaylor: if the calculation is as trivial as in the example code, a ternary operator will indeed suffice. If the calculation is somehow longer, a final assignment to a variable in each branch will not be too much repetition. Even better, if each branch could be wrapped into a separate function, the terseness could be preserved: Print(predicate ? calculationOne() : calculationTwo()). This is not always practical because of the need to pass too much context into the functions, though.
Jul
16
answered Using variable + method invocation or repeating invocation?
Jul
16
revised Is using up 'too much' storage space a practical concern when storing only text in a database in 2015?
edited body
Jul
16
answered Is using up 'too much' storage space a practical concern when storing only text in a database in 2015?
Jul
10
awarded  Nice Answer
Jul
10
comment Should my (sequential) collection start at index 0 or index 1?
@kdbanman: The idea was to introduce a method that takes an interface as a parameter, and that interface only lists operations required for sorting; perhaps IComparable fits the bill? Then you can make your label class implement it, or assume that integers already implement it, if you use integers.