Understanding positive shift paths

I understand the concept of negative offset in shift paths.

But I don’t understand how does positive offset works in this case. Can anyone please explain?


SHIFT PATH QUESTIONS.gh (16.3 KB)

You can use the Param Viewer to see what the offset does to your trees:

The concept is very simple. With negative numbers, Shift Paths works exactly like Trim Tree, eliminating a certain number of digits from the back of the branch addresses in a tree.

With positive numbers, it eliminates a certain number of digits from the front of the branch addresses in a tree.

Formerly disparate branches of the tree become merged if by trimming from the back or the front they form a common branch address.

Shift positive trims the tree paths starting from left and going to right.

In your example you have {0;0;0;A} on each list because:

  1. first zero is from the initial curve component
  2. second zero is beacuse you graft the curve component, putting each curve in a separate list (but the component had already just one item so nothing changes)
  3. third zero is after array component, putting each array in a separate list, one for each starting input (but you have only one, so again nothing changes)

zeros from points 2 and 3 (and maybe even 1) are not necessary in this particular case, so you can delete them the way you prefer

Got it. Thanks! This makes sense.

Thanks @Fabio_Franchetti , thanks @martinsiegrist :+1: