If I understand correctly, keywords aren't "defined" anywhere; they
are literal values, so your question would be akin to asking for a way
to retrieve all the literal integers used in the code. That said,
there may be some implementation detail that maintains the set of
instantiated keyword values
On Jun 3, 2010, at 24:02 , rzeze...@gmail.com wrote:
> I was able to make this go away by adding a method to Numbers.java. I
> have a use case where I'm calling bit-and with two longs tens of
> millions of times. Is there another way I could avoid this reflection
> without this change to the Jav
I have some new data that suggests there are issues inherent to pmap
and possibly other parallelism with Clojure on older Intel quad+ core
machines.
I added a noop loop to the benchmark. It looks like this:
(defn noops [n]
(when (> n 0)
(recur (- n 1
Running those in parallel is also n
The Java stubs are, ideally, a temporary thing. They don't need to be
around forever. However, I know of no way at present to generate them
automatically.
Also, you are solving half the problem. Generating the stubs and
class files at the same time does not solve the compile-time
dependency pro
I asked this on the swank-clojure list too*, but no responses so far.
I want swank-clojure to complete on keywords as well as vars, but the
only place I can find that has that information is
clojure.lang.Keyword.table, which is private (probably for good
reasons).
Is there any way to get a seq of
On Fri, 4 Jun 2010 11:59:46 -0700 (PDT)
BerlinBrown wrote:
> I don't think tiobe is all accurate index of anything. But when you
> look at the actual rankings, they seem to line up, especially for the
> mainstream languages.
>
> I could see where Delphi ranks high on the list. "Go" is a little
Responses to the survey have started to trickle off (after a very
healthy raft of feedback, BTW). Given that, I've decided to shut the
survey off at the end of today, probably around midnight EDT. You
have until then to toss in your 2¢, and be included in the survey
results (which I'll be
I am working on a simple DSL and wanted to some form of embedded
Clojure to where I can invoke Clojure scripts and have those scripts
not effect the bootloader/my main application code.
It seems there are two approaches that sound doable.
(A) - With the dynamically loaded clojure scripts, the DSL
I don't think tiobe is all accurate index of anything. But when you
look at the actual rankings, they seem to line up, especially for the
mainstream languages.
I could see where Delphi ranks high on the list. "Go" is a little
odd.
But I was glad to see Clojure get a little recognition.
And I a
I read the explanation on how they compute their charts.
I do not see why a Cobol or Fortran programmer would query the Web for
references on a regular basis.
What can be the significance of computing references on the Web about older
languages that do not evolve too much but that have a large a
On Jun 4, 2010, at 16:23 , Chouser wrote:
>
> I agree with the spirit of your argument, but not your
> implementation:
>
> (update-in* {nil 2} [nil] (constantly 3))
> ;=> 3
As so often Chouser, you are of cause totally right :). I just realized the
flaw when I was about to open a ticket but y
Tiobes rankings always seems a little dubious to me.
Delphi more popular than Javascript? Really? Google Go more popular
than Lisp/Scheme/Clojure?
Ranking those three together is an atrocity, by the way. Just because
they all have paren's doesn't make them the same.
Anyway, I'm sure Tiobe measur
On Fri, Jun 4, 2010 at 10:04 AM, Heinz N. Gies wrote:
>
> On Jun 4, 2010, at 14:11 , Heinz N. Gies wrote:
>
>>
>> On Jun 4, 2010, at 14:03 , Joost wrote:
>>
>>> On Jun 4, 1:42 pm, "Heinz N. Gies" wrote:
Sorry I mixed arguments, it should be (update-in {1 2} [] (constantly {2
3}))
>>>
>
Nice.
http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html
It is number 16.
...combined with Lisp and Scheme.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts
On Jun 4, 2010, at 14:11 , Heinz N. Gies wrote:
>
> On Jun 4, 2010, at 14:03 , Joost wrote:
>
>> On Jun 4, 1:42 pm, "Heinz N. Gies" wrote:
>>> Sorry I mixed arguments, it should be (update-in {1 2} [] (constantly {2
>>> 3}))
>>
>> Yes, that gives {nil {2 3}, 1 2}
>>
>> You're not giving any
@Jason
I'm supplying a Java API (implemented in Clojure) so needed a solution
quickly which just worked w/o me having to do special things.
Hence the gen-class+javadoc macro (http://gist.github.com/415269).
But I feel there should be something like this available in contrib
which handles the whol
On Jun 4, 2010, at 14:03 , Joost wrote:
> On Jun 4, 1:42 pm, "Heinz N. Gies" wrote:
>> Sorry I mixed arguments, it should be (update-in {1 2} [] (constantly {2 3}))
>
> Yes, that gives {nil {2 3}, 1 2}
>
> You're not giving any key in the key list, so that is the reason
> there's a nil key now
On Jun 4, 2:03 pm, Joost wrote:
> Seems correct as far as the documentation of update-in is concerned.
Addendum: though I think you've got a point in that inserting a nil
key is unexpected.
Personally, I don't really know what to expect from that expression.
Joost.
--
You received this messa
On Jun 4, 1:42 pm, "Heinz N. Gies" wrote:
> Sorry I mixed arguments, it should be (update-in {1 2} [] (constantly {2 3}))
Yes, that gives {nil {2 3}, 1 2}
You're not giving any key in the key list, so that is the reason
there's a nil key now, and {2 3} is just the value that you give it,
since t
On Jun 4, 2010, at 11:15 , Joost wrote:
> On Jun 4, 7:37 am, "Heinz N. Gies" wrote:
>> Update-in behaves oddly when getting an empty path. (update-in [] {1 2}
>> (constantly {2 3})) returns {nil {2 3} 1 2} not {2 3} as I'd expect. get-in
>> works well with empty pathes so I think this isn't a
I've pushed my changes to clojure-master to github (master from
today):
git://github.com/MHOOO/clojure.git
This should work so far. As for a hello-clojure-android application:
I'll try to get my example up and running on the weekend - possibly
together with a leiningen plug-in which automates the
Feka, please try a 0.2.1 version (https://chrome.google.com/extensions/
detail/lhmgejcdhmollecbianopflcfdaennle)
On Jun 1, 8:49 pm, feka wrote:
> Good idea! Thanks. (And try-clojure is good idea, too. So they also
> merit the thanks.)
>
> I can't make it grab the selection and evaluate it though.
Very clear, much appreciate!
On Jun 4, 2:55 am, Chouser wrote:
> On Thu, Jun 3, 2010 at 9:38 AM, YD wrote:
> > Hi,
>
> > When 'destructure' is doing a map destructuring, 'pmap' is the
> > function to use. 'pmap' will do some kind of process to the given
> > bindings using these lines of code:
>
On Jun 4, 7:37 am, "Heinz N. Gies" wrote:
> Update-in behaves oddly when getting an empty path. (update-in [] {1 2}
> (constantly {2 3})) returns {nil {2 3} 1 2} not {2 3} as I'd expect. get-in
> works well with empty pathes so I think this isn't a good behavior.
I don't know why you expect tha
Yes, you can compile the code to a DLL using th compile function,
similarly to how
it's done on the JVM. You have to set two env. variables, though (just
like one has to set
the classpath for the JVM):
clojure.compile.path and clojure.load.path
-Roland
On Jun 3, 8:49 am, Peter Hultgren wrote:
>
25 matches
Mail list logo
