We help IT Professionals succeed at work.

Pointers

liau080698
liau080698 asked
on
Medium Priority
177 Views
Last Modified: 2010-04-04
Let say I have stored a set of data in a field of a record. Now I want to use these data in a procedure which will calculate the difference between two adjacent elements. How can I create such a procedure?
Comment
Watch Question

Commented:
Unlock this solution and get a sample of our free trial.
(No credit card required)
UNLOCK SOLUTION

Commented:
mmm, reading your title again, this can't be a database question...

Just a pointer question?

Assume this :

type
  PMyData = ^TMyData;
  TMyData = record
   Value1 : integer;
   Value2 : integer;
  end;

var Pointer1, Pointer2 : PMyData

function difference(apointer1, apointer2: PMyData):interger;
begin
 result := apointer1^.value1 - apointer2^.value1;
end;


{fill records}

 Pointer1^.value1 := 30;
 Pointer1^.value2 := 40;

 Pointer2^.value1 := 10;
 Pointer2^.value2 := 20;


{function call}

 Mydifference := difference(pointer1,pointer2);

Euhm, let's assume that the syntax is correct (test it please, haven't done it myself, it's getting kinda late here), because it's a long time ago that I've used these things.

Zif.

Author

Commented:
The data has been read from a text file and stored in a plain pascal record called data with 2 fields namely dat and next. What I actually did was the following:

TopPointer := Nil;
While not Eof(f1) do
Readln(f1, Element);
Push(TopPointer, Element)


Procedure Push(var TopPointer : ^Data; Element : real);
var
TempPointer := ^Data;

begin
  new(TempPointer);
  TempPointer^.dat := Element;
  TempPointer^.Next := TopPointer;
  TopPointer := TempPointer;
  Dispose(TempPointer);
end;


Now I require a procedure that could calculate the difference of all the adjacent data I have stored. If the data is stored in an array, I could create a loop within the procedure to do such a job since the array element has been numbered. How does one do a similar job if only the pointer of the record is passed into the procedure?
Thanks.

Commented:
Hi liau,

Ok, I understand now :

Mostly we do it this way :

1. Store a the top of the stack into a variable :  eg. PStackTop
    PStackTop.Next := NIL;
2. POldRecord := PStackTop
2. If you add a record : eg NewRecord
    NewRecord.Next := NIL;
    OldRecord.Next := NewRecord;

Now to iterate through the list, just do

 PiterateRecord := PStackRecord
 while PiterateRecord.Next <> NIL then do begin
 ....
   PiterateRecord := PiterateRecord.next;
 end;

You see, the NIL is very important here, because it determines the end of the list....

What you also can do, but not so 'good' is to keep a pointer which addresses to the begin in the list, but also a pointer which addresses to the end of the list...

This way you iterate from beginpointer till you arrive on endpointer. But you should better use the method with nil.

PS. you can also add a .previous field... that way you can iterate both ways...

Regards, Zif.

Unlock the solution to this question.
Thanks for using Experts Exchange.

Please provide your email to receive a sample view!

*This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

OR

Please enter a first name

Please enter a last name

8+ characters (letters, numbers, and a symbol)

By clicking, you agree to the Terms of Use and Privacy Policy.