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



I don't do API's.  My experience is that few programmers understand them 
so later maintenance becomes a hassle for clients.  Perhaps in a few years 
API's will be better understood but presently that is not the case.

However I had 3 thoughts last night. 

1-Don't put the K in the F-spec (you need arrival sequence) 

2-I bet you need READ, not READP

3-Do you really need to recover the RRN of the last record?  I was trying 
to think of a reason for needing it and couldn't think of a single need 
for it that couldn't be solved easier another way.


_______________________
Booth Martin
booth@martinvt.com
http://www.MartinVT.com
_______________________




"Raikov, Lo" <RaikovL@mki.com.au>
06/03/2000 02:37 AM
Please respond to MIDRANGE-L

 
        To:     "'boothm@earth.Goddard.edu '" <boothm@earth.Goddard.edu>
        cc: 
        Subject:        RE: Last RRN

 Yeah, that's better than adding and deleting the record, but I was
half-hoping somebody could point me to an API.

Lo

-----Original Message-----
From: boothm@earth.Goddard.edu
To: MIDRANGE-L@midrange.com
Sent: 6/3/00 11:41 AM
Subject: Re: Last RRN

Would something like this work for you?  Where DB1RRN would be the RRN
of 
the highest record.  I would prefer to use   C    *END   CHAIN (E)
but that is fairly new and you may not have it on your machine.  I 
am unsure about the "BLOCK(*NO)" so I use it, just in case.


FGCKFL1 IF   E     K DISK    INFDS(DB1) BLOCK(*NO) 

 * Get the record Number, to know which record 
 * to update/process: 
D DB1             DS 
D DB1RRN                397    400B 0 

C     *HiVal        Setll     RGCKF1 
C                   READP     RGCKF1            58
 
_______________________
Booth Martin
booth@martinvt.com
http://www.MartinVT.com
_______________________




"Raikov, Lo" <RaikovL@mki.com.au>
Sent by: owner-midrange-l@midrange.com
06/02/2000 03:50 AM
Please respond to MIDRANGE-L

 
        To:     "'MIDRANGE-L@midrange.com'" <MIDRANGE-L@midrange.com>
        cc: 
        Subject:        Last RRN

                  Can anybody think of an easy way to obtain the highest

used RRN in
a DB file? Changing the file to REUSEDLT(*NO), writing to it and 
extracting
RRN from INFDS data area and then changing the file back to
REUSEDLT(*YES)
looks a bit too tricky for my taste.

                 Lo 
+---
| This is the Midrange System Mailing List!
| To submit a new message, send your mail to MIDRANGE-L@midrange.com.
| To subscribe to this list send email to MIDRANGE-L-SUB@midrange.com.
| To unsubscribe from this list send email to 
MIDRANGE-L-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator: 
david@midrange.com
+---




+---
| This is the Midrange System Mailing List!
| To submit a new message, send your mail to MIDRANGE-L@midrange.com.
| To subscribe to this list send email to MIDRANGE-L-SUB@midrange.com.
| To unsubscribe from this list send email to
MIDRANGE-L-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator:
david@midrange.com
+---




+---
| This is the Midrange System Mailing List!
| To submit a new message, send your mail to MIDRANGE-L@midrange.com.
| To subscribe to this list send email to MIDRANGE-L-SUB@midrange.com.
| To unsubscribe from this list send email to MIDRANGE-L-UNSUB@midrange.com.
| Questions should be directed to the list owner/operator: david@midrange.com
+---

As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

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.