Re: My first Clojure program (and blog post about it)

> 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: https://github.com/4dsolutions/synmods/blob

Re: My first Clojure program (and blog post about it)

On Sat, Aug 8, 2015 at 12:39 PM, kirby urner 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] (let [[a] [(:OA qray

Re: some guidance sought

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 red-b

Re: some guidance sought

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 t

New Functional Programming Job Opportunities

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 yo

Re: Anotating functions for pre-processing

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 not

Re: Hashing With Consistent Results

-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

Re: some guidance sought

The clojure core datastructures PersistentHashMap and PersistentVector are based on Philip Bagwells Ideal Hash Trees: http://lampwww.epfl.ch/papers/idealhashtrees.pdf Several of Chris Okasakis Purely Functional Datastructures are implemented already. http://www.cs.cmu.edu/~rwh/theses/okasaki.pd

Re: why does this file watcher keep triggering?

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 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 thousands of time

Hashing With Consistent Results

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