Search Results for "tree"

A CommonMark-compliant parser for Julia.

...It's highly compatible with Julia's older femtoliter-based parser - It parses all of Base, the standard libraries and the General registry. Some minor differences remain where we've decided to fix bugs or strange behaviors in the reference parser. The AST and tree data structures are usable but their APIs will evolve as we try out various use cases. Parsing to the standard Expr AST is always possible and will be stable. The intention is to extend this library over time to cover more of the Julia compiler front end.

Interactive error messages for the Julia REPL. Just start using your REPL normally. Once you hit an error you'll be presented with an interactive tree representing your stacktrace which you can explore. To turn interactive errors off and return to using normal stack traces call toggle(). Call toggle() again to turn it back on. Press up and down arrows to move through the stacktrace. Press space to fold or unfold the currently selected line. A + will appear on folded lines. Press enter once finished. ...

Easy everyday parallelism with a file tree abstraction. Read a directory structure as a Julia data structure, (lazy-)load the files, apply map and reduce operations on the data while not exceeding available memory if possible. Make up a file tree in memory, create some data to go with each file (in parallel), write the tree to disk (in parallel). FileTrees is a set of tools to lazy-load, process and save file trees.

Soss is a library for probabilistic programming. Soss and DynamicPPL are both maturing and becoming more complete, so the above will change over time. It's also worth noting that we (the Turing team and I) hope to move toward a natural way of using these systems together to arrive at the best of both.