Re: [ANN and RFC] Bifurcan: impure functional data strucures

I think this would solve an issue I'm facing. I'm working on implementing variations of Monte Carlo tree search for very large trees, with states and actions represented by maps. There are several lookup tables indexed by either state or state-action pairs. I haven't done any detailed

Re: [ANN] meet postagga, a new lib for natural language processing

On Mar 13, 2017 8:24 AM, "Rafik NACCACHE" wrote: Hey guys, I am pleased to share my new lib, capable of training models that help parse natural language ! My french-speaking friends will find it extremely useful as I did some work to provide some french models! Besides,

Re: [ANN and RFC] Bifurcan: impure functional data strucures

Both the 'List' and 'Map' data structures in Bifurcan use innovative approaches that were published after Clojure's original release [1] [2]. In the case of the immutable map, you get faster iteration and the structural invariants allow for some clever stuff w.r.t. equality checks and set

Re: [ANN] meet postagga, a new lib for natural language processing

Thank you for this. I am excited to give this a try. On Monday, March 13, 2017 at 9:24:36 AM UTC-4, Rafik NACCACHE wrote: > > Hey guys, > I am pleased to share my new lib, capable of training models that help > parse natural language ! > My french-speaking friends will find it extremely

Re: [ANN and RFC] Bifurcan: impure functional data strucures

I'm not well versed enough in these data structures to know this without asking (apologies if it's really obvious to some people): is there opportunity to improve Clojure's built-in data structures with Bifurcan rather than trying to wrap Bifurcan's structures in Clojure? As an aside, I want

Re: [ANN and RFC] Bifurcan: impure functional data strucures

Benchmarks are available here, and the Clojure benchmarks make use of transients wherever possible: https://github.com/lacuna/bifurcan/blob/master/doc/benchmarks.md. More generally, while transients are often used in practice to quickly construct a read-only data structure, the more formal

Re: [ANN and RFC] Bifurcan: impure functional data strucures

> On Mar 27, 2017, at 09:51, Zach Tellman wrote: > > They also provide high-performance mutable variants of the data structure > which share an API with their immutable cousins. How does their performance compare to Clojure's transients? Transients are slower than Java's

[ANN and RFC] Bifurcan: impure functional data strucures

This is a slightly irregular announcement, because it's not for a Clojure library. Rather, it's for a library written purely in Java: https://github.com/lacuna/bifurcan. This is a collection of mutable and immutable data structures, designed to address some of my personal frustrations with

Re: Compiling gen-class runs static initializers: workarounds, solutions?

Hi Colin, I had read through this, but I'm using 1.8 and the problem still exists for me. -- 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 -

Re: Compiling gen-class runs static initializers: workarounds, solutions?

Did not see this. Will investigate and see if it helps. BTW, noticed in one of your comments on http://dev.clojure.org/jira/browse/CLJ-1315 that you directly mentioned

Re: Compiling gen-class runs static initializers: workarounds, solutions?

Hi Gregg, I've have tried them, but have not been able to get anything that will compile, let alone run. On Sunday, March 26, 2017 at 5:15:52 PM UTC-4, Gregg Reynolds wrote: > > > > On Jan 2, 2015 12:36 PM, "David James" > wrote: > > I have a problem when compiling while

Re: pager for lein repl?

I have always used either CIDER (with full emacs paging support) or tmux for those requirements. On Thu, Mar 23, 2017 at 8:46 PM, Joe Python wrote: > > Is there a equivalent of less/more like pager (found in Linux shells) for > Leiningen repl? > > The lein repl is fast