In addition to what the others said, try symbolhound:
http://symbolhound.com/?q=%23%27+clojure
--
Michael Wood
On 05 Jun 2015 10:05 PM, "Dru Sellers" wrote:
> Trying to google what #' means is tricky to say the least.
>
> Is there a good name for these that I can google to read up on them?
>
>
>
> Bitcoin?
>
Unfortunately my local supermarket doesn't accept it yet.
On 7 June 2015 at 04:11, Fluid Dynamics wrote:
> On Saturday, June 6, 2015 at 5:05:59 AM UTC-4, Colin Fleming wrote:
>>
>> Thanks for the kind words Fergal, and as I said in my other mail, I'm
>> very pleased to see more
On Saturday, June 6, 2015 at 5:05:59 AM UTC-4, Colin Fleming wrote:
>
> Thanks for the kind words Fergal, and as I said in my other mail, I'm very
> pleased to see more people thinking about this problem. It's a hard one,
> for sure - I'd love to be able to open source Cursive but I haven't seen
Yes, I should have said :refer, not :require.
On Friday, June 5, 2015 at 11:09:37 PM UTC-5, Sean Corfield wrote:
>
> I think you mean :as vs :refer?
>
> The consensus is that using :as makes it easier to see where each symbol
> comes from when you're reading the code -- and avoids name conflicts
(for [[x y z] {:a "aa" :b "bb" :c "cc"}] [x y z])
([:c "cc" nil] [:b "bb" nil] [:a "aa" nil]);; WTF?
So her, I guess, your taking each entry in the map and destructuring them into
the three vars x, y, and z. Since each map entry is a pair, the third var z
will be nil.
Erik.
--
i farta
x and y are destructured into the key and value of each map entry. Z is
nil.
The second example uses seq to convert the map into a sequence of map
entries and then it destructures the seq (not the map entries themselves).
The third example does destructure the map entries.
(let [[a b c] [1 2]] [a
Yes, if-and-let is similar to if-let-all.
On Friday, June 5, 2015 at 10:47:24 PM UTC+9, Fluid Dynamics wrote:
>
> On Friday, June 5, 2015 at 1:53:07 AM UTC-4, crocket wrote:
>>
>> Ouch, I didn't write. Gary Fredericks wrote it. I simply modified his
>> if-let-all macro a little bit.
>>
>> On Frid
On 06/06/2015 05:01, Sean Corfield wrote:
Page 84 is where it shows that maps are a sequence of pairs.
The destructuring in James's code is on vectors -- the pairs in the
sequence.
Hope that helps?
Sean
Page 84 describes the sequence abstraction in general but it's the
implicit seq in for
Thanks for the kind words Fergal, and as I said in my other mail, I'm very
pleased to see more people thinking about this problem. It's a hard one,
for sure - I'd love to be able to open source Cursive but I haven't seen
any viable way to do so except by selling it to a company who can afford to
pa
Just to be clear the GPL (version 2 and 3) does not contain the defer
clause you mention.
The link you provide is to a draft additional permission which can be used
to amend the GPL.
On Friday, June 5, 2015 at 2:11:53 PM UTC+2, Fergal Byrne wrote:
>
> Hi Frank,
>
> That's a great post (and the
>
> Lots of companies already are successfully built on open source
I'm not sure there are so many, actually. Or at least, that there are very
many models - it's almost exclusively the Red Hat model. SideKiq is another
(open source feature limited free edition, closed source paid Enterprise
editi
11 matches
Mail list logo
