{0;1;0}N=6
{0;1;1}N=6
{0;1;2}N=5
{0;2;0}N=7
{0;2;1}N=8
{0;2;2}N=9
Can you shift and wrap any of the paths A B or C?
Say if I wanted to shift and wrap B by 1 to get the following...
{0;0;0}N=7
{0;0;1}N=8
{0;0;2}N=9
{0;1;0}N=3
{0;1;1}N=2
{0;1;2}N=5
{0;2;0}N=6
{0;2;1}N=6
{0;2;2}N=5…
would like to group the paths based on their item count (n) values resulting in a tree which should look something like this:
{0;0} (3)
{0;1} (2)
{0;2} (2)
{0;3} (1)
in other words, all paths with 2 items are under one path, all with 6 items in another, and so on.
I feel that the pathmapper should be able to do this very easily but cannot figure out what the expression should be... I have tried searching the forum but have not had much luck!
Any ideas? Thanks a ton!…
ents will do or which components will be available.
My problem arises because I want to obtain a list such as the following:
{{6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6}, {5, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5}, {4, 5, 6, 5, 4, 3, 2, 1, 2, 3, 4}, {3, 4, 5, 6, 5, 4, 3, 2, 1, 2, 3}, {2, 3, 4, 5, 6, 5, 4, 3, 2, 1, 2}, {1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1}}
Which displayed as a matrix is:
If it were possible to combine GH operations (series, shift list, replace string...) with matrices I think it would be quite powerful. A matrix to list component like those available on scientific calculators, would then translate the matrix to list.
For me, matrices come in handy when dealing with surface patterns.
…
Added by Jesus Galvez at 6:46am on November 26, 2012
Writing simulation parameters...3. [2 of 8] No context surfaces...4. [3 of 8] Writing geometry...5. unsupported operand type(s) for +: 'str' and 'list'6. Failed to write Pelle_aperture000 to idf file7. unsupported operand type(s) for +: 'str' and 'list'8. Failed to write Pelle_aperture001 to idf file9. unsupported operand type(s) for +: 'str' and 'list'10. Failed to write Pelle_aperture002 to idf file11. [4 of 8] Writing Electric Load Center - Generator specifications ...12. [5 of 8] Writing materials and constructions...13. [6 of 8] Writing schedules...14. [7 of 8] Writing loads and ideal air system...15. [8 of 8] Writing outputs...16. ...... idf file is successfully written to : C:\Users\Personal\Desktop\TESI\x001\THOR\EnergyPlus\THOR.idf17. 18. Set runEnergyPlus to True!
or this
0. Current document units is in Meters1. Conversion to Meters will be applied = 1.0002. [1 of 8] Writing simulation parameters...3. [2 of 8] No context surfaces...4. [3 of 8] Writing geometry...5. Runtime error (MissingMemberException): 'hb_EPFenSurface' object has no attribute 'blindsMaterial'6. Traceback:line 1567, in main, "<string>"line 2134, in script
i think that i've same problem with my windows...any suggestion???
Thanks for all…
ep is to understan the logics of what you want to do, in your case, build 4 point surfaces (u also need to know the right direction to build the surfaces). Then you can write an hipotetic list (by hand in a paper) of what you want. In your case the list was (0, 1, 3, 2) (2, 3, 5, 4) (4, 5, 7, 6), etc... if you can imagine building 2 lists, each one with the sequences (0, 2, 4, 6, etcc) and (1, 3, 5, 7, etc..) then you can manage with shift and graft to finally have four lists. A( 0 1 2 3 ...) B (1 3 5 etc..) C(3 5 7 etc..) D (2 4 6 etc..). And to achieve the 2 first lists, you need to get the odd and the pair numbers. The cull pattern does that amazingy well. With a pattern True-False you get de pair numbers, and with the False-True pattern you get de odd numbers.
Hope it was clear enough…
Added by Pep Tornabell at 5:32am on November 19, 2009
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