Re: ANN: Kibit 0.1.2 is released

Hi Daniel, thanks a lot for this great plugin! I've just run it on a project but I don't get this: Consider using: :p instead of: (fn [s] [:p s]) I'd understand it if it was (fn [s] (:p s)) can you explain it? Thanks again On Monday, April 20, 2015 at 2:26:20 PM UTC+2, Daniel Compton wrot

Re: ANN: Reagent 0.4.0

ed to the latest react. > > On Friday, August 29, 2014 7:21:46 AM UTC-4, Cesare wrote: >> >> Hi Dan, >> I'm playing with Reagent and I find it very simple and promising. Thanks >> for it! >> >> Anyway, the last update was 5 months ago (react 0.10.0): is th

Re: ANN: Reagent 0.4.0

Hi Dan, I'm playing with Reagent and I find it very simple and promising. Thanks for it! Anyway, the last update was 5 months ago (react 0.10.0): is the project still alive and well? Thanks in advance! Il giorno sabato 22 febbraio 2014 09:11:42 UTC+1, Dan Holmsand ha scritto: > > Reagent is no

Re: Pathfinding via core.logic

You could hack the following example: https://groups.google.com/forum/#!msg/clojure/4zrTBUzIxWQ/OYfGom-VY3oJ Il giorno martedì 24 luglio 2012 20:21:53 UTC+2, tbc++ ha scritto: > > I have a problem I'm interested in using core.logic with: > > Let's say I have a set of rooms in a maze, they are

Re: first core.logic experiment

On Mar 22, 2:47 pm, David Nolen wrote: > Neat! I see that you figured out defne, you could probably simplify > doactiono with matche as well. ok, I'll try soon. > The Clojure REPL doesn't print exceptions by default, but I'm sure if you > print it out with (clojure.repl/pst *e) you'd see that it

first core.logic experiment

Hi all, I'm experimenting with clojure.core: very nice! This is a simple planner for the Farmer Crosses River puzzle: (def characters [:farmer :goat :wolf :cabbage]) ;;; they all start on the left side of the river (def _starting-state {:farmer :l, :goat :l :wolf :l :cabbage :l}) ;;; they all m

CfP + Deadline Extension: IEEE Software Special Issue: Algorithms and Today’s Practitioner

sandro Tommasi, Comprendo Srl — a.tomm...@comprendo.it - Cesare Zavattari, Comprendo Srl — c.zavatt...@comprendo.it -- 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 p

Re: CfP: IEEE Software Special Issue: Algorithms and Today’s Practitioner

Favaro, INTECS SpA - john.fav...@intecs.it Alessandro Tommasi, Comprendo Srl - a.tomm...@comprendo.it Cesare Zavattari, Comprendo Srl - c.zavatt...@comprendo.it Submission Information Manuscripts must not exceed 4,700 words including figures and tables, which count for 200 words each. Submissions in

CfP: IEEE Software Special Issue: Algorithms and Today’s Practitioner

andro Tommasi, Comprendo Srl — a.tomm...@comprendo.it Cesare Zavattari, Comprendo Srl — c.zavatt...@comprendo.it -- 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

Re: complexity of subvec

On Oct 3, 5:21 pm, Rich Hickey <[EMAIL PROTECTED]> wrote: > Yes. If it is important to get access bounded by the subvector's N you > can just call vec on it, at a one-time O(subvecN) cost. > > It is important to note that for vectors that are created by vec (and > literals) that have never been up

Re: complexity of subvec

On Oct 3, 4:42 pm, Rich Hickey <[EMAIL PROTECTED]> wrote: > On Oct 3, 10:12 am, Cesare <[EMAIL PROTECTED]> wrote: > Subvectors can be created in constant time because they copy nothing > and share structure with the original. So, they are effectively views > on the origin

complexity of subvec

Hi All, I'm reading the Clojure documentation and there is something I don't understand about vector functions. "Vectors support access to items by index in log32N hops" but this seems in contrast with the fact that 'subvec' is O(1) (few lines later). If subvec was O(1), it would be possible t