[ANN] Inlein 0.2.0

idea to either refactor the commonly used code into a library, or make a CLI program in your favourite project management tool (Leiningen/Boot). Here is the full list of visible user changes: - Added support for :file-deps (Jean Niklas L'orange) - Added support for :exclusions in the

Re: [ANN] clj-xchart – A charting/plotting library for Clojure

s" section named Many Datapoints <https://github.com/hyPiRion/clj-xchart/blob/master/docs/tutorial.md#many-datapoints> (bottom of the page) which has a couple of lines on how one can do that. I haven't found a good generic interface for it yet, so it's not provided by c

[ANN] clj-xchart – A charting/plotting library for Clojure

Hi Clojurians, I am happy to announce clj-xchart ! XChart is a lightweight charting library for Java. clj-xchart wraps this library and tries to be a succinct yet evident charting library for Clojure. The library can e

[ANN] Leiningen 2.7.1

2.7.0: * Add support for SDKMAN! as installation alternative. (Jean Niklas L'orange) * Improved text in some error messages. (Jean Niklas L'orange) * Don't require `nil` for version in managed deps. (Chris Price) * Fix a bug with snapshot dependencies for managed deps. (Chris

[ANN] Leiningen 2.7.0

and handle fixture errors during `lein test`. (Alex Hall) * Fix a bug where spaces in directory names on Windows caused crashes. (Leon Mergen, Tobias Kiertscher, Jean Niklas L'orange) * Fix a bug where `lein search` would take forever downloading clojars.org. (Paul Dorman) * Retain user de

[ANN] clj-conduit 0.1.0

Hello fellow Clojurians, I have just released the first version of clj-conduit – a small library that attempts to make transducers a bit more readable. To give you a taste, here's the take transducer implemented with clj-conduit: (ns my.namespace (:r

Re: [ANN] Inlein 0.1.0

On 14 March 2016 at 19:45, Christopher Small wrote: > I know that planck (http://planck-repl.org/) has successfully achieved > cljs scripting capacity on OSX (and I've heard there's progress on Linux > support as well, but am fuzzy on the details). Do you think support for > planck or something s

[ANN] Inlein 0.1.0

Hi all Clojurians, Alex Miller did some research on slow boot times with Clojure/scripting in Clojure not too long ago. What I found weird was that there were no tool for doing Clojure scripting. It's possible to do this with b

Re: [ANN] Leiningen 2.6.0

On Wednesday, February 10, 2016 at 9:18:04 PM UTC+1, Avi Flax wrote: > > Does this mean that those who manually installed will not experience these > improvements? If so, I’m curious as to why? > Ah, good question: People who installed manually will already have the performance improvements that

Re: [ANN] Leiningen 2.6.0

s has now been fixed. Sorry for any inconvenience caused. -- Jean Niklas On Friday, February 5, 2016 at 2:27:37 AM UTC+1, Jean Niklas L'orange wrote: > > Greetings! > > I am happy to announce Leiningen 2.6.0! This release contains mostly > usability improvements, along wit

[ANN] Leiningen 2.6.0

upport for Clojure 1.1.0 and older. The full list of significant changes: * The templates, repl and Leiningen itself now use Clojure 1.8. * Support for Clojure 1.1.0 and older is now dropped. * Warn if possibly stale native dependencies end up in `:native-path`. (Jean Niklas L'orange) * Sp

[ANN] Leiningen 2.5.3

Greetings, Clojurians. I am happy to announce the release of Leiningen version 2.5.3. This version contains mostly bugfixes, most notably an issue where environment variables were not propagated down to GPG. This caused `lein deploy` and similar commands to fail if you set up GPG with the `GPG_A

[ANN] Leiningen 2.5.2

updated to 0.2.10. ## 2.5.2 / 2015-08-09 * Allow repl dependencies to be specified in default user profiles. (Jean Niklas L'orange) * Fix a bug where transitive dependencies on tools.nrepl failed. (Jean Niklas L'orange) * Fix a bug preventing custom certificates to work. (Jean Nikla

Re: Paper on Immutable Persistent Data Structures

On Tuesday, July 21, 2015 at 1:43:54 AM UTC+2, JvJ wrote: > > Does anyone know if there exists a paper/web page describing in detail how > each of Clojure's data structures are implemented? > I have a formal analysis and all the core algorithms related to the Persistent Vector in Chapter 2 of my

Re: [ANN] Understanding the Persistent Vector

rested (I found them to be pretty hard to grasp by the paper alone). Again, Great Work! > Thanks! =) -- Jean Niklas Frank > > On Saturday, February 28, 2015 at 11:14:17 AM UTC-5, Jean Niklas L'orange > wrote: >> >> Hello fellow Clojurians, >> >> I am

Re: [ANN] Understanding the Persistent Vector

Hi Bost, Thanks for the input! Yeah, I agree it might be a bit confusing right now. I'll definitely change it to something that's a bit easier to grok, probably with some inspiration from your suggestion. On Tuesday, March 3, 2015 at 11:58:00 AM UTC+1, Bost wrote: > > Hi Jean > > > The tail o

[ANN] Understanding the Persistent Vector

and how efficient it is on the JVM. Constructive criticism, both positive and negative, is appreciated. Enjoy! (NB: I haven't gotten around to fix the illustrations in part 3, so unfortunately it will be a bit hard to read if you print it out in grayscale. It's on my todo-list.) -- Jean

Re: [ANN] Leiningen 2.5.1 released

Hi there, On Monday, January 12, 2015 at 3:22:46 AM UTC+1, hba wrote: > > The message comes from wget [1] and to fix it i uninstalled it to let > leiningen-win-installer [2] use curl instead. > If it's more sensible to use curl over wget on Windows by default, then I'd like to have one of you

Re: About transients no longer being safe in 1.7-alpha2

g in logical threads. > I'd like to know how feasible a solution like that would be. > > Op dinsdag 4 november 2014 11:12:08 UTC+1 schreef Jean Niklas L'orange: >> >> Hi there, >> >> On Tuesday, November 4, 2014 8:05:03 AM UTC+1, Daniel Marjenburgh wrot

Re: About transients no longer being safe in 1.7-alpha2

this, although I feel it is implicit from the bash in-place rule. Perhaps that's something worth adding to the page to avoid confusion. -- Regards, Jean Niklas L'orange > Op dinsdag 4 november 2014 06:13:00 UTC+1 schreef Alex Miller: >> >> >> >> On Mo

Re: Is there a term for non-map collections?

On Friday, May 16, 2014 6:53:08 PM UTC+2, Mars0i wrote: > > Is there a single term that covers vectors, lists, sets, lazy sequences, > cons's, etc., but not maps? > I would use "a collection of keywords" in your example. As mentioned by Steve, a map is a collection of map entries/pairs, so a ma

Re: core.logic with functions

Hey Phillip, If you want to say "the goal g(x) shall succeed, for all x in this list", then use `everyg` from clojure.core.logic instead of map. I think it is exactly what you're looking for. On Monday, April 28, 2014 3:36:10 PM UTC+2, Phillip Lord wrote: > > > > I can do this with core.logic (

Re: fast parallel reduction into hash-set/map

Hello, On Saturday, March 15, 2014 11:37:11 PM UTC+1, Jules wrote: > > 2. I've had a look at rrb-vector - very fast for catvec - agreed, but > there does appear to be a performance penalty in terms of conj[!]-ing - I > can post my results if you are interested. I read the Bagwell paper on > wh

Re: Accumulate results without state?

Hello, On Tuesday, March 4, 2014 10:47:12 PM UTC+1, Jason Felice wrote: > > Something like > > (with-open [rdr (clojure.java.io/reader "/dev/errors-sunday.csv")] > (->> (line-seq rdr) > (filter #(re-matches #"...")) > (map #(nth (string/split % #",") 1 > > Will do what you

Re: fast parallel reduction into hash-set/map

Hi Jules, On Thursday, February 20, 2014 11:59:03 PM UTC+1, Jules wrote: > > Subvec provides a view on a subseq of a vector that behaves like a full > vector. Supervec provides a similar view that makes two vectors behave like > a single one > This data structure ("supervec") is usually known a

Re: fast parallel reduction into hash-set/map

On Sunday, February 16, 2014 11:49:38 AM UTC+1, Mikera wrote: > > Wow - that's a pretty big win. I think we should try and get this into > Clojure ASAP. > > Are we too late for 1.6? > Yeah, this is probably too late for 1.6 =/ Anyway, cool stuff you got going on here. I'm playing around with s

Re: Latex style file for formatting/coloring clojure code?

Hi Mark, On Monday, February 17, 2014 12:05:24 AM UTC+1, puzzler wrote: > > I am unable to find a style file that supports clojure code in LaTeX. Can > anyone point me in the right direction? > I always use Minted for this kind of stuff: See https://code.google.com/p/minted/ It is available i

Re: simple-check gen/boolean Only Returning false

On Saturday, January 25, 2014 10:03:13 PM UTC+1, Michael Daines wrote: > > I decided to play with simple-check for the first time and was working > through the examples on github. I noticed that all the values that use > gen/boolean are returning false. I never get a true. > > At the extreme en

Re: Auto updating Leiningen dependencies?

On Thursday, January 2, 2014 1:28:19 AM UTC+1, g vim wrote: > > Is there are a way to auto-update project.clj dependencies in Leiningen > or configure them to simply use the latest stable version? Instead of using "1.2.3", you can use "RELEASE" to specify the latest stable release. I would ne

Re: Leiningen 2.3.0 and uberjar

On Sunday, August 11, 2013 1:18:52 AM UTC+2, Nelson Morris wrote: > I believe this is https://github.com/technomancy/leiningen/issues/1283. > Yes. As Nelson says, this is 1283. As a workaround until 2.3.1 is out, downgrade by calling `lein upgrade 2.2.0` and then use uberjar from there. -- JN

Re: [ANN] Leiningen 2.3.0 released

Hey guys, I've hacked together a temporary fix for people who really, really, really want to use 2.3.0 right away, or have broken their lein script and just want to solve this "the easy way". I would NOT recommend people to upgrade right now, just wait until the jar has been set up with the rig

[ANN] Beckon - POSIX signal handling in Clojure

Hello Clojurians, I've released a tiny library for handling POSIX signals named Beckon. You can find more information and documentation at https://github.com/hyPiRion/beckon: It is not a library aimed to make POSIX signals simpler, but to make it easier to work with from Clojure without gettin

Re: with-open and for

I haven't seen the use of multiple statements in the for comprehension here, so perhaps it's nice to elaborate that this exists? (defn filter-file [filename] (with-open [rdr (io/reader filename)] (set (for [line (line-seq rdr) word (str/split line #"\s+") :when (<

Re: [ANN] if-and

On Monday, June 10, 2013 10:20:20 PM UTC+2, Steven Degutis wrote: > Sometimes I've wanted a function that takes a value and a bunch of tests, > and returns it if it passes every test, otherwise nil. > > Does this seem useful enough to put into core? > > A simpler variant already exists in core,

Re: What is the status of Clojure on LLVM or C?

nonexistant. As such, the GC cannot be completely cycle-ignorant, but perhaps it doesn't have to be efficient at finding them either. Another place where cycles happen are in (mutually) recursive functions, they may be iffy if you define many recursive anonymous functions at ru

Re: Why is using (not (empty? coll)) not idiomatic?

On Saturday, May 11, 2013 11:28:34 PM UTC+2, Sean Corfield wrote: > you could just write [...] > In some cases, this is even more readable: (if-not (empty? foo) (do-something-to foo) base-expr) which has the same effect, but in some cases, having (do-something-to foo) first may be more

Re: What is the status of Clojure on LLVM or C?

ned from creating Clojure? I'm sure Rich has some ideas on what should be done differently from what is currently done in Clojure right now, though perhaps aimed for the JVM implementation, and not in general. (Maybe you talked about this at Clojure/West?) -- Jean Niklas L'orang

Re: Problem installing Pedestal libraries

If you upgrade leiningen to 2.1.1 (`lein upgrade 2.1.1`) , it may be that the issue will be resolved as if by magic :) If you still get some issues, report it at https://github.com/technomancy/leiningen or join #leiningen on freenode, and we should be able to help you out. -- JN -- -- You r

Re: Metadata evaluation

On Tuesday, March 19, 2013 11:49:45 AM UTC+1, ajlopez wrote: > > Thanks Jean! > > Yes, I did that test before my email. > > But my doubt is: > > What part is in charge of metadata evaluation? > As Herwig commented: The part which evaluates metadata is without doubt the lisp evaluator's work, th

Re: Metadata evaluation

On Tuesday, March 19, 2013 9:49:09 AM UTC+1, ajlopez wrote: > > Hi everyone! Hi! The easiest thing to find out of this would be to check it out: (def ^{:a (+ 1 1)} two 2) ;=> user/two (meta #'two) ;=> { :a 2} So indeed, the forms within metadata is evaluated. -- Jea

Re: problem with dependencies

On Wednesday, March 13, 2013 3:17:49 PM UTC+1, Joachim De Beule wrote: > This gives the following error: > > "ClassNotFoundException org.mortbay.log.Logger > java.net.URLClassLoader$1.run (URLClassLoader.java:202)" > > The problem disappears when I do not include [ring.util.serve]. For some > r

Re: Using Leiningen 2.1.0-SNAPSHOT

On Saturday, March 16, 2013 1:03:27 AM UTC+1, Michael Klishin wrote: > > To upgrade: pull, compile. Sometimes re-bootstrapping is necessary if > there were leiningen-core changes. > It's often, if not always, when leiningen-core changes its project.clj map (updates dependencies or changes versi

Re: Proposal/request: Give clojure.core/conj a unary implementation

On Sunday, November 4, 2012 12:43:22 AM UTC+1, Ben wrote: > There might be a reason to write (apply f coll seqable) in a situation > in which f might be conj, though. > One may use (reduce f coll seqable) instead, if that makes sense semantically in that context. -- You received this message

Re: Parallelising reduce-kv

On Tuesday, October 9, 2012 9:14:51 PM UTC+2, Wolodja Wentland wrote: > > --- snip --- > (reduce-kv > (fn [ret k v] > (assoc ret k (func-that-does-something-with v))) > some-map)) > --- snip -- > > I am using reducers in other places, but am not entirely sure how to > employ > them her

Re: apply: increase performance by 60% for fixed length

On Sunday, October 7, 2012 11:15:28 PM UTC+2, Marc Dzaebel wrote: > > *apply *is slow. However you can increase performance by 60% with the > following macro, if you have a fixed length in S. > [...] > > (let[t(fn[](*apply *+ '(1 2 3 4 5 6 7 8 9 10)))] (time(dotimes [_ > 100] (t)))

Re: == is not transitive?

On Friday, October 5, 2012 7:17:50 PM UTC+2, Ben wrote: > > I'm not sure what you mean by this. Transitivity means that for all x, > y, and z, (Fxy & Fyz) => Fxz. But there are values of x, y, and z for > which that does not hold. > Yeah, sorry. What I meant was that == is only commutative if

Re: == is not transitive?

On Friday, October 5, 2012 2:39:05 AM UTC+2, Ben wrote: > > user> [(== 0 0.0) (== 0.0 0.0M) (== 0.0M 0)] > [true true false] > When passing two arguments to ==, == will be transitive. > user> [(== 0 0.0 0.0M) (== 0 0.0M 0.0) (== 0.0 0 0.0M) (== 0.0 0.0M 0) > (== 0.0M 0.0 0) (== 0.0M 0 0.0)

Re: Which power function is right for Clojure?

Numeric tower has implemented pow (named expt in the library), so you could have a look at their implementation: https://github.com/clojure/math.numeric-tower/blob/master/src/main/clojure/clojure/math/numeric_tower.clj#L64 (It utilizes exponentiation by squaring to get the running time from O(n)

Re: More Concise or Idiomatic Max Sub-Array?

> > Is there a more concise implementation, perhaps using `filter` or merely > by making the `reduce` version more "idiomatic" somehow? > Another version I believe is more evident utilizes reductions to build a list over all the *max-ending-here*s. You can then just pick the maximal value in