Welcome to the Wing Ding! We're one or more semi-formal study groups in the Seattle/Bellevue area.
Here is where you'll find meeting announcements, some planning discussions, and occasionally meeting recaps. Most of the "what is art" type discussion happen on other lists (e.g. SeaJUG).
We are currently studying "Programming Scala" by Dean Wampler and Alex Payne.
Past iterations of Wing Ding have included Best Practices in Java ("Effective Java, 2nd Edition" by Bloch), Concurrency and Transactional Memory ("Java Concurrency in Practice" by Goetz, Peierls, Bloch, Bowbeer, Holms, and Lea and "Concurrent Programming in Java" by Lea), Design Patterns (GoF + Industrial Logic's Study Guide), Collective Intelligence ("Programming Collective Intelligence" by Toby Segaram), Ajax + GWT, and Functional Programming (SICP). Who knows what the future may hold?
Interesting. Looks like Lisp. What "order" is your algorithm? Mine is O(n log m), where n is length of input and m is size of set. The algorithm does a couple
Because I couldn't help myself here is a clojure implementation of Joe's problem. I suspect the combination-seq function could be made lazy which would
On Wed, Nov 25, 2009 at 13:44, P.Hill & E. Goodall ... "I create an anonymous function ad hoc" Come to think of it: How can an anonymous function be anything
... "I adhoculous create an anonymous function"? Hmm... I want to say "I adhoculously create an anonymous function" :-) But I see your dictionary reference