Lightweight, lazy trees (new package)

[Siddhartha Kasivajhula]

Hi folks,

Here is a new package providing lightweight, general purpose utilities for working with tree-structured data:

https://docs.racket-lang.org/lazytree/

It allows you to take any data exhibiting tree structure and lazily construct a stream representation of it using functions that presumably already exist in your application, if the data indeed already possesses tree structure.

The library leverages the corresponding tree structure of nested lists (streams) to perform standard operations on data that has such structure, for instance, providing operations analogous to map, filter, and fold, for trees and with lazy semantics.

The laziness is inherited from the collection utilities in the excellent data/collection library, and more generally, Racket streams.

Enjoy,

-Sid

[Simon Schlee]

Hi Sid,

this looks like a nice, clean, simple to use interface,

that could replace some of my adhoc tree traversals hidden within,

some of my code.

I am looking forward to playing around with it and seeing where I can use it, thank you for creating it!

Have a great day!

Simon

[Jason Hemann]

This seems quite cool and useful. 

Thank you for sharing!

JBH

--
You received this message because you are subscribed to the Google Groups "Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to racket-users...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/47c44020-4f17-4581-a973-3c519a9f33ea%40googlegroups.com.

--

JBH