Comments for Software Craftsmanship – Katas

Comment on What are Katacasts? by Rickard Nilsson

Rickard Nilsson — Wed, 21 Jul 2010 22:51:10 +0000

Hi!

I’ve recorded av C# version of the Prime Factors Kata which I’d like you to see.

I have been practicing it for a while but it is not total perfection but I think it’s interesting and since you haven’t featured a C# version yet…

You’ll find it on my blog.

Best regards / Rickard Nilsson

Comment on Codebreaker in C# by Antonio Lucca by Matthew

Matthew — Wed, 14 Jul 2010 04:02:35 +0000

Thanks. The HD link is much better, although I also had turn scaling on to make it legible in full screen.

Comment on Codebreaker in C# by Antonio Lucca by tonyx

tonyx — Mon, 12 Jul 2010 13:29:40 +0000

to watch the video on hd:
click on hd, then a link to the original url on vimeo (which is hd actually) appears.

However this the hd link: http://vimeo.com/13072671?hd=1
enjoy

Comment on Codebreaker in C# by Antonio Lucca by tonyx

tonyx — Mon, 12 Jul 2010 09:10:59 +0000

Thanks!

Comment on Prime Factors Kata — Flower Duet by Developer in Training « Rubberducking

Developer in Training « Rubberducking — Mon, 12 Jul 2010 04:19:48 +0000

[...] I started my first session with the Prime Number kata. I like this kata since it is really simple, can easily be done in less than 30 minutes (closer to 10 once you’ve done it a few times) and I learned a few useful tricks in ruby by watching this kata permormed by Uncle Bob on Katacast. [...]

Comment on Codebreaker in C# by Antonio Lucca by Matthew

Matthew — Thu, 08 Jul 2010 05:11:18 +0000

So I can only find two options for displaying this video – one embedded in the page which is too small to read, and one full screen, which is blurred and unreadable. Are there any other options for viewing this in which you can actually read the code ?

Comment on Codebreaker in C# by Antonio Lucca by Chris Cyvas

Chris Cyvas — Wed, 07 Jul 2010 15:33:16 +0000

THAT is slick! Very well done – he should be proud of his work.

Comment on Prime Factors Kata — Flower Duet by Ian Calvert

Ian Calvert — Thu, 13 May 2010 09:00:15 +0000

The tests here feel a little artificial. You can create the tests given the definition of “prime factors”. For all n >= 2, the factors must:
Be prime
Multiply together to get n

Now in almost on time you can generate thousands of test cases.

Two other points, your code might want to return an undefined for n <= 0, and the prime factors of 1 are [1].

Interesting to watch though!

Comment on String Calculator – Python by Gary Bernhardt

Gary Bernhardt — Thu, 11 Mar 2010 22:44:57 +0000

Jonathan,

The “raises” function was part of Mote, the test runner I was using. I wrote it and it’s very experimental – in fact, the current version doesn’t even have the “raises” function any more.

Comment on Prime Factors Kata — Flower Duet by Inspiration | Pyxis blog

Inspiration | Pyxis blog — Wed, 10 Mar 2010 15:41:20 +0000

[...] you read yesterday’s post and wonder where you can find motivation to start to practice, look at this. It’s a screencast of Uncle Bob doing a Code Kata. A simple exercise, but if you look at the [...]