Subject:
|
Re: Some secrets of MLCad revealed ...
|
Newsgroups:
|
lugnet.cad.mlcad
|
Date:
|
Sun, 6 Jul 2003 12:07:55 GMT
|
Viewed:
|
3841 times
|
| |
|
|
"Damien Guichard" <damien.guichard@wanadoo.fr> schrieb im Newsbeitrag
news:HHKMxB.225G@lugnet.com...
<SNIP>
> Thanks Michael.
> So, at loading time, each added point has to be compared to all points in • the
> point list. Does this impact the loading time of big parts or big models • in a
> significant manner? Or is it only minor slowdown?
>
> Regards,
>
> Damien
So far I could find out, it doesn't effect loading much, I think it was
something about 10% less then without this feature. I must say, I haven't
tried using hash algorythms to find the point more quickly, but so far I
remember there is an average of arround 400 points in a file, and search for
an 12 byte value is not so hard ...
Michael
|
|
Message has 2 Replies:
 | | Re: Some secrets of MLCad revealed ...
|
| (...) Ok, the practical figures relativize the problem for everyday use. Thanks Michael. For the sake of sharing here is how I imagine a sorted point list. The sorted list is also implemented as an array, so points can be accessed by index for (...) (21 years ago, 7-Jul-03, to lugnet.cad.mlcad)
|
Message is in Reply To:
| | Re: Some secrets of MLCad revealed ...
|
| (...) Thanks Michael. So, at loading time, each added point has to be compared to all points in the point list. Does this impact the loading time of big parts or big models in a significant manner? Or is it only minor slowdown? Regards, Damien (21 years ago, 5-Jul-03, to lugnet.cad.mlcad)
|
12 Messages in This Thread:
  
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
This Message and its Replies on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
