Why not turn this problem on its head? Have a vector of lists of prime
factors for each i. March through this vector and for each prime factor in
the current list, add that prime factor p to list i + p. And if i has no
prime factors, then it is a prime itself and add it to the list at 2 * i.
So
Jonathon,
Blocking at read time, within the test (via
wrote:
> If I have code in a go block or a future call, what is the best way to
> automate test coverage of that code?
>
> --
> You received this message because you are subscribed to the Google
> Groups "Clojure" group.
> To post to this gro
If I have code in a go block or a future call, what is the best way to
automate test coverage of that code?
--
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 new members
I got a working version in my fork of emacs-live (if you happen to use it).
See here
https://github.com/arichiardi/emacs-live/blob/ar-stable/packs/dev/clojure-pack/config/flycheck-clojure-conf.el
On Thursday, September 24, 2015 at 1:36:07 PM UTC-7, JvJ wrote:
>
> Hi,
>
> Maybe this topic has alre
Hi all, I used the clojure.core.cache for the first time last week and I
think adding a note about the importance of ordering to the wiki page on
"Composing" might help save some time for newbies like me in the future.
I staged the suggested updates to the wiki page here:
https://github.com/u
You can see it if you read:
user=> (read-string "(= (list {'a 42}) '({'a 42}))")
;;=> (= (list {(quote a) 42}) (quote ({(quote a) 42})))
If you remove it:
user=> (= (list {'a 42}) '({a 42}))
;;=> true
On Saturday, September 26, 2015 at 3:12:44 PM UTC+2, Chris Cornelison wrote:
>
> Anyone know
Anyone know why these evaluate differently and are not equal?
$lein repl
nREPL server started on port 56056 on host 127.0.0.1 -
nrepl://127.0.0.1:56056
REPL-y 0.3.5, nREPL 0.2.6
Clojure 1.6.0
Java HotSpot(TM) 64-Bit Server VM 1.8.0_31-b13
Docs: (doc function-name-here)
(find-doc "pa
That question has been asked recently and the official answer was that a
new release is coming "soon". There was no promise that the next release
would get the project out of alpha, though.
On Saturday, 26 September 2015, Rafik NACCACHE
wrote:
> core.async didn't move since more than a year.
>
>
It relies on kibit, eastwood and core.typed to provide warnings and errors.
This means support for other dialects will be available when those projects
add support.
On Saturday, September 26, 2015 at 12:19:03 AM UTC+2, JvJ wrote:
>
> Lars, thanks for telling me about squiggly-clojure. It seems
core.async didn't move since more than a year.
Is any new release coming soon? I actually use this library intensively,
and the fact it is staying alpha for more than a year starts giving me some
shivers :)
Thank you for any updates !!
--
You received this message because you are subscribed to
Primes are hard, because you essentially need to track all previous primes.
Here's one way to think about what you're doing here. First, you
create a lazy sequence of infinite numbers from 3 and up. This is done
by building a cons cell with 3 as the head and (iterate inc 4) as the
tail.
Then you
11 matches
Mail list logo