[beta] Structured Data Object (create tree structures with data)

[LB]

This object allows you to create tree structures with data (named strings and numbers) at each point in the tree.

The object maintains a bunch of nodes, where each node contains:

• A constant, unique ID
• Named references to other nodes
• Named integers
• Named floats
• Named strings

You navigate to individual nodes and view/modify them, similar to selecting peers and channels in Lacewing. Because the design allows for recursive structures, iteration and saving/loading is by ID.

Latest beta version always available here: http://www.LB-Stuff.com/MMF2/Extensi...cturedData.zip
GitHub: https://github.com/LB-Stuff/StructuredData-Object

I'd like input on the design and terminology as well as bug reports.

Enjoy!

[netninja]

Sounds like a fantastic extension!

The ability to have nodes with references to other nodes sounds great and should allow some nice complex data structures.

Will give it a go.

[Phi]

I assumed Format object would be capable of this...

[netninja]

I think there needs to be an expression to get the number of nodes. Otherwise I can't really see a good way of generating node IDs.

Also, can you have loops among nodes? i.e. non-tree structured graphs?

[LB]

I assumed Format object would be capable of this...

Format Object is for saving and loading simple file formats. Its support for nesting is only for the creation of formats.

I think there needs to be an expression to get the number of nodes. Otherwise I can't really see a good way of generating node IDs.

Node IDs are generated for you. Expressions to get the number of node references/integers/floats/strings will be in the next version since you refer to everything by its name.

Also, can you have loops among nodes? i.e. non-tree structured graphs?

Yes, that was the other goal of this object. This feature works already, it is just not obvious how to do it. I will make an obvious way to do it in the next version

[Phi]

Okay, I have a plan for a program using this , but the hiccup is how to display the tree...

[LB]

I am adding iterators as we type

[Phi]

I mean working out the positions and sizes of the data boxes. There's got to be some formula like the one MS PowerPoint uses...

[LB]

The Calculate Text Rect object?

[Phi]

That'll help a bit actually, but how is the child position calculated with regards to the parent node? What if the child node grows wider?
I'd be happy to see a demonstration as you don't seem to see the issues that I see.