Intellij diffs, FileMerge, or Meld - they all highlight the words that
changed not just the lines.
On Thu, Jun 6, 2013 at 7:57 PM, John D. Hume wrote:
> One neat hidden Github feature is that if you add the query string
> parameter w=1 to any diff view, it will ignore whitespace-only changes
> (l
One neat hidden Github feature is that if you add the query string
parameter w=1 to any diff view, it will ignore whitespace-only changes
(like passing -w to git diff).
That doesn't help with those final lines with added or removed close
parens, but it still improves readability of many diffs.
htt
Hi all,
Diffs for clojure code (and lisps in general) can be hard to read. Every
time we wrap a form, any lines below are indented. The resulting diff just
shows that you've deleted lines and added lines, even though you've only
changed a few characters.
What diff tools do people use to addres
Alexandru's analysis is spot on.
Here's the pithy IRC version I've used in the past: "C# has a better type
system and compiler, so it doesn't need as good of a JIT. That's a problem
for languages that aren't C#, especially dynamic ones."
There are lots of caveats, but that more or less covers i
On Jun 5, 2013, at 11:12 AM, Catonano wrote:
> My 2 cents:
>
> it´s ture that the Emacs features are not discoverable and that the learning
> curve is mean.
>
> But it also true that once you´ve done it, it brings you a great value.
>
> My suggestions about Emacs:
>
> 1) ...
> 2) ...
> 3) ..
On Thu, Jun 6, 2013 at 4:27 PM, Mark Engelberg wrote:
> Short answer: This is fixed in 1.2.0-SNAPSHOT.
>
To be clear, just change your project file to [instaparse "1.2.0-SNAPSHOT"]
and you should be good to go. As a bonus, there are some new perf
improvements and features already in there, slate
Short answer: This is fixed in 1.2.0-SNAPSHOT.
Long answer:
There was a file in instaparse that had two functions:
parser->str
and
Parser->str
On case-insensitive filesystems, the clojure compiler ends up spitting out
a bunch of classfiles that correspond to the different functions, and the
one
Sure; just to clarify, I was definitely talking about capturing test *input*,
not output.
BTW, if anyone with a hardware testing background have pointers to good
literature on the topic that might be accessible to lowly software twiddlers,
fire away... :-)
- Chas
On Jun 6, 2013, at 6:16 PM, P
I can quite imagine seeing a failure from a Travis ci run which can't be
explained by the test output; being able to reproduce it locally is the
first step towards diagnosis.
(warning: thread drift ahead...)
I also have a hardware background - specifically, xilinx FPGAs. The xilinx
synthesis tool
I just realized it after I posted, but thanks for the help anyways.
On Thursday, 6 June 2013 15:27:28 UTC-4, Jim foo.bar wrote:
>
> On 06/06/13 20:23, JvJ wrote:
> > Is there a shorter form of [&{:keys [] :as m}]?
>
> if you don't care about the actual keys just do this:
>
> [& {:as m}]
>
> HT
Thanks for that perspective, Andy!
It sounds like one ends up looking for canaries in the coal mine, perhaps just
borderline behaviour or results, odd "sideband emissions", etc. that indicate
that it'd be worthwhile to turn the debug knobs up to 11. It's interesting to
think of cases where the
I've worked on hardware logic design, where the time and effort required to
create good tests that find subtle bugs rivals the complexity of the
hardware being designed itself. In this context, much of the testing has
often been generated using pseudo-random streams similar to test.generative
and
yes, a constant is weird. whenever i've implemented my own variant of
this, i always use a seed from the clock or whatever, and then spit
out the seed in test/assertion failure messages so people can paste it
back in to reproduce.
--
--
You received this message because you are subscribed to the
Well, if *that's* all it is, I'll feel like quite the heel for putting so much
thought into it! ;-)
Assuming failures are rarer, then starting with a just-previously-failed seed
would be better as an explicit action, rather than defaulting to a constant?
- Chas
On Jun 6, 2013, at 3:21 PM, Raou
On 06/06/13 20:23, JvJ wrote:
Is there a shorter form of [&{:keys [] :as m}]?
if you don't care about the actual keys just do this:
[& {:as m}]
HTH,
Jim
--
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to cl
[& {:as m}]
On Fri, Jun 7, 2013 at 3:23 AM, JvJ wrote:
> Consider the following:
>
> (let [ [&{:keys [] :as m}] [:a 1 :b 2 :c 3]]
> m)
>
> ==> {:a 1 :b 2 :c 3}
>
> Is there a shorter form of [&{:keys [] :as m}]?
>
> --
> --
> You received this message because you are subscribed to the Goo
Well... I'm a dingus.
[&{:as m}]
On Thursday, 6 June 2013 15:23:22 UTC-4, JvJ wrote:
>
> Consider the following:
>
> (let [ [&{:keys [] :as m}] [:a 1 :b 2 :c 3]]
> m)
>
> ==> {:a 1 :b 2 :c 3}
>
> Is there a shorter form of [&{:keys [] :as m}]?
>
--
--
You received this message because yo
Consider the following:
(let [ [&{:keys [] :as m}] [:a 1 :b 2 :c 3]]
m)
==> {:a 1 :b 2 :c 3}
Is there a shorter form of [&{:keys [] :as m}]?
--
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@goog
i always thought it was basically solely for letting you re-run the
test that just/previously failed, nothing more weird or silly than
that.
--
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.
I've used test.generative[1], data.generators[2], and most recently,
simple-check[3] to perform specification-based testing of various libraries
for some time now, and now consider such tools indispensable.
However, one thing that's never sat well with me about them is the
implicit objective of pr
Guessing a bit here.
1. This file
https://github.com/Engelberg/instaparse/blob/master/src/instaparse/print.cljdefines
fns called parser->str and Parser->str.
2. Windows has a case-insensitive filesystem.
3. [guess] Something about class files getting overwritten?
4. [guess] Instaparse can't work on
Folks,
I'm skipping Midge for the time being.
I've written up a little more on my environment for other newbies:
http://blog.goodstuff.im/clojure_setup
I plan to read more of Chas' book on my NYC flight on Saturday.
Thanks,
David
On Wed, Jun 5, 2013 at 2:44 AM, Chas Emerick wrote:
> Hi D
The java core library also provides LinkedHashMap which preserves insertion
order, although this is a mutable bash-in-place data structure rather than
an immutable persistent data structure.
On Jun 6, 2013 4:06 PM, "Andy Fingerhut" wrote:
> A few people, I believe primarily Alan Malloy and Anthon
On Thursday, June 6, 2013 1:55:13 AM UTC-5, Zed Becker wrote:
>
> Why do the languages running on the CLR (ironRuby, ironPython, ironScheme,
> ScalaCLR) do not get to live long enough in the sunshine, whereas same
> languages get embraced by the Java runtime, and live in the limelight?
>
Many
A few people, I believe primarily Alan Malloy and Anthony Grimes, have
created a Clojure library for what they call ordered sets and maps that do
exactly this. They are implemented not as you tried to do, but by
remembering a number for each element (for ordered sets) or key (for
ordered maps) tha
Thanks,you are right.I want to creat a map which keeps elements in
insertion order, but clojure doesn‘t have.
在 2013-6-6 下午10:02，"Andy Fingerhut" 写道：
> Your comparator #(if (= %1 %2) 0 1) may happen to give the correct answers
> for your example sorted-maps, but it is also a bad comparator that wi
Hi all,
I am trying new parsing library Instaparse. I setup a Leiningen project,
included [instaparse "1.1.0"] as my dependency and tried to run it.
Unfortunately, I am getting this error:
Exception in thread "main" java.lang.NoClassDefFoundError:
instaparse/print$parser__GT_str (wrong name:
insta
On Wed, Jun 5, 2013 at 11:55 PM, Zed Becker wrote:
> Why do the languages running on the CLR (ironRuby, ironPython, ironScheme,
> ScalaCLR)
FWIW -- Scala on the CLR has always been a Microsoft funding issue. When
Martin's lab got a grant for ScalaCLR, it did the work. When the funding
went away
Your comparator #(if (= %1 %2) 0 1) may happen to give the correct answers
for your example sorted-maps, but it is also a bad comparator that will
fail for larger examples:
user=> (:a (sorted-map-by #(if (= %1 %2) 0 1) :z -26 :b 1 :a 2 :c 3 :m 13
:h 8))
nil
user=> (:z (sorted-map-by #(if (= %1 %2)
> Note that the problem is actually the Clojure startup time, *not* the JVM
> startup. JVM starts up in about 0.1sec on my machine. The rest of the time
> is spend loading Clojure code, compiling all the core namespaces etc.
>
>
That's one way to look at it, another is that clojure's design tightly
puzzler wrote:
> I decided it would be a bad idea to include rhizome
> directly in instaparse's dependencies. Nevertheless, it
> made sense to enable the "visualize" function *provided*
> rhizome was already in the user's dependencies.
I prefer to avoid these kinds of load-time tricks, as they
bre
Hey All,
The CFP for Clojure/conj 2013 closes tomorrow, June 6 at 5 PM EST.
http://clojure-conj.org/call-for-proposals
Clojure/conj 2013
Alexandria, VA (D.C. Area)
November 14-16, 2013
All speakers receive a conference ticket, lodging at the conference hotel,
airfare stipend and an invitatio
Hi,
I wanted to shave a few cycles of a "(quot n 2)" by using "(bit-shift-right
n 1)" instead, with n being a bigint.
However, this fails with an "IllegalArgumentException bit operation not
supported for: class clojure.lang.BigInt clojure.lang.Numbers.bitOpsCast
(Numbers.java:1008)".
Since the
Sorry, it's my mistake.
Because treep map use the comparator to compare keys, and if the comparator
returns 1 constantly,it can not find the item that equals the key.
So i can modified the example,and it works:
user=> (sorted-map-by #(if (= %1 %2) 0 1) :b 1 :a 2)
{:b 1, :a 2}
user=> (:a (sorted-m
Laurent PETIT writes:
> 2013/6/5 John Gabriele :
>> On Tuesday, June 4, 2013 4:24:49 PM UTC-4, Gary Trakhman wrote:
>>>
>>> Just fyi, most clojure libs are published under EPL or Apache licenses, of
>>> course the choice is up to you :-). GPL has some restrictions that would
>>> prevent the lib
user=> (sorted-map-by (constantly 1) :b 1 :a 2)
{:b 1, :a 2}
user=> (:a (sorted-map-by (constantly 1) :b 1 :a 2))
nil
user=> (keys (sorted-map-by (constantly 1) :b 1 :a 2))
(:b :a)
user=> (count (sorted-map-by (constantly 1) :b 1 :a 2))
2
user=> (:a (sorted-map-by (constantly 1) :b 1 :a 2))
nil
It
Btw, I knew I forgot something important ... on the JVM, exceptions are
used a lot by language designers to control flow (like for emulating
continuations). Throwing an exception on the JVM is cheap. On the CLR on
the other hand it's very expensive.
On Thu, Jun 6, 2013 at 1:53 PM, Alexandru Nedel
On Thu, Jun 6, 2013 at 12:47 PM, Colin Fleming
wrote:
> I'm not sure this is true, Don Syme has written several times about how
> difficult it would be to implement F# on the JVM - I believe tail recursion
> and not being able to define new intrinsic types (i.e. new primitives) are
> the sticking
*The JVM as a target is much friendlier to other languages, compared to the
CLR, in spite of the initial hype surrounding the CLR's multi-language
capabilities.*
I'm not sure this is true, Don Syme has written several times about how
difficult it would be to implement F# on the JVM - I believe tai
On Thu, Jun 6, 2013 at 9:55 AM, Zed Becker wrote:
> Why do the languages running on the CLR (ironRuby, ironPython, ironScheme,
> ScalaCLR) do not get to live long enough in the sunshine, whereas same
> languages get embraced by the Java runtime, and live in the limelight?
N.B. - Not all is well
On Jun 5, 2013, at 23:55, Zed Becker wrote:
> Why do the languages running on the CLR (ironRuby, ironPython,
> ironScheme, ScalaCLR) not get to live long enough in the sunshine,
> whereas same languages get embraced by the Java runtime, and live
> in the limelight?
I have a theory for your consid
41 matches
Mail list logo
