s 8, 4, 2, 10, 1, 3, 8, 4, 2, 0. But then for the end result to maintain all numbers above 5 but replace all numbers below with a defined number..Let's say zero. So then the list would read...8, 0, 0, 10, 0, 0, 8, 0, 0.…
ee 3)
{5}
0 15
{6}
0 16
And I want to place points at every possible combination of these coordinates, treating Tree 1 as X coordinates, Tree 2 as Y coordinates, and Tree 3 as Z coordinates. Also, I would like the list of points to be a tree with paths corresponding to the coordinates. Wouldn't it be nice if I could plug these trees into a Point XYZ, with a new "branch cross reference" method, and get the following result?
{0:3:5}
0 {10.0, 13.0, 15.0}
{0:3:6}
0 {10.0, 13.0, 16.0}
{0:4:5}
0 {10.0, 14.0, 15.0}
{0:4:6}
0 {10.0, 14.0, 16.0}
{1:3:5}
0 {11.0, 13.0, 15.0}
{1:3:6}
0 {11.0, 13.0, 16.0}
{1:4:5}
0 {11.0, 14.0, 15.0}
{1:4:6}
0 {11.0, 14.0, 16.0}
{2:3:5}
0 {12.0, 13.0, 15.0}
{2:3:6}
0 {12.0, 13.0, 16.0}
{2:4:5}
0 {12.0, 14.0, 15.0}
{2:4:6}
0 {12.0, 14.0, 16.0}
In this form of cross referencing, every combination of individual branches from the different lists is used as separate input, and the output for each combination is put onto a branch in the result whose path is the concatenation of the input branch paths used.…
Added by Andy Edwards at 7:03pm on November 3, 2009
a seed, and instead creating a pattern where each color has a seed/control slider for each row? For example, row 1: brown 2, tan 6, yellow 7, purple 3, repeat. row 2: brown 6, tan 1, yellow 4, purple 10, repeat. row 3: yellow 5, purple 1, brown 3, tan 10, repeat. row 4: purple 2, brown 7, tan 3, yellow 4, repeat. Then repeat that sequence up the wall? For each color, the number in the sequence should be adjustable.
Thank you again for your help!…
the paths.
Structure one (paths = 2)
{1;0;0;0;0}(N=10)
{2;0;0;0;0}(N=10)
Structure two (paths = 2)
{1;0;0;0}(N=10)
{2;0;0;0}(N=10)
If i merge the two lists i don't get a structure with 2 paths:
Structure result af merging (2 paths)
{1}(N=20)
{2}(N=20)
as i had expected, but instead a structure with 4 paths because of the difference in amount of zeroes:
Structure result af merging (4 paths)
{1;0;0;0;0}(N=10)
{2;0;0;0;0}(N=10)
{1;0;0;0}(N=10)
{2;0;0;0}(N=10)
The amount of zeroes changes all the time when working on the definition, so what im asking is if there some way to adress paths with * number of zeroes behind.…
≈ 4.8 " as " x= 4.8 ± a ", do you know what is the min and max for "a"?
and second, i had tried the "round" function, but i faced problem with it too! for example:
if the input is a series as {0.0, 0.5, 1, 1.5, 2, 2.5, ...}
the output for Round(x, 0.5) is : {0, 0, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, ... }
and for Round(x, 2) the output is : {0.0, 0.5, 1, 1.5, 2, 2.5, ... }
i can't understand the logic that lies behind this function, i think
for Round(x, 0.5) the output must be {0.0, 0.5, 1, 1.5, 2, 2.5, 3, 3.5, 4, 4.5, ... }
and for Round(x, 2) it must be {0.0, 0.0, 2, 2, 2, 2, 4, 4, 4, 4, ... }
so, is there any problem with it, or I misendestood the logic ?…