Le mardi 12 août 2014, MS 5lvqbw...@sneakemail.com a écrit :
Thanks, I figure now in 2014 disk space is not a big deal, and any two
sequences of text will compress to something really small, so saving disk
space is not a compelling reason for reference data. There was in fact a
decent reason
Bozhidar Batsov bozhidar.bat...@gmail.com writes:
This was recently renamed - have a look at CIDER's changelog.
Interestingly we have an alias with the old name, so people should be
getting warnings, not errors. I’ll have at the problem.
I think the attached patch should fix the problem.
--
You could likely use System/identityHashCode to count the similarity of
objects all the objects.
I created a small function that only honors the clojure-visible
structure, and exposes every item in a tree structure (apart from the
arrays in PersistentVectors and some PersistentMaps)
(defn
So I am finally comfortable for showing Project Skummet to the general
public.
Skummet is a experimental Clojure branch that features a modified
AOT-compiler
providing the following features:
a) Compiling vars into objects stored as namespace's static fields;
b) Skipping emission of macros;
c)
Hi All,
there's a new version of Gorilla REPL, version 0.3.2, available on clojars
that contains an important security fix. I would recommend upgrading
immediately, if possible. Many thanks to @silasdavis for initially
reporting this issue, and for @foogoof for highlighting that it was more
I am so excited to use this, Alex! A hello world uberjar with Skummet is 1
MB slimmer and launches twice as fast on my netbook, though I won't call it
a scientific test. And of course you know I'm excited about the prospects
for CoA -- have you been testing it with ART yet, or just Dalvik?
Thank you for the feedback, Zach! I only tested on Dalvik so far, with
Clojure and most part of Neko lean-compiled (including neko.ui). I plan to
try it on ART soon, since Adam Clements made CoA finally working with ART.
Alex Yakushev
http://www.bytopia.org
On Aug 12, 2014 6:49 PM, Zach Oakes
On 12 August 2014 at 13:49:42, Linus Ericsson (oscarlinuserics...@gmail.com)
wrote:
The conclusion of this is I think the easiest way to make this work is to just
run the algorithm in both versions and watch the object allocation statistics
closely in VisualVM or similar.
Yeah, that's exactly
On Monday, August 11, 2014 10:08:09 PM UTC-7, Jeremy Heiler wrote:
On Mon, Aug 11, 2014 at 3:07 PM, Brian Craft craft...@gmail.com
javascript: wrote:
Two questions, really. I'm running large batch jobs with an agent. The
jobs may fail in any number of unanticipated ways (due to user
On Tuesday, August 12, 2014 9:59:54 AM UTC-7, Brian Craft wrote:
On Monday, August 11, 2014 10:08:09 PM UTC-7, Jeremy Heiler wrote:
On Mon, Aug 11, 2014 at 3:07 PM, Brian Craft craft...@gmail.com wrote:
Two questions, really. I'm running large batch jobs with an agent. The
jobs may
It seems hard to answer in a completely generic fashion. If there's a
certain collection of vectors which you'd like to share structure, it
may be possible to put a number on the degree of sharing achieved by
examining the internals of those vectors. That wouldn't address the
issue of intermediate
I wanted to submit a talk to share my experience with implementing CRDTs in
Clojure and building riak_core-like cluster. But put it aside cause there
are still too many unresolved problems and question without proper answers.
I talked at local meetup a month ago about deterministic parallel and
12 matches
Mail list logo
