Re: Yet another incomplete D cryptography library.
Nice. Will you implement RSA? On 10.8.2012 00:13, Nvirjskly wrote: This is a skeleton library that I decided to push out in order to motivate myself to finish it. It supports AES, and Threefish in terms of block ciphers, and SHA1. I want to implement all SHA3 finalists, fast hashes like murrmurr, and many more block ciphers (DES c.) https://github.com/Nvirjskly/cryptod
Re: TDPL monthly sales at 12-month high
Yeah, its great book, probably the best I've read about programming. On 27.2.2012 14:16, MattCodr wrote: I started reading this book a couple of days ago and one thing that I liked on this book, is not only about D, but about design and implementation too.
Re: D to Javascript converter (a hacked up dmd)
I think once you get past the horror that is building gcc for your target platform, the big issue remaining is that druntime needs to be ported. There is actually gdc package in debwrt, but it is D1 :( You'll hit the same issue with a D-C translator, so it might be better just to work on the actual runtime. Well, I don't consider myself as enough skilled programmer to work at gdc.
Re: D to Javascript converter (a hacked up dmd)
ADM 5120 is MIPS, right? Are you trying to build a cross compiler or a compiler running on the MIPS itself? Compiler running on the MIPS. And MIPS is probably also affected by GDC issue 120, so you have to configure like this: DFLAGS=-fno-section-anchors ./configure [configure arguments here] Thanks.
Re: D to Javascript converter (a hacked up dmd)
I've played with gdc, but it's pretty complicated. I have few ADM 5120 routers with debwrt and it would be nice to be able compile D2 code there, but so far, it was just fail. C run pretty much everywhere and metacompiler D2C would be nice.. On 1.3.2012 09:05, Daniel Murphy wrote: Bystroushaak bystrou...@kitakitsune.org wrote in message news:mailman.239.1330541205.24984.digitalmars-d-annou...@puremagic.com... Thx. On 29.2.2012 18:03, Robert Clipsham wrote: On 29/02/2012 16:56, Bystroushaak wrote: Daniel Murphy's microd fork of dmd, meant to output C Link please. https://github.com/yebblies/dmd/tree/microd Don't get your hopes up, it was more of an experiment than a serious fork, I have no intention of doing anything more with it (unless I get really bored again). It does work, but the effort is probably better spent on improving gdc's support of embedded platforms.
Re: D to Javascript converter (a hacked up dmd)
Daniel Murphy's microd fork of dmd, meant to output C Link please.
Re: D to Javascript converter (a hacked up dmd)
Thx. On 29.2.2012 18:03, Robert Clipsham wrote: On 29/02/2012 16:56, Bystroushaak wrote: Daniel Murphy's microd fork of dmd, meant to output C Link please. https://github.com/yebblies/dmd/tree/microd
Re: AI Challenge - Ants
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 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 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 blocked for some reason. As far as I could see from what I've read about Lifelong A*, D*, Focused D* and D* Lite, I would have to store all nodes used in the algorithm - so, as opposed to A*, I have to conserve the state of the entire search algorithm throughout ticks, for each ant. Is the environment in this AI challenge really noisy enough to warrant this? Obviously, if the path needs to be re-planned almost every tick, D* Lite seems like a better choice to me. But if you have 100+ ants, that would be a lot of allocated heap memory, wouldn't it? I really don't have a clue how the processing vs allocating should be weighed here performance-wise. /Max
HTTP client and HTML parser
Hello. I've created D2/phobos based HTML parser and HTTP client, which could be also usefull to others than me. If you want to try it, you can find them here: https://github.com/Bystroushaak/DHTMLParser and here: https://github.com/Bystroushaak/DHTTPClient It isn't something special or profesional, but as far as i know it works..
