Last active
October 31, 2022 20:01
-
-
Save piac/ef91ac83cb5ee92a1294 to your computer and use it in GitHub Desktop.
Transforms DataTrees in Grasshopper to nestings of lists, and vice versa
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def list_to_tree(input, none_and_holes=True, source=[0]): | |
| """Transforms nestings of lists or tuples to a Grasshopper DataTree""" | |
| from Grasshopper import DataTree as Tree | |
| from Grasshopper.Kernel.Data import GH_Path as Path | |
| from System import Array | |
| def proc(input,tree,track): | |
| path = Path(Array[int](track)) | |
| if len(input) == 0 and none_and_holes: tree.EnsurePath(path); return | |
| for i,item in enumerate(input): | |
| if hasattr(item, '__iter__'): #if list or tuple | |
| track.append(i); proc(item,tree,track); track.pop() | |
| else: | |
| if none_and_holes: tree.Insert(item,path,i) | |
| elif item is not None: tree.Add(item,path) | |
| if input is not None: t=Tree[object]();proc(input,t,source[:]);return t |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # written by Giulio Piacentino, giulio@mcneel.com | |
| def tree_to_list(input, retrieve_base = lambda x: x[0]): | |
| """Returns a list representation of a Grasshopper DataTree""" | |
| def extend_at(path, index, simple_input, rest_list): | |
| target = path[index] | |
| if len(rest_list) <= target: rest_list.extend([None]*(target-len(rest_list)+1)) | |
| if index == path.Length - 1: | |
| rest_list[target] = list(simple_input) | |
| else: | |
| if rest_list[target] is None: rest_list[target] = [] | |
| extend_at(path, index+1, simple_input, rest_list[target]) | |
| all = [] | |
| for i in range(input.BranchCount): | |
| path = input.Path(i) | |
| extend_at(path, 0, input.Branch(path), all) | |
| return retrieve_base(all) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
For total beginners who is having trouble with replicating the script as I had,
You need to set "Tree Access" type hint for the input.