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.
…
{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…
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}
ow do you sort data trees with distinctive number of list items in each branch?
In this example, there are 161 branches with three distinctive number of list items, 3, 4, and 5. I want to know if there is another way to sort out this data tree into this way: 3 vertices {0;0}, {0;1}, {0;2],...4 vertices {1;0}, {1;1}, {1;2},... 5 vertices {2;0}, {2;1}, {2;2},...
2. Is there a way to sort our surfaces based on number of distinctive list items automatically? For example, if there are surfaces with 3, 4, 5, 6, and 7 vertices, I want to make five branches with the same number of vertices automatically.
I hope my questions make sense...
Thank you!
Dongyeop …
Added by Dongyeop Lee at 12:14pm on October 3, 2016
EC
1. Between hours 1:00 to 24:002. Current document units is in Meters3. Conversion to Meters will be applied = 1.0004. [1 of 7] Writing simulation parameters...5. [2 of 6] No context surfaces...6. [3 of 6] Writing geometry...7. [4 of 6] Writing materials and constructions...8. [5 of 7] Writing schedules...9. [6 of 7] Writing loads and ideal air system...10. [7 of 7] Writing outputs...11. ...... idf file is successfully written to : c:\ladybug\Freeformtower_IDF\EnergyPlus\Freeformtower_IDF.idf12. 13. Analysis is running!...14. ......
Done! Read below for errors and warnings:
15. 16. Program Version,EnergyPlus-Windows-64 8.1.0.009, YMD=2015.04.04 23:39,IDD_Version 8.1.0.00917. 18. ************* IDF Context for following error/warning message:19. 20. ************* Note -- lines truncated at 300 characters, if necessary...21. 22. ************* 577 Zone,23. 24. ************* Only last 1 lines before error line shown.....25. 26. ************* 578 Freeformbuilding27. 28. ** Warning ** IP: IDF line~578 Comma being inserted after:" Freeformbuilding" in Object=ZONE29. 30. ** Severe ** Out of range value Numeric Field#5 (Type), value=0.00000, range={>=1 and <=1}, in ZONE=FREEFORMBUILDING31. 32. ************* IDF Context for following error/warning message:33. 34. ************* Note -- lines truncated at 300 characters, if necessary...35. 36. ************* 586 BuildingSurface:Detailed,7341.
…
ant to find all paths where exactly two items are the same like in branch {1}. How can I solve this in VB? Is there an easy "search in list" class or do I have to iterate over all items by myself ??
Regards Alex…
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!…