Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

hi, RC1 works well with our largest project. See a 5-8% slow-down but no other problems. Regards, Stefan -- 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 members

[ANN] zcube 0.0.2

Hi, clojure community. It is my pleasure to announce zcube[1], a Clojure library all about counting trees for analytical purposes. The intent is to compute aggregate sums over multiple hierarchical dimensions, based on the (old) algorithmic ideas exposed in [2] by Pr. Minato et Al, and implem

Re: [GSoC] Proposal: persistent probabilistic data structures

I just had a short conversation with Ambrose through comments on my proposal. He suggests to offer this library to Clojure contrib. So I have to sign a Clojure CA, however I don't know what "project name" to put in the form, since the project has yet to start. Any suggestion? What should I do?

Kibit output

Hi, is it possible to output kibit code analysis results into a file? My aim is to publish this file with a CI tool such as teamcity/ jenkins. Thanks, Tim -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@

Re: Kibit output

`lein kibit > file` On Wed, Mar 19, 2014 at 03:26:17AM -0700, Tim Terry wrote: >Hi, is it possible to output kibit code analysis results into a file? My >aim is to publish this file with a CI tool such as teamcity/ jenkins. >Thanks, >Tim > >-- >You received this message be

Re: algorithm help: extracting groups of consecutive ints from a sorted list

Or use glue from flatland.useful.seq and: user=> (glue conj [] (fn [s n] (= (inc (last s)) n)) [1 3 4 5 7 9 10 13]) ([1] [3 4 5] [7] [9 10] [13]) On 19 March 2014 04:10, Shantanu Kumar wrote: > > > On Wednesday, 19 March 2014 09:39:56 UTC+5:30, Shantanu Ku

Re: [GSoC] Proposal: persistent probabilistic data structures

Matteo, When sending the CA adding a "project name" is optional, you can leave it empty. Usually the name for a contrib project will be chosen in the thread in clojure-dev when proposing the library as a contrib project, see http://dev.clojure.org/display/community/Guidelines+for+Clojure+Contrib+

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

what's that about performance now? Is that something definitive and reproducible? And if so, is there any way to track down a cause? -- 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 Not

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

I'm guessing it's because of the minor overhead on hashing added with the move to Murmur3? Alex Miller writes: > what's that about performance now? > > Is that something definitive and reproducible? And if so, is there any way to > track down a cause? -- You received this message because you

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

I moved to 1.6 two weeks ago for development and have had no problem. I had to change some tests because they depended on the order of elements if you seq a hashmap. On Tuesday, March 18, 2014 3:21:22 PM UTC+1, Alex Miller wrote: > > Hello all, > > We would love to release Clojure 1.6.0 final s

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

That is the only set of changes that I know of that negatively affect performance in 1.6.0. However, the absolute differences are quite small and codes are cached. It's hard for me to conjure a scenario where the resulting effect is an overall 5-8% slowdown. If this is one, I'd like to understa

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

Hashes are cached for Clojure collections, keywords and symbols, but not for strings. I wonder if people who report these perf regressions use long string keys in their maps... For this to explain the regression they'd have to be looking up the same String objects a lot, of course (else hashCode c

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

Hi Alex, the runtime of the program changed from 19 to 20 seconds for one set of data and from approx 6minutes to 6:30 for another set. To me that is acceptable. We are reading a few MB of files into memory, create lots of intermediate vectors, maps and sets and output up to a few hundred M

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

Hi, On Wednesday, March 19, 2014 3:55:22 PM UTC+1, Michał Marczyk wrote: > > Hashes are cached for Clojure collections, keywords and symbols, but > not for strings. > > I wonder if people who report these perf regressions use long string > keys in their maps... As far as I can see, we have /

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

Thanks, this is all really useful. I would appreciate any more detailed info. On Wednesday, March 19, 2014 10:15:35 AM UTC-5, Stefan Kamphausen wrote: > > Hi, > > On Wednesday, March 19, 2014 3:55:22 PM UTC+1, Michał Marczyk wrote: >> >> Hashes are cached for Clojure collections, keywords and sy

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

I just tried to build master locally with the new JDK 1.8 on a Mac. I'm getting a build test failure. Sorry, I don't have time to look into it at the moment. JDK 1.7 worked fine for me. [java] clojure.test-clojure.reflect [java] [java] java.lang.IllegalArgumentException [

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

On Wednesday, March 19, 2014 4:34:45 PM UTC+1, Alex Miller wrote: > > Thanks, this is all really useful. I would appreciate any more detailed > info. >> >> >> * No atoms, agents, refs * Almost purely functional plus logging and I/O * Multi-threaded using latest core.async with thread, no go * J

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

ASM 4.1 does not work with JDK 1.8 see http://dev.clojure.org/jira/browse/CLJ-1323 Steve Miner writes: > I just tried to build master locally with the new JDK 1.8 on a Mac. I'm > getting a build test failure. Sorry, I don't have time to look into it at > the moment. JDK 1.7 worked fine for

[ANN] stch.routing 0.1.1

I'm really excited to announce stch.routing. This library is similar to Compojure in purpose, but is much different in use. It is based off ideas from bulletphp.com. The overall objective is concise routing of Ring requests. Feedback is very much appreciated. Full documentation, examples, a

reduced

Hi, Ive been looking at http://www.4clojure.com/problem/137 and I have a solution : (fn [x b] (reduce #(let [r (quot x %2) d (mod r b)] (if (zero? r) (reduced %1) (conj %1 d))) '() (iterate (partial * b) 1))) but the 4clojure website is failing with : java.lang.RuntimeException: Unable to re

Re: reduced

ah ok... i worked around this using a restriction on the input collection, but i think it is less concise : (fn [x b] (if (zero? x) [0] (reduce #(let [r (quot x %2) d (mod r b)] (conj %1 d)) '() (take-while #(<= % x) (iterate (partial * b) 1) -- You received this message because you are s

Re: reduced

`reduced' was added in 1.5. It looks like 4clojure is using an older version. On Wed, Mar 19, 2014 at 5:44 PM, Andy Smith wrote: > Hi, > > Ive been looking at http://www.4clojure.com/problem/137 and I have a > solution : > > (fn [x b] (reduce #(let [r (quot x %2) d (mod r b)] (if (zero? r) (redu

Re: reduced

I think `reduced` was added in 1.4... 4clojure is on 1.2 right? Jim On 19/03/14 16:44, Andy Smith wrote: Hi, Ive been looking at http://www.4clojure.com/problem/137 and I have a solution : (fn [x b] (reduce #(let [r (quot x %2) d (mod r b)] (if (zero? r) (reduced %1) (conj %1 d))) '() (ite

Re: STM and persistent data structures performance on mutli-core archs

> I like FSMs, but they do not compose well. some have argued for generative grammars that generate the fsm, because it is generally easier to compose grammars, and then generate the final fsm. iiuc. -- You received this message because you are subscribed to the Google Groups "Clojure" group. To

Re: More functional Quil

Hello Nikita, I think Quil should definitely provide a way to write functional style processing code. At the moment, my knowledge of both Clojure and Processing is not enough to evaluate these solutions. I'm certainly going to write my code following some of this and if someone proposes a solut

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

Moved to this release 3 days ago. Nothing to report, works as expected :) Thank to everyone for this new release :) Luc P. > Hello all, > > We would love to release Clojure 1.6.0 final soon. > > We need your help in checking out the current release candidate - this is > your opportunity to le

[ANN] Gorilla REPL 0.2.0 - all new extensible renderer

Hi all, I'm happy to announce a new release of Gorilla REPL. The number one comment I got from people on the original release was that it looked good, but they'd like to see it extended to some library or other. Jeff Rose hit the nail on the head with: "Being able to render values of differen

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

Rich just pushed a change to the String hashing to address this. We're going to grab the string hashcode (which is cached after first call) and murmur the result of that. This gives us constant time hashcode after first call with better distribution for combinations in nested collections. Will

Re: Clojure 1.6.0-RC1 - LAST CHANCE, PLEASE TEST

And thanks everyone for giving RC1 a look. You are (collectively) the fortune in my fortune cookie. -- 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 members are mod

[GSoC] Proposal, question and possible call for menthor

Hello, Clojurians! GSoC application deadline is dangerously close and it's time to fill an application, at last. But here is a problem: I don't know what will be the best for community. I have a few ideas and I will present them here to get some feedback. Sorry for a bit late posting! First: t

Re: STM and persistent data structures performance on mutli-core archs

> Due to the path-copy semantics, the contention gets driven to the root of the > tree. Out of curiosity, would reference counting (rather than or in addition to "normal" GC) help with this? Or is reference counting problematic in a highly concurrent environment? It seems like reference cycles

Re: STM and persistent data structures performance on mutli-core archs

> > >1. Due to the path-copy semantics, the contention gets driven to the >root of the tree. > > > Out of curiosity, would reference counting (rather than or in addition to > "normal" GC) help with this? Or is reference counting problematic in a > highly concurrent environment? It seem

honeysql subquery

Is there a way to do a subquery in honeysql, e.g. {:select [:*] :from {:select [5]}} (which doesn't work)? -- 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 members

Re: honeysql subquery

ah, got it. Need [] around the subselect. On Wednesday, March 19, 2014 3:17:07 PM UTC-7, Brian Craft wrote: > > Is there a way to do a subquery in honeysql, e.g. > > {:select [:*] :from {:select [5]}} > > (which doesn't work)? > -- You received this message because you are subscribed to the Goog

Re: [ANN] Gorilla REPL 0.2.0 - all new extensible renderer

This looks great, Jony - I look forward to playing with it soon! -- 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 members are moderated - please be patient with you

[ANN] lein-4clj

4clojure is a great site for practicing various datatypes and concepts in Clojure. However, the code editor on the website is somewhat limited, mostly because it doesn't have a REPL to test out individual parts of your code. I'm not affiliated with 4clojure in any way,

Re: [ANN] lein-4clj

Can you explain the difference between this and https://github.com/bfontaine/lein-fore-prob? I haven't really looked since back when https://github.com/broquaint/lein-foreclojure-plugin was new (in lein 1!), but it seems like there is a lein2 plugin already. On Wednesday, March 19, 2014 4:37:46

Re: [ANN] lein-4clj

Admittedly these two libraries are very similar; I actually hadn't heard about lein-fore-prob before (because it wasn't listed on the leiningen plugin list wiki ). Because I started working on this without knowledge of the other library, it na

Re: STM and persistent data structures performance on mutli-core archs

So, the following test puzzles me. Not because it takes virtually the same time (I know that Fork/Join is not cheap and memory is probably the biggest bottleneck here). But because I do not get why map (as opposed to r/ma) uses all 8 cores on my MacBookPro. All of them seem to be running according

Re: STM and persistent data structures performance on mutli-core archs

On Wed, Mar 19, 2014 at 11:14 AM, Raoul Duke wrote: > > I like FSMs, but they do not compose well. > > some have argued for generative grammars that generate the fsm, > because it is generally easier to compose grammars, and then generate > the final fsm. iiuc. > I thought about it too but compo

honeysql function call limitation

honeysql supports function calls by joining args with commas, e.g. => (hsql/format #sql/call [:foo :bar :baz]) ["foo(bar, baz)"] However sql functions have more syntax, for example group_concat(a order by b separator ',') So #sql/call doesn't work. I tried implementing a clause format for gro

Re: honeysql function call limitation

ugh, bit by missing [] a second time. Nevermind. On Wednesday, March 19, 2014 8:46:37 PM UTC-7, Brian Craft wrote: > > honeysql supports function calls by joining args with commas, e.g. > > => (hsql/format #sql/call [:foo :bar :baz]) > ["foo(bar, baz)"] > > > However sql functions have more syntax