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


  • Subject: Re: Based variables
  • From: Jim Langston <jimlangston@xxxxxxxxxxxxxxxx>
  • Date: Fri, 08 Dec 2000 13:08:44 -0800
  • Organization: Pacer International

Hmm.. no.

The pointer will point to the start of the Data structure.  This data
structure initially contains one record.  Say the data structure is 240
bytes long.  When you read anther record, you allocate another 240 bytes
to store it in, which goes at the end of your first record.  Then you
increment your pointer by 240, so now it will be pointing at the start
of the second record.

Regards,

Jim Langston

"M. Lazarus" wrote:
> 
> At 12/8/00 11:33 AM -0600, you wrote:
> >The way you do this is to NOT use a field, ONLY use a pointer that is first
> >Allocated to 1 record, and then Reallocated for an additional record each
> >time you read another record in.  This creates a completely dynamic and
> >contiguous memory block that holds the records for the file.  The externally
> >described Data Structure to the file is Based on a Pointer, and you
> >re-calculate this pointer to the correct position in the dynamic memory
> >block.
> 
>   Let me get this straight.  If the DS is based, the pointer is set for the
> first record read.  I increment the pointer to point to the byte right
> after the DS.  How do I know I'm not stepping on some valid data in
> memory?  Do I use ALLOC / REALLOC to reserve it?  If yes, then that should
> work well.
> 
>   Does it make sense (performance wise) to only add one record to the
> memory allocation?  Or should I just add, say, 500 records worth.
> 
> >Another technique in the RPG Programmer's guide is to create a Linked List.
> >The problem with this is that it requires at least 2 pointers per record,
> >and possibly 3, and creates a lot of pointer management issues.  The above
> >technique requires only 1 pointer for the data, and an additional pointer
> >for the Based Data Structure.
> 
>   I agree that a linked list is too complicated for this application.
> 
>   -mark
>
+---
| This is the RPG/400 Mailing List!
| To submit a new message, send your mail to RPG400-L@midrange.com.
| To subscribe to this list send email to RPG400-L-SUB@midrange.com.
| To unsubscribe from this list send email to RPG400-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:
Replies:

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.