Virtual Machines to test FlashI recently had a problem that some of my Flash programs were not behaving correctly when served from my http://disemia.com/ website. This led to a very difficult situation of being able to properly test my flash. (more…) by edA-qa mort-ora-y on Thursday May 15 2008 @ 19:35:56 |
Computing ↪Technology |
The Dictionary Trie, An efficient word and prefix lookup algorithmLoading the words of a dictionary into an in-memory structure for the purpose of lookups occurs quite commonly in computing. That is, if we allow word to mean any sequence of bytes, letters, or other structured data. Indeed such lookup is one of the cornerstones of computing. (more…) by edA-qa mort-ora-y on Sunday May 11 2008 @ 12:23:56 |
Computing ↪Technology |
How I built Worgle, a Boggle-like gameI've always wanted to write a word game like Boggle: a game where the player has to form words using the letters on dice. It's a fun game, and would be a good addition to my Flash library. So I built Worgle, or I should say, am building Worgle. (more…) by edA-qa mort-ora-y on Sunday May 11 2008 @ 12:20:45 |
Computing ↪Technology |
Reply To Knuth on Extreme ProgrammingReusing code is like reusing toilet paper. (replies…) by Some Clown on Thursday May 08 2008 @ 20:52:54 in reply to Knuth on Extreme Programming |
Computing ↪Technology |
Knuth on Extreme ProgrammingFrom an interview with Knuth "Still, I hate to duck your questions even though I also hate to offend other people’s sensibilities—given that software methodology has always been akin to religion. (more…) by Vlad on Wednesday April 30 2008 @ 23:41:39 |
Computing ↪Technology |
Knuth on Extreme ProgrammingFrom an interview with Knuth "Still, I hate to duck your questions even though I also hate to offend other people’s sensibilities—given that software methodology has always been akin to religion. (more…) by Vlad on Wednesday April 30 2008 @ 23:41:29 |
Computing ↪Technology |
Reply To how to unit test a permutation tree?I've not come to an easy solution that tests just the permutation tree -- in particular the boggle matrix case. There is however a reasonable test for the full boggle anagram finding algorithm. (replies…) by edA-qa mort-ora-y on Friday April 18 2008 @ 22:16:47 in reply to how to unit test a permutation tree? |
Computing ↪Technology |
how to unit test a permutation tree?How does one unit test a permutation tree? I have one and am faced with this question. (more…) by edA-qa mort-ora-y on Friday April 11 2008 @ 15:58:10 |
Computing ↪Technology |
Updated BrainBrain versionThis new version supports: -editing of your old notes -clipped viewing in the main lists, with link to full note -basic bbcode parsing, only bold and italic are supported now (replies…) by edA-qa mort-ora-y on Friday April 04 2008 @ 21:08:10 |
Computing ↪Technology |
new brain versionThis version supports private topics, editing, and many other small changes (replies…) by edA-qa mort-ora-y on Saturday March 29 2008 @ 23:13:30 |
Computing ↪Technology |
© edA-qa mort-ora-y 2008