W3C home > Mailing lists > Public > www-archive@w3.org > April 2003

cwm uripath.py bug

From: Ryan Lee <ryanlee@w3.org>
Date: Thu, 3 Apr 2003 17:08:30 -0500 (EST)
To: <www-archive+n3bugs@w3.org>
cc: Tim Berners-Lee <timbl+n3bugs@w3.org>, Dan Connolly <connolly@w3.org>
Message-ID: <Pine.LNX.4.30.0304031648400.25190-100000@tux.w3.org>


A while loop at line 194 increments a string index past the end of the
shortest string (contrary to the comments) in the case where refTo(base,
uri) is comparing uneven length strings.  If uri is shorter, then code
like uri[i] on line 217 will complain about the index being out of bounds
(whereas code using splicing like line 208 will just ignore the problem).

Fixed by checking that i<len(uri) in line 217, which I think is correct:
if base and uri match for the whole length of uri, then it will take some
number of '../' to get to uri from base, with no other trailing
characters (the else case).

Passes uripath.py tests, Python no longer barfs on what I run it on -
checked in change.

Ryan Lee
Received on Thursday, 3 April 2003 17:08:42 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 14:42:23 UTC