projects / mit-scheme.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d7335db) | patch
Second draft: this one uses a fully lazy copy of the XML structure so
authorChris Hanson <org/chris-hanson/cph>
Tue, 30 Sep 2003 04:33:46 +0000 (04:33 +0000)
committerChris Hanson <org/chris-hanson/cph>
Tue, 30 Sep 2003 04:33:46 +0000 (04:33 +0000)
commitd7bc14dccbd77e785d65e31e7765a4fc8313d58d
tree8126b72c3d0ba08e83aabe10f3c433281d76aa99tree | snapshot
parentd7335dbfef0978c2ab4ff0ecc1266aa4dfac531ccommit | diff
Second draft: this one uses a fully lazy copy of the XML structure so
that the algorithms are concise _and_ efficient.  This design also
allows EQ? to be used when comparing nodes.
v7/src/xml/xpath.scm diff | blob | history
MIT/GNU Scheme, Pucked