Re: Demoralising experience trying to install on Win 7

Hi, I experience one problem too with leining 2.5.0 (not sure if it happened before already). The upgrade to leiningen 2.5.0 from 2.4.x was broken. The same happened yesterday when I tried to install leiningen in a new environment on windows 7. Not sure what the exact output of leiningen during

Demoralising experience trying to install on Win 7

Hi Wanting to get Clojure running on a Win 7 machine with no diskspace for dual boot. It's been a demoralising experience. I tried the Win installer linked from the Leiningen website. It failed to download the Leiningen 1 jar - the shell simply flashed open and crashed. Dug around the git site

Re: how to count items in a list

On Friday, October 24, 2014 11:41:47 AM UTC-7, Roelof Wobben wrote: > > Hello, > > Im at exercise 21 : > http://iloveponies.github.io/120-hour-epic-sax-marathon/structured-data.html#exercise-20 > > Where I have to find out if a sequence has duplicates. > > But I have no clue how to handle this .

Re: State of Clojure/ClojureScript 2014 survey results

On Thursday, October 23, 2014 8:59:21 AM UTC-7, Alex Miller wrote: > I've published links to the State of Clojure and ClojureScript 2014 survey > results here: > http://blog.cognitect.com/blog/2014/10/20/results-of-2014-state-of-clojure-and-clojurescript-survey > > > > That page links to some r

ANN Meltdown 1.1.0 is released

Meltdown is a Clojure interface to Reactor, an asynchronous programming, event passing and stream processing toolkit for the JVM. Release notes: http://blog.clojurewerkz.org/blog/2014/10/25/meltdown-1-dot-1-0-is-released/ Documentation: https://github.com/clojurewerkz/meltdown#documentation Ther

ANN Elastisch 2.1.0-beta9 is released

Elastisch [1] is a small, feature complete client for ElasticSearch that provides both REST and native clients. Release notes: http://blog.clojurewerkz.org/blog/2014/10/25/elastisch-2-dot-1-0-beta9-is-released/ 1. http://clojureelasticsearch.info -- @michaelklishin, github.com/michaelklishin -

ANN Cassaforte 2.0.0-beta8 is released

Cassaforte [1] is a Clojure Cassandra client built around CQL 3. This release introduces a breaking public API change. Release notes: http://blog.clojurewerkz.org/blog/2014/10/13/cassaforte-2-dot-0-0-beta8-is-released/ 1. http://clojurecassandra.info -- @michaelklishin, github.com/michaelklishi

Re: how to count items in a list

On Friday, October 24, 2014 4:38:46 PM UTC-4, Fluid Dynamics wrote: > > On Friday, October 24, 2014 4:28:54 PM UTC-4, Fluid Dynamics wrote: >> >> On Friday, October 24, 2014 4:19:52 PM UTC-4, Fluid Dynamics wrote: >>> >>> (= s (distinct s)) looks to me like it should return true if it lacks >>>

Re: how to count items in a list

On Friday, October 24, 2014 4:28:54 PM UTC-4, Fluid Dynamics wrote: > > On Friday, October 24, 2014 4:19:52 PM UTC-4, Fluid Dynamics wrote: >> >> (= s (distinct s)) looks to me like it should return true if it lacks >> duplicates, false if it has duplicates, and, due to how laziness and = >> work

Re: how to count items in a list

On Friday, October 24, 2014 4:19:52 PM UTC-4, Fluid Dynamics wrote: > > (= s (distinct s)) looks to me like it should return true if it lacks > duplicates, false if it has duplicates, and, due to how laziness and = > work, short circuit as soon as any duplicate item is found. > > Your way sounds

Re: how to count items in a list

(= s (distinct s)) looks to me like it should return true if it lacks duplicates, false if it has duplicates, and, due to how laziness and = work, short circuit as soon as any duplicate item is found. Your way sounds closer to how this version works: (defn dupes? [c] (->> c (frequencies)

[ANN] Introducing milestones, a little project scheduling Library.

Hi all, I am very excited to present my work on the project scheduling library in Clojure! This is a first shot in what I hope will end up being a set of useful tools for the devz community in a general, The automagic.tools project! Please check it out here: https://github.com/automagictools/mi

Re: Modelling in Clojure

On Thursday, October 16, 2014 11:19:32 PM UTC+2, Tom Oram wrote: > > In Clojure, would you consider hiding the data behind a set of specialised > functions to create, access and use it? Or would you just pass the > primitive string/map/vector/whatever about and work on it directly? > Stuart Sier

how to count items in a list

Hello, Im at exercise 21 : http://iloveponies.github.io/120-hour-epic-sax-marathon/structured-data.html#exercise-20 Where I have to find out if a sequence has duplicates. But I have no clue how to handle this . I think making a set of it and then map count the old one with the set I have m

Re: Question about test.check, and knossos

Oh thank goodness, I've been directing people towards the source for test.check, which is obviously sub-optimal. Thanks for adding that! On Fri, Oct 24, 2014 at 11:43 AM, Reid Draper wrote: > Hey Andy, > I've added a link to the API documentation [1]. And I'll update Codox for > the next versi

Re: Question about test.check, and knossos

Hey Andy, I've added a link to the API documentation [1]. And I'll update Codox for the next version of test.check, hopefully to be released shortly. [1] https://github.com/clojure/test.check/commit/200b77bbf24b67d2904dab4d4f5722badbe8b223 Reid On Thursday, October 23, 2014 11:44:54 PM UTC-5,

CljOS - An OOP system on Clojure

CljOS is a single-inheritance OOP system in Clojure that I wrote over the weekend. Would love some feedback. :) -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegr

Re: [ANN] Arcadia, the integration of Clojure and Unity3D

On Friday, 24 October 2014 16:20:41 UTC+1, Fluid Dynamics wrote: > > > Really? .NET running on iOS? That'll be the day. :) > http://xamarin.com/faq#q5 :-) Jony -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to c

Re: [ANN] Arcadia, the integration of Clojure and Unity3D

On Friday, October 17, 2014 3:10:29 PM UTC-4, tims wrote: > > Ramsey Nasser and I are excited to announce the alpha release of Arcadia, > the integration of Clojure 1.7 into the Unity3D > game engine and development platform. > > Based on Clojure's CLR branch

Re: Particle system with Quil

On Friday, October 24, 2014 11:14:56 AM UTC-4, Fluid Dynamics wrote: > > On Friday, October 24, 2014 10:42:37 AM UTC-4, Kasper Jordaens wrote: >> >> Hey, >> >> I've been experimenting with newtonian, I love it, but I have a simple >> question, because I'm stuck >> >> after adding some emitters >

Re: Particle system with Quil

On Friday, October 24, 2014 10:42:37 AM UTC-4, Kasper Jordaens wrote: > > Hey, > > I've been experimenting with newtonian, I love it, but I have a simple > question, because I'm stuck > > after adding some emitters > > [#newtonian.corporum.ParticleEmitter{:position > #newtonian.utils.Vector2D{:

Re: reorganizing/naming args with partial

On Friday, October 24, 2014 10:27:58 AM UTC-4, Sam Raker wrote: > > (Accidentally hit 'enter' prematurely :( ) > From what I can tell, `partial` goes 'in order'. As such, you can't pass > it a fn that takes > 1 args and the 2nd...nth args. In Python, at least, > you can explicitly name positional

Re: Particle system with Quil

Hey, I've been experimenting with newtonian, I love it, but I have a simple question, because I'm stuck after adding some emitters [#newtonian.corporum.ParticleEmitter{:position #newtonian.utils.Vector2D{:x 23.0, :y 280.0}, :velocity #newtonian.utils.Vector2D{:x 0.0, :y 10.0}, :size 8, :lif

reorganizing/naming args with partial

(Accidentally hit 'enter' prematurely :( ) >From what I can tell, `partial` goes 'in order'. As such, you can't pass it a fn that takes > 1 args and the 2nd...nth args. In Python, at least, you can explicitly name positional arguments, e.g. def my_func(x, y, z): return x + y * z

reorganizing/naming args with partial

>From what I can tell, `partial` goes 'in order'. As such, you can't pass it a fn that takes > 1 args and the 2nd...nth args. In Python, at least, you can explicitly name positional arguments, e.g. def my_func(x, y, z): return x + y * z p -- You received this message because

Re: map problem (Ilove ponies)

oke, So map is taking the first item of coll and put's it in x. Then it calling second-item . Now I understand . Thanks a lot for the patience and explanation. Roelof Op vrijdag 24 oktober 2014 16:01:48 UTC+2 schreef Laurens Van Houtven: > (defn double [x] (* x 2)) > > See, x is right the

Re: map problem (Ilove ponies)

(defn double [x] (* x 2)) See, x is right there ^ Now, I do (double 10). How does Clojure “know what the x is”? There’s no x in that expression. Exactly the same with map. The x is just a name; it doesn’t matter what it is. The only thing that matters is that you call that function (whether it

Re: map problem (Ilove ponies)

Sorry but I still do not have a clue how clojure knows what x is. the first part where x is mentioned is the fn part and on the map part there is no mention about x. Roelof Op vrijdag 24 oktober 2014 15:51:30 UTC+2 schreef Laurens Van Houtven: > Hi Roelof, > > > I understand that part. >

Re: map problem (Ilove ponies)

Hi Roelof, > I understand that part. > > so we have (map second-item collection) where second-item and collection are > arguments of map. Yep. > Then we have second-item ( fn [x] (get x 2) > which can be read as : > > ( second-item [x] (get x 2) . This makes no sense to me. second-item

Re: filter but for non-sequences

(defn if-its [pred x] (if (pred x) x)) => (if-its even? 4) 4 => (if-its even? 5) nil Or, if you want a macro for performance reasons or something, and don't mind the loss of e.g. (filter identity (map (partial if-its pred) coll)): (defmacro if-its [pred x] `(let [a# ~x] (if (~pred a#)

Re: map problem (Ilove ponies)

Op vrijdag 24 oktober 2014 15:32:33 UTC+2 schreef Laurens Van Houtven: > > Hi Roelof, > > On 24 Oct 2014, at 15:12, Roelof Wobben > > wrote: > > > I understand that part but when I look at the map part there is no x. > When I look at the function no x. > > I’m assuming you mean that when yo

Re: [ANN] Arcadia, the integration of Clojure and Unity3D

Thanks, Tims. I'll try it out later this week and post some feedback of my experiences here! On Friday, October 17, 2014 9:10:29 PM UTC+2, tims wrote: > > Ramsey Nasser and I are excited to announce the alpha release of Arcadia, > the integration of Clojure 1.7 into the Unity3D

Re: map problem (Ilove ponies)

Hi Roelof, On 24 Oct 2014, at 15:12, Roelof Wobben wrote: > I understand that part but when I look at the map part there is no x. When I > look at the function no x. I’m assuming you mean that when you look at the function, you do see the x — it’s right there, both in the argument list and i

Re: [ANN] Immutant 2.0.0-alpha2

Good catch, thanks! Fixed: https://github.com/immutant/immutant/commit/49b22d34105135c83f5e7b849e2acc0312006c82 - Toby Christian Romney writes: > One small nit with the documentation (web guide): like hello and howdy, hola > begins with an "h", albeit a silent one. -- You received this mess

Re: map problem (Ilove ponies)

I understand that part but when I look at the map part there is no x. When I look at the function no x. So how does Clojure know what the value of x is. Roelof Op vrijdag 24 oktober 2014 15:06:05 UTC+2 schreef Laurens Van Houtven: > Hi Roelof, > > On 24 Oct 2014, at 15:00, Roelof Wobben >

Re: filter but for non-sequences

On 24 Oct 2014, at 15:05, Sam Raker wrote: > "I think the point is to get nil if x does not satisfy some predicate." <-- > exactly. … and shorter than (when (p x) x)? If you can come up for a good name for that, I guess you could macro it? :-) hth lvh signature.asc Description: Message sign

Re: map problem (Ilove ponies)

Hi Roelof, On 24 Oct 2014, at 15:00, Roelof Wobben wrote: > (defn second-elements [collection] >(let [second-item (fn [x] (get x 1))] > (map second-item collection))) > > one thing I m not sure I understand complete. x is the output of the map > command, if so, how does Clojure know t

Re: filter but for non-sequences

"I think the point is to get nil if x does not satisfy some predicate." <-- exactly. I basically want something like `if-let`, but which returns x instead of f(x). `(if-let [m-with-k (contains? m k)]...` results in `m-with-k` evaluating to `true`, not `m`. I *think* it's better to reject someth

Re: map problem (Ilove ponies)

Yes. I solved the problem with : (defn second-elements [collection] (let [second-item (fn [x] (get x 1))] (map second-item collection))) one thing I m not sure I understand complete. x is the output of the map command, if so, how does Clojure know that. Roelof Op vrijdag 24 oktober

Re: map problem (Ilove ponies)

Hi Roelof, OK, so, what you want to do is look at the example right before it, (defn mungefy …). You want to do something very similar: except instead of munge you’ll have a different (fn [x] …) that uses get on x. Make sense? hth lvh signature.asc Description: Message signed with OpenPGP

Re: map problem (Ilove ponies)

I try to make exercise 16. Roelof Op vrijdag 24 oktober 2014 14:27:19 UTC+2 schreef Laurens Van Houtven: > Hi Roelof, > > > I had no idea iloveponies was a Clojure introduction. > > > https://iloveponies.github.io/120-hour-epic-sax-marathon/structured-data.html > > What exercise are you at

Re: map problem (Ilove ponies)

Hi Roelof, I had no idea iloveponies was a Clojure introduction. https://iloveponies.github.io/120-hour-epic-sax-marathon/structured-data.html What exercise are you attempting, exactly? cheers lvh signature.asc Description: Message signed with OpenPGP using GPGMail

Re: map problem (Ilove ponies)

Thanks, but still very confusing for a beginner. the exercise is talking about using a helper function and it looks like second does the same as (get coll 1 ) Roelof Op vrijdag 24 oktober 2014 14:19:28 UTC+2 schreef Laurens Van Houtven: > Hi Roelof, > > On 24 Oct 2014, at 14:16, Roelof Wob

Re: map problem (Ilove ponies)

Hi Roelof, On 24 Oct 2014, at 14:16, Roelof Wobben wrote: > oke, and second could be the helper function. `second` is part of Clojure. You do not have to write it. > I know what schould be done map has to pick up the items and on that item I > have to be doing the get. Yes. map calls its fi

Re: map problem (Ilove ponies)

Op vrijdag 24 oktober 2014 14:09:13 UTC+2 schreef Laurens Van Houtven: > > Hi Roelof, > > On 24 Oct 2014, at 14:05, Roelof Wobben > > wrote: > > > I have to use map and get a vector of all the second items in a list. > > I know I can use map to do things with all the items in a list. > > and

Re: map problem (Ilove ponies)

Hi Roelof, On 24 Oct 2014, at 14:05, Roelof Wobben wrote: > I have to use map and get a vector of all the second items in a list. > I know I can use map to do things with all the items in a list. > and with get I can get the second item (get collection 1) Yes, depending on what the items in the

Re: Retrieving the namespace an expression in compiled in

Oopsie daisy. Sorry, James––thanks for your hard work. On Fri, Oct 24, 2014 at 12:59 PM, Herwig Hochleitner wrote: > 2014-10-24 10:20 GMT+02:00 Brian Guthrie : > >> Depending on how deep your investment in Compojure is, I've found ... >> > > I'd imagine James' investment with Compojure to be qui

map problem (Ilove ponies)

Hello, I have to use map and get a vector of all the second items in a list. I know I can use map to do things with all the items in a list. and with get I can get the second item (get collection 1) map uses this map what_has _to_be_done collection so I thougt this would work (map (get coll

Re: Retrieving the namespace an expression in compiled in

On 24 October 2014 09:20, Brian Guthrie wrote: > Depending on how deep your investment in Compojure is, I've found Silk's > ability to derive a path once defined (bidirectional routes) to be quite > handy and very clean. I also prefer its general philosophy, though the > library's in its early da

Re: Retrieving the namespace an expression in compiled in

2014-10-24 10:20 GMT+02:00 Brian Guthrie : > Depending on how deep your investment in Compojure is, I've found ... > I'd imagine James' investment with Compojure to be quite substantial, given that he is its primary author ;-) -- You received this message because you are subscribed to the Googl

Re: filter but for non-sequences

I think the point is to get nil if x does not satisfy some predicate. The best option would depend on the context in which these expressions are used, but one option would be to write your predicates to return the input as the truthy value (and nil otherwise). On Friday, 24 October 2014, Laurens

Re: Retrieving the namespace an expression in compiled in

Depending on how deep your investment in Compojure is, I've found Silk's ability to derive a path once defined (bidirectional routes) to be quite handy and very clean. I also prefer its general philosophy, though the library's in its early days and I haven't tested it extensively. However, it does

Re: [ANN] thi.ng/crypto - GPG/OpenPGP keypair generation, file/stream encryption helpers

GPG integration is a requirement for an upcoming project. Glad to have two options to choose from! If you end up collaborating, please share your planned path forward so I know which project to track. :) On 10/23/2014 03:45 PM, Karsten Schmidt wrote: > W00t! Thanks for the heads up! That looks fa

Re: filter but for non-sequences

Hi Sam, I’m not sure I understand. If not for sequences, then what for? `(if (pred x) x)` looks like it’s missing an else-clause; so I don’t know what happens when (not (pred x)). From the rest of your e-mail it sounds a little bit like you might want (get m x x)? (i.e. get me x if x isn’t in