pe Description = 41 byteType Name = 6 byteIs valid = 1 byteIs valid why not = 0 byte (let's assume everything works)Value = 8 byteTotal for GH_Number: 46 bytes, 8 of which are used for the number, 38 for saying it's a number). 2.400.000 x 46 byte = 105MB for one set of data. (a quick runtime check seems to confirm this is the right ballpark)
My conclusion for using big data in grasshopper needs some additional love at the moment. Currently the datatree structure becomes less useful when starting to go beyond the order 100,000, after this I usually consider writing some C# solution. Main reason usually is the runtime, not memory: executing the multiply command for example for 2.4 million times takes 20 seconds here (I'm not that patient).…
NONE, in SIZING:PARAMETERS". I'm not sure of where to start in troubleshooting this. I've attached the file.
Thank you,
See the errors and warnings below:
{0;0;0}
0. Current document units is in Meters
1. Conversion to Meters will be applied = 1.000
2. [1 of 8] Writing simulation parameters...
3. [2 of 8] Writing context surfaces...
4. [2 of 8] Writing context surfaces...
5. [3 of 8] Writing geometry...
6. [4 of 8] Writing Electric Load Center - Generator specifications ...
7. [5 of 8] Writing materials and constructions...
8. [6 of 8] Writing schedules...
9. [7 of 8] Writing loads and ideal air system...
10. [8 of 8] Writing outputs...
11. ...
... idf file is successfully written to : R:\Green\SuRG\Building_Performance_Analysis\2016_analysis_studies\Energy_Analysis_Comparison\Honeybee_+_Ladybug\tutorial01\EnergyPlus\tutorial01.idf
12.
13. Analysis is running!...
14. ...
...
Done! Read below for errors and warnings:
15.
16. Program Version,EnergyPlus, Version 8.5.0-c87e61b44b, YMD=2016.10.31 11:39,IDD_Version 8.5.0
17.
18. ************* IDF Context for following error/warning message:
19.
20. ************* Note -- lines truncated at 300 characters, if necessary...
21.
22. ************* 24 Sizing:Parameters,
23.
24. ************* Only last 1 lines before error line shown.....
25.
26. ************* 25 None, !- Heating Sizing Factor
27.
28. ** Severe ** IP: IDF line~25 Invalid Number in Numeric Field#1 (Heating Sizing Factor), value=NONE, in SIZING:PARAMETERS
29.
30. ** Warning ** IP: Note -- Some missing fields have been filled with defaults. See the audit output file for details.
31.
32. ** ~~~ ** Possible Invalid Numerics or other problems
33.
34. ** Fatal ** IP: Errors occurred on processing IDF file. Preceding condition(s) cause termination.
35.
36. ...Summary of Errors that led to program termination:
37.
38. ..... Reference severe error count=1
39.
40. ..... Last severe error=IP: IDF line~
, value=NONE, in SIZING:PARAMETERS
41.
42. ************* Warning: Node connection errors not checked - most system input has not been read (see previous warning).
43.
44. ************* Fatal error -- final processing. Program exited before simulations began. See previous error messages.
45.
46. ************* EnergyPlus Warmup Error Summary. During Warmup: 0 Warning; 0 Severe Errors.
47.
48. ************* EnergyPlus Sizing Error Summary. During Sizing: 0 Warning; 0 Severe Errors.
49.
50. ************* EnergyPlus Terminated--Fatal Error Detected. 1 Warning; 1 Severe Errors; Elapsed Time=00hr 00min 9.34sec
51.…
t where I get 20branches with 8 forces...
See diagram below where same data is fed to EqAngle and Bend
For more details, 20Curves (tree branch) are broken down into 8 segments (lists). And I am trying, to Equalize the Angle of each of these curves individually.
I was expecting one force per (pt1,pt2,pt3) and not one force per Branch so to speak...
Thanks.
…
Added by Jean to Kangaroo at 5:52am on October 7, 2015
oxes in the most efficient way within boundaries of object and follow the following constraints. The Goal: To fit 125 boxes in the most efficient way inside the total area. Starting Variables: (1) 40% of the Boxes need to be between 60 and 85MSQ. (2) 40% of the boxes need to be between 86 and 110MSQ.
(3) 20% of the boxes need to be between 111 and 125mSQ. The breakdown doesn’t have to be exact to give the script some flexibility. Meaning you can have 41% +39% +20% = 100%.
Constraints:
1. A total MAXIMUM area of approximately 1600M per layer.
2. A maximum of 8 layers for a total of 12,800M per layer. Optimization can make as little or as many as 8 layers vertical to accommodate all boxes. So if script can achieve with 3 levels great. If needed all 8 levels, that's fine too. However, pay attention to next constraint (#3).
3. Approximately 15% of that space on each layer is off limits. (internal area) (blue area in example script) and the shape of the boundary cannot be modified to accommodate box design resulting in jagged lines for the internal area.
4. All generated squares/rectangles must have at least 3m touching an outside border (The Green lines).
5. All boxes must also be touching minimum 1M of border of the blue line.
6. If the boxes generated go outside the green boundary, they must be fillet to maintain the straight lines of the green boundaries.
7. Get as many of the boxes as possible a view towards the dots.
Could any one provide me a method or a way to start, if there are any useful links, please share with me. Thank you!…
Boxes in the most efficient way within boundaries of object and follow the following constraints.
The Goal: To fit 125 boxes in the most efficient way inside the total area. Starting Variables:
(1) 40% of the Boxes need to be between 60 and 85MSQ. (2) 40% of the boxes need to be between 86 and 110MSQ.
(3) 20% of the boxes need to be between 111 and 125mSQ. The breakdown doesn’t have to be exact to give the script some flexibility. Meaning you can have 41% +39% +20% = 100%.
Constraints:
1. A total MAXIMUM area of approximately 1600M per layer.
2. A maximum of 8 layers for a total of 12,800M per layer. Optimization can make as little or as many as 8 layers vertical to accommodate all boxes. So if script can achieve with 3 levels great. If needed all 8 levels, that's fine too. However, pay attention to next constraint (#3).
3. Approximately 15% of that space on each layer is off limits. (internal area) (blue area in example script) and the shape of the boundary cannot be modified to accommodate box design resulting in jagged lines for the internal area.
4. All generated squares/rectangles must have at least 3m touching an outside border (The Green lines).
5. All boxes must also be touching minimum 1M of border of the blue line.
6. If the boxes generated go outside the green boundary, they must be fillet to maintain the straight lines of the green boundaries.
7. Get as many of the boxes as possible a view towards the dots.
Could any one provide me a method or a way to start, if there are any useful links, please share with me. Thank you!
…
re is my problem... I need to arrange Boxes in the most efficient way within boundaries of object and follow the following constraints.
The Goal: To fit 125 boxes in the most efficient way inside the total area. Starting Variables:
(1) 40% of the Boxes need to be between 60 and 85MSQ. (2) 40% of the boxes need to be between 86 and 110MSQ.
(3) 20% of the boxes need to be between 111 and 125mSQ. The breakdown doesn’t have to be exact to give the script some flexibility. Meaning you can have 41% +39% +20% = 100%.
Constraints:
1. A total MAXIMUM area of approximately 1600M per layer.
2. A maximum of 8 layers for a total of 12,800M per layer. Optimization can make as little or as many as 8 layers vertical to accommodate all boxes. So if script can achieve with 3 levels great. If needed all 8 levels, that's fine too. However, pay attention to next constraint (#3).
3. Approximately 15% of that space on each layer is off limits. (internal area) (blue area in example script) and the shape of the boundary cannot be modified to accommodate box design resulting in jagged lines for the internal area.
4. All generated squares/rectangles must have at least 3m touching an outside border (The Green lines).
5. All boxes must also be touching minimum 1M of border of the blue line.
6. If the boxes generated go outside the green boundary, they must be fillet to maintain the straight lines of the green boundaries.
7. Get as many of the boxes as possible a view towards the dots.
Could any one provide me a method or a way to start, if there are any useful links, please share with me. Thank you!
…
was to take the list, sort it from hight to low and low to high, flip the values then resort them back in the original order but im not quit sure if this is achievable in GH. I might need to dig into a C# component to sort the array within a loop. If someone could lend me a hand that would be great.
…