Also, if you write your let bindings (according to common convention)
so that you have one binding per line, you can use ;; to create a line
comment, like:
(let [x 1
;;y 2
]
x)
(Ps. A single semicolon would suffice, but the double version keeps
indentation when formatting the buffer
Thanks for bringing deploy-repositories to my attention, I didn't know it
was there.
On Tue, Jun 10, 2014 at 5:22 AM, Phil Hagelberg p...@hagelb.org wrote:
Greetings!
I'm pleased to announce the release of Leiningen 2.4.0, our most
significant release in quite some time. The star of the
And I don't know if the level of off-topic contained in this reply is
appropriate, but I'd love to take on or help with any projects pro bono
Allen, just for the sake of having an experienced resource (i.e. you) that
I can ask questions! I have about three months of combined Clojure + Scheme
(boom)
On Mon, Jun 9, 2014 at 1:23 PM, Alex Miller a...@puredanger.com wrote:
Starting today, we have updated the Clojure Contributor Agreement process.
The prior process which involved signing and mailing a form has been
replaced with an online e-signing process.
Existing contributors that
On Monday, June 9, 2014 7:09:01 PM UTC-4, Andy Fingerhut wrote:
On Mon, Jun 2, 2014 at 6:54 AM, John Gabriele jmg...@gmail.com
javascript: wrote:
On Sunday, June 1, 2014 5:15:52 PM UTC-4, Andy Fingerhut wrote:
Thanks to Francois du Toit, the versions of the Clojure cheatsheet
available
Thank you for all you do. This is wonderful!
-Michael O'Keefe
On Tuesday, June 10, 2014 6:49:52 AM UTC-6, Tim Visher wrote:
(boom)
On Mon, Jun 9, 2014 at 1:23 PM, Alex Miller al...@puredanger.com
javascript: wrote:
Starting today, we have updated the Clojure Contributor Agreement
Hello Everyone,
I just released Slacker 0.12 and its cluster support module. In this
release, several bugs got fixed and there are also lovely features added
(nippy serialization, leader election, etc). For more detail, please
move to the project pages:
https://github.com/sunng87/slacker
I have been using lein-release
(https://github.com/relaynetwork/lein-release) for a while. It's surely
nice to see this feature built into core.
On Tue 10 Jun 2014 06:11:06 PM CST, Atamert Ölçgen wrote:
Thanks for bringing deploy-repositories to my attention, I didn't know
it was there.
On
*New: *+ and + will now thread through try and catch, and leave finally
alone.
packthread
Threading macros for working with globs of state.
https://github.com/maitria/packthread/blob/master/README.md#whyWhy?
Many descriptions about state in Clojure fit into the following form:
State is hard to
I am interested in solving a simple equation for all of its solutions when
some constraints are applied. This sounds like a problem for core.logic.fd.
Let's use a toy example:
8 = 3*x + 2*y, where x and y must be non-negative integers.
Here are the possible solutions: [x,y]= {[2,1],[0,4]}.
I found the solution to my first problem at
https://github.com/clojure/core.logic/wiki/Features (with a few small
changes by me):
(run* [q]
(fresh [x y]
(fd/in x y (fd/interval 0 9))
(fd/eq
(= (+ (* x 3) (* y 2)) 8))
(== q [x y])))
I suppose that I could set (fd/interval 0
That's that's the suggested way - just pick a large bound.
David
On Tue, Jun 10, 2014 at 11:28 AM, cej38 junkerme...@gmail.com wrote:
I found the solution to my first problem at
https://github.com/clojure/core.logic/wiki/Features (with a few small
changes by me):
(run* [q]
(fresh [x y]
Hello everyone,
http://crossclj.info
I've been working on CrossClj for some time now, and I feel it has grown
usable (and useful) enough to make a public announcement.
CrossClj is a tool to explore the whole Clojure(-script) open-source
ecosystem as an interconnected codebase.
The source
Hello everybody, I have a newbie question about destructuring and assigning
and didn't find an answer in documentation or books.
I have a list that contains an arbitrary number of elements for example
'(one two three ...) I now only that elements are strings.
I need to to take every element
Could you explain a little more what your end goal is?
It sounds like you want a map, but without knowing more about the purpose,
it's difficult to say.
- James
On 10 June 2014 16:43, Francesco Lunelli francesco.lune...@gmail.com
wrote:
Hello everybody, I have a newbie question about
This is so cool and extremely useful. Thank you so much for this!
Ghadi
On Tuesday, June 10, 2014 11:39:12 AM UTC-4, Francesco Bellomi wrote:
Hello everyone,
http://crossclj.info
I've been working on CrossClj for some time now, and I feel it has grown
usable (and useful) enough to make
Cool update!
On Tuesday, June 10, 2014 10:29:34 PM UTC+8, Sun Ning wrote:
Hello Everyone,
I just released Slacker 0.12 and its cluster support module. In this
release, several bugs got fixed and there are also lovely features added
(nippy serialization, leader election, etc). For more
I'm getting a 403 error on
https://leiningen.s3.amazonaws.com/downloads/leiningen-2.4.0-standalone.jar
when I run lein upgrade...
Is this just me?
On Tue, Jun 10, 2014 at 3:31 PM, Sun Ning classicn...@gmail.com wrote:
I have been using lein-release (https://github.com/
The same for me:
Error
CodeAccessDenied/Code
MessageAccess Denied/Message
RequestId8BF2847E2A8F7FEF/RequestId
HostId
xGsEqKhBDcDZb6mc41WeQdJoHgUQRnILPzWuVZZsVJSDWK4/SYUQ2game588rvm/
/HostId
/Error
On 10.06.2014 18:42, David Powell wrote:
I'm getting a 403 error
on
Thanks for the answer, I try to explain better what I have to do.
I need to create some nodes in Neo4j then I need to create relationships
between those nodes.
This is an example taken from necons doc.
(let [conn (nr/connect http://localhost:7474/db/data/;)
page1 (nn/create conn {:url
In a similar vein to Nelson Morris
http://nelsonmorris.net/2014/04/07/saturday-remote-pairing.html (his
availability is booked), I'd like to pair with someone to help get my foot
further in the door than it already is. I have a couple months of
experience under me. I'd love to help with
Hi Francesco,
You want to decouple your code from the data that it is operating on, so
your code can operate regardless of the contents of the list. Otherwise,
you'll need code that matches the list, in which case it could all be code
anyway. Operating on arbitrary lists makes it easy to test
Thanks for the answer.
If I understand well your code it's a partial answer to my question because
if I'm not wrong it creates a link between to elements at a time. What I
need is to create all the elements then create on them every kind of
relation.
I take as example a graph db used in another
Sorry if that was already answered,
Is there a possibility to get rid of this legalwall?
I realize that there are good intents behind the existing practice, but it
feels a bit wrong for an open source artifact in the digital age of instant
sharing.
Starting today, we have updated the Clojure
Welcome to the real world, where programmer ideals are often overridden
by the concerns of lawyers. That's what it comes down to, you have to do it
this way in the US (and other places) or risk legal issues.
https://www.clahub.com/pages/why_cla
Timothy
On Tue, Jun 10, 2014 at 2:35 PM, Sergey
I picked a toy problem that was really easy to solve, figuring that once I
had the idea down, I would be able to easily change the equation to the one
that I am interested in solving. In moving to my real problem I hit the
next snag I can't use real numbers within the equation. I note that
Hi Francesco,
I apologize for using for earlier, as I did not explain how you should be
using it. The comment of do something with rel should have indicated that
it resolved to an expression, and those expressions would be returned in a
seq (the for expression resolves to have a value of a seq).
What about the real world
constraints ?
As far as I know, everyone needs
air, water, heat, and a minimal food
ration to survive.
The day I cut your air away, I bet
you'll be suddenly be very concerned
about the 'the physical world' and
that you will relinquish the
'digital age' way back
It doesn't totally make sense to me that you would have integer variables
with real coefficients. If the coefficients are irrational and are not
scaled versions of each other, then the problem is impossible. Otherwise,
you can just scale them by a common factor and make them integers. For
Hi Paul,
2014-06-06 17:28 GMT+02:00 Paul Gearon gea...@gmail.com:
I've split up the namespace pretty much the same way that you did (since I
totally agreed with that). To that end I ought to put your name down as the
author, though I typically end up changing things in each file, so it's got
Excuse my ignorance. But from what I've read, it all seems fair game.
Essentially contributors are assigning the same rights they have to
project's creator, no? What exactly feels wrong to you?
On Tue, Jun 10, 2014 at 8:35 PM, Sergey Didenko sergey.dide...@gmail.com
wrote:
Sorry if that was
I figured out the problem. Although the article fails to mention the need
for modifying the (ns ...) form to reflect the *quil* dependency, the code
available for download has the needed change. Now I'm on to the next
error, this time using the downloaded code. I'll spend a bit more time
I just wanted to post a public Thank You! to Mark Engelberg for his
Instaparse library.
https://github.com/Engelberg/instaparse
We are just starting to use this at World Singles so that we can provide a
natural language interface to our search engine, allowing our internal
support
33 matches
Mail list logo
