× 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 Wed, 27 Feb 2002, Buck Calabro wrote:

> I write an in-house function (oops.  Procedure) named qsort.  That function
> is a special quick sort for  putting toll records into temporal order.  You
> have written an RPG implementation of the C qsort() and kindly put it on the
> Web.  I really could use that to replace a home-grown binary sort that I've
> been using in lieu of LOOKUP.  When I try to bind your service program,
> there are two 'qsort' procedures and I can't tell the compiler that I want
> my qsort for the tolls work and your qsort for the LOOKUP replacement, as in
>
> callp taylor.qsort(array)
> callp commsoft.qsort(customer_key)

Errors had better be encountered before binding occurs.  This should fail
when compiling because the two qsort functions have different definitions,
and those definitions clash.  The compiler should never get to the binding
step.

James Rich
james@eaerich.com



As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

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.