Re: [QUIL] select-input and select-output?

2017-04-19 Thread Jay Porcasi
my 'implementation' is actually nothing more than a function that runs your code :-) meaning that it relies on an AOT dependency in the project for the java class, which i don't mind in a personal project like mine, but probably wouldn't cut for Quil moreover my initial goal was for the functio

Carrot for Rabbit message queue retrial

2017-04-19 Thread Gábor Ráski
Hello, I just want to announce that I've made a clumsy little library for supporting RabbitMQ with delayed and exponential retrial. Please let me know what you think, what should be corrected, done differently. Feel free to use of course if you find it useful (and in working condition :) ). ht

[ANN] com.walmartlabs/lacinia 0.15.0

2017-04-19 Thread Howard Lewis Ship
Lacinia is an open-source implementation of Facebook's GraphQL specification, in Clojure. GraphQL is an outstanding approach to getting diverse clients and servers exchanging data cleanly and efficiently. The GitHub repository is https://github.com/walmartlabs/lacinia Documentation: http://lacin

[ANN] com.walmartlabs/pedestal-lacinia 0.1.0

2017-04-19 Thread Howard Lewis Ship
Lacinia is an open-source implementation of Facebook's GraphQL specification, in Clojure. pedestal-lacinia provides the support to expose a GraphQL schema as a web endpoint, using Pedestal. This includes optionally exposing a GraphiQL IDE. The GitHub repository is https://github.com/walmartlabs/p

Re: Has anyone tried building ClojureCLR using dontnet core on non-windows platforms?

2017-04-19 Thread dmiller
As mentioned, you likely will get more respone on the clojure-clr group. The subject of this post mentions .net core. From my understanding, you will not get ClojureCLR working on .Net Core on any platform due to Core's lack of support for System.Reflection.Emit. Alan correctly mentions Arcadi

Faster diffing for large-ish nested data structures

2017-04-19 Thread lvh
Hi, I have two deeply nested data structures (consisting of maps, vecs and the occasional seq; althoguh I can make it maps and vecs consistently if need be). I want to compute (and store) diffs; ideally diffs that store [path oldval newval] so that I can apply them in either direction. Using clo

Re: Faster diffing for large-ish nested data structures

2017-04-19 Thread Timothy Baldridge
I've gotten really fast diffing in Clojure by using the following concepts: 1) If you can sometimes make parts of A and B be identical, then your differ can skip checking those parts by doing a (identical? A B), this improves performance 2) Take a side effecting approach, pass into the differ a fu