ng its top is 5/6 so I guess there is a pattern developing here.
Cube missing 1 face (6-1)/6 = 5/6
Cube missing 2 faces (6-2)/6 = 4/6 (2/3)
Cube missing 3 faces (6-3)/6 = 3/6 (1/2)
cube missing 4 faces (6-4)/6 = 2/6 (1/3)
…
e possible to change the component definition making possible to customize the number of outputs.Now Dispatch moves "true" values to A and "False" values to B
INPUT:
L (List to work on) -> 1, 2, 3, 4, 5, 6, 7, 8
D (Dispatch Pattern) -> True, False
OUTPUT:
A (List) -> 1, 3, 5, 7
B (List) -> 2, 4, 6, 8
Could it be possible/useful to modify it so it could dispatch items to several outputs, like:
INPUT:
L (List to work on) -> 1, 2, 3, 4, 5, 6, 7, 8, 9, 0
D (Dispatch Pattern) -> A, B, C
OUTPUT:
A (List) -> 1, 4, 7, 0
B (List) -> 2, 5, 8
C (List) -> 3, 6, 9
maybe I'm missing something and there's already a component with this function... I have been searching on the forum for half afternoon, but can't find anything about it!
Thank you!…
l at each point intersection, less 14. align holes to common angle between each 2 points of intersection (so ovals align with curve)5. copy 4. 360/60 about center circle (creates 6 curves rotated thru 360)6. it appears there a 3 more sets of curves that need to be taken care in the same way as 1 thru 4 (see colander pic)6. project the oval patterns onto, 1/2 a sphere somewhat larger that the surface circle, to avoid extreme oval distortion.7. needs some Boolean subtraction of holes from sphere surface
Does this simple road map have some merit?
…
ches it with the first branch in Tree B (and then the first branch in Tree C if more than two trees are involved).
I'm planning to add better branch matching logic, but I'm not going to touch it until I have a good idea about what's needed and how it can be accomplished without breaking existing files.
So, the branch "address" is only used to sort the branches in a single tree. Thus, a tree with the following branches is always sorted in the exact same way:
{0;0}
{0;1}
{0;2}
{0;3;0}
{0;3;1}
{1;6}
If you have another tree with different branches:
{0}
{1}
{2}
{3}
{4}
{5}
Then the matching will be:
{0;0} -> {0}
{0;1} -> {1}
{0;2} -> {2}
{0;3;0} -> {3}
{0;3;1} -> {4}
{1;6} -> {5}
As long as people adhere to your advice: "it is best for the addresses of each tree branch to be in the same format", there will be no problem. But it is at the moment extremely difficult to perform complex matchings.
--
David Rutten
david@mcneel.com
Poprad, Slovakia…
Added by David Rutten at 9:25am on August 11, 2010
a follow up question... how do I wrap a list onto itself at a certain frequency?
i.e. I want the list {1;2;3;4;5;6;7;8;9}
to become {1,4,7; 2,6,8; 3,6,9} wrapped every 3rd item
Added by Joshua Jordan at 5:30pm on November 17, 2012