Dear vimming Clojurians,
I'd like to announce a bugfix release for VimClojure.
This release is compatible with Clojure 1.0 and
Clojure-Contrib 919 (in old SVN terms). Other
pre-GTIC contrib versions from Github should also
work. For Clojure(-Contrib) head consider using the
bleeding-edge branch
Hello,
I was going to extend java.util.regex.Matcher for named groups and
came to a point where I wanted to proxy the Matcher-class so that my
extension was usable in-place of the original implementation.
I realized - via java.lang.VerifyError: Cannot inherit from final
class - that it isn't
Hello,
I wonder if any of the Clojurians on here might like to describe how
one might write the factorial function as a parallel one?
shameful-plug
Look at the files section of this group, I wrote 2 examples of
parallel factorial and the sources are uploaded there...
/shameful-plug
Kind
On Sat, Jul 25, 2009 at 4:40 PM, atucker agjf.tuc...@googlemail.com wrote:
I wonder if any of the Clojurians on here might like to describe how
one might write the factorial function as a parallel one? Taking
advantage of the associativity of multiplication, along the lines of
16! =
I want to implement ISeq to provide a sequence over an Excel file. I
plan to implement it in Java. I see that Range extends ASeq for its
default implementation of cons() and more(). Is extending ASeq the
recommended way to implement a sequence?
Hi,
Am 26.07.2009 um 22:45 schrieb eyeris:
I want to implement ISeq to provide a sequence over an Excel file. I
plan to implement it in Java. I see that Range extends ASeq for its
default implementation of cons() and more(). Is extending ASeq the
recommended way to implement a sequence?
Yes.
Hey Rich, or anyone else that knows, can you shed some light on the
purpose of the wait call inside the lock method of LockingTransaction?
If I understand correctly, refinfo belongs to the transaction that is
going to continue (it wasn't barged) and the current transaction will
be retried. It
I have this very trivial function:
(defn find-me [n]
(loop [coll (iterate inc 20)]
(if (= (first coll) n)
n
(recur (next coll)
Let's leave out the problem that the loop may never end. My question is the
sequence that's bound to coll in the loop will only generate the next digit
in
(assuming you agree that xwiki-backed sites like http://www.idiva.com ,
http://www.curriki.org or http://www.bestventes.com constitute
serious web apps...)
On the Xwiki devs list, I inquired:
http://lists.xwiki.org/pipermail/devs/2009-July/013763.html about using
Clojure as a scripting language
When I asked the same question a few weeks ago, Rich Hickey gave this
response:
http://groups.google.com/group/clojure/browse_thread/thread/77ba769caef82803/60738209810ec491
Looking at StringSeq, as he suggested, was particularly helpful. I found
useful the idea of using an integer counter to
Hi Jeremy,
The 'find in collection' function is 'filter', so one way to write
find the first match would be like:
user= (first (filter (partial = 25) (iterate inc 20)))
25
Filter is lazy itself so in this example I believe minimum execution
is forced.
Regarding your questions about lazy
11 matches
Mail list logo
