If I need to loop a global with a lot nodes, is there any performance difference between $o(^Global(subscript)) vs $o(^Global(subscript),-1)? Thanks,
$o(^Global(subscript)) is probably marginally faster by a few millibleems per lookup, but whether you will notice any difference in throughput in the context of a complete application is not clear.
I did some performance testing in Intersystems Cache and found the $o(^Global(subscript)) is about 3-4 time faster than $o(^Global(subscript),-1). Also if ^Global has a lot of multi level subscripts, both $o(^Global(subscript)) and $o(^Global(subscript),-1) are dramatically slowed. Not sure this is true in GT.M since the implementation might be different.
Sign up for the SourceForge newsletter:
You seem to have CSS turned off.
Please don't fill out this field.