6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, etc
In addition to the components in the attached file, I have also tried using Cull Index but that did not do much. I tried using a number slider set to whole numbers with the range equal to the values I have set up in the integer, but it just increases the size by 1 every time. Any help on steps in the right direction would be great thanks.…
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).…
{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…
ny iterations at one go as you describe:
http://smartgeometry.org/index.php?option=com_community&view=groups&task=viewdiscussion&topicid=20&groupid=2&Itemid=0
I also posted there an example of linking this to Galapagos - which is something I'd been meaning to explore more for ages. I've not tried it yet with anything more interesting than adjusting the depth of a truss to minimize total displacement, but I think there's a lot more that could be done.…
raft the first (4) 0's into a branch, then the next (5) 26's, then (5) 52's, then (8) 72's, and so on. The list is being generated does not have a consistent pattern of consecutive numbers, but if I could count the number of consecutive items, then I would be able to tell the list where to partition.…
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.…
which will result in creating a check for each branch with one item to be 'matched' (in this case to see if it is included in the domain) with all three domains in the single list. so in the end you get a data tree with 8 branches (derived from the 8 grafted values) with 3 items in each branch, that are the check of each initial value with the 3 items domain list.
thank you for sharing the other option too!.
cheers
alex…
o luck so far. I get the same error every time. I am attaching a print screen. Thanks to anyone who makes an effort
P.S. My PC is running now Windows 8 Enterprise N RTM x64 Build 9200 …
Added by cuki fuki at 1:24am on September 25, 2012