I have a data tree of points that I am testing for inclusion with a data tree of curves. Unfortunately, I am not getting the output that I get when I feed in one branch of points at a time.

To the right of the definition is the correct output I am going for.

The definition works fine when I cycle through the branches. It does not work when I run two data trees at once. This makes me think that it is not a geometrical issue where points lists are not inside curve lists.

1.Why are you working 1,084,692 units away from the origin?
2.The relationship of these trees donât make sense to me. For instance index zero why do you want to see if 5 points are in 48 curves? I think you will need to describe better what you are after.

@Michael_Pryor - pertaining to scale, this is an urban design project. The shapefile brought it in away from the origin. I didnât think this would cause an error.

The reason i am looking for disproportionate amounts of pts to curves is bc I am making comparative graphs from the linked excel data. For instance, if 5 points match out of 48 curves on branch 1, 2 points out of 3 curves on branch 2 etcâŠ

Then this allows me to test if one data set (building A is found within another datasetâŠ the other list)âŠ these are predefined from excel.

I can do this branch by branch and create a matrix by hand, but Iâd rather just combine the trees to create the comparative matrix.

I have the same question as @anon39580149 why is the list you are trying to get the same as the input point list? How did you generate that result list you internalized. This would be helpful to know (as a gh definition)

For clarification I have posted a more detailed definition. Here I am testing whether 9 building types (each on a branch in a data tree) fall within 3 FFE groups. (also on a branch in another data tree)

Cycling through this code shows that it works branch by branch; however; when the data tree is inputted into the âcurves in pointsâ node, it does not give the expected ânestedâ tree structure.

For example:
Branch 1: 5 points in group A crvs.
Branch 2: 2 points in group A crvs.
Branch 3: 8 points in group A crvs.
ETCâŠ

so the Data Tree should be something like:
(the path to the left of the semicolon is the building type and the path to the right is the FFE Group) N will equal the number of inclusions for EACH building type per group.

{0;0} N = x
{0;0} N = x
{0;0} N = x
{1;0} N = x
{1;1} N = x
{1;2} N = x
{2;0} N = x
{2;1} N = x
{2;2} N = x
ETCâŠ

So what I am looking for is to have each FFE group (0 to 2) within a Path in the tree that I described above like this:

{0;0} N = x
{0;1} N = x
{0;2} N = x
{1;0} N = x
{1;1} N = x
{1;2} N = x
{2;0} N = x
{2;1} N = x
{2;2} N = x
ETCâŠ

What you have worked out is only for one branch of the âBLDG HEIGHTSâ data tree. I am attempting to compare all of the branches of the first tree to the âFFE GROUPSâ tree. This tree should have thirty branches as it will compare each height to each of the three branches in the FFE groups.

I tried to understand but i canât
i see that the buildings and the surfaces have different index; do you want to sort the buildings based on the surfaces index?

If you are trying to sort your data by curve, you need to graft the âCâ input of your Point in Curves. Otherwise it matches your data curve to point.