Ahoy Beancounters! I have been busy for a little while now on a new implementation of Beancount in Rust and Clojure, called limabean. 🥁
https://github.com/tesujimath/limabean It is an implementation of Beancount in the sense that the file format and the booking algorithm are the same, although there are several new and different ideas. Foremost among the differences is that the user interface is the Clojure REPL, there is no Beancount Query Language (by design). All the directives, inventory positions, and so on, are exposed as Clojure data structures, enabling the full power of Clojure for drilling into it all. There are surely rough edges and unfinished business, but at this stage I would be grateful if anyone is inclined to have a look and give me their feedback. Happy Beancounting! cheers, Simon -- You received this message because you are subscribed to the Google Groups "Beancount" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion visit https://groups.google.com/d/msgid/beancount/CAFhGSbstDOKP-JF9fW_%3DsH8GzfPfh5XdUkeaC7SZD9cqFg%3DTwg%40mail.gmail.com.
