420 reputation
515
bio website
location United Kingdom
age 30
visits member for 3 years, 2 months
seen Jul 3 at 14:41

This is just here so I get the nice drop-shadow!


Jul
1
comment using this in a constructor, why does it work?
The object might not be finished being constructed, but we know where it will be (in memory) when it is, hence we can get a reference to that location.
Oct
19
comment One dimensional cutting algorithm with minimum waste
Regarding cutting width just increase all the required lengths by that cutting width.
Oct
19
comment One dimensional cutting algorithm with minimum waste
This sounds like the Bin Packing Problem where the bins are the size of your rods and the object sizes are the lengths of material required. stackoverflow.com/questions/tagged/bin-packing
Oct
18
comment It's hard to judge your own product. Is there a name for this issue?
This might be a question for english.stackexchange.com
Sep
30
comment Abstract class + Inheritance vs Interface
You can't have fields in interfaces, so ToleranceLevel would probably be a get property.
Sep
14
comment Is there a constant for “end of time”?
Maybe slightly of interest: How do I reset the time on my computer without turning it on?
Aug
17
comment Should I take care of race conditions which almost certainly has no chance of occuring?
"others have said that if there's even a 0.00000000000000000000000000000000000000000000000000001% (I kid you not on the numbers, this is what I've heard)" I hope they said that number in scientific notation! :)
Apr
26
comment How does Google crawl frequently updated webpages?
See also what google has to say (not much): support.google.com/webmasters/bin/…
Apr
20
comment When should you use bools in C++?
Not sure about efficiencies, but the purpose of an int is to store an integer and the purpose of a bool is to store a boolean value (true or false). Using a bool IMO reflects its use much better than using an int.
Mar
26
comment C is written in C, how is this possible?
Possible duplicate: "Chickens come from eggs but eggs come from chickens, how is this possible?" :)
Mar
21
comment Where to find algorithms work?
Maybe game development, or somewhere else where efficiency can matter.
Mar
20
comment I have a stacktrace and limit of 250 characters for a bug report
If I end up needing help with actual coding I'll ask that as a separate question on SO. I'm more interested in the ideas/algorithms here.
Mar
1
comment Test bed application for executing LinQ queries against AdventureWorks
If this had been posted on stackoverflow there would be at least 10 identical answers by now. I'm surprised I'm the first here after 10 minutes.
Feb
6
comment How do I efficiently store all OpenStreetMap data in an indexed way?
Chances are the road you are on will be the edge you're nearest to though. I suppose the only issue would be which of the 2 nodes on the should you go to first. Possibly you could store the 'mid-point' along each edge at which it makes no difference, then always initially move away from that point.
Feb
6
comment How do I efficiently store all OpenStreetMap data in an indexed way?
It also depends on the definition of 'junction' the meaning that would reduce the most, but would be least accurate would simply be where 2 or more roads meet. An alternative could be where a property of the road changed (i.e. Minor->Major, 30km->40km etc).
Feb
6
comment How do I efficiently store all OpenStreetMap data in an indexed way?
For path-finding you can probably get away with reducing the number of nodes, for example, if a road (between junctions) has several nodes, where there are changes in the speed limit that doesn't matter as once you're on that road you have to continue to the next junction. Just take care when reducing nodes to take into account different speed limits and lengths of those speed limits. The same goes for # of lanes, you'd just have to reduce it to an appropriate edge weight.
Feb
6
comment How do I efficiently store all OpenStreetMap data in an indexed way?
You'd have to balance the threshold between including more nodes (larger size) and including fewer nodes (less accurate) I guess. Suppose the first step is being able to generate a smaller DB containing only junctions and end points.
Jan
16
comment Using static classes as namespaces
Also, if someone wants to not use namespaces, even using classes the can: using Item1 = CategoryA.Item1 (i think that works for nested classes as it does for namespaces)
Nov
26
comment What are some common examples of a Parallelizable problem?
It could come under image processing in the same way that raytracing can. I think it's a big enough topic to appear separately. Also, it's not quite image processing as, like ray tracing, you produce an image but don't start with one.
Nov
26
comment What are some common examples of a Parallelizable problem?
Each pixel has its value calculated independently of the others.