Here are some functional programming job opportunities that were posted
recently:
Senior Software Engineer / Clojure at goCatch
http://functionaljobs.com/jobs/8855-senior-software-engineer-clojure-at-gocatch
Cheers,
Sean Murphy
FunctionalJobs.com
--
You received this message because
Oh! The Java collection methods! For interop with Java, I'm guessing. Not a
personal priority, though I see that data.int-map does exactly that.
The Clojure interfaces are much more reasonable. And really I want to focus
on the extensions to AA trees that I've developed, like virtual AA trees
Your way works because basically you are building two extra vectors
which are implicitly getting destructured, but that's syntactically noisy
and also a lot of extra computational work that is unneeded.
--
Thanks!
I cleaned it up a bunch:
I had not heard of AA trees before, but according to Wikipedia they sound
like a variant of red-black trees. Clojure's built-in sorted-map and
sorted-set implementations are called by the class name PersistentTreeMap
in its Java implementation [1], and it implements a persistent version of a
On Sat, Aug 8, 2015 at 12:39 PM, kirby urner kirby.ur...@gmail.com wrote:
(defrecord XYZray [OX OY OZ]
VectorOps
(norm [this] (this))
Should be (norm [this] this) not (norm [this] (this)), because the latter
will try to invoke `this` as a function.
(defn qray-to-xyzray
[qray]
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
I am the author of https://github.com/whilo/hasch
Would calling hasch.core/edn-hash satisfy your performance
requirements? I tried hard to make the recursion of the protocol
performant, but hashing a value is slower than the time needed to
write
I'm glad that sort of thing doesn't just happen to me :)
Sent from my iPhone
On 10 Aug 2015, at 00:44, Lawrence Krubner lawre...@rollioforce.com wrote:
Okay, I am an idiot. I had the directory watch setup to watch the directory
where the uberjar was built, so of course it was triggered
Hi,
I need a way to reduce a compound value, say {:foo bar}, into a number
(like 693d9a0698aff95c in hex). I don't necessarily need a very large hash
space, 7 hex digits is good enough for my purposes. But I need
this hash to be consistent between runs and JVM versions etc. So I guess
that rules
Hi Andy,
I would provide a function that wraps put!. It would still return a
deferred, but not the result of put!. It would create a deferred,
representing the result of the computation and pass it down the stream
together with the input. Consumers would set its value once the computation
is
thanks for all the useful replies. I underwent some pc migration so could
not answer.
to all that suggest that I rethink the use case — I am fully aware of
libraries like tools.trace and this approach (with-xyz ...). I am also
aware of function composition and I enjoy it in many places, but
10 matches
Mail list logo