RE: Inserting a record into the middle of a subfile--suggestions?

I have not seen it addressed here, nor have I actually used it, but Ted Holt
wrote an article back in 2011 titled "Implementing Linked Lists in RPG." I
don't know if it would be helpful, but the link to it is:

http://tinyurl.com/LinkedListsinRPG

He co-authored another one about doubly-linked lists at
http://tinyurl.com/DoublyLinkedLists .

Jerry C. Adams
IBM i Programmer/Analyst
Any sufficiently advanced technology is indistinguishable from magic.
-Arthur C. Clarke
--
NMM&D
615-832-2730

-----Original Message-----
From: MIDRANGE-L [mailto:midrange-l-bounces@xxxxxxxxxxxx] On Behalf Of x y
Sent: Wednesday, December 31, 2014 1:58 AM
To: Midrange Systems Technical Discussion
Subject: Re: Inserting a record into the middle of a subfile--suggestions?

I appreciate the variety of solutions offered--thanks to all who took the
time to respond. My wish for a linked list was partially tongue-in-cheek
but it does have its uses (in many text editors, I believe). I'm a bit
surprised and disappointed that IBM never released an API to provide greater
control over subfiles but I'm not waiting for the announcement.

The variable-length array using LIKEREC appears to be the best solution. I
don't need any sorting capability--as I read through the subfile and load
the array, I can post the "insertions" and then reload the subfile directly
from the array. Since I'll be using this in a high-volume,
moderately-complex data entry application, every CPU cycle counts and I
avoid gold-plating.

Happy 2015!

On Tue, Dec 30, 2014 at 4:26 PM, Booth Martin <booth@xxxxxxxxxxxx> wrote:

http://martinvt.com/Subfiles/SFL_Sort/sfl_sort.html

This is an example of a sorting (ascending/descending) subfile. I've
used this with subfiles up to several hundred rows and performance is

sub-second.

On 12/30/2014 10:45 AM, Alan Campin wrote:

If you are looking to dynamically sort data from a subfile, you can
go to www.think400.dk/downloads.htm and look for a utility called XVSRTQ.

This API allows you to build keys and sort data dynamically. It uses
QSORT to do the actual sorting. Basically a wrapper around an array
that gets sorted. The good thing about the utility is that it knows
how to store data correctly for sorting. Everything is handled by the
API. Plus its free.
That best price of all.

--
Booth Martin<br>
www.martinvt.com<br>
(802)461-5349<br>
Skype: booth.martin<br><br>

Duct tape is like the force. It has a light side, and a dark side, and
it holds the universe together ...
-- Carl Zwanzig

--
This is the Midrange Systems Technical Discussion (MIDRANGE-L) mailing
list To post a message email: MIDRANGE-L@xxxxxxxxxxxx To subscribe,
unsubscribe, or change list options,
visit: http://lists.midrange.com/mailman/listinfo/midrange-l
or email: MIDRANGE-L-request@xxxxxxxxxxxx Before posting, please take
a moment to review the archives at
http://archive.midrange.com/midrange-l.

--
This is the Midrange Systems Technical Discussion (MIDRANGE-L) mailing list
To post a message email: MIDRANGE-L@xxxxxxxxxxxx To subscribe, unsubscribe,
or change list options,
visit: http://lists.midrange.com/mailman/listinfo/midrange-l
or email: MIDRANGE-L-request@xxxxxxxxxxxx Before posting, please take a
moment to review the archives at http://archive.midrange.com/midrange-l.