Sorting a Multi-occurrence data structure -- RPG400-L

× 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.

Subject: Sorting a Multi-occurrence data structure
From: "Jon Paris" <Jon.Paris@xxxxxxxxxxxxxx>
Date: Wed, 13 Nov 2002 09:03:15 -0500
Importance: Normal
List-archive: <http://archive.midrange.com/rpg400-l/>
List-help: <mailto:rpg400-l-request@midrange.com?subject=help>
List-id: RPG programming on the AS400 / iSeries <rpg400-l.midrange.com>
List-post: <mailto:rpg400-l@midrange.com>
List-subscribe: <http://lists.midrange.com/cgi-bin/listinfo/rpg400-l>,<mailto:rpg400-l-request@midrange.com?subject=subscribe>
List-unsubscribe: <http://lists.midrange.com/cgi-bin/listinfo/rpg400-l>,<mailto:rpg400-l-request@midrange.com?subject=unsubscribe>

 >> But it doesn't just stop at the first match found. In order to match the
semantics of LOOKUP, the algorithm then walks up or down through

That's exactly what I was hoping to hear Hans.  I was contrasting it with
bsearch (which doesn't "walk") which I often had to use until %Lookup came
along.

Jon Paris
Partner400

As an Amazon Associate we earn from qualifying purchases.

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.