×
The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.
cozzi@xxxxxxxxx wrote:
Hans,
Sorry perhaps my memory had a V5.3 feature confused with something
else we've discussed on-line before.
-Bob
Hi Bob! Sorry for the sarcastic tone of my last note. As we discussed
previously, there are some incremental improvements to SORTA in that you
can now code a fully qualified name as the operand. For example, "SORTA
DS(I).SA(J).SA" is now allowed, provided that the subfield SA is an array.
Doing a SORTA on an array data structure is a "future objective", and
perhaps someday we'll allow some kind of syntax like "SORTA DS(*).KEY"
to sort the data structure using subfield KEY as the key. We'll have to
study this carefully since we'd probably need to use a different sort
algorithm. For sorting DS arrays, preferably, we should use a stable
sort algorithm. That is, items with equal key should be kept in the same
relative sequence after the sort. (BTW, the same kind of syntax could
also apply to %LOOKUP, as in "%LOOKUP('needle':HAYSTACKDS(*).KEY)".)
Cheers! Hans
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact
[javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.
midrange.com
