Note: The code accompanying this article is available for download here.

In Part 1 of this series, we introduced several concepts, such as managing external storage and defining comparator procedures, that are required for defining a reusable routine for managing doubly-linked lists.

In this second part, we:

• Detail the procedures that create, delete, and manipulate reusable doubly-linked lists.
• Tell you about the source code and how to create a service program.
• Show you an example of how to use the doubly-linked list service program in your applications.

Creating and Destroying a List

Let’s begin with a list of the

You’re swamped with work, and here comes Harold in Accounts Receivable yet again for help with some query he threw together that doesn’t work correctly. Harold’s not a bad guy–his wife, his kids, and his dog adore him. He just doesn’t understand computer stuff. Here’s a way you can help him help you.

Harold’s problem is that he doesn’t understand how to join files properly. What you need is a way to store join field information on the system. That is, you need a way to store the fact that file A and file B join over field C and

I’m using the Web interface on my Hardware Management Console (HMC) to move memory between my Power i partitions, and it keeps timing out before completing the move. What’s going on and why can’t I move memory between my partitions?

–Sven

There are a number of reasons for moving memory between i/OS partitions. I’ve frequently moved memory and CPU from one partition to another during an upgrade, to help speed the process along faster. A few years ago, I also set up an HMC to automatically shift memory from our development box to our production system and back again during