13,005 reputation
22452
bio website
location
age
visits member for 3 years, 6 months
seen 7 hours ago

Nov
5
comment How to avoid spaghetti code when I have a lot of conditions?
Karnough maps
Nov
5
answered OOP: relying on protected properties in a class-subclass contract
Nov
5
revised how to implement idempotent webservice calls
added 498 characters in body
Nov
4
answered how to implement idempotent webservice calls
Nov
4
awarded  Explainer
Nov
3
comment Why is most SQL written in YELLING?
it's case INsensitive, SQL doesn't care whether you type DELETE or delete
Nov
3
answered Java Streams API Documentation
Nov
3
revised Java Streams API Documentation
formatting
Nov
3
comment In-place merging of sorted intervals in an array?
asked and answered on SO: stackoverflow.com/q/2571049/731620
Nov
2
answered Generics in low level languages
Nov
2
comment How to Safely Sell Source Code?
@InteXX a laywer will be able to write up a proper sales contract and advice on the transfer of copyright/license, and suing someone for failure to pay is generally a open&shut case and no-one wants the bad press of being a defaulter
Nov
2
comment Autoreleasing objects in Reference Counting Systems
@NSAddict well unless you have actual RAII language support (where destruction happens after the copy to the callers variable) then that is a decent second choice
Nov
1
answered Autoreleasing objects in Reference Counting Systems
Nov
1
comment How to Safely Sell Source Code?
Talk to a laywer
Oct
31
comment How to avoid long call chains?
use breakpoints in the A class?
Oct
30
answered Usage of the argv[0]
Oct
29
comment Pair programming via mailing list
A "Mailing List" isn't purely email, it allows conversation threads, and FOS projects generally have a issue tracker where you can submit patches
Oct
27
comment How to get a one-way hash function that is collision safe for about 1 million unique inputs?
@CodesInChaos unless he needs a stateless hash function
Oct
27
comment How to get a one-way hash function that is collision safe for about 1 million unique inputs?
you'll need only ~40 bits in the hash output, (unless I remember the birthday paradox wrong)
Oct
26
comment Original source of `(seed * 9301 + 49297) % 233280` random algorithm?
it's a linear congruent generator but with a fairly small period (only 233k while a 32 bit int allows have a 4 billion period