Re: GUID algorithm

• To: Chris Double <chris@double.co.nz>, <info-dylan@ai.mit.edu>
• Subject: Re: GUID algorithm
• From: P T Withington <ptw@callitrope.com>
• Date: Sat, 13 Oct 2001 18:06:19 -0400
• In-Reply-To: <wku1x8r75a.fsf@double.co.nz>
• Organization: Callitrope
• Sender: owner-info-dylan@ai.mit.edu
• User-Agent: Microsoft-Entourage/9.0.1.3108

Chris Double chris@double.co.nz on  2001-10-09 14:45 wrote:

> ron.franke-polz@psd.invensys.com writes:
> 
>> Any ideas on how to create a pure-dylan (no MS dll's) GUID
>> algorithm?  I keep running into situations where I need unique ID's
>> and a GUID generator would be very handy.
> 
> The following gives a description of the algorithm:
> 
> http://www.webdav.org/specs/draft-leach-uuids-guids-01.txt
> 
> Chris.

Amusing.  Sure looks like a direct descendant of the LispM (Statice)
algorithm, via OSF (which had a number of ex-Symbolians, including 11CC)...

• Re: GUID algorithm
• From: Chris Double <chris@double.co.nz>

• Prev: Socket programming in Dylan
• Next: Re: Some thoughts on using Dylan
• Index(es):
  • Main
  • Thread