Great work! Thank you
On 28 February 2015 at 17:14, Jean Niklas L'orange
jeann...@hypirion.com wrote:
Hello fellow Clojurians,
I am happy to announce that I have finished my blogpost series on the
persistent
vector. It consists of five parts:
The basic algorithms
Indexing
The tail
Hi Jean
The tail optimisation
http://hypirion.com/musings/understanding-clojure-transients
It took me a second to find out how the graphs for the vector-trie and
tail correspond to each other.
Please consider slightly deeper explanation or add some visual clues.
Something like:
Greetings,
I'm a post-graduate student in Computer Science currently doing research in
Spatial/Amorphous Computing. I've been a lurker on this forum for quite
sometime and I believe my Clojure(Script) knowledge is at an intermediate
level at best (though no apps under my belt as yet).
I'd
That is pretty amazing, I'll have to remember this library next time I need
to use UUID's.
Also I think you meant 450% faster.
On Sunday, March 1, 2015 at 5:35:16 PM UTC-7, danl...@gmail.com wrote:
Ok, for anyone following my adventures optimizing clj-uuid, I've gotten
another substantial
We used Clojure and Cascalog to generate the monthly deforestation alerts
from satellite imagery for Global Forest Watch
http://globalforestwatch.org. This is the real-time component of the
project.
On Tuesday, April 19, 2011 at 10:38:14 AM UTC-4, Damien wrote:
Hi Everyone,
I'm on a
Hi all,
for some tests I need a function which starts a new partition each time a
predicate returns true, for instance:
(partition-when
(fn [s] (.startsWith s ))
[ 1 2 3 4 5 6])
:= [[ 1 2 3] [ 4 5 6]]
Since I haven't found a built-in function, I copied, pasted, and modified
the core
PS. We are now TEN TIMES faster, so it is a lot easier to compute that
percentage:
#'uuid/v1:201 nanoseconds
#'java.util.UUID/randomUUID: 2012 nanoseconds
Best,
Dan
On Tuesday, March 3, 2015 at 3:06:35 PM UTC-5, danl...@gmail.com wrote:
I invoked engineer's privilege
I normally use a set utility functions to reload individual namespaces so I
don't lose state. This almost always suffices for day-to-day work. But, if
the REPL is still acting shady, then I'll use refresh. Anything is better
than having to wait out a REPL reboot.
On Sat, Feb 28, 2015 at 10:43 AM
A tiny update to my Component library.
https://github.com/stuartsierra/component
Leiningen: [com.stuartsierra/component 0.2.3]
Changes in this release:
* More-specific error message when a component returns nil from start or
stop
--
You received this message because you are subscribed to
Hi,
Nice work!
I wanted to clarify something: it seems to me that the v1 uuids clj-uuid
generate are not exactly equivalent or comparable to the uuids generated by
java.util/randomUUID? It appears that V1 uuids are time (and MAC) based and
don't use a cryptographic random number generator, so
I invoked engineer's privilege to quote the number very conservatively.
In one of the later episodes, didn't Scotty confide that the Enterprise
actually went up to warp 11, he just never told anyone? :)
Actually, you are right -- I noticed it after I hit send. As you can
tell, the relative
Watch this video from Neal Ford ;-) http://youtu.be/2WLgzCkhN2g
I Think it will help.
On Fri, Feb 27, 2015 at 7:38 PM, Dan Hammer dan.s.ham...@gmail.com wrote:
We used Clojure and Cascalog to generate the monthly deforestation alerts
from satellite imagery for Global Forest Watch
Just wanted to double check. This? ((f 1)(g (f 1) (h (g (f 1
Or this? ((f 1)(g (f 1))(h (g (f 1
--
You received this message because you are subscribed to the Google
Groups Clojure group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new
Are v1 as unique as randomUUID()?
On 3 Mar 2015 20:08, danle...@gmail.com danle...@gmail.com wrote:
PS. We are now TEN TIMES faster, so it is a lot easier to compute that
percentage:
#'uuid/v1:201 nanoseconds
#'java.util.UUID/randomUUID: 2012 nanoseconds
Best,
Dan
Hi,
Are there any other Lispers in South Devon who would be interested in
meeting up and talking code? Clojure, Common Lisp, Scheme, anything as long
as there are loads of parentheses!
Please get in touch.
Cheers
Stephen
--
You received this message because you are subscribed to the
Great - thanks Dan.
On 3 Mar 2015 20:27, danle...@gmail.com danle...@gmail.com wrote:
v1 UUID's are deterministically unique across both space and time.
Random UUID's are random. There is an (infinitesimally small chance of a
duplicate). To my knowledge, the reason random uuid's exist and
If you have a ClojureScript based product and your customers use FireFox
Nightly you will encounter trouble due to a RegExp detection bug in prior
ClojureScript releases interacting with recent Firefox ES6 related changes.
Here's the ticket:
https://bugzilla.mozilla.org/show_bug.cgi?id=1138325
I've been thinking about this for a bit and our posts just happen to be within
a minute of each other! A hash bucket is filling up somewhere, I just know it!
On 4 Mar 2015, at 04:13, Colin Yates colin.ya...@gmail.com wrote:
Ha - the irony of you and I posting a message about uniqueness at
Ha - the irony of you and I posting a message about uniqueness at pretty
much the same time :).
On 3 Mar 2015 20:11, Lucas Bradstreet lucasbradstr...@gmail.com wrote:
Hi,
Nice work!
I wanted to clarify something: it seems to me that the v1 uuids clj-uuid
generate are not exactly equivalent
v1 UUID's are deterministically unique across both space and time. Random
UUID's are random. There is an (infinitesimally small chance of a
duplicate). To my knowledge, the reason random uuid's exist and are part
of the RFC is that they are bone simple to implement, whereas v1 and v3/v5
Clojure has been accepted as a mentoring organization for GSOC 2015,
announced by Google yesterday.
I'd recommend contacting the mentors, David Nolen and Nicola Mometto,
directly. The email they use to correspond on this group are:
David - dnolen.li...@gmail.com
Nicola - brobro...@gmail.com
Have things changed in 4 years? ;-)
On Mar 3, 2015, at 4:52 PM, James Reeves ja...@booleanknot.com wrote:
This is a thread that's four years old. I think it's dead now :)
- James
On 3 March 2015 at 20:11, Hildeberto Mendonça m...@hildeberto.com wrote:
Watch this video from Neal Ford
Hi Everyone,
Thanks Andy for your great help. I was able to contact Mike regarding the
Numerical Clojure Project.
I have been looking at Project Ideas once again and the projects
ClojureScript on Android and ClojureScrupt and Google Closure strike as
pretty interesting projects. I would be
On 04/03/2015 00:55, Marcus Blankenship wrote:
Have things changed in 4 years? ;-)
Figures in my last post are for London.
gvim
--
You received this message because you are subscribed to the Google
Groups Clojure group.
To post to this group, send email to clojure@googlegroups.com
Note
Hi Andy,
I actually posted this last Friday, but it seems like it just got approved.
I've gotten in contact with at least David on IRC already (I'm juggernot
there) and I guess I have some homework to do on my part before I touch
bases again with either mentor.
But, Thanks for your help
There is the No Location Dojo online which might help
https://groups.google.com/forum/#!forum/no-location-clojure-dojo
cheers,
Bruce
On Tue, Mar 3, 2015 at 9:50 PM, Stephen Wakely
fungus.humun...@gmail.com wrote:
Hi,
Are there any other Lispers in South Devon who would be interested in
On 04/03/2015 00:55, Marcus Blankenship wrote:
Have things changed in 4 years? ;-)
The leading jobs indicator - indeed.co.uk - shows Clojure adoption
trailing a long way behind the other 2 main JVM languages - Scala and
Groovy. Numbers are exclusive/inclusive of other languages in the job
This is a thread that's four years old. I think it's dead now :)
- James
On 3 March 2015 at 20:11, Hildeberto Mendonça m...@hildeberto.com wrote:
Watch this video from Neal Ford ;-) http://youtu.be/2WLgzCkhN2g
I Think it will help.
On Fri, Feb 27, 2015 at 7:38 PM, Dan Hammer
Also, check out the success stories:
http://cognitect.com/clojure#successstories
And this list of companies using Clojure:
http://clojure.org/companies
Thanks to Alex Miller for putting this together.
gvim mailto:gvi...@gmail.com
March 3, 2015 at 6:28 PM
Figures in my last post are for
Hi Dan,
The hash bucket sentence was only a joke about us posting the same
question at the same time :).
I don't have any particular thoughts on whether there's a reason to
use the truly random UUIDs over v1 UUIDs, I just wanted to check
whether the methods were equivalent so I know if I should
Lucas, if there are any good reasons why one should pay 10 times the cost
to generate a UUID randomly, I'd like to hear them.
Thank you very much for your kind words and please see my prior reply to
Colin.
Best,
Dan
On Tuesday, March 3, 2015 at 3:24:42 PM UTC-5, Lucas Bradstreet wrote:
31 matches
Mail list logo
