the one-but-last list [4]. After running out of the n- items avalaible it should continue with the second item of list 0 and so on for all items on all the lists.
Intput, six lists of 30 items each
[0] (n=30)
[1] (n=30)
[2] (n=30)
[3] (n=30)
[4] (n=30)
[5] (n=30)
Output, 18 lists of 10 items each
[0],i=0;[5],i=4; [4],i=7;...
[0],i=1;[5],i=5; [4],i=8;...
...
[5],i=1;[4],i=5; [3],i=0;...
I thought perhaps the weave component or the relative tree item component but didn't manage to figure out how to compose the mask. I couldn't find much on how to use these. I guess it should wrap the lists, but not the items.
Any help would be greatly appreciated.…
Added by Thorsten Lang at 2:27am on January 24, 2011
t / int, or \ in Vb.Net).
- there's no need to graft or do anything with trees in the script above: it already handles all the shift logic internally. The letters give you a hint as to which part you are getting: E (even cells), O (odd cells), T (top triangles), etc. Try to draw the diagonals on paper to see which ones share a similarity, that's also what I did to write the script. It is rather repetitive and would need some pages to explain line by line.
Finally, I'm attaching a full and simple example showing how to use the script with normals. Please post your definition if you are encountering any other problem. The normals are all on the right side I hope (see pic).
Hope this helps,
Giulio…