Scribd Logo
Upload

Welcome to Scribd!

  • 59 views

    Arrays

    Uploaded by

    prasmiranjan
    This document provides an overview of how arrays are implemented in Synon for RPG. It explains that arrays in Synon behave more like indexed files than traditional arrays, with records stored in a multiple occurrence data structure and an array used to store the record keys and occurrence numbers. It details the create, change, delete, and retrieve functions for working with array elements and how the index is maintained during adds and deletes. Potential issues are also outlined around deleting records using partial keys and changing key values of existing records.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    Arrays

    Uploaded by

    prasmiranjan
    59 views2 pages
    This document provides an overview of how arrays are implemented in Synon for RPG. It explains that arrays in Synon behave more like indexed files than traditional arrays, with records stored in a multiple occurrence data structure and an array used to store the record keys and occurrence numbers. It details the create, change, delete, and retrieve functions for working with array elements and how the index is maintained during adds and deletes. Potential issues are also outlined around deleting records using partial keys and changing key values of existing records.

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an overview of how arrays are implemented in Synon for RPG. It explains that arrays in Synon behave more like indexed files than traditional arrays, with records stored in a multiple occurrence data structure and an array used to store the record keys and occurrence numbers. It details the create, change, delete, and retrieve functions for working with array elements and how the index is maintained during adds and deletes. Potential issues are also outlined around deleting records using partial keys and changing key values of existing records.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    59 views2 pages

    Arrays

    Uploaded by

    prasmiranjan
    This document provides an overview of how arrays are implemented in Synon for RPG. It explains that arrays in Synon behave more like indexed files than traditional arrays, with records stored in a multiple occurrence data structure and an array used to store the record keys and occurrence numbers. It details the create, change, delete, and retrieve functions for working with array elements and how the index is maintained during adds and deletes. Potential issues are also outlined around deleting records using partial keys and changing key values of existing records.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 2

    Gray & Associates Gray Grodzicki (415) 397-1796 grayg@pacbell.

    net Synon Implementation of Arrays for RPG Synon array processing is totally intuitive for any synon user. You do not need to open a manual. If you can use a file, you can use an array. The main difference is that there are only 4 function types: CRTOBJ, CHGOBJ, DLTOBJ, RTVOBJ, and only 1 "ACP" (set of Key fields) The array processing really behaves more like an indexed file than an array. The file portion (Records) is a multiple occurrence data structure and the index portion is an array. The data structure contains the fields as defined in the *ARRAY file. The array(Index) is the fields defined as the Key concatenated with the occurrence# of the data structure. When you create an element in the array (a record in the file), the program takes the next available occurrence of the data structure and loads the fields. The program also creates the Index element by concatenating the key fields with the occurrence# of the newly added data structure. The program then does a Sort Array to sequence the Index so that the records may be accessed in key sequence. Any time a record is deleted, the Index element is blanked out and the Index is Sorted (Sort Array). This is a very clean solution and the performance is surprisingly good considering that the array is sorted after each add or delete. When accessing the data, a LOKUP is performed on the array using the key value with blanks instead of the occurrence# and looking for GT in the array. This allows processing of partial keys as positioners or restrictors. The program then reads the data structure for the occurrence# taken from the array element to get the data(fields). For the next occurrence, it is not necessary to do another LOKUP (which is slow) because the array is sorted. The program only has to read the next element in the array and continue the processing as long as the partial key matches the key in the array. From the point of view of the Synon user, this processing is identical to a file RTVOBJ. Synon loads the array from the bottom (an RPG technique to improve performance in large arrays) because the LOKUP command may be given a starting position, but cannot be stopped until every element is checked when no match is found. By loading the array backwards from the bottom and counting the elements, the search may be started at the last element loaded and only elements which contain data are read. For Example: The array is defined for 1000 elements. Only 10 elements are loaded. These are loaded to occurrences 991 thru 1000. When the LOKUP is performed, it starts at 991 and only 10 compares are made even if no match is found. If the array is loaded from the top, 1000 compares are performed if no match is found.

    Gotchas:

    If you are deleting records using a partial key as a positioner, (RTVOBJ with DLTOBJ when record is found) after the first record is found, the element number of the array is used to determine which record to process. However DLTOBJ re-sorts the array and the element number is no longer correct for the next occurrence in the array. The program still compares the partial keys to make certain that only records with a match on the partial key are processed, but some records are skipped. This bug has been reported to Synon. If you need to do this, call the RTVOBJ in a loop until there is no record found. To clear the entire array, Create a DLTOBJ with no parameters and the array is cleared with 1 move. If you ever try to change the key values for an array record, (you would have to put code inside of the CHGOBJ to do this) the array is not sorted and the index no longer works. The array is never sorted for a CHGOBJ because Synon assumes that you will never change a key. You must delete the record and add the new record.

    You might also like