Path: utzoo!utgpu!attcan!uunet!seismo!sundc!pitstop!sun!decwrl!ucbvax!pasteur!ames!killer!tness7!tness1!sugar!ficc!peter
From: peter@ficc.uu.net (Peter da Silva)
Newsgroups: comp.lang.fortran
Subject: Re: Data types _without_ pointers
Message-ID: <1580@ficc.uu.net>
Date: 23 Sep 88 02:44:30 GMT
References: <1032@amelia.nas.nasa.gov> <4026@lanl.gov>
Organization: SCADA
Lines: 25

In article <4026@lanl.gov>, jlg@lanl.gov (Jim Giles) writes:
> _NONE_ of these require user accessable pointers not even the linked list!
> Items of type 'list' have values of type 'list' - _not_ values of type
> 'address_of_list'....

This is an interesting arrangement. How do you propose to implement insertion
into a doubly linked list without pointers:

	struct {
		struct list *prev, *next;
		data;
	} *p, *q;

	...

	q->next = p;
	p->prev->next = q;
	q->prev = p->prev;
	p->prev = q;

Whatever syntax would you use that would adequately hide the pointers and
still let you express this? I am genuinely curious.
-- 
Peter da Silva  `-_-'  Ferranti International Controls Corporation.
"Have you hugged  U  your wolf today?"            peter@ficc.uu.net