Re: Ghosts in the machine

Thanks for sharing! Sébastien Le jeudi 12 mai 2016 02:13:07 UTC+2, Daniel Szmulewicz a écrit : > > Hi all, > > The next version of system 0.3.0 is ready and it is a matter of days > before the official announcement. > > In the meantime, here is a summary of the research that has been carried

Re: [ANN] Predicat 0.2.2

VitalLabs/probe), which could > not only record the failures but also potentially feed them into a > monitoring system. Also, in tandem with Manifold ( > https://github.com/ztellman/manifold), I could see this greatly aiding > asynchronous error tracing. > > > On Sunday, March 27,

[ANN] Predicat 0.2.2

Hi all, I'm pleased to announce Predicat , a new validation library that permits to create and compose predicate functions whose failures always carry the expression and the input of the predicate that fails. See readme on github for the motivation examples:

Risk of unsafe publishing of LazyTransformer?

Hello, I noticed that LazyTransformer [1] implements mutable state without any volatile or final modifier to guard its fields (it might not be an isolated case in the core library e.g. SeqIterator.java). Isn't such class subject to unsafe publication? For example, considering only this part

Re: Risk of unsafe publishing of LazyTransformer?

moot. Alex On Monday, March 9, 2015 at 5:40:11 PM UTC-5, Sébastien Bocq wrote: Hello, I noticed that LazyTransformer [1] implements mutable state without any volatile or final modifier to guard its fields (it might not be an isolated case in the core library e.g. SeqIterator.java

Re: How to persist a value while doing do-seq

Le mercredi 4 mars 2015 22:08:13 UTC+1, Fluid Dynamics a écrit : For examining adjacent items in a sequence, there are a few functional (i.e., no mutable state) approaches. When the output is a sequence with an element for each adjacent pair: (map (fn [a b] ...) s (next s)) When the

Re: Performant flattening of nested data structures

Hi Mark, Here is a version runs about 1.3x faster on my setup. (defn flatten-keys [thing] (letfn [(-map-key [prefix k] (str prefix . (name k))) (-seq-key [prefix i] (str prefix [ i ])) (-flatten-entry [make-key prefix result entry] (let [[k v] entry]

Showing pretty forms with their result?

Hi, I would like to display the results of applying first, next, rest to different collections. In the end, I'd like to create an org table with the forms and their result. I began simply with this: (doseq [op '(first next rest)] (doseq [cs '((nil) ('() '(1 2 3))

Re: Showing pretty forms with their result?

:25 UTC+1, Sébastien Bocq a écrit : Hi, I would like to display the results of applying first, next, rest to different collections. In the end, I'd like to create an org table with the forms and their result. I began simply with this: (doseq [op '(first next rest)] (doseq [cs '((nil