I am interested in the cKanren and go meetings, and I would be happy
to add myself to them if given spreadsheet access.
Jim
On Oct 31, 6:36 am, Fogus wrote:
> I've added everyone to this thread as an editor of the spreadsheet.
> Please feel free to add yourself and your sessions at your leisure
Using PriorityQueue should give a good, fast result. Here's my
implementation:
(defn smallest-n [n xs]
(let [q (java.util.PriorityQueue. xs)]
(for [i (range n)] (.poll q
(smallest-n 5 (shuffle (range 100)))
;; (0 1 2 3 4)
Jim
--
You received this message because you are subscribed to
On Jul 20, 7:01 pm, Mark Engelberg wrote:
> Where is the original problem statement?
It is hidden in Powerpoint slides (http://butunclebob.com/files/
downloads/Bowling%20Game%20Kata.ppt) linked on the description of the
bowling game (http://butunclebob.com/
ArticleS.UncleBob.TheBowlingGameKata).
My main concern was that the problem statement doesn't just specify
the score function but also a roll function to accumulate the ball
rolls. Obviously this will be different in Clojure since we would
prefer immutable data structures, but it feels like we're losing part
of the problem by ignoring
On Jul 20, 4:59 am, Perttu wrote:
> He is not totally satisfied with what he came up with - especially on
> the Unit Testing side. If you have any suggestions how to make it
> cleaner and more explicit, leave them in the comments there.
I left some comments about changes I thought were worth mak
