Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!husc6!mit-eddie!genrad!decvax!ucbvax!COGSCI.BERKELEY.EDU!bryce
From: bryce@COGSCI.BERKELEY.EDU (Bryce Nesbitt)
Newsgroups: comp.sys.amiga
Subject: Comments on the uniqueness of task & window id's
Message-ID: <8706260543.AA20346@cogsci.berkeley.edu>
Date: Fri, 26-Jun-87 01:43:29 EDT
Article-I.D.: cogsci.8706260543.AA20346
Posted: Fri Jun 26 01:43:29 1987
Date-Received: Sat, 27-Jun-87 07:01:03 EDT
Sender: daemon@ucbvax.BERKELEY.EDU
Lines: 21

It just hit home that task & window id's are not really guaranteed to be
unique.  It's a longshot, but a task or window could disappear, and a new one
be created in it's place.  There would be no totally safe way of determining
if what is at that location is that same window/task you talked to last time.

99999 out of every 100000 Amiga programs won't need it, but my latest creation
could make use of a 100% unique task key.  Possibly a sequential long,
incremented and checked for uniqueness (You never know when that
4,294,967,296th task will start up!!) (I believe in truly infinite systems)

As it is there is a safe enough way for my program to work without this,
and I can also check things like the stack pointers etc.  But I'm fanatic about
reliability, so this does not sit very well.

Observation:  All those LONGs end up on WORD boundaries because of the size of
the node structure. 

|\ /|  . Ack! (NAK, EOT, SOH)
{O O} . 
( " )	bryce@cogsci.berkeley.EDU -or- ucbvax!cogsci!bryce
  U	using a task with the INTERACTIVE bit set. :-)