Re: GPU and memory is not contiguous - you need to take a look at
e.g.http://www.anandtech.com/show/7677/amd-kaveri-review-a8-7600-a10-7850k/6
GPU can now access the entire CPU address space without any copies
Heterogeneous System Architecture (HSA) is already here. The h/w and
libraries are
Hello all,
I'm applying to GSoC this year, and I'm interested in taking the
opportunity to go full-speed on a project I've been toying with on the side
for the last month or so now.
Specifically, I'm interested in writing a self-hosting ClojureScript
compiler – either by forking the current
I recently searched for other graph algorithms and did not find much
more than what you probably know: JUNG, JGraphT, Loom, Tinkerpop.
So my guess is that you'll be very lucky to find an implementation in
java, let alone in clojure.
Be prepared to write your own.
--
You received this message
As a co-author of the reactive manifesto I'd like to point out that
reactive can be considered a superset of async. Good reactive
applications are event driven and non-blocking. They are also responsive,
resilient, and scalable which async can help with but does not prescribe.
What are the bad
In my personal experience I cannot get within 10X the throughput, or
latency, of mutable data models when using persistent data models.
Hi Martin,
Thanks for finding this thread :-). Let me ask a reversed question. Given
you come from a persistent data model where code remains
Unfortunately, a prerequisite to this project would most likely be
replacing the ClojureScript analyzer with the tools.analyzer. There is
already a proposal for this work in GSOC. Perhaps some collaboration is
possible?
In addition there would probably need to be some talk around how to handle
Nice, thanks!
--
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 are moderated - please be patient with your
first post.
To unsubscribe from this group, send
I've written general versions of Blossom and Blossom V in the past, and
every so often a similar question comes up on this mailing list.
I'd personally love to see both algorithms contributed to Loom if OP is up
for the task.
Paul
--
You received this message because you are subscribed to
On Mon 17 Mar 2014 at 09:16:25PM -0700, Timothy Pratley wrote:
Is there a better way to write
(cond
(neg? 1) neg
(zero? 1) zero
(pos? 1) pos
:default default)
…
But I think I'm missing a more idiomatic approach.
FWIW, the `compare` function works well in this particular case.
Hi Max,
Seems like an interesting project.
I suggest submitting a proposal on Melange and we can work out the details
there, since student applications close soon. Please follow the
guidelineshttp://dev.clojure.org/display/community/Student+application+guidelines
.
Thanks,
Ambrose
On Tue, Mar
Hello all,
We would love to release Clojure 1.6.0 final soon.
We need your help in checking out the current release candidate - this is
your opportunity to let us know about problems *before* we release, rather
than after.
Try it via
- Download:
All test passes on my projects! It works fine for me!
Thanks!
2014-03-18 15:21 GMT+01:00 Alex Miller a...@puredanger.com:
Hello all,
We would love to release Clojure 1.6.0 final soon.
We need your help in checking out the current release candidate - this is
your opportunity to let us
Thanks Andrey! You are the wind beneath my wings.
On Tuesday, March 18, 2014 9:28:03 AM UTC-5, Andrey Antukh wrote:
All test passes on my projects! It works fine for me!
Thanks!
2014-03-18 15:21 GMT+01:00 Alex Miller al...@puredanger.com javascript:
:
Hello all,
We would love to
Hi,
On Tuesday, March 18, 2014 3:02:01 PM UTC+1, Paul deGrandis wrote:
I've written general versions of Blossom and Blossom V in the past, and
every so often a similar question comes up on this mailing list.
I'm guessing that wasn't in clojure? :-(
Do you happen to know what happens when
Thx for hints.
As for the main function, my tendency would be to avoid taking cases on
the number of args
Is that due to performance implications, I mean that it takes longer to
check cases every time? Or just a style. BTW, I followed
Got it! :-)
One more thing. While developing, I often have to deal with large amounts
of data that take quite a while to load. However, the data is lost and so
has to be reloaded after every reset, which is a bit annoying. Is there a
way to prevent this?
--
You received this message
It's a nice idea to load your schema and data on every reset, if you can.
But if you need to, place you data anywhere under the :safe key in the
system map and it will survive a reset.
On 18 Mar 2014 15:57, Joachim De Beule joachim.de.be...@gmail.com wrote:
Got it! :-)
One more thing. While
Max,
Just a fair bit of warning that such a project should probably only happen
under GSoC only if it actually pushes along *official* support for
bootstrapping ClojureScript in ClojureScript. Just forking the compiler and
making changes until it works just isn't going to fly and I do not think
I thought matching was a dual of max flow, so weighted matching was a dual
of min cost max flow (relabling edges with infinity minus cost).
The simplest algorithm to implement would be Ford-Fulkerson with
Floyd-Warshall to find augmenting paths. The most efficient would be
Dinic's, I think?
As a co-author of the reactive manifesto I'd like to point out that
reactive can be considered a superset of async. Good reactive
applications are event driven and non-blocking. They are also responsive,
resilient, and scalable which async can help with but does not prescribe.
What are the
Martin,
You recommend message-passing approaches like Erlang's as generally
superior, but I'm curious if there's any more specific thoughts to the
relative tradeoffs from shared-memory by default vs message-passing, ie,
where you might rely on hardware-level copies (cache coherence) for
I've never heard of imperative model. I'm aware of imperative
programming. Can you expand on what you mean?
I meant mutable data model. Sorry for mixing up terms.
http://blog.codinghorror.com/separating-programming-sheep-from-non-programming-goats/
Hope this helps clarify.
It does.
That is true for maximum matching (weighted or not) in bipartite graphs.
Max (weighted) flow methods do not work for matchings in general graphs.
Andy
On Tue, Mar 18, 2014 at 9:31 AM, Jason Felice jason.m.fel...@gmail.comwrote:
I thought matching was a dual of max flow, so weighted matching
If it's any consolation, queues or delays are used in hardware to overcome
limitations in hardware, too :-).
Specifically, I'm thinking of anti-jitter stuff in audio circuits.
On Tue, Mar 18, 2014 at 12:45 PM, Andy C andy.coolw...@gmail.com wrote:
I've never heard of imperative model. I'm
As a co-author of the reactive manifesto I'd like to point out that
reactive can be considered a superset of async. Good reactive
applications are event driven and non-blocking. They are also responsive,
resilient, and scalable which async can help with but does not prescribe.
What are
2014-03-18 17:45 GMT+01:00 Andy C andy.coolw...@gmail.com:
I've never heard of imperative model. I'm aware of imperative
programming. Can you expand on what you mean?
I meant mutable data model. Sorry for mixing up terms.
2014-03-18 18:21 GMT+04:00 Alex Miller a...@puredanger.com:
We need your help in checking out the current release candidate - this is
your opportunity to let us know about problems *before* we release, rather
than after.
No issues to report from testing 20+ ClojureWerkz projects on
Thanks Michael! You're the hops in my ale.
On Tuesday, March 18, 2014 12:22:15 PM UTC-5, Michael Klishin wrote:
2014-03-18 18:21 GMT+04:00 Alex Miller al...@puredanger.com javascript:
:
We need your help in checking out the current release candidate - this is
your opportunity to let us
Just tried 1.6.0-RC1 with ClojureScript master. All ClojureScript tests
pass except for one which is due to assumptions about print order
(different now due to hash code changes). Easy enough to fix once 1.6.0
actually ships.
David
On Tue, Mar 18, 2014 at 1:44 PM, Alex Miller
some sort of FSM. Perhaps concurrency could be modeled using FSMs, but I do
not believe it is always a simple transition.
http://www.cis.upenn.edu/~stevez/papers/LZ06b.pdf
:-)
--
You received this message because you are subscribed to the Google
Groups Clojure group.
To post to this group,
Thanks David! You're the English horn in my symphony.
On Tuesday, March 18, 2014 12:50:04 PM UTC-5, David Nolen wrote:
Just tried 1.6.0-RC1 with ClojureScript master. All ClojureScript tests
pass except for one which is due to assumptions about print order
(different now due to hash code
We had some bugs related to assumed ordering in our code which
1.6.0-RC1 surfaced (https://github.com/puppetlabs/puppetdb/pull/887),
otherwise everything looks good for our project - thanks for all the
hard work on this release.
ken.
On Tue, Mar 18, 2014 at 2:21 PM, Alex Miller
I'm pleased to note that Lambda Jam (http://www.lambdajam.com) will return
to Chicago this year on July 22-23rd. Lambda Jam is designed to appeal to
the increasing group of programmers using FP in industry with a particular
focus on Clojure, Scala, Erlang, Haskell, and F#. The conference is also
Thanks Ken! You're the cheese on my nachos.
On Tuesday, March 18, 2014 12:45:46 PM UTC-5, Ken Barber wrote:
We had some bugs related to assumed ordering in our code which
1.6.0-RC1 surfaced (https://github.com/puppetlabs/puppetdb/pull/887),
otherwise everything looks good for our project -
I think I found a difference between 1.5.1-1.6.0-RC1.
(compile 'cljs.core) fails with a NPE in 1.6.0-RC1. I realise this isn't
particularly supported
by CLJS, but it still worked in 1.5.1.
https://github.com/frenchy64/clojure-16-fail
Help narrowing this is appreciated.
Thanks,
Ambrose
On
I believe this is because cljs.core defines unsigned-bit-shift-right, which
now conflicts
with clojure.core/unsigned-bit-shift-right (added with 1.6.0).
1.6.0 doesn't seem to break anything here, aside from adding to
clojure.core.
Thanks,
Ambrose
On Wed, Mar 19, 2014 at 3:12 AM, Ambrose
Yeah, that's a thing. I think the name was chosen intentionally to be the
same across those as cljs had it first.
On Tuesday, March 18, 2014 2:29:04 PM UTC-5, Ambrose Bonnaire-Sergeant
wrote:
I believe this is because cljs.core defines unsigned-bit-shift-right,
which now conflicts
with
FYI `mvn test` will fail on core.typed because of this issue.
I believe it otherwise passes.
Ambrose
On Wed, Mar 19, 2014 at 3:45 AM, Alex Miller a...@puredanger.com wrote:
Yeah, that's a thing. I think the name was chosen intentionally to be the
same across those as cljs had it first.
I assume that fixing this is a matter of updating src/clj/cljs/core.clj in
clojurescript to exclude unsigned-bit-shift-right?
On Tuesday, March 18, 2014 2:52:03 PM UTC-5, Ambrose Bonnaire-Sergeant
wrote:
FYI `mvn test` will fail on core.typed because of this issue.
I believe it otherwise
Yep, we'll get rid of it once 1.6.0 actually ships.
David
On Tue, Mar 18, 2014 at 5:04 PM, Alex Miller a...@puredanger.com wrote:
I assume that fixing this is a matter of updating src/clj/cljs/core.clj in
clojurescript to exclude unsigned-bit-shift-right?
On Tuesday, March 18, 2014
Greetings,
I'm confused by the failure of 2 record instances to compare as equal, only
when generated by a protocol method and having extra fields.
The code below shows this, with uninformative REPL responses snipped. The
attached file has similar code as a clojure.test.
Would somebody please
On 18/03/14 18:03, Martin Thompson wrote:
Our use of language in the technology industry could, for sure, be
better. Take simple examples like RAM where random should be
arbitrary, or don't get me started on people who misuse the term
agnostic ;-)
I would even say our use of abstractions in
The thing is that our industry is based on layers upon layers of
abstractions, whether at the physical level (integrated circuits,
interfaces, etc.) or at the software level: binary (1GL) abstracted into
assembly (2GL), then C language (3GL), etc. Virtual machines is now another
you maybe
What Clojure version are you on?
--
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 are moderated - please be patient with your
first post.
To unsubscribe from
Here's the bug:
user (defrecord a [])
user.a
user (defrecord b [])
user.b
user (.__extmap (map-b (map-a {:a 1})))
#user.a{:a 1}
--
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
Yeah that looks bad.
--
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 are moderated - please be patient with your
first post.
To unsubscribe from this group,
I added a patch+tests here http://dev.clojure.org/jira/browse/CLJ-1388
Alex Miller writes:
Yeah that looks bad.
--
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
I'm on 1.5.1
I have a workaround:
- instead of
- (map-Foo this)
- use
- (map-Foo (into {} this))
On Tuesday, March 18, 2014 5:47:46 PM UTC-7, Alex Miller wrote:
What Clojure version are you on?
--
You received this message because you are subscribed to the Google
If you've got a sorted list of numbers, for example:
[1 3 4 5 7 9 10 13]
where some are consecutive, how can you pull out the consecutive runs? That
is, either produce
[1 [3 4 5] 7 [9 10] 13]; or maybe something like
[[1 7 13] [3 4 5] [9 10]] ; (the first vec is the elements
On Tue, Mar 18, 2014 at 11:06 AM, Raoul Duke rao...@gmail.com wrote:
some sort of FSM. Perhaps concurrency could be modeled using FSMs, but I
do
not believe it is always a simple transition.
http://www.cis.upenn.edu/~stevez/papers/LZ06b.pdf
I like FSMs, but they do not compose well.
A.
Something like this?
(defn x [1 3 4 5 7 9 10 13])
(reduce (fn [a i] (let [y (last a) z (last y)] (if (and z (= (inc z) i))
(conj (pop a) (conj y i)) (conj a [i] [] x)
Shantanu
On Wednesday, 19 March 2014 08:26:43 UTC+5:30, John Gabriele wrote:
If you've got a sorted list of numbers, for
On Wednesday, 19 March 2014 09:39:56 UTC+5:30, Shantanu Kumar wrote:
Something like this?
(defn x [1 3 4 5 7 9 10 13])
Sory for the typo. Should be (def x [1 3 4 5 7 9 10 13])
(reduce (fn [a i] (let [y (last a) z (last y)] (if (and z (= (inc z) i))
(conj (pop a) (conj y i)) (conj a
Tests look good in some of Staples Innovation Labs' projects. Only
failures are ones that assume ordering, which is just an easily correct
failure in the test cases.
On Tue, Mar 18, 2014 at 2:06 PM, David Nolen dnolen.li...@gmail.com wrote:
Yep, we'll get rid of it once 1.6.0 actually ships.
We have 1.6.0-RC1 running in production as of this afternoon. No
problems so far...
Sean
On Tue, Mar 18, 2014 at 7:21 AM, Alex Miller a...@puredanger.com wrote:
Hello all,
We would love to release Clojure 1.6.0 final soon.
We need your help in checking out the current release candidate -
54 matches
Mail list logo
