×
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.
On 11/11/2011 2:33 PM, Kurt Anderson wrote:
That is excellent news indeed, Barbara.
Any possibility of being able to do a lookup to a data structure array w/o specifying a subfield?
I don't think RPG would ever support being able to do a byte-wise lookup
or sort of a data structure array. There are too many data types where a
byte-wise comparison isn't the same as a logical comparison.
But byte-wise isn't the only way to compare data structures without
specifying a subfield to be the key. The comparison could go subfield by
subfield until it found a difference. Or the comparison could work like
bsearch, and use a programmer-specified procedure to do the comparison
in whatever way it it wanted to (even byte-wise if that made sense).
One of those mechanisms is possible.
Of course, as others have already pointed out, you can already do tht if
you use bsearch(). If you're not familiar with bsearch(), it would be
good to try it out. It looks a bit daunting a first, but once you get
used to it, it's great.
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
