W3C home > Mailing lists > Public > uri@w3.org > May 2003

Re: draft-fielding-uri-rfc2396bis-02

From: Graham Klyne <GK@ninebynine.org>
Date: Mon, 26 May 2003 08:52:26 +0100
Message-Id: <5.1.0.14.2.20030525102006.03420eb8@127.0.0.1>
To: Rob Cameron <cameron@cs.sfu.ca>, uri@w3.org

At 12:00 24/05/03 -0700, Rob Cameron wrote:
>4.  I have been working on the  inverse of the algorithm
>     of section 5.2 for resolving relative references.
>     I thought an algorithm for that might appear in this draft.

I assume you mean for constructing relative references?

A problem with this is that there's no single correct implementation.  I 
did a relative path computation [1] when I implemented this stuff, and 
realized that some equally legitimate choices are available in come cases 
for the fairly minimal requirements I was working from.

#g
--

[1] My code, in Haskell, including a fairly extensive range of test cases, 
is at:
     http://www.ninebynine.org/Software/Intro.html#URIsInHaskell



-------------------
Graham Klyne
<GK@NineByNine.org>
PGP: 0FAA 69FF C083 000B A2E9  A131 01B9 1C7A DBCA CB5E
Received on Monday, 26 May 2003 04:18:58 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Thursday, 13 January 2011 12:15:31 GMT