Comments for Tsukasa's ramblings

Comment on PyGolf - Winner of competition 1 by Mathew

Mathew — Sat, 06 Dec 2008 00:55:18 +0000

Well done Katie! However, this is what I achived in Ruby in 63 chars!

m=Hash.new(0);STDIN.map{|l|m[l[/^\S+/]]+=l[/\d+\s+$/].to_i};p m

Comment on PyGolf - Winner of competition 1 by Katie

Katie — Sun, 30 Nov 2008 03:08:50 +0000

Win! :D
Just don’t try it with big numbers. :P

Comment on PyGolf - Winner of competition 1 by SI

SI — Sat, 29 Nov 2008 13:22:46 +0000

Well done katie :D

Goes to show when you decide to use regex for one problem, you just end up with two problems ;-)

Comment on Of databases and repositories by Mathew

Mathew — Tue, 07 Oct 2008 04:38:14 +0000

Interesting post! I can see a number of uses for this.

All to often programmers don’t use source control.
When they do, if they are working on a project which has a strong dependency on a database schema they often leave that out of source control leaving you with a hell of a time figuring out your schema if you want to go back in time and play with some older revisions.

Comment on What do you get when a programmer is bored on the train? by Mathew

Mathew — Wed, 01 Oct 2008 11:06:14 +0000

They keys do not have to be in quotes, and they are not dictionaries (as such)

if My JSON is:
{name: “Mathew”, age: 22}

This is called an Object Literal and should result in a JavaScript object with amongst other things a property called name with value “Mathew” etc.

Comment on Python DNS server by Tsukasa

Tsukasa — Mon, 22 Sep 2008 12:48:43 +0000

No, no prize for James.

Well, I mean… that is /one/ way they are related, just not the one I was thinking of. I was planning on reimplementing the dnsproxy stuff (as there are a few annoying bugs in it) in python.

Though maybe when I have finished this year ^^;

Comment on Python DNS server by James Bunton

James Bunton — Mon, 22 Sep 2008 09:54:30 +0000

Yeah. doxpara has a bunch of articles on the recently discovered DNS flaw.

Do I get a prize?

Comment on Round two of golf by Tsukasa

Tsukasa — Sat, 23 Aug 2008 16:45:24 +0000

James: Although that is a nice solution, it is not exactly a prime sieve… It requires the use of the modulus operator (which the prime sieve alleviates). Though, due to how python is implemented, your method might still be faster (though it does suffer from the recursion problem.

Comment on Round two of golf by James C

James C — Sat, 23 Aug 2008 02:23:33 +0000

72 characters:

_=lambda x:x and x[:1]+_([i for i in x if i%x[0]]);print _(range(2,1e3))

I should point out though that there is a limit to how high you can go with this one before you hit Python’s maximum recursion depth…
It’s also not one statement.

Comment on Round two of golf by Tsukasa

Tsukasa — Fri, 22 Aug 2008 11:46:25 +0000

Don’t forget that you are counting the newline character there… So your solution is actually 145 characters long…

I am sorry to say though, I am down to 132 (after a trip on the bus).

I have updated the main article to reflect my new solution.