Re: Seattle Clojure meeting

I'm in! But on 11th. I cannot make it on 15th On Wed, Feb 3, 2010 at 7:01 PM, Phil Hagelberg wrote: > Hello, clojurists of Seattle. > > Let's meet! I'm thinking of getting folks together from 7pm to 9pm at Zoka > in the University District: http://bit.ly/c9jinW Topics may include > Leiningen, d

Clojure for system administration

Hi, I was wondering if the time is right to replace Perl/Bash/Ruby/Python with Clojure for system administration / dev productivity scripts. I would not do things in Java (for obvious reasons), but clearly Clojure is more concise than Java in most cases. I would however want to know in detail if i

Re: Heap implementation in Clojure

What is the time and space complexity for your implementation? Equals the normal non-functional implementation? On Tue, Feb 2, 2010 at 7:31 AM, e wrote: > i was messing around a while back with this: > http://code.google.com/p/jc-pheap/ > > the algorithms work, but it's probably in a between-sta

Re: Debugging in Clojure

010 10:08:45 +0200 > > > > > > > > > > > > Miron Brezuleanu wrote: > > > Hello, > > > > > On Fri, Jan 22, 2010 at 3:14 AM, ajay gopalakrishnan < > ajgop...@gmail.com>wrote: > > > > > > Hi, > > > > > > I usually debug

Re: Clojure Conference Poll

I vote for Seattle. On Fri, Jan 22, 2010 at 1:15 PM, Wilson MacGyver wrote: > I vote let's turn this into a clojure vacation, and hold it in an > exotic location. > > Otherwise, hey, Columbus Ohio is as good as any other city. :) > > On Fri, Jan 22, 2010 at 3:50 PM, Sean Devlin > wrote: > > Clea

Re: Debugging in Clojure

Is this the preferred way of debugging in Clojure? On Thu, Jan 21, 2010 at 5:25 PM, Richard Newman wrote: > I usually debug by adding println statements. How can I achieve the same >> effect in Clojure. I don't think I can introduce println at arbitrary places >> to figure out at which step is t

Debugging in Clojure

Hi, I usually debug by adding println statements. How can I achieve the same effect in Clojure. I don't think I can introduce println at arbitrary places to figure out at which step is the algorithm failing. Thanks, Ajay -- You received this message because you are subscribed to the Google Grou

Re: Good "refs" on concurrency?

I think the strongest argument I ever found and which indicates the complexity involved with Concurrent programming are the following 2 articles: 1. The too much milk problem This is taken fr

Re: I'm going to teach Clojure at university - suggestions/comments?

I think it is better not to say "It is a better Lisp" although it actually is in many ways. Talking about its other Concurrency features and advantages of side-effect free programming is a good way to interest the students in this world dominated by OOPs Ajay On Wed, Jan 13, 2010 at 10:58 PM, mac

Re: ANN: 6pm Sat, Dec 9th: Wraith Scheme, Paralell & Distributed Clojure at the Hacker Dojo

It's Jan 9 I guess On Wed, Jan 6, 2010 at 10:53 PM, nallen05 wrote: > Two very cool presentations this Saturday at the Hacker Dojo in > Mountain View: > > 1. An introduction to Wraith Scheme by Jay Reynolds Freeman > 2. An introduction to parallel and distributed programming with > Clojure by Am

Re: Google-collections

AFAIK, Clojure's persistent data structures resolve many of the scenarios where immutability is desired. Scenario in which I think immutability is highly desired are as follows: *Scenario 1*: Non-concurrency related reason. One of the non-concurrency related reason for immutability (I dont recall

Re: Parenthesis Inference

I was watching "Pleasantville" again and it reminded me of this whole argument. On Mon, Dec 21, 2009 at 6:39 PM, Joost wrote: > On 21 dec, 15:38, kyle smith wrote: > > Martin, you're trying to argue that some hypothetical 'unwashed > > masses' of programmers won't like clojure because of parent

Re: Parenthesis Inference

It's better if we can support both. It's never one size fits all. On Sun, Dec 20, 2009 at 11:49 AM, Sean Devlin wrote: > Alex, > > I just thought of something. I think we're all forgetting the amount > of hacking done at the REPL. > > ;This is easy to type > user=>(from (too (many (parens >

Re: Advice for someone coming from an OO world?

I don't know if anybody mentioned this before, (it was not suggested to me when I asked a similar question earlier), but Stuart's explanation on OOP in Clojure is the best I've ever found. It's simple, clear and takes on each of the 4 pieces nicely. http://blog.thinkrelevance.com/2009/8/12/rifle-o

Re: Parenthesis Inference

Precedence is an overrated thing. You dont run into that issue every day. When we do we have the support of (). So, a developer must have the option to disambiguate it when necessary, but otherwise should not have to type the otherwise redundant () all the time. (All this talk is about arithmetic e

Re: Parenthesis Inference

Yes, Martin, please give it a try. Only then can we know if the parenthesis is real issue or not. There is no point arguing about it. The only disadvantage is that, over time, people will forget that it is actually a list. But, hey, if it does not prevent us from writing efficient and correct code

Re: Parenthesis Inference

> Is it possible that people are confusing their inability to comprehend > deeply nested function calls (no offense intended by that - I hit this > often myself) with the strangeness of the perens? I think what others > have said about having to think more about each line of Clojure is > true. It

Re: Parenthesis Inference

I think this discussion is getting too long, but anyway .. Coming from an imperative background, especially Java which is a lot bloated, when I tried to read Lisp code, I start to get the feeling that I am staring at the same place for a long time. In an imperative setting, it definitely means tha

Re: Parenthesis Inference

The intended audience are Software Engineers. Not the people who hide behind "this-is-not-intuitive" their lack of willing to learn the most effective way to spend their professional life. Why is it that you believe them to be mutually exclusive events? You portray Software engineers as if they ar

Re: Parenthesis Inference

Hi, I've a different take on the entire thing. Based on my experience I have realized the following: 1. A lot of software engineers do not have a CS background. Out of them, many joined this field for the fun of coding and are willing to learn new things. I know many like that. However,

Re: Call for masters thesis ideas (possibly related to Clojure)

Put *Comparative performance evaluation of Java threads for embedded applications**: Linux thread vs. Green thread Google, and click the second link that says [PDF]. It is for free. * On Fri, Dec 18, 2009 at 7:20 PM, Patrick Kristiansen < patrick.kristian...@gmail.com> wrote: > On Dec 18, 11:06

Re: Call for masters thesis ideas (possibly related to Clojure)

Hi, An idea I was interested in (more from an learning opportunity perspective than thesis) is provided more Persistent data structures. As of now, we have the the Array mapped Hash tree based structure that works well for Vectors, Maps and Graphs too. What I feel is missing is Tree based structur

Re: Any interest in a Nova Clug?

Seems like a wrong place to ask, but is there a Seattle Clojure Group too? Where can I find this info? Thanks, Ajay On Thu, Dec 17, 2009 at 3:22 PM, tcg wrote: > I'm interested. > > On Dec 16, 1:14 pm, Matt wrote: > > I'm looking into setting up a Northern Virginia Clojure User Group and > > w

Re: Clojure analysis

I was about to point out this reference, but realized Rich has already already given a nice explanation. Good to know that this newbie (myself) is on the right track! On Thu, Dec 17, 2009 at 3:24 PM, Rich Hickey wrote: > > > On Dec 17, 2:16 pm, Martin Coxall wrote: > > On 17 Dec 2009, at 10:04,

Re: How to efficiently compare related persistent collections (maps, sets)?

If the sets data structure is also not shared, then the paper I mentioned (link provided earlier) is one of the fastest to date. And it is very small & easy to implement. On Wed, Dec 16, 2009 at 2:59 PM, Dragan Djuric wrote: > Yes, the true/false for equality is not a problem. > > I am looking f

Re: How to efficiently compare related persistent collections (maps, sets)?

Your argument is right and it is a good idea to take advantage of the shared structure to calculate differences. However, it is important to remember that is is just a special case and I don't expect that whenever you want to calculate a difference between two sets, you always compare between the o

Re: Clojure newbie question regarding compile time type checking.

, Perl, and later Ruby, so this is what feels most natural to me. > > On Tue, Dec 15, 2009 at 8:43 AM, Laurent PETIT wrote: > >> >> >> 2009/12/15 ajay gopalakrishnan >> >> Oh ... I know all that. What I wanted to know is that is there any way to >>> FOR

Re: Clojure newbie question regarding compile time type checking.

Oh ... I know all that. What I wanted to know is that is there any way to FORCE compile time checking by providing some flag or the other to Clojure compiler. If not, I guess a good set of test cases is the only way to fix it. (Good test cases are always recommended, it's just that in this case it

Re: Mapping OOPS concepts to Clojure? Doable or Wrong thinking?

to do, etc. >> >> So there's really no problem with your questions, apart the fact that >> they're certainly too general to get a comprehensive answer. >> >> I (as other already did in this thread) encourage you to experiment with >> some concrete exampl

Clojure newbie question regarding compile time type checking.

It tried the following in REPL and got no error. Personally, I feel that I should get an error because calling square on strings is wrong in both cases. Is there a way out of this in Clojure? (defn square [n] (* n n)) (if (= 0 0) (println "hello") (map square ["a" "b"])) The following gives erro

Re: Mapping OOPS concepts to Clojure? Doable or Wrong thinking?

@Joost , Excellent Description. Of the sort that I was really hoping for! Indeed a heavy meal to digest, for an OOP person, but I see your point. Thanks! Ajay On Sat, Dec 12, 2009 at 12:21 PM, Joost wrote: > On 12 dec, 14:13, ajay gopalakrishnan wrote: > > Hi, > > > > I c

Mapping OOPS concepts to Clojure? Doable or Wrong thinking?

Hi, I come from a OOPS (Java) world and I am used to Singletons, Inheritance, Statics, Interfaces etc. I am reading the Programming Clojure book and I understand multi-methods and when it is used. But I am still not able to see how to achieve the effects of Singletons, Inheritance, Statics, Interf

Re: Trouble implementing Dijkstra algorithm in Clojure

It might not be if the sorted set is internally represented as a tree. Then the smallest element with the leaf of the tree (if tree is balanced) and that is not accessible in O(1) time. -- Forwarded message -- From: ataggart Date: Tue, Dec 8, 2009 at 6:22 PM Subject: Re: Trouble i