One of those moments where an interview question turns into a research project, or is it really a bake off? The simple problem is demonstrate an algorithm to intersect two lists of numbers, fundamentally it’s a question about using modern interpreted languages and their associative array bits to make a simple …

Read More

Way to carried away with this… here’s the SpiderMonkey version (as opposed to the rhino) one. Biggest complaint is the File object is a bit of a pain to use… 1fd = File('p.test'); 2fd.open("read",'text'); 3 4mre = /^MULTI_TOKEN\s+(\S+)\s+(.)\t?\s(\d+)\s*$/; 5sre = …

Read More

Using the Rhino compiler… sorry no benchmark numbers, but just as a placeholder. To pick a nit, wanted to do first[m[1]] += parseInt(m[3]) but that yeilded a NaN since first[m[1]] was undefined... You would think that JavaScript would make undefined == 0. 1fd = …

Read More

Had a 7GB text file that I needed to run some parsing on (to prepare for a DB import). As part of my habit I pulled out perl and whipped up a quick program to parse and generate some loadable files. While watching it run I got to thinking about … why … why perl (yes, I know habbits are hard to break). So while watching …

Read More