jonase

Disney are apparently using drones to combat paparazzi drones when filming Star Wars VIII: http://consequenceofsound.net/2016/02/drones-are-patrolling-...

I learned a lot from Mastering Bitcoin by Andreas M. Antonopoulos (http://shop.oreilly.com/product/0636920032281.do)

Thanks! So if I read your comment correctly there is nothing inherently wrong with the Comparable interface it's just that Clojure's sorted sets and maps could have used protocols instead. I can see why that would be useful for extending existing types (as you mentioned).

OTOH it’s not often I’ve seen third-party types that I wanted to be comparable but were not. In general I think that if a type does not implement a core interface you have to consider the possibility that the designer chose not to implement it for a reason.

Sorry to jump in on an interesting discussion but I got interested in this part:

> It's also disheartening to see that the sorted-set wants things that implement Java's Comparable.

Could you quickly explain what's disheartening about Java's Comparable interface and what the available options are?

At akvo.org we are using Clojure in production and hopefully soon also Clojurescript.

We are using Clojure on top of existing Java functionality, and we're moving our Ember based Dashboard over to Clojurescript/Om.

I'm very interested in working with SVG in the browser and have found it to work pretty well with React. I built a demo (Code: https://github.com/jonase/elements, App: http://jonase.github.io/elements/) using one of the (increasing number of) React wrappers for ClojureScript (Chrome only for the moment I'm afraid)

Maybe mori could include core.rrb-vector[1]. Other interesting persistent data structures (by the same author) are persistent sorted maps and sets[2].

[1] https://github.com/clojure/core.rrb-vector [2] https://github.com/clojure/data.avl

Weekend project? That's amazing! Is the source available? I would love to read it.

Am I missing something here or is the algorithm you describe simply: "Find the smallest even and odd number in a set of numbers?" This shouldn't be hard to do in any language.

The best source I've found is at http://rewriting.loria.fr which contains lots of interesting papers.

If someone is interested in how kibit is implemented I've got some slides at http://jonase.github.io/kibit-demo/. It's quite easy and a good (I think) introduction to core.logic.

It means that you can write pure functions (in the functional programming sense) where one (or more) of the arguments to your function is a _database value_. In haskell the types to a query function would perhaps look like this:

    query :: Query -> DBValue -> Result

instead of

    performQuery :: Query -> IO DBConn -> IO Result

or maybe even

    cljs.user> (.css (js/jQuery "body") "background" "cyan")