branches in each A's list of B's, or remove its ends etcso that if I want to remove the last B in every A{0;1},{0;2},{0;3},{0;4},{0;5},{0;6}{1;1},{1;2},{1;3},{1;4}{2;1},{2;2},{2;3},{2;4},{2;5}would become{0;1},{0;2},{0;3},{0;4},{0;5}
{1;1},{1;2},{1;3}
{2;1},{2;2},{2;3},{2;4}I guess the question is do I need to figure out the cull pattern- each B may have different lengths...…
lues. What I want to do is combine them so that the structure would be something like:
{4;0}
{4;1}
{4;2}
{4;3}
{5;0}
{5;1}
{5;2}
{5;3}
I tried the method here, but it didn't give me what I wanted, it was just tacking the new values onto the end, and not maintaining their paths. Any help would be appreciated. Thanks!…
Added by Dennis Goff at 8:13am on February 10, 2016