Browse Prior Art Database

Subset Pointers

IP.com Disclosure Number: IPCOM000041396D
Original Publication Date: 1984-Jan-01
Included in the Prior Art Database: 2005-Feb-02
Document File: 2 page(s) / 39K

Publishing Venue

IBM

Related People

Kornelis, S: AUTHOR [+2]

Abstract

We describe a method for operating a computing apparatus to access one or more sub-chains of dependent segments with a chain, where the dependent segment is not at the beginning of the chain, including the steps of (1) defining a subset pointer for each sub-chain and (2) manipulating subset pointers selectively to retrieve the first segment occurrence in the subset, to delete the subset pointer, to set the subset pointer to a current position, to move the subset pointer to the next segment occurrence in the subset, and to delete the subset pointer if the segment is the last in the chain. By this method, the number of pointers is not limited to one and application programs are no longer responsible for the manipulation of the pointer -- setting and resetting of the physical address of the segments.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 55% of the total text.

Page 1 of 2

Subset Pointers

We describe a method for operating a computing apparatus to access one or more sub-chains of dependent segments with a chain, where the dependent segment is not at the beginning of the chain, including the steps of (1) defining a subset pointer for each sub-chain and (2) manipulating subset pointers selectively to retrieve the first segment occurrence in the subset, to delete the subset pointer, to set the subset pointer to a current position, to move the subset pointer to the next segment occurrence in the subset, and to delete the subset pointer if the segment is the last in the chain. By this method, the number of pointers is not limited to one and application programs are no longer responsible for the manipulation of the pointer -- setting and resetting of the physical address of the segments. Referring to the figure, a chain of dependent segments is accessed by skipping from a specific segment.

In the exemplary embodiment of the figure, up to eight subset pointers can be defined and used independently. For example, assume an application is to post unposted transactions to a dependent segment type which may contain both "posted" and "unposted" passbook transactions. The application program requests to access the dependent segments via the first subset pointer SSP1, which will point to the first unposted item. After posting all unposted items, pointer SSP1 can be deleted for this chain. The second subset pointer (SSP2) divides the segments inse...