Maybe with numbers it would be easier to understand.
If there is 1 insert to the list 5
If there is a 5 insert to the list 6 or 4
So if i start from 1 one possible list would be: {1, 5, 6}
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
1:
{0} N=5
{1} N=6
and a tree 2:
{0;0} N=1
{0;1} N=1
...
{0;18} N=1
{1;0} N=1
{1;1} N=1
...
{1;19} N=1
I want to basically modify Tree 1 in order to get
{0;0} N=5
{0;1} N=5
...
{0;18} N=5
{1;0} N=6
{1;1} N=6
...
{1;19} N=6
which is the Tree 1 with the structure of Tree 2 and the items of Tree 1 {0} branch populated at each {0;*} branch of Tree 2 and the items of Tree 1 {1} branch populated at each {1;*} branch of Tree 2.
…
owing:
{0}0. d1. e2. f
3. g4. h5. i
{1}0. a1. b2. c
3. g4. h5. i
{2}0. a1. b2. c
3. e
4. f
5. g
Thought maybe I could use relative Item but I cant figure out how to do an offset that includes multiples.
…