Wrong type of parens!
This works for me:
(ns test (:import [java.io File]))
it's a bit of a gotcha, though.
/Linus
On 2/18/12 10:29 PM, ClusterCat wrote:
> Hello,
> I have two newbie questions:
>
> First
> -
> (ns test (:import (java.io File)))
>
> I can use File like this
> (let [file (Fi
On Feb 20, 2012, at 4:05 PM, turcio wrote:
> Chas, have you been able to run ClojureScript One in exactly the same
> manner?
I did, yes, though I (foolishly) blew away the project right after. If you
continue to have issues, I might be persuaded to reconfigure it and post the
resulting .proje
FWIW, nREPL is on its way to being baked into Leiningen, so the
REPL-protocol-interop issue you had will be effectively eliminated.
Laurent is hard at work on the actual Leiningen project integration and
support; it's coming, it's coming. :-)
- Chas
On Feb 19, 2012, at 11:30 PM, Nick Klauer wr
2012/2/21 Chas Emerick
> FWIW, nREPL is on its way to being baked into Leiningen, so the
> REPL-protocol-interop issue you had will be effectively eliminated.
>
> Laurent is hard at work on the actual Leiningen project integration and
> support; it's coming, it's coming. :-)
>
I confirm :)
>
>
Hi all,
After a good deal of effort, I managed to beat the following code
into something functional, but it's getting kind of big, unwieldy and
hard to follow.
I'd appreciate if anyone could take a look and give me some pointers.
First, it will probably be easier for me to describe what
DHM writes:
> I want to announce the release of mcache 0.1.0:
> https://github.com/davidhmartin/mcache
Very nice. One thing you might consider is implementing
core.cache/CacheProtocol [1] in terms of mcache. I've done this [2] for
the Infinispan data grid in Immutant. It'd be great to see anothe
On Tue, Feb 21, 2012 at 8:51 AM, Aaron Cohen wrote:
> Hi all,
>
> After a good deal of effort, I managed to beat the following code
> into something functional, but it's getting kind of big, unwieldy and
> hard to follow.
>
> I'd appreciate if anyone could take a look and give me some pointers
On Tue, Feb 21, 2012 at 9:21 AM, Cedric Greevey wrote:
> On Tue, Feb 21, 2012 at 8:51 AM, Aaron Cohen wrote:
>> I would like to process the ast such that:
>> 1) Any nodes that are of :op :fn, get an entry added named
>> ":constants" which contains a vector of all the constants found in any
>> of
I should have just put this example in the email initially, it's in the gist:
(process-frames {:op :fn :children [{:op :let :children [{:op
:constant :form 1}]}]})
{:op :fn,
:constants [{:value 1}],
:children [
{:op :let,
:unbox false,
:children [
{:unbox true, :form 1, :op :constant}]}]}
--
Yo
If deep nesting's not a concern, how about
(defn process-node [node descendant-of-let?]
(let [op (:op node)
children (:children node)
let-or-descendant? (or descendant-of-let? (= op :let))
processed-children (map #(process-node % let-or-descendant?) children)
chil
Hi,
I'm not sure it nicer, but anyway...
It follows a similar approach as Cedric: pass down unbox info and collect
up constants info. However I use the form itself to carry additional
information. YMMV. One could also put info into meta.
(derive ::let ::recursive)
(derive ::fn ::recursive)
(d
2012/2/21 Aaron Cohen
> Hi all,
>
> After a good deal of effort, I managed to beat the following code
> into something functional, but it's getting kind of big, unwieldy and
> hard to follow.
>
> I'd appreciate if anyone could take a look and give me some pointers.
>
> First, it will probab
On Tue, Feb 21, 2012 at 12:20 AM, kovas boguta wrote:
> I also have a small syntax idea.
>
> One principle that would be nice, and that Mathematica lacks, is
> parity between anonymous predicate dispatch constructs, and those
> attached to vars.
>
> So while one way is to look at predicate dispatc
2012/2/7 Tom Chappell :
> This problem is caused by the underlying Java library that is used to
> launch the browser, which, under linux, only launches the proper
> default browser if gnome is installed. Install enough gnome and it
> will start to work.
> -Tom
Thanks, Tom. That was the cause, and
On Tue, Feb 21, 2012 at 9:48 AM, Cedric Greevey wrote:
> It works by recursing, passing descendant-of-let? information down the
> stack, and accumulating constants up the stack. The implementation fn
> returns a two-element vector of the modified node and a vector of the
> constants in it (if a :
On Tue, Feb 21, 2012 at 10:32 AM, Meikel Brandmeyer (kotarak)
wrote:
> Hi,
>
> I'm not sure it nicer, but anyway...
>
> It follows a similar approach as Cedric: pass down unbox info and collect up
> constants info. However I use the form itself to carry additional
> information. YMMV. One could al
Hi,
Am 21.02.2012 um 22:35 schrieb Aaron Cohen:
> I'd actuallly tried to avoid littering the syntax tree with :constants
> elements anywhere other than where they were needed, but thinking
> about it, there doesn't really seem to be any reason to do that, and
> it does make the implementation muc
On Tue, Feb 21, 2012 at 4:44 PM, Meikel Brandmeyer wrote:
> Hi,
>
> Am 21.02.2012 um 22:35 schrieb Aaron Cohen:
>
>> I'd actuallly tried to avoid littering the syntax tree with :constants
>> elements anywhere other than where they were needed, but thinking
>> about it, there doesn't really seem to
Hi,
This email is not stricly about Clojure but about a tool that is useful to the
open source Clojure
ecosystem, so I hope it is appropriate to post this kind of stuff here.
travis-ci.org has had Clojure support for several months now but we'd not
gotten around to announcing it here. So, here
Hi,
Am 21.02.2012 um 22:56 schrieb Aaron Cohen:
> One complication I'm not sure about is nested fns.
>
> I'm typing the following in my email client, so forgive any typos...
>
> For instance: {:op :fn, :children [{:op fn, :children [{:op :constant,
> :form 1}]}, {:op :constant, :form 2}]}
>
>
Michael Klishin writes:
> travis-ci.org is a hosted continuous integration system for the open
> source community. It started in the Ruby community in 2011; since
> then, it has grown to support Erlang, Clojure, Node.js, PHP, Java,
> Groovy, and Scala, and now hosts over 6000 projects, including
On Tue, Feb 21, 2012 at 4:56 PM, Aaron Cohen wrote:
> On Tue, Feb 21, 2012 at 4:44 PM, Meikel Brandmeyer wrote:
>> Hi,
>>
>> Am 21.02.2012 um 22:35 schrieb Aaron Cohen:
>>
>>> I'd actuallly tried to avoid littering the syntax tree with :constants
>>> elements anywhere other than where they were n
On Tue, Feb 21, 2012 at 4:30 PM, Aaron Cohen wrote:
> On Tue, Feb 21, 2012 at 9:48 AM, Cedric Greevey wrote:
>
>> It works by recursing, passing descendant-of-let? information down the
>> stack, and accumulating constants up the stack. The implementation fn
>> returns a two-element vector of the
2012/2/21 Meikel Brandmeyer
> Hi,
>
> Am 21.02.2012 um 22:56 schrieb Aaron Cohen:
>
> > One complication I'm not sure about is nested fns.
> >
> > I'm typing the following in my email client, so forgive any typos...
> >
> > For instance: {:op :fn, :children [{:op fn, :children [{:op :constant,
>
2012/2/21 Meikel Brandmeyer
> Hi,
>
> Am 21.02.2012 um 22:35 schrieb Aaron Cohen:
>
> > I'd actuallly tried to avoid littering the syntax tree with :constants
> > elements anywhere other than where they were needed, but thinking
> > about it, there doesn't really seem to be any reason to do that,
25 matches
Mail list logo
