2,746 reputation
310
bio website boardspace.net
location
age
visits member for 2 years, 11 months
seen 3 hours ago

I develop games for fun.


Sep
2
answered Should I commit my generated parser to source control?
Aug
21
answered How to handle divide by zero in a language that doesn't support exceptions?
Aug
14
answered How to handle assumptions while designing any system?
Aug
9
awarded  Yearling
Aug
7
comment Methods to secure user log-in's
Just charge a subscription fee, and let them register as many times as they want to.
Aug
3
answered Flat addressing vs. segmented addressing
Jul
31
answered Garbage collectors and pointers/ reference
Jul
21
answered How should I store an old project?
Jul
21
answered What is the lowest level that you can program?
Jul
5
answered Demonstration of garbage collection being faster than manual memory management
Jul
4
comment Demonstration of garbage collection being faster than manual memory management
In any case, the most relevant question is how do you compare a GC'd program to a manually managed program with a management bug, which crashes or produces incorrect results.
Jul
4
comment Demonstration of garbage collection being faster than manual memory management
GC and non-GC don't mix well, so you can't easily just throw a switch to compare the "same" program with and without. Even if you can, the manual and gc'd strategies can have radically different memory usage profiles, and generally different real-world performance for a lot of reasons.
Jul
4
comment Demonstration of garbage collection being faster than manual memory management
That's a handwave argument. It's very difficult to compare apples to apples, but the point is they can be comparable. The one way in which GC'd programs are always faster is they are faster to develop and debug.
Jul
4
comment Demonstration of garbage collection being faster than manual memory management
To make an extreme example, you'd have to define a complete system with your own heap and heap management, which would be a great student project but too large to fit in this margin. You'd do pretty well by writing a program that allocates and deallocates random sized arrays, in a way designed to be stressful to non-gc memory management methods.
Jul
4
answered Demonstration of garbage collection being faster than manual memory management
Jul
4
comment What would be the fastest way of storing or calculating legal move sets for chess pieces?
the space of possible "faster" solutions is enormously large, and depends on an equally large space of possible confounding factors. The "fastest" solution is still the one that leaves you the most time to work on something else.
Jul
3
answered Blank lines in C
Jul
3
comment Why do most programming languages only support returning a single value from a function?
Just don't use inappropriate functions. This is no different from the "problem" posed by functions that return no values, or return non-numeric values.
Jul
2
comment Why do most programming languages only support returning a single value from a function?
Lots of the time you end up encoding information into the return value in non-obvious ways - ie; negative values are error codes, positive values are results. Yuk. Accessing a hash table, it's always messy to indicate if the item is was found and also return the item.
Jul
2
answered Why do most programming languages only support returning a single value from a function?