|Message: Re: Turn off overlap warning||Not Logged In (login)|
Click on the Forum title, e.g. on the "Forums by Category" page, to read a sequence of postings to the Forum and its threads all in one page. If you are only interested in one thread or the thread following a specific posting, click the thread or the posting, which takes you to a smaller page, which contains only the part you are interested in and may be easier to navigate.
Messages are "chained" if there are only replies at the first level, i.e. 1/1.html, 1/1/1.html etc. In case of "chained" messages the message number is replaced by the icon and there is no indentation.
Inline: Display the subject line only or also the text of the posting(s); for the choice "All" the "Outline" choices are switched off.
|1||0||1||no text / full text of posting|
|2||1||All||text for level 1 only / text for All postings|
Outline: Choose the depth of the posting thread, successive toggle controls provide increasing detail.
|1||2||1||2 levels / 1 level (original posting)|
|2||3||2||3 levels / 2 levels|
|3||3||All||3 levels / all levels (all postings)|
On Fri, 28 Aug 2009 15:50:03 GMT, Gabriele Cosmo wrote:
> We could introduce an additional level of verbosity to satisfy your needs, > however, let me point out that the technique you use for determining the > smallest bounding box is certainly not efficient. > It would be more appropriate to compute (with some coding) the extent > of the solid, perhaps by adopting the CalculateExtent() method that each > one of the shapes already provides...
Hi, Gabriele. Thanks for the response.
An additional level of verbosity would indeed be welcome. In general, it would be nice to have the option to turn off any, or even all, warning messages (something like the gcc "-Wall" flag). Could this don't-print-warnings-flag be written into the G4Exception class?
The technique I'm suggesting may not be terribly efficient, but all that matters in the end is the time it takes to actually run. I've already put together a very simple (and inefficient) algorithm for finding the smallest bounding sphere on any arbitrary physical volume, and looping over roughly 300 volumes takes a small amount of time, about 4 seconds.
It may be that using CalculateExtent() gives better and faster results, but the difference between 4 seconds and 0 seconds is negligible. If my bounding volume routines grow unwieldy, I'll take a look at CalculateExtent().
|Inline Depth:||Outline Depth:||Add message:|