This looks like a viable solution! Is Portkey on Clojars or will I have to
build myself? Not a problem either way, just making sure I'm doing it
right. Thanks Kimmo.
On Sunday, July 23, 2017 at 2:35:37 AM UTC-6, Kimmo Koskinen wrote:
>
> Hi!
>
> Although still at early stages, check out portkey
I'm not sure I can fully help without you explaining more what you're
doing. It sounds like you've got a collection or container type which has
an implementation of print that loops over its elements, and calls print on
them. So if you have a cycle, the print will go on forever until memory
run
You can prevent the need for mutable nodes by using an adjacency list to
represent a graph structure. In clojure this works nicely as a hash-map
from a node id to a set of connected node ids (eg for your case, a set of
parent nodes and a set of child nodes), and traversal becomes a series of
lookup
I'm translating some code from an object oriented language to Clojure. I'm
a little confused about a tree structure I had where tree nodes have parent
and children properties, so the structure forms cycles. I used atoms for
those properties, so I could wire it all up. The code is clean and simpl
Yes, I find that much clearer too. Thanks!
On Saturday, July 22, 2017 at 4:50:23 PM UTC-4, tbc++ wrote:
>
> If we think about what we're doing here is a stateful filter, then maybe
> we could leverage a few more core Clojure functions:
>
>
> (defn distinct-by [f coll]
> (let [seen (atom #{})]
>
Hi all,
I recently used Clojure to create a Java interface and class (via
definterface/deftype) that both required Java annotations. I was within
striking distance of my goal, but was finally caught out by the fact that
although Clojure has a nice Java annotation syntax, one cannot currently
s
portkey looks great, I wasn't aware of that - thanks!
On 23 July 2017 at 20:35, Kimmo Koskinen wrote:
> Hi!
>
> Although still at early stages, check out portkey
> https://github.com/cgrand/portkey.
>
> Portkey does tree-shaking by starting from a closure to minimize resulting
> jar size. Uses k
Hi!
Although still at early stages, check out portkey
https://github.com/cgrand/portkey.
Portkey does tree-shaking by starting from a closure to minimize resulting jar
size. Uses kryo and implementation of var tracing started in powderkeg project
(https://github.com/HCADatalab/powderkeg)
.
Yep, appears that you are right. I ended with this:
(doseq
[[k v] (ns-map ns)
:when (= (find-ns 'clojure.core) (:ns (meta v)))]
(ns-unmap ns k))
which is pretty ugly.
Justin Smith writes:
> refer-clojure doesn't ever remove mappings, it only adds them
>
> The reason a refer-c
