Nick Sabalausky Wrote:
Robik szad...@gmail.com wrote in message
news:j8f14s$1o78$1...@digitalmars.com...
Hi.
I'd like to share with new theme for DDOC named CuteDoc. It can be
found here: https://github.com/robik/cuteDoc .
Live demo can be foudn here: http://cutedoc.dav1d.de/ .
Robik szad...@gmail.com wrote in message
news:j8g8oj$qj7$1...@digitalmars.com...
Nick Sabalausky Wrote:
Robik szad...@gmail.com wrote in message
news:j8f14s$1o78$1...@digitalmars.com...
Hi.
I'd like to share with new theme for DDOC named CuteDoc. It can be
found here:
On 10/25/2011 1:44 PM, Trass3r wrote:
I'm working on a bot in D. I'm currently done implementing the A*
algorithm for path finding
Dump A*, D* Lite ftw ;)
Hellooo.
Correct me if I'm wrong, but in A*, I can just find a path, store it
(let's say as a string) and find a new one if it's
I recently put some time into updating my implementation of xinok sort
for D. Major changes include support for random-access ranges and custom
predicates (ab). You can download the new version here:
http://sourceforge.net/projects/xinoksort/files/D%202.0/2011-10-29/xinoksort.d/download
For
If you want to cheat, there have been books published on ant colony
optimization. I'm sure the related papers could be dug up.
Sent from my iPhone
On Oct 29, 2011, at 3:12 AM, Max Wolter awishform...@gmail.com wrote:
On 10/25/2011 1:44 PM, Trass3r wrote:
I'm working on a bot in D. I'm
Hi.
I don't think, that you have to use some advanced strategies and path
finding. I'm currently 261 with this simple code:
http://pastebin.com/1Nsb81rj With hill defense and ant grouping, you
could be imho easilly in first 100 without A* :)
2011/10/29 Sean Kelly s...@invisibleduck.org:
If you
On 10/29/2011 5:53 PM, Timon Gehr wrote:
Looks good =). Thank you. How does this implementation of your algorithm
compare to the the unstable sort that is currently in Phobos,
performance wise?
I posted some benchmarks here. These benchmarks used the specialized
code for arrays. There would
On 10/30/2011 12:19 AM, Xinok wrote:
On 10/29/2011 5:53 PM, Timon Gehr wrote:
Looks good =). Thank you. How does this implementation of your algorithm
compare to the the unstable sort that is currently in Phobos,
performance wise?
I posted some benchmarks here. These benchmarks used the
On Sun, 30 Oct 2011 01:56:23 +0300, Timon Gehr timon.g...@gmx.ch wrote:
You could use catch(Error err) or catch(OutOfMemoryError err) or not
catch the Error at all.
Note that (IIRC) an OutOfMemoryError will be thrown only when:
1) There is no space on the managed heap
2) A garbage collection
On 10/29/2011 7:19 PM, Vladimir Panteleev wrote:
On Sun, 30 Oct 2011 01:56:23 +0300, Timon Gehr timon.g...@gmx.ch wrote:
You could use catch(Error err) or catch(OutOfMemoryError err) or not
catch the Error at all.
I'll use OutOfMemoryError. If any other error occurs, it's probably best
to
10 matches
Mail list logo