import 1.1.3

68 files changed, 12959 insertions, 0 deletions

diff --git a/xdelta1/doc/CVS/Entries b/xdelta1/doc/CVS/Entries
new file mode 100755
index 0000000..d029e40
--- /dev/null
+++ b/xdelta1/doc/CVS/Entries
@@ -0,0 +1,4 @@
+/Makefile.am/1.2/Sun Jun 24 07:21:50 2001/-ko/
+/xdelta.cat/1.2/Fri Jun 29 11:35:34 2001/-ko/
+/xdelta.1/1.5/Mon Sep 24 06:59:18 2001/-ko/
+D
diff --git a/xdelta1/doc/CVS/Repository b/xdelta1/doc/CVS/Repository
new file mode 100755
index 0000000..0e1072e
--- /dev/null
+++ b/xdelta1/doc/CVS/Repository
@@ -0,0 +1 @@
+xdelta11/xdelta11/doc
diff --git a/xdelta1/doc/CVS/Root b/xdelta1/doc/CVS/Root
new file mode 100755
index 0000000..645ccf1
--- /dev/null
+++ b/xdelta1/doc/CVS/Root
@@ -0,0 +1 @@
+:ext:jmacd@cvs.xdelta.sourceforge.net:/cvsroot/xdelta
diff --git a/xdelta1/doc/Makefile b/xdelta1/doc/Makefile
new file mode 100644
index 0000000..6c46cd7
--- /dev/null
+++ b/xdelta1/doc/Makefile
@@ -0,0 +1,236 @@
+# Generated automatically from Makefile.in by configure.
+# Makefile.in generated automatically by automake 1.4 from Makefile.am
+
+# Copyright (C) 1994, 1995-8, 1999 Free Software Foundation, Inc.
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+
+SHELL = /bin/sh
+
+srcdir = .
+top_srcdir = ..
+prefix = /usr/local
+exec_prefix = ${prefix}
+
+bindir = ${exec_prefix}/bin
+sbindir = ${exec_prefix}/sbin
+libexecdir = ${exec_prefix}/libexec
+datadir = ${prefix}/share
+sysconfdir = ${prefix}/etc
+sharedstatedir = ${prefix}/com
+localstatedir = ${prefix}/var
+libdir = ${exec_prefix}/lib
+infodir = ${prefix}/info
+mandir = ${prefix}/man
+includedir = ${prefix}/include
+oldincludedir = /usr/include
+
+DESTDIR =
+
+pkgdatadir = $(datadir)/xdelta
+pkglibdir = $(libdir)/xdelta
+pkgincludedir = $(includedir)/xdelta
+
+top_builddir = ..
+
+ACLOCAL = aclocal
+AUTOCONF = autoconf
+AUTOMAKE = automake
+AUTOHEADER = autoheader
+
+INSTALL = /usr/bin/install -c
+INSTALL_PROGRAM = ${INSTALL} $(AM_INSTALL_PROGRAM_FLAGS)
+INSTALL_DATA = ${INSTALL} -m 644
+INSTALL_SCRIPT = ${INSTALL_PROGRAM}
+transform = s,x,x,
+
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+host_alias = i686-pc-linux-gnu
+host_triplet = i686-pc-linux-gnu
+AS = @AS@
+CC = gcc
+CPP = gcc -E
+DLLTOOL = @DLLTOOL@
+EMACS = /usr/bin/xemacs
+GLIB_CFLAGS = -I/usr/local/include/glib-1.2 -I/usr/local/lib/glib/include
+GLIB_CONFIG = /usr/local/bin/glib-config
+GLIB_LIBS = -L/usr/local/lib -lglib
+LD = /usr/i586-pc-linux-gnu/bin/ld
+LIBTOOL = $(SHELL) $(top_builddir)/libtool
+LN_S = ln
+MAINT = #
+MAKEINFO = makeinfo
+NM = /usr/bin/nm -B
+OBJDUMP = @OBJDUMP@
+PACKAGE = xdelta
+RANLIB = ranlib
+VERSION = 1.1.3
+top_srcdir_absolute = /mnt/polaroid/Polaroid/orbit_linux/home/jmacd/projects/xdelta11
+
+man_MANS = xdelta.1
+
+EXTRA_DIST = xdelta.1 xdelta.cat
+mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
+CONFIG_HEADER = ../config.h
+CONFIG_CLEAN_FILES = 
+man1dir = $(mandir)/man1
+MANS = $(man_MANS)
+
+NROFF = nroff
+DIST_COMMON =  Makefile.am Makefile.in
+
+
+DISTFILES = $(DIST_COMMON) $(SOURCES) $(HEADERS) $(TEXINFOS) $(EXTRA_DIST)
+
+TAR = tar
+GZIP_ENV = --best
+all: all-redirect
+.SUFFIXES:
+$(srcdir)/Makefile.in: # Makefile.am $(top_srcdir)/configure.in $(ACLOCAL_M4) 
+        cd $(top_srcdir) && $(AUTOMAKE) --gnu doc/Makefile
+
+Makefile: $(srcdir)/Makefile.in  $(top_builddir)/config.status $(BUILT_SOURCES)
+        cd $(top_builddir) \
+          && CONFIG_FILES=$(subdir)/$@ CONFIG_HEADERS= $(SHELL) ./config.status
+
+
+install-man1:
+        $(mkinstalldirs) $(DESTDIR)$(man1dir)
+        @list='$(man1_MANS)'; \
+        l2='$(man_MANS)'; for i in $$l2; do \
+          case "$$i" in \
+            *.1*) list="$$list $$i" ;; \
+          esac; \
+        done; \
+        for i in $$list; do \
+          if test -f $(srcdir)/$$i; then file=$(srcdir)/$$i; \
+          else file=$$i; fi; \
+          ext=`echo $$i | sed -e 's/^.*\\.//'`; \
+          inst=`echo $$i | sed -e 's/\\.[0-9a-z]*$$//'`; \
+          inst=`echo $$inst | sed '$(transform)'`.$$ext; \
+          echo " $(INSTALL_DATA) $$file $(DESTDIR)$(man1dir)/$$inst"; \
+          $(INSTALL_DATA) $$file $(DESTDIR)$(man1dir)/$$inst; \
+        done
+
+uninstall-man1:
+        @list='$(man1_MANS)'; \
+        l2='$(man_MANS)'; for i in $$l2; do \
+          case "$$i" in \
+            *.1*) list="$$list $$i" ;; \
+          esac; \
+        done; \
+        for i in $$list; do \
+          ext=`echo $$i | sed -e 's/^.*\\.//'`; \
+          inst=`echo $$i | sed -e 's/\\.[0-9a-z]*$$//'`; \
+          inst=`echo $$inst | sed '$(transform)'`.$$ext; \
+          echo " rm -f $(DESTDIR)$(man1dir)/$$inst"; \
+          rm -f $(DESTDIR)$(man1dir)/$$inst; \
+        done
+install-man: $(MANS)
+        @$(NORMAL_INSTALL)
+        $(MAKE) $(AM_MAKEFLAGS) install-man1
+uninstall-man:
+        @$(NORMAL_UNINSTALL)
+        $(MAKE) $(AM_MAKEFLAGS) uninstall-man1
+tags: TAGS
+TAGS:
+
+
+distdir = $(top_builddir)/$(PACKAGE)-$(VERSION)/$(subdir)
+
+subdir = doc
+
+distdir: $(DISTFILES)
+        here=`cd $(top_builddir) && pwd`; \
+        top_distdir=`cd $(top_distdir) && pwd`; \
+        distdir=`cd $(distdir) && pwd`; \
+        cd $(top_srcdir) \
+          && $(AUTOMAKE) --include-deps --build-dir=$$here --srcdir-name=$(top_srcdir) --output-dir=$$top_distdir --gnu doc/Makefile
+        @for file in $(DISTFILES); do \
+          d=$(srcdir); \
+          if test -d $$d/$$file; then \
+            cp -pr $$d/$$file $(distdir)/$$file; \
+          else \
+            test -f $(distdir)/$$file \
+            || ln $$d/$$file $(distdir)/$$file 2> /dev/null \
+            || cp -p $$d/$$file $(distdir)/$$file || :; \
+          fi; \
+        done
+info-am:
+info: info-am
+dvi-am:
+dvi: dvi-am
+check-am: all-am
+check: check-am
+installcheck-am:
+installcheck: installcheck-am
+install-exec-am:
+install-exec: install-exec-am
+
+install-data-am: install-man
+install-data: install-data-am
+
+install-am: all-am
+        @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+install: install-am
+uninstall-am: uninstall-man
+uninstall: uninstall-am
+all-am: Makefile $(MANS)
+all-redirect: all-am
+install-strip:
+        $(MAKE) $(AM_MAKEFLAGS) AM_INSTALL_PROGRAM_FLAGS=-s install
+installdirs:
+        $(mkinstalldirs)  $(DESTDIR)$(mandir)/man1
+
+
+mostlyclean-generic:
+
+clean-generic:
+
+distclean-generic:
+        -rm -f Makefile $(CONFIG_CLEAN_FILES)
+        -rm -f config.cache config.log stamp-h stamp-h[0-9]*
+
+maintainer-clean-generic:
+mostlyclean-am:  mostlyclean-generic
+
+mostlyclean: mostlyclean-am
+
+clean-am:  clean-generic mostlyclean-am
+
+clean: clean-am
+
+distclean-am:  distclean-generic clean-am
+        -rm -f libtool
+
+distclean: distclean-am
+
+maintainer-clean-am:  maintainer-clean-generic distclean-am
+        @echo "This command is intended for maintainers to use;"
+        @echo "it deletes files that may require special tools to rebuild."
+
+maintainer-clean: maintainer-clean-am
+
+.PHONY: install-man1 uninstall-man1 install-man uninstall-man tags \
+distdir info-am info dvi-am dvi check check-am installcheck-am \
+installcheck install-exec-am install-exec install-data-am install-data \
+install-am install uninstall-am uninstall all-redirect all-am all \
+installdirs mostlyclean-generic distclean-generic clean-generic \
+maintainer-clean-generic clean mostlyclean distclean maintainer-clean
+
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
diff --git a/xdelta1/doc/Makefile.am b/xdelta1/doc/Makefile.am
new file mode 100755
index 0000000..062008a
--- /dev/null
+++ b/xdelta1/doc/Makefile.am
@@ -0,0 +1,3 @@
+man_MANS = xdelta.1
+
+EXTRA_DIST = xdelta.1 xdelta.cat
diff --git a/xdelta1/doc/Makefile.in b/xdelta1/doc/Makefile.in
new file mode 100755
index 0000000..8bd322c
--- /dev/null
+++ b/xdelta1/doc/Makefile.in
@@ -0,0 +1,236 @@
+# Makefile.in generated automatically by automake 1.4-p6 from Makefile.am
+
+# Copyright (C) 1994, 1995-8, 1999, 2001 Free Software Foundation, Inc.
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+
+SHELL = @SHELL@
+
+srcdir = @srcdir@
+top_srcdir = @top_srcdir@
+VPATH = @srcdir@
+prefix = @prefix@
+exec_prefix = @exec_prefix@
+
+bindir = @bindir@
+sbindir = @sbindir@
+libexecdir = @libexecdir@
+datadir = @datadir@
+sysconfdir = @sysconfdir@
+sharedstatedir = @sharedstatedir@
+localstatedir = @localstatedir@
+libdir = @libdir@
+infodir = @infodir@
+mandir = @mandir@
+includedir = @includedir@
+oldincludedir = /usr/include
+
+DESTDIR =
+
+pkgdatadir = $(datadir)/@PACKAGE@
+pkglibdir = $(libdir)/@PACKAGE@
+pkgincludedir = $(includedir)/@PACKAGE@
+
+top_builddir = ..
+
+ACLOCAL = @ACLOCAL@
+AUTOCONF = @AUTOCONF@
+AUTOMAKE = @AUTOMAKE@
+AUTOHEADER = @AUTOHEADER@
+
+INSTALL = @INSTALL@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@ $(AM_INSTALL_PROGRAM_FLAGS)
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+transform = @program_transform_name@
+
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+host_alias = @host_alias@
+host_triplet = @host@
+AS = @AS@
+CC = @CC@
+CPP = @CPP@
+DLLTOOL = @DLLTOOL@
+EMACS = @EMACS@
+GLIB_CFLAGS = @GLIB_CFLAGS@
+GLIB_CONFIG = @GLIB_CONFIG@
+GLIB_LIBS = @GLIB_LIBS@
+LD = @LD@
+LIBTOOL = @LIBTOOL@
+LN_S = @LN_S@
+MAINT = @MAINT@
+MAKEINFO = @MAKEINFO@
+NM = @NM@
+OBJDUMP = @OBJDUMP@
+PACKAGE = @PACKAGE@
+RANLIB = @RANLIB@
+VERSION = @VERSION@
+top_srcdir_absolute = @top_srcdir_absolute@
+
+man_MANS = xdelta.1
+
+EXTRA_DIST = xdelta.1 xdelta.cat
+mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
+CONFIG_HEADER = ../config.h
+CONFIG_CLEAN_FILES = 
+man1dir = $(mandir)/man1
+MANS = $(man_MANS)
+
+NROFF = nroff
+DIST_COMMON =  Makefile.am Makefile.in
+
+
+DISTFILES = $(DIST_COMMON) $(SOURCES) $(HEADERS) $(TEXINFOS) $(EXTRA_DIST)
+
+TAR = tar
+GZIP_ENV = --best
+all: all-redirect
+.SUFFIXES:
+$(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ Makefile.am $(top_srcdir)/configure.in $(ACLOCAL_M4) 
+        cd $(top_srcdir) && $(AUTOMAKE) --gnu doc/Makefile
+
+Makefile: $(srcdir)/Makefile.in  $(top_builddir)/config.status $(BUILT_SOURCES)
+        cd $(top_builddir) \
+          && CONFIG_FILES=$(subdir)/$@ CONFIG_HEADERS= $(SHELL) ./config.status
+
+
+install-man1:
+        $(mkinstalldirs) $(DESTDIR)$(man1dir)
+        @list='$(man1_MANS)'; \
+        l2='$(man_MANS)'; for i in $$l2; do \
+          case "$$i" in \
+            *.1*) list="$$list $$i" ;; \
+          esac; \
+        done; \
+        for i in $$list; do \
+          if test -f $(srcdir)/$$i; then file=$(srcdir)/$$i; \
+          else file=$$i; fi; \
+          ext=`echo $$i | sed -e 's/^.*\\.//'`; \
+          inst=`echo $$i | sed -e 's/\\.[0-9a-z]*$$//'`; \
+          inst=`echo $$inst | sed '$(transform)'`.$$ext; \
+          echo " $(INSTALL_DATA) $$file $(DESTDIR)$(man1dir)/$$inst"; \
+          $(INSTALL_DATA) $$file $(DESTDIR)$(man1dir)/$$inst; \
+        done
+
+uninstall-man1:
+        @list='$(man1_MANS)'; \
+        l2='$(man_MANS)'; for i in $$l2; do \
+          case "$$i" in \
+            *.1*) list="$$list $$i" ;; \
+          esac; \
+        done; \
+        for i in $$list; do \
+          ext=`echo $$i | sed -e 's/^.*\\.//'`; \
+          inst=`echo $$i | sed -e 's/\\.[0-9a-z]*$$//'`; \
+          inst=`echo $$inst | sed '$(transform)'`.$$ext; \
+          echo " rm -f $(DESTDIR)$(man1dir)/$$inst"; \
+          rm -f $(DESTDIR)$(man1dir)/$$inst; \
+        done
+install-man: $(MANS)
+        @$(NORMAL_INSTALL)
+        $(MAKE) $(AM_MAKEFLAGS) install-man1
+uninstall-man:
+        @$(NORMAL_UNINSTALL)
+        $(MAKE) $(AM_MAKEFLAGS) uninstall-man1
+tags: TAGS
+TAGS:
+
+
+distdir = $(top_builddir)/$(PACKAGE)-$(VERSION)/$(subdir)
+
+subdir = doc
+
+distdir: $(DISTFILES)
+        here=`cd $(top_builddir) && pwd`; \
+        top_distdir=`cd $(top_distdir) && pwd`; \
+        distdir=`cd $(distdir) && pwd`; \
+        cd $(top_srcdir) \
+          && $(AUTOMAKE) --include-deps --build-dir=$$here --srcdir-name=$(top_srcdir) --output-dir=$$top_distdir --gnu doc/Makefile
+        @for file in $(DISTFILES); do \
+          d=$(srcdir); \
+          if test -d $$d/$$file; then \
+            cp -pr $$d/$$file $(distdir)/$$file; \
+          else \
+            test -f $(distdir)/$$file \
+            || ln $$d/$$file $(distdir)/$$file 2> /dev/null \
+            || cp -p $$d/$$file $(distdir)/$$file || :; \
+          fi; \
+        done
+info-am:
+info: info-am
+dvi-am:
+dvi: dvi-am
+check-am: all-am
+check: check-am
+installcheck-am:
+installcheck: installcheck-am
+install-exec-am:
+install-exec: install-exec-am
+
+install-data-am: install-man
+install-data: install-data-am
+
+install-am: all-am
+        @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+install: install-am
+uninstall-am: uninstall-man
+uninstall: uninstall-am
+all-am: Makefile $(MANS)
+all-redirect: all-am
+install-strip:
+        $(MAKE) $(AM_MAKEFLAGS) AM_INSTALL_PROGRAM_FLAGS=-s install
+installdirs:
+        $(mkinstalldirs)  $(DESTDIR)$(mandir)/man1
+
+
+mostlyclean-generic:
+
+clean-generic:
+
+distclean-generic:
+        -rm -f Makefile $(CONFIG_CLEAN_FILES)
+        -rm -f config.cache config.log stamp-h stamp-h[0-9]*
+
+maintainer-clean-generic:
+mostlyclean-am:  mostlyclean-generic
+
+mostlyclean: mostlyclean-am
+
+clean-am:  clean-generic mostlyclean-am
+
+clean: clean-am
+
+distclean-am:  distclean-generic clean-am
+        -rm -f libtool
+
+distclean: distclean-am
+
+maintainer-clean-am:  maintainer-clean-generic distclean-am
+        @echo "This command is intended for maintainers to use;"
+        @echo "it deletes files that may require special tools to rebuild."
+
+maintainer-clean: maintainer-clean-am
+
+.PHONY: install-man1 uninstall-man1 install-man uninstall-man tags \
+distdir info-am info dvi-am dvi check check-am installcheck-am \
+installcheck install-exec-am install-exec install-data-am install-data \
+install-am install uninstall-am uninstall all-redirect all-am all \
+installdirs mostlyclean-generic distclean-generic clean-generic \
+maintainer-clean-generic clean mostlyclean distclean maintainer-clean
+
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
diff --git a/xdelta1/doc/old/dcc99/CVS/Entries b/xdelta1/doc/old/dcc99/CVS/Entries
new file mode 100755
index 0000000..658871c
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/CVS/Entries
@@ -0,0 +1,14 @@
+D/data////
+D/exact-delta////
+D/figs////
+/Makefile/1.1.1.1/Tue Jun 12 03:16:38 2001/-ko/
+/dcc99.bib/1.1.1.1/Tue Jun 12 03:16:39 2001/-ko/
+/dcc99.sty/1.1.1.1/Tue Jun 12 03:16:39 2001/-ko/
+/dcc99.tex/1.1.1.1/Tue Jun 12 03:16:39 2001/-ko/
+/dead.code/1.1.1.1/Tue Jun 12 03:16:39 2001/-ko/
+/lcs.c/1.1.1.1/Tue Jun 12 03:16:39 2001/-ko/
+/llncs.cls/1.1.1.1/Tue Jun 12 03:16:39 2001/-ko/
+/mkex.c/1.1.1.1/Tue Jun 12 03:16:39 2001/-ko/
+/mkex2.c/1.1.1.1/Tue Jun 12 03:16:39 2001/-ko/
+/vdelta/1.1.1.1/Tue Jun 12 03:16:39 2001/-ko/
+/vupdate/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
diff --git a/xdelta1/doc/old/dcc99/CVS/Repository b/xdelta1/doc/old/dcc99/CVS/Repository
new file mode 100755
index 0000000..add325d
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/CVS/Repository
@@ -0,0 +1 @@
+xdelta11/xdelta11/doc/dcc99
diff --git a/xdelta1/doc/old/dcc99/CVS/Root b/xdelta1/doc/old/dcc99/CVS/Root
new file mode 100755
index 0000000..645ccf1
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/CVS/Root
@@ -0,0 +1 @@
+:ext:jmacd@cvs.xdelta.sourceforge.net:/cvsroot/xdelta
diff --git a/xdelta1/doc/old/dcc99/Makefile b/xdelta1/doc/old/dcc99/Makefile
new file mode 100755
index 0000000..5fdb623
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/Makefile
@@ -0,0 +1,19 @@
+all: dcc99.dvi
+
+# mkex mkex2 lcs
+
+# mkex: mkex.c
+#       gcc -o mkex -Wall `glib-config --cflags` `glib-config --libs` -g mkex.c -lglib
+
+# mkex2: mkex2.c
+#       gcc -o mkex2 -Wall `glib-config --cflags` `glib-config --libs` -g mkex2.c -lglib
+
+# lcs: lcs.c
+#       gcc -o lcs -Wall -O lcs.c -lglib
+
+LATEX=latex
+
+dcc99.dvi: dcc99.tex dcc99.bib
+        $(LATEX) dcc99.tex
+        bibtex dcc99
+        $(LATEX) dcc99.tex
diff --git a/xdelta1/doc/old/dcc99/data/CVS/Entries b/xdelta1/doc/old/dcc99/data/CVS/Entries
new file mode 100755
index 0000000..23d6bb1
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/CVS/Entries
@@ -0,0 +1,11 @@
+/analyze.l/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/fig1.data/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/fig1.m/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/fig2.data/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/fig2.m/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/mytime.c/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/runtest/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/runtest-one/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/runtest-versions/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/tclean.l/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+D
diff --git a/xdelta1/doc/old/dcc99/data/CVS/Repository b/xdelta1/doc/old/dcc99/data/CVS/Repository
new file mode 100755
index 0000000..33526a2
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/CVS/Repository
@@ -0,0 +1 @@
+xdelta11/xdelta11/doc/dcc99/data
diff --git a/xdelta1/doc/old/dcc99/data/CVS/Root b/xdelta1/doc/old/dcc99/data/CVS/Root
new file mode 100755
index 0000000..645ccf1
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/CVS/Root
@@ -0,0 +1 @@
+:ext:jmacd@cvs.xdelta.sourceforge.net:/cvsroot/xdelta
diff --git a/xdelta1/doc/old/dcc99/data/analyze.l b/xdelta1/doc/old/dcc99/data/analyze.l
new file mode 100755
index 0000000..ba41df0
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/analyze.l
@@ -0,0 +1,438 @@
+/* -*- C -*- */
+
+%{
+#include <glib.h>
+#include <string.h>
+#include <math.h>
+
+
+#define BIG 1
+
+void fromfile();
+void tofile();
+void tool();
+void normal();
+void reverse();
+void onetime();
+
+char* _from;
+int _fromsize;
+char* _to;
+int _tosize;
+char* _tool;
+
+GArray* runs;
+GArray* pairs;
+
+#define FORWARD 0
+#define REVERSE 1
+
+typedef struct {
+  char* from;
+  int   from_size;
+
+  char* to;
+  int   to_size;
+
+  char* tool;
+
+  double  forward_delta_size;
+  double  reverse_delta_size;
+
+  double   forward_delta_time;
+  double   reverse_delta_time;
+
+  gboolean missing_time;
+} Run;
+
+#define PAIRS 6
+
+#define BUCKET_SIZE 10000
+
+typedef struct {
+  Run* runs[PAIRS];
+  int  run_count;
+} Pair;
+
+int time_index;
+int time_stage;
+GSList** buckets[PAIRS];
+
+%}
+
+dig       [0-9]
+num       {dig}+("."{dig}+)?
+space     [\v\f\r\t\n ]
+ws        {space}+
+filename  [^\v\f\r\t\n ]+
+
+%%
+
+{ws} { }
+"FromFile:".* { fromfile(); }
+"ToFile:".* { tofile(); }
+"Tool:".* { tool(); }
+"Normal:".* { normal(); }
+"Reverse:".* { reverse(); }
+"Time:".* { onetime(); }
+
+%%
+
+char*
+first_nonspace (char* p)
+{
+  while (*p == ' ')
+    p += 1;
+
+  return p;
+}
+
+void
+fromfile()
+{
+  char** toks = g_strsplit (first_nonspace(yytext + strlen("FromFile:")), " ", -1);
+
+  _from = g_strdup(toks[0]);
+  _fromsize = atoi (toks[2]);
+
+  g_free (toks);
+}
+
+void
+tofile()
+{
+  char** toks = g_strsplit (first_nonspace(yytext + strlen("ToFile:")), " ", -1);
+
+  _to = g_strdup(toks[0]);
+  _tosize = atoi(toks[2]);
+
+  g_free (toks);
+}
+
+void
+tool()
+{
+  char** toks = g_strsplit (first_nonspace(yytext + strlen("Tool:")), " ", -1);
+
+  _tool = g_strdup (toks[0]);
+
+  g_free (toks);
+}
+
+void
+normal()
+{
+  char** toks = g_strsplit (first_nonspace(yytext + strlen("Normal:")), " ", -1);
+  Run r;
+
+  g_assert (toks[0]);
+
+  r.forward_delta_size = atoi (toks[0]);
+
+  r.from = _from;
+  r.from_size = _fromsize;
+
+  r.to = _to;
+  r.to_size = _tosize;
+
+  r.tool = _tool;
+
+  g_array_append_val(runs, r);
+
+  g_free (toks);
+}
+
+void
+reverse()
+{
+  char** toks = g_strsplit (first_nonspace(yytext + strlen("Reverse:")), " ", -1);
+  int size = atoi (toks[0]);
+
+  g_array_index (runs, Run, runs->len-1).reverse_delta_size = size;
+
+  g_free (toks);
+}
+
+void
+onetime()
+{
+  char** toks = g_strsplit (first_nonspace(yytext + strlen("Time:")), " ", -1);
+  char** names = g_strsplit (toks[0], "-", -1);
+  char* tool = names[0];
+  char* dir = names[1];
+
+  Run* r = &g_array_index (runs, Run, time_index);
+
+  double t;
+
+  int time_stage_max;
+
+  sscanf (toks[1], "%lf", &t);
+
+  g_assert (strncmp (tool, r->tool, 2) == 0);
+
+  if (strncmp (tool, "dz", 2) == 0)
+    time_stage_max = 4;
+  else
+    time_stage_max = 2;
+
+  if (strcmp (dir, "forward") == 0)
+    r->forward_delta_time += t;
+  else if (strcmp (dir, "reverse") == 0)
+    r->reverse_delta_time += t;
+  else
+    r->missing_time = TRUE;
+
+  if (time_stage < (time_stage_max-1))
+    {
+      time_stage += 1;
+    }
+  else
+    {
+      time_stage = 0;
+      time_index += 1;
+    }
+}
+
+void
+add (int j, int size, double* dsize)
+{
+  g_assert (*dsize > 0.0);
+  buckets[j][size / BUCKET_SIZE] = g_slist_prepend (buckets[j][size / BUCKET_SIZE], dsize);
+}
+
+void
+compute_stats (GSList* dlist, double* mean, double* min, double* max)
+{
+  GSList* dlist0 = dlist;
+  gint c = 0;
+
+  double m, s = 0, s2 = 0;
+
+  /*(*max) = 0.0;
+  (*min) = 1000000000.0;*/
+
+  for (; dlist; dlist = dlist->next)
+    {
+      double d = * (double*) dlist->data;
+
+      g_assert (d > 0.0);
+
+      s += d;
+      c += 1;
+
+      /*(*min) = MIN (*min, d);
+      (*max) = MAX (*max, d);*/
+    }
+
+  m = (*mean) = s / (double) c;
+
+  g_assert (m > 0.0);
+
+  if (c == 1)
+    {
+      /*(*stddev) = 0.0;*/
+      (*min) = m;
+      (*max) = m;
+    }
+  else
+    {
+      for (dlist = dlist0; dlist; dlist = dlist->next)
+        {
+          double d = * (double*) dlist->data;
+          double ds = d-m;
+
+          s2 += ds*ds;
+        }
+
+      s2 /= (double) (c-1);
+
+      /*(*stddev) = sqrt (s2);*/
+
+      (*min) = MIN(sqrt (s2), m);
+      (*max) = sqrt (s2);
+    }
+}
+
+double*
+copyd (double d)
+{
+  double* dp = g_new (double, 1);
+
+  *dp = d;
+
+  return dp;
+}
+
+#if 0
+void
+test()
+{
+  double avg, std;
+  GSList* l = NULL;
+
+  l = g_slist_prepend (l, copyd (3));
+  l = g_slist_prepend (l, copyd (4));
+  l = g_slist_prepend (l, copyd (5));
+  l = g_slist_prepend (l, copyd (6));
+  l = g_slist_prepend (l, copyd (7));
+  l = g_slist_prepend (l, copyd (8));
+
+  compute_stats (l, &avg, &std);
+
+  fprintf (stderr, "test %f %f\n", avg, std);
+}
+#endif
+
+int main()
+{
+  FILE* one = fopen ("runtest.out", "r");
+  FILE* two = fopen ("runtest.errs", "r");
+  GHashTable* pair_table = g_hash_table_new (g_str_hash, g_str_equal);
+  GPtrArray* pair_array = g_ptr_array_new ();
+  int i;
+  int skipped = 0;
+  int max_size = 0;
+
+  g_assert (one && two);
+
+  runs = g_array_new (FALSE, TRUE, sizeof(Run));
+  pairs = g_array_new (FALSE, TRUE, sizeof(Pair));
+
+  yyin = one;
+  while (yylex ()) ;
+  yyin = two;
+  while (yylex ()) ;
+
+  /*printf ("%d runs found\n", runs->len);
+  printf ("%d runs timed\n", time_index);*/
+
+  for (i = 0; i < runs->len; i += 1)
+    {
+      Run* r = &g_array_index (runs, Run, i);
+      Pair* p;
+
+      if (strcmp (r->tool, "cim") != 0)
+        {
+          continue;
+        }
+
+      if (r->missing_time)
+        {
+          skipped += 1;
+#ifndef BIG
+          continue;
+#endif
+        }
+
+      p = g_new0 (Pair, 1);
+
+      g_ptr_array_add (pair_array, p);
+      g_hash_table_insert (pair_table, r->from, p);
+
+      p->run_count = 1;
+      p->runs[0] = r;
+
+      max_size = MAX(max_size, r->to_size);
+      max_size = MAX(max_size, r->from_size);
+    }
+
+  /*printf ("%d runs skipped\n", skipped);*/
+
+  for (i = 0; i < runs->len; i += 1)
+    {
+      Run* r = &g_array_index (runs, Run, i);
+      Pair* p;
+
+      if (strcmp (r->tool, "cim") == 0)
+        continue;
+
+      p = g_hash_table_lookup (pair_table, r->from);
+
+      if (! p)
+        continue;
+
+      p->runs[p->run_count++] = r;
+    }
+
+#ifndef BIG
+  g_assert (pair_array->len == (runs->len / PAIRS) - skipped);
+#endif
+
+  for (i = 0; i < PAIRS; i += 1)
+    buckets[i] = g_new0 (GSList*, max_size / BUCKET_SIZE);
+
+  for (i = 0; i < pair_array->len; i += 1)
+    {
+      Pair* p = pair_array->pdata[i];
+      int j;
+      double cim_reverse_size = p->runs[0]->reverse_delta_size;
+      double cim_forward_size = p->runs[0]->forward_delta_size;
+
+#ifdef BIG
+      if (p->runs[0]->missing_time)
+        {
+          printf ("%d, %f, %f\n", p->runs[0]->to_size, p->runs[1]->forward_delta_size, p->runs[2]->forward_delta_size);
+          printf ("%d, %f, %f\n", p->runs[0]->from_size, p->runs[1]->reverse_delta_size, p->runs[2]->reverse_delta_size);
+        }
+#else
+
+      if (cim_reverse_size == 0.0)
+        continue;
+      if (cim_forward_size == 0.0)
+        continue;
+
+      for (j = 0; j < PAIRS; j += 1)
+        {
+          if (p->runs[j]->tool[0] == 'x')
+            {
+              /* take out the xdelta header */
+              int len = strlen (p->runs[j]->from) + strlen (p->runs[j]->to);
+
+              p->runs[j]->forward_delta_size -= 28 + len;
+              p->runs[j]->reverse_delta_size -= 28 + len;
+
+              g_assert (p->runs[j]->reverse_delta_size > 0.0);
+              g_assert (p->runs[j]->forward_delta_size > 0.0);
+            }
+
+          p->runs[j]->forward_delta_size /= cim_forward_size;
+          p->runs[j]->reverse_delta_size /= cim_reverse_size;
+
+          add (j, p->runs[0]->to_size,   &p->runs[j]->forward_delta_size);
+          add (j, p->runs[0]->from_size, &p->runs[j]->reverse_delta_size);
+        }
+    }
+
+  for (i = 0; i < max_size / BUCKET_SIZE; i += 1)
+    {
+      int j, found = 0;
+
+      for (j = 0; j < PAIRS; j += 1)
+        {
+          if (buckets[j][i])
+            {
+              printf ("%d, ", (i * BUCKET_SIZE) + BUCKET_SIZE/2);
+              found = 1;
+              break;
+            }
+        }
+
+      if (found)
+        {
+          for (j = 0; j < PAIRS; j += 1)
+            {
+              double avg, min, max;
+
+              compute_stats (buckets[j][i], &avg, &min, &max);
+
+              printf ("%f, %f, %f, ", avg, min, max);
+            }
+
+          printf ("\n");
+        }
+#endif
+    }
+
+  return 0;
+}
diff --git a/xdelta1/doc/old/dcc99/data/fig1.data b/xdelta1/doc/old/dcc99/data/fig1.data
new file mode 100755
index 0000000..e585750
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/fig1.data
@@ -0,0 +1,29 @@
+5000, 1.000000, 0.000000, 0.000000, 2.247578, 1.494850, 1.494850, 4.513087, 3.841368, 3.841368, 5.150437, 3.945593, 3.945593, 4.883296, 4.762887, 4.762887, 5.354498, 4.662331, 4.662331, 
+15000, 1.000000, 0.000000, 0.000000, 1.935773, 1.107924, 1.107924, 3.776800, 2.806186, 2.806186, 4.442599, 2.775799, 2.775799, 4.862028, 3.163344, 3.163344, 4.542423, 3.507239, 3.507239, 
+25000, 1.000000, 0.000000, 0.000000, 1.992891, 1.203505, 1.203505, 3.918552, 2.910202, 2.910202, 4.594742, 2.878777, 2.878777, 4.944386, 3.107605, 3.107605, 4.409800, 3.406593, 3.406593, 
+35000, 1.000000, 0.000000, 0.000000, 1.869683, 1.116450, 1.116450, 3.693352, 2.777232, 2.777232, 4.391966, 2.674814, 2.674814, 4.966845, 2.964413, 2.964413, 4.127713, 3.142258, 3.142258, 
+45000, 1.000000, 0.000000, 0.000000, 1.847218, 1.142778, 1.142778, 3.383056, 2.298025, 2.298025, 4.093188, 2.135231, 2.135231, 5.198964, 3.207633, 3.207633, 4.289643, 3.599258, 3.599258, 
+55000, 1.000000, 0.000000, 0.000000, 1.770871, 1.131038, 1.131038, 3.358432, 2.460521, 2.460521, 4.147034, 2.266551, 2.266551, 5.256925, 2.971032, 2.971032, 3.816856, 2.768544, 2.768544, 
+65000, 1.000000, 0.000000, 0.000000, 1.556571, 0.913805, 0.913805, 2.911364, 1.943752, 1.943752, 3.845784, 1.739544, 1.739544, 5.641156, 2.550957, 2.550957, 3.582800, 2.612439, 2.612439, 
+75000, 1.000000, 0.000000, 0.000000, 1.615948, 0.999812, 0.999812, 2.879092, 1.850208, 1.850208, 3.809982, 1.636014, 1.636014, 4.794411, 2.124749, 2.124749, 3.164612, 1.948221, 1.948221, 
+85000, 1.000000, 0.000000, 0.000000, 1.825609, 1.013160, 1.013160, 3.430278, 2.071402, 2.071402, 4.121070, 1.931381, 1.931381, 4.852611, 2.869002, 2.869002, 3.908317, 2.625903, 2.625903, 
+95000, 1.000000, 0.000000, 0.000000, 1.670724, 1.143832, 1.143832, 2.940294, 2.024779, 2.024779, 3.876037, 1.753694, 1.753694, 5.853093, 3.516541, 3.516541, 4.043364, 4.043364, 4.284600, 
+105000, 1.000000, 0.000000, 0.000000, 2.158986, 1.369352, 1.369352, 3.614015, 2.034547, 2.034547, 4.216942, 1.858502, 1.858502, 4.965549, 3.036721, 3.036721, 4.185543, 2.586688, 2.586688, 
+115000, 1.000000, 0.000000, 0.000000, 1.360088, 0.616350, 0.616350, 2.551459, 1.964894, 1.964894, 3.234822, 1.605634, 1.605634, 4.322613, 1.545842, 1.545842, 3.228285, 1.964847, 1.964847, 
+125000, 1.000000, 0.000000, 0.000000, 1.529777, 0.848630, 0.848630, 2.945658, 2.014869, 2.014869, 3.900222, 1.974606, 1.974606, 5.478995, 1.905685, 1.905685, 3.434508, 2.093207, 2.093207, 
+135000, 1.000000, 0.000000, 0.000000, 1.059016, 0.247858, 0.247858, 1.500279, 0.759026, 0.759026, 3.022245, 0.432389, 0.432389, 5.186137, 0.139577, 0.139577, 1.741970, 0.525337, 0.525337, 
+145000, 1.000000, 0.000000, 0.000000, 1.949116, 1.676826, 1.676826, 2.800988, 2.189285, 2.189285, 3.939680, 1.756528, 1.756528, 4.947291, 1.224407, 1.224407, 3.418648, 2.731867, 2.731867, 
+155000, 1.000000, 0.000000, 0.000000, 3.292208, 2.802525, 2.802525, 3.851028, 2.003085, 2.003085, 4.287683, 1.861235, 1.861235, 3.926793, 2.032467, 2.032467, 4.297426, 2.102505, 2.102505, 
+165000, 1.000000, 1.000000, 1.000000, 2.113117, 2.113117, 2.113117, 1.966306, 1.966306, 1.966306, 3.229242, 3.229242, 3.229242, 6.534296, 6.534296, 6.534296, 2.446450, 2.446450, 2.446450, 
+175000, 1.000000, 0.000000, 0.000000, 1.751311, 1.444948, 1.444948, 2.852141, 2.756114, 2.756114, 3.847896, 2.101695, 2.101695, 3.943581, 1.230728, 1.230728, 2.211612, 1.706203, 1.706203, 
+185000, 1.000000, 1.000000, 1.000000, 1.632011, 1.632011, 1.632011, 1.461468, 1.461468, 1.461468, 2.628363, 2.628363, 2.628363, 4.902417, 4.902417, 4.902417, 1.831281, 1.831281, 1.831281, 
+195000, 1.000000, 0.000000, 0.000000, 1.202820, 0.214820, 0.214820, 1.753262, 0.815314, 0.815314, 3.025649, 0.847447, 0.847447, 3.710422, 0.867004, 0.867004, 1.685907, 0.581806, 0.581806, 
+205000, 1.000000, 0.000000, 0.000000, 3.371956, 3.371956, 5.627443, 3.747549, 2.970076, 2.970076, 4.492117, 2.761550, 2.761550, 5.074542, 2.563123, 2.563123, 4.404258, 3.013979, 3.013979, 
+215000, 1.000000, 0.000000, 0.000000, 1.647549, 0.554709, 0.554709, 1.755538, 0.334468, 0.334468, 2.940955, 0.166030, 0.166030, 5.886149, 0.878080, 0.878080, 2.304068, 0.125165, 0.125165, 
+235000, 1.000000, 0.000000, 0.000000, 5.656103, 5.656103, 11.862490, 2.597165, 1.876097, 1.876097, 3.387417, 1.601737, 1.601737, 4.513242, 2.991713, 2.991713, 3.069354, 1.750298, 1.750298, 
+245000, 1.000000, 0.000000, 0.000000, 2.566175, 1.888322, 1.888322, 3.882325, 2.612144, 2.612144, 4.388008, 2.461386, 2.461386, 7.744080, 7.744080, 10.722341, 6.220723, 5.914358, 5.914358, 
+255000, 1.000000, 0.000000, 0.000000, 1.506253, 0.664362, 0.664362, 1.687721, 0.540915, 0.540915, 3.125387, 0.292466, 0.292466, 5.703524, 1.929671, 1.929671, 2.030101, 0.199591, 0.199591, 
+265000, 1.000000, 0.000000, 0.000000, 3.088008, 2.850353, 2.850353, 2.303957, 1.042549, 1.042549, 3.139581, 0.615099, 0.615099, 7.694560, 3.638420, 3.638420, 4.130421, 2.551056, 2.551056, 
+325000, 1.000000, 1.000000, 1.000000, 4.122605, 4.122605, 4.122605, 2.144636, 2.144636, 2.144636, 3.645594, 3.645594, 3.645594, 6.508621, 6.508621, 6.508621, 2.496169, 2.496169, 2.496169, 
+335000, 1.000000, 0.000000, 0.000000, 1.510913, 0.732142, 0.732142, 1.547070, 0.460837, 0.460837, 3.064122, 0.336828, 0.336828, 4.668883, 0.871269, 0.871269, 1.659188, 0.539544, 0.539544, 
+355000, 1.000000, 1.000000, 1.000000, 0.251797, 0.251797, 0.251797, 0.183558, 0.183558, 0.183558, 1.007455, 1.007455, 1.007455, 1.007573, 1.007573, 1.007573, 0.183841, 0.183841, 0.183841, 
diff --git a/xdelta1/doc/old/dcc99/data/fig1.m b/xdelta1/doc/old/dcc99/data/fig1.m
new file mode 100755
index 0000000..7521631
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/fig1.m
@@ -0,0 +1,20 @@
+function graphit(name)
+
+errorbar (name(:,1) - 2000, name(:, 5), name(:, 6), name(:, 7), 'ro')
+hold
+
+errorbar (name(:,1) , name(:, 8), name(:, 9), name(:, 10), 'bs')
+hold
+
+legend ('Vdelta standard deviation', 'Vdelta mean', 'Xdelta standard deviation', 'Xdelta mean')
+set(gca, 'XTickLabel', [0,50000,100000,150000,200000,250000,300000,350000,400000])
+ylabel ('Delta Size Ratio')
+xlabel ('To File Size (bytes)')
+
+plot     (name(:,1) - 2000, name(:, 5), 'r-')
+hold
+hold
+
+plot     (name(:,1) , name(:, 8), 'b-')
+hold
+hold
diff --git a/xdelta1/doc/old/dcc99/data/fig2.data b/xdelta1/doc/old/dcc99/data/fig2.data
new file mode 100755
index 0000000..e1d38c3
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/fig2.data
@@ -0,0 +1,114 @@
+24545280, 86416.000000, 14748.000000
+24535040, 87078.000000, 12624.000000
+24545280, 86416.000000, 14748.000000
+24535040, 87078.000000, 12624.000000
+24565760, 580866.000000, 25254.000000
+24545280, 594341.000000, 18693.000000
+24565760, 580866.000000, 25254.000000
+24545280, 594341.000000, 18693.000000
+24576000, 570711.000000, 16047.000000
+24565760, 595705.000000, 11194.000000
+24576000, 570711.000000, 16047.000000
+24565760, 595705.000000, 11194.000000
+24616960, 1217651.000000, 61225.000000
+24576000, 1247992.000000, 49980.000000
+24616960, 1217651.000000, 61225.000000
+24576000, 1247992.000000, 49980.000000
+24668160, 1826667.000000, 14993.000000
+24616960, 1869542.000000, 6412.000000
+24668160, 1826667.000000, 14993.000000
+24616960, 1869542.000000, 6412.000000
+24678400, 839641.000000, 108137.000000
+24668160, 835891.000000, 98220.000000
+24678400, 839641.000000, 108137.000000
+24668160, 835891.000000, 98220.000000
+24780800, 3876954.000000, 42104.000000
+24678400, 3918457.000000, 24561.000000
+24780800, 3876954.000000, 42104.000000
+24678400, 3918457.000000, 24561.000000
+25169920, 2640520.000000, 171675.000000
+24780800, 2586986.000000, 87922.000000
+25169920, 2640520.000000, 171675.000000
+24780800, 2586986.000000, 87922.000000
+25589760, 6738090.000000, 180254.000000
+25169920, 6667429.000000, 87609.000000
+25589760, 6738090.000000, 180254.000000
+25169920, 6667429.000000, 87609.000000
+25589760, 1039716.000000, 35248.000000
+25589760, 1002712.000000, 39366.000000
+25589760, 1039716.000000, 35248.000000
+25589760, 1002712.000000, 39366.000000
+25784320, 4862543.000000, 71029.000000
+25589760, 4872708.000000, 20363.000000
+25784320, 4862543.000000, 71029.000000
+25589760, 4872708.000000, 20363.000000
+25815040, 653867.000000, 29446.000000
+25784320, 670899.000000, 23979.000000
+25815040, 653867.000000, 29446.000000
+25784320, 670899.000000, 23979.000000
+25804800, 147471.000000, 12049.000000
+25815040, 138851.000000, 14661.000000
+25804800, 147471.000000, 12049.000000
+25815040, 138851.000000, 14661.000000
+25794560, 760784.000000, 43758.000000
+25804800, 774757.000000, 44445.000000
+25794560, 760784.000000, 43758.000000
+25804800, 774757.000000, 44445.000000
+26583040, 6286263.000000, 318882.000000
+25794560, 6091237.000000, 156185.000000
+26583040, 6286263.000000, 318882.000000
+25794560, 6091237.000000, 156185.000000
+27555840, 6913260.000000, 315703.000000
+26583040, 6705831.000000, 113159.000000
+27555840, 6913260.000000, 315703.000000
+26583040, 6705831.000000, 113159.000000
+28262400, 7113085.000000, 295105.000000
+27555840, 6983847.000000, 149050.000000
+28262400, 7113085.000000, 295105.000000
+27555840, 6983847.000000, 149050.000000
+28252160, 529053.000000, 58262.000000
+28262400, 544997.000000, 64953.000000
+28252160, 529053.000000, 58262.000000
+28262400, 544997.000000, 64953.000000
+28631040, 6480127.000000, 71249.000000
+28252160, 6420172.000000, 45890.000000
+28631040, 6480127.000000, 71249.000000
+28252160, 6420172.000000, 45890.000000
+28753920, 2134350.000000, 89255.000000
+28631040, 2170438.000000, 65201.000000
+28753920, 2134350.000000, 89255.000000
+28631040, 2170438.000000, 65201.000000
+28651520, 2369727.000000, 30326.000000
+28753920, 2372283.000000, 45047.000000
+28651520, 2369727.000000, 30326.000000
+28753920, 2372283.000000, 45047.000000
+28661760, 740340.000000, 57676.000000
+28651520, 754161.000000, 52499.000000
+28661760, 740340.000000, 57676.000000
+28651520, 754161.000000, 52499.000000
+29194240, 7591422.000000, 237318.000000
+28661760, 7504794.000000, 104630.000000
+29194240, 7591422.000000, 237318.000000
+28661760, 7504794.000000, 104630.000000
+29194240, 46036.000000, 10714.000000
+29194240, 47276.000000, 9377.000000
+29194240, 46036.000000, 10714.000000
+29194240, 47276.000000, 9377.000000
+29634560, 6674584.000000, 183120.000000
+29194240, 6587975.000000, 73595.000000
+29634560, 6674584.000000, 183120.000000
+29194240, 6587975.000000, 73595.000000
+29634560, 112022.000000, 18621.000000
+29634560, 115749.000000, 16434.000000
+29634560, 112022.000000, 18621.000000
+29634560, 115749.000000, 16434.000000
+30177280, 5052730.000000, 192939.000000
+29634560, 4979842.000000, 94495.000000
+30177280, 5052730.000000, 192939.000000
+29634560, 4979842.000000, 94495.000000
+30658560, 3855336.000000, 183959.000000
+30177280, 3781299.000000, 82085.000000
+30658560, 3855336.000000, 183959.000000
+30177280, 3781299.000000, 82085.000000
+30883840, 6090180.000000, 96952.000000
+30658560, 6105737.000000, 45032.000000
diff --git a/xdelta1/doc/old/dcc99/data/fig2.m b/xdelta1/doc/old/dcc99/data/fig2.m
new file mode 100755
index 0000000..2ceb91b
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/fig2.m
@@ -0,0 +1,9 @@
+function graphit(name)
+
+plot     (name(:,1), name(:, 2), 'ro')
+hold
+plot     (name(:,1) , name(:, 3), 'bs')
+
+legend ('Vdelta', 'Xdelta')
+ylabel ('Delta Size (bytes)')
+xlabel ('To File Size (bytes)')
diff --git a/xdelta1/doc/old/dcc99/data/mytime.c b/xdelta1/doc/old/dcc99/data/mytime.c
new file mode 100755
index 0000000..b80c2bd
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/mytime.c
@@ -0,0 +1,61 @@
+#include <glib.h>
+#include <stdio.h>
+#include <unistd.h>
+#include <sys/types.h>
+#include <sys/wait.h>
+#include <sys/time.h>
+#include <sys/resource.h>
+
+int main(int argc, char** argv)
+{
+  int pid, npid, status = 0;
+  char* argv1 = argv[1];
+
+  argv += 2;
+  argc -= 2;
+
+  if ((pid = fork()))
+    {
+      struct rusage ru;
+      long t = 0;
+
+      if (pid != (npid = wait4 (pid, &status, 0, &ru)))
+        {
+          fprintf (stderr, "wait failed: %d\n", npid);
+          abort ();
+        }
+
+      if (! WIFEXITED(status))
+        {
+          fprintf (stderr, "process did not exit\n");
+          exit (1);
+        }
+
+      if (WEXITSTATUS(status) == 127)
+        {
+          fprintf (stderr, "exec failed\n");
+          exit (1);
+        }
+
+      if (WEXITSTATUS(status) > 1)
+        {
+          fprintf (stderr, "process exited %d\n", WEXITSTATUS(status));
+          exit (1);
+        }
+
+      t += 1000000*ru.ru_utime.tv_sec;
+      t += 1000000*ru.ru_stime.tv_sec;
+      t += ru.ru_utime.tv_usec;
+      t += ru.ru_stime.tv_usec;
+
+      fprintf (stderr, "Time: %s %f\n", argv1, (double)t / 1000000.0);
+
+      exit (0);
+    }
+  else
+    {
+      execvp (argv[0], argv);
+      _exit (127);
+    }
+  exit (0);
+}
diff --git a/xdelta1/doc/old/dcc99/data/runtest b/xdelta1/doc/old/dcc99/data/runtest
new file mode 100755
index 0000000..3b25060
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/runtest
@@ -0,0 +1,38 @@
+#!/bin/sh
+
+trap "rm -rf tmp.files" 0
+
+tar -xzf linux-kernels/linux-2.1.0.tar.gz
+
+mv linux linux-2.1.0
+
+(cd linux-2.1.0 && tar -cf linux.tar.gz *)
+
+LASTVER=0
+
+for VER in `cat runtest-versions`; do
+  echo Creating version 2.1.$VER
+  mkdir linux-2.1.$VER
+  (cd linux-2.1.$LASTVER && tar -cf - .) | (cd linux-2.1.$VER && tar -xf -)
+  gzip -dc linux-kernels/patch-2.1.$VER.gz | (cd linux-2.1.$VER && patch -s -f -p1)
+  find linux-2.1.$VER -name \*.orig | xargs rm -rf
+  find linux-2.1.$VER -name \*.rej | xargs rm -rf
+  (cd linux-2.1.$VER && tar -cf linux.tar.gz *)
+
+  FILES=""
+
+  for f in `(cd linux-2.1.$VER; find . -type f)`; do
+    if test -f linux-2.1.$LASTVER/$f; then
+      FILES="$FILES $f"
+    fi
+  done
+
+  echo $FILES > tmp.files
+
+  ./runtest-one linux-2.1.$LASTVER linux-2.1.$VER tmp.files \
+     2>> runtest.errs 1>>runtest.out
+
+  rm -rf linux-2.1.$LASTVER
+  rm -rf linux-2.1.$LASTVER.tar.gz
+  LASTVER=$VER
+done
diff --git a/xdelta1/doc/old/dcc99/data/runtest-one b/xdelta1/doc/old/dcc99/data/runtest-one
new file mode 100755
index 0000000..77b24bd
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/runtest-one
@@ -0,0 +1,71 @@
+#!/bin/sh
+
+ODIR=$1
+NDIR=$2
+FILES=`cat $3`
+
+for i in $FILES; do
+  FROM=$ODIR/$i
+  TO=$NDIR/$i
+
+  if cmp -s $FROM $TO; then
+    FOO=bar
+  else
+
+    echo "FromFile: " $FROM `wc -c -l $FROM`
+    echo "ToFile:   " $TO `wc -c -l $TO`
+
+    # 1
+    echo "Tool: cim"
+
+    ./mytime cim-forward ../exact-delta/delta $FROM $TO > tmp.out
+    echo "Normal: " `cat tmp.out`
+    ./mytime cim-reverse ../exact-delta/delta $TO $FROM > tmp.out
+    echo "Reverse: " `cat tmp.out`
+
+    # 2
+    echo "Tool: vdelta"
+
+    ./mytime vdelta-forward ../vdelta $FROM < $TO > tmp.out
+    echo "Normal: " `wc -c tmp.out`
+    ./mytime vdelta-reverse ../vdelta $TO < $FROM > tmp.out
+    echo "Reverse: " `wc -c tmp.out`
+
+    # 3
+    echo "Tool: xdelta"
+
+    ./mytime xdelta-forward ../../../xdelta delta -0 -n $FROM $TO tmp.out
+    echo "Normal: " `wc -c tmp.out`
+    ./mytime xdelta-reverse ../../../xdelta delta -0 -n $TO $FROM tmp.out
+    echo "Reverse: " `wc -c tmp.out`
+
+    # 4
+    echo "Tool: xz"
+
+    ./mytime xz-forward ../../../xdelta delta -n $FROM $TO tmp.out
+    echo "Normal: " `wc -c tmp.out`
+    ./mytime xz-reverse ../../../xdelta delta -n $TO $FROM tmp.out
+    echo "Reverse: " `wc -c tmp.out`
+
+    # 5
+    echo "Tool: diff"
+
+    ./mytime diff-forward gdiff --rcs -a $FROM $TO > tmp.out
+    echo "Normal: " `wc -c tmp.out`
+    ./mytime diff-reverse gdiff --rcs -a $TO $FROM > tmp.out
+    echo "Reverse: " `wc -c tmp.out`
+
+    # 6
+    echo "Tool: dz"
+
+    ./mytime dz1-forward gdiff --rcs -a $FROM $TO > tmp.out
+    rm -f tmp.out.gz
+    ./mytime dz2-forward gzip tmp.out
+    echo "Normal: " `wc -c tmp.out.gz`
+    ./mytime dz1-reverse gdiff --rcs -a $TO $FROM > tmp.out
+    rm -f tmp.out.gz
+    ./mytime dz2-reverse gzip tmp.out
+    echo "Reverse: " `wc -c tmp.out.gz`
+
+  fi
+done
diff --git a/xdelta1/doc/old/dcc99/data/runtest-versions b/xdelta1/doc/old/dcc99/data/runtest-versions
new file mode 100755
index 0000000..310c96c
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/runtest-versions
@@ -0,0 +1,127 @@
+1
+2
+3
+4
+5
+6
+7
+8
+9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
+47
+48
+49
+50
+51
+52
+53
+54
+55
+56
+57
+58
+59
+60
+61
+62
+63
+64
+65
+66
+67
+68
+69
+70
+71
+72
+73
+74
+75
+76
+77
+78
+79
+80
+81
+82
+83
+84
+85
+86
+87
+88
+89
+90
+91
+92
+93
+94
+95
+96
+97
+98
+99
+100
+101
+102
+103
+104
+105
+106
+107
+108
+109
+110
+111
+112
+113
+114
+115
+116
+117
+118
+119
+120
+121
+122
+123
+124
+125
+126
+127
diff --git a/xdelta1/doc/old/dcc99/data/tclean.l b/xdelta1/doc/old/dcc99/data/tclean.l
new file mode 100755
index 0000000..b440e30
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/data/tclean.l
@@ -0,0 +1,38 @@
+/* -*-Mode: C++;-*-
+ * PRCS - The Project Revision Control System
+ * Copyright (C) 1997  Josh MacDonald
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License
+ * as published by the Free Software Foundation; either version 2
+ * of the License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
+ *
+ * $Id$
+ */
+
+%{
+double r,u,s;
+%}
+
+dig       [0-9]
+num       {dig}+("."{dig}+)?
+space     [\v\f\r\t\n ]
+ws        {space}+
+
+%%
+
+{ws} { }
+"real"{ws}{num} { sscanf (yytext, "real %lf", &r); }
+"user"{ws}{num} { sscanf (yytext, "user %lf", &u);}
+"sys"{ws}{num} { sscanf (yytext, "sys %lf", &s); printf ("Time: %f\n", u+s); }
+
+%%
diff --git a/xdelta1/doc/old/dcc99/dcc99.bib b/xdelta1/doc/old/dcc99/dcc99.bib
new file mode 100755
index 0000000..09d3d3c
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/dcc99.bib
@@ -0,0 +1,502 @@
+@String{pub-USENIX              = "USENIX"}
+@String{pub-USENIX-EL-CERRITO:adr = "P.O. Box 7, El Cerrito 94530, CA,
+                                  USA"}
+@String{pub-USENIX:adr          = "Berkeley, CA, USA"}
+
+@String{j-LECT-NOTES-COMP-SCI   = "Lecture Notes in Computer Science"}
+@String{j-SPE                   = "Software---Practice and Experience"}
+
+@Article{Severance:1976:TODS,
+  title =        "Differential Files: Their Application to the
+                 Maintenance of Large Databases",
+  author =       "Dennis S. Severance and Guy M. Lohman",
+  journal =      "ACM Transactions on Database Systems",
+  month =        sep,
+  year =         "1976",
+  publisher =    "ACM, New York",
+  pages =        "256--267",
+}
+
+@Article{Vo:1996:SCM,
+  author =       "J. J. Hunt and K.-P. Vo and W. F. Tichy",
+  title =        "An Empirical Study of Delta Algorithms",
+  journal =      j-LECT-NOTES-COMP-SCI,
+  volume =       "1167",
+  pages =        "49--66",
+  month =        "July",
+  year =         "1996",
+  CODEN =        "LNCSD9",
+  ISSN =         "0302-9743",
+  bibdate =      "Fri Aug 22 11:59:49 MDT 1997",
+  acknowledgement = ack-nhfb,
+}
+
+@Article{MacDonald:1998:SCM,
+  author =       "Josh MacDonald and Paul N. Hilfinger and Luigi Semenzato",
+  title =        "PRCS: The Project Revision Control System",
+  journal =      j-LECT-NOTES-COMP-SCI,
+  volume =       "1439",
+  pages =        "33--45",
+  month =        "July",
+  year =         "1998",
+}
+
+@Article{Alderson:1988:JSE,
+  author = "Albert Alderson",
+  title = "A Space-Efficient Technique for Recording Versions of Data",
+  journal = "Software Engineering Journal",
+  volume = "3",
+  number = "6",
+  pages = "240--246",
+  month = nov,
+  year = "1988",
+}
+
+@Article{Tichy:1985:RSV,
+  author =       "Walter F. Tichy",
+  title =        "{RCS}: {A} System for Version Control",
+  journal =      j-SPE,
+  volume =       "15",
+  number =       "7",
+  pages =        "637--654",
+  month =        jul,
+  year =         "1985",
+  CODEN =        "SPEXBL",
+  ISSN =         "0038-0644",
+  bibdate =      "Sat May 31 13:36:16 MDT 1997",
+  acknowledgement = ack-nhfb,
+  keywords =     "algorithms; management; performance; measurement",
+  review =       "ACM CR 8604-0320",
+  subject =      "D.2.7 Software, SOFTWARE ENGINEERING, Distribution and
+                 Maintenance, Version control \\ D.2.9 Software,
+                 SOFTWARE ENGINEERING, Management, Software
+                 configuration management \\ D.4.0 Software, OPERATING
+                 SYSTEMS, General, UNIX \\ K.6.3 Computing Milieux,
+                 MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS,
+                 Software Management, Software maintenance",
+}
+
+
+
+
+@Article{Rochkind:ieee:tose:1975,
+  author =       "Marc J. Rochkind",
+  title =        "The Source Code Control System",
+  journal =      "IEEE Transactions on Software Engineering",
+  volume =       "1",
+  number =       "4",
+  pages =        "364--370",
+  month =        dec,
+  year =         "1975",
+  refs =         "10",
+  checked =      "19940609",
+  source =       "Main library",
+  keywords =     "configuration management, program maintenance,
+                 software control, software project management, revision
+                 control, source control, SCCS",
+  abstract =     "The Source Code Control System (SCCS) is a software
+                 tool designed to help programming projects control
+                 changes to source code. It provides facilities for
+                 storing, updating, and retrieving all versions of
+                 modules, for controlling updating privilges, for
+                 identifying load modules by version number, and for
+                 recording who made each software change, when and where
+                 it was made, and why. This paper discusses the SCCS
+                 approach to source code control, shows how it is used
+                 and explains how it is implemented.",
+  reffrom =      "Kernighan:Mashey:ieee:c:1981",
+  reffrom =      "Tichy:acm:toplas:1986",
+}
+
+@Article{Miller:1985:FCP,
+  author =       "Webb Miller and Eugene W. Myers",
+  title =        "A File Comparison Program",
+  journal =      j-SPE,
+  volume =       "15",
+  number =       "11",
+  pages =        "1025--1040",
+  month =        nov,
+  year =         "1985",
+  coden =        "SPEXBL",
+  ISSN =         "0038-0644",
+  bibdate =      "Sat May 31 13:36:16 MDT 1997",
+  acknowledgement = ack-nhfb,
+  keywords =     "design; algorithms; performance",
+  subject =      "D.4.3 Software, OPERATING SYSTEMS, File Systems
+                 Management, File organization \\ E.5 Data, FILES,
+                 Organization/structure \\ I.1.2 Computing
+                 Methodologies, ALGEBRAIC MANIPULATION, Algorithms,
+                 Analysis of algorithms",
+}
+
+@Article{Tichy84,
+  author =       "W. F. Tichy",
+  title =        "The string-to-string correction problem with block moves.",
+  journal =      "ACM Transactions on Computer Systems",
+  volume =       "2",
+  number =       "4",
+  pages =        "309--321",
+  month =        nov,
+  year =         "1984",
+  keywords =     "longest common subsequence, LCS, LCSS, edit distance,
+                 block, move, TOCS, string to strings, sequence,
+                 alignment, linear, algorithm",
+  abstract =     "Uses block moves as the edit operation, seeks min'
+                 number, gets a O(n) linear algorithm if P.Weiner's
+                 data-structure used. S source string, T target string.
+                 Algorithm: find longest prefix of T that is a substring
+                 of S, this gives the first block move; repeat until
+                 done. Proof: by induction on number of block moves. One
+                 block move - T must obviously be a substring of S, alg'
+                 finds this. Suppose optimal is i block moves and alg'
+                 fails, i.e. finds j $>$ i moves.
+                 T:----Opt1----$|$--Opt2--$|$---Opt3---$|$.....$|$--Algi--
+                 T:-----Alg1-----$|$---Alg2---$|$.....$|$-----Algj------
+                 NB. $|$Alg1$|$ $>$= $|$Opt1$|$ Delete the substring
+                 Alg1. By induction the alg' would find the opt'
+                 explanation of the rest of T - but it doesn't :-
+                 contradiction.",
+}
+
+@Book{Knuth:V3:73,
+  author =       "D. E. Knuth",
+  year =         "1998",
+  title =        "The Art of Computer Programming {III}: Sorting and
+                 Searching",
+  publisher =    "Addison--Wesley",
+  address =      "Reading, Massachusetts",
+  kwds =         "cs, book, sorting, searching",
+}
+
+@InCollection{Hunt77,
+  author =       "Hunt and Szymanski",
+  title =        "A Fast Algorithm for Computing Longest Common
+                 Subsequences",
+  booktitle =    "Communications of the ACM",
+  publisher =    "ACM, New York",
+  volume =       "20",
+  year =         "1977",
+}
+
+@TECHREPORT{Rsync,
+        AUTHOR = {Andrew Tridgell and Paul Mackerras},
+        TITLE = {The {Rsync} Algorithm},
+        INSTITUTION = "The Australian National University",
+        YEAR = "1996",
+        NUMBER = "TR-CS-96-05",
+        MONTH = "June"
+}
+
+@Article{Yu:1994:LTS,
+  author =       "Lin Yu and Daniel J. Rosenkrantz",
+  title =        "A Linear-Time Scheme for Version Reconstruction",
+  journal =      "ACM Transactions on Programming Languages and
+                 Systems",
+  volume =       "16",
+  number =       "3",
+  pages =        "775--797",
+  month =        may,
+  year =         "1994",
+  coden =        "ATPSDT",
+  ISSN =         "0164-0925",
+  url =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/177705.html",
+  abstract =     "An efficient scheme to store and reconstruct versions
+                 of sequential files is presented. The reconstruction
+                 scheme involves building a data structure representing
+                 a complete version, and then successively modifying
+                 this data structure by applying a sequence of specially
+                 formatted differential files to it. Each application of
+                 a differential file produces a representation of an
+                 intermediate version, with the final data structure
+                 representing the requested version.\par The scheme uses
+                 a linked list to represent an intermediate version,
+                 instead of a sequential array, as is used
+                 traditionally. A new format for differential files
+                 specifying changes to this linked list data structure
+                 is presented. The specification of each change points
+                 directly to where the change is to take place, thereby
+                 obviating a search. Algorithms are presented for using
+                 such a new format differential file to transform the
+                 representation of a version, and for reconstructing a
+                 requested version. Algorithms are also presented for
+                 generating the new format differential files, both for
+                 the case of a forward differential specifying how to
+                 transform the representation of an old version to the
+                 representation of a new version, and for the case of a
+                 reverse differential specifying how to transform the
+                 representation of a new version to the representation
+                 of an old version.\par The new version reconstruction
+                 scheme takes time linear in the sum of the size of the
+                 initial complete version and the sizes of the file
+                 differences involved in reconstructing the requested
+                 version. In contrast, the classical scheme for
+                 reconstructing versions takes time proportional to the
+                 sum of the sizes of the sequence of versions involved
+                 in the reconstruction, and therefore has a worst-case
+                 time that is quadratic in the sum of the size of the
+                 initial complete version and the sizes of the file
+                 differences. The time cost of the new differential file
+                 generation scheme is comparable to the time cost of the
+                 classical differential file generation scheme.",
+  acknowledgement = ack-pb,
+  keywords =     "algorithms; languages",
+  subject =      "{\bf H.2.5}: Information Systems, DATABASE MANAGEMENT,
+                 Heterogeneous Databases, Program translation. {\bf
+                 H.3.2}: Information Systems, INFORMATION STORAGE AND
+                 RETRIEVAL, Information Storage, File organization. {\bf
+                 H.2.1}: Information Systems, DATABASE MANAGEMENT,
+                 Logical Design. {\bf H.2.0}: Information Systems,
+                 DATABASE MANAGEMENT, General, Security, integrity, and
+                 protection. {\bf H.2.5}: Information Systems, DATABASE
+                 MANAGEMENT, Heterogeneous Databases, Data translation.
+                 {\bf D.2.7}: Software, SOFTWARE ENGINEERING,
+                 Distribution and Maintenance.",
+}
+
+@InProceedings{Burns:InPlace,
+  author =       "Randal C. Burns and Darrell D. E. Long",
+  title =        "In-Place Reconstruction of Delta Compressed Files",
+  booktitle =    "Proceedings of the Seventeenth ACM Symposium on Principles of Distributed Computing",
+  month =        "June",
+  year =         "1998"
+}
+
+@InProceedings{Burns:Backup,
+  author =       "Randal C. Burns and Darrell D. E. Long",
+  title =        "Efficient Distributed Backup with Delta Compression",
+  booktitle =    "Proceedings of the Fifth Workshop on I/O in Parallel and Distributed Systems",
+  month =        "November",
+  year =         "1997"
+}
+
+@MASTERSTHESIS{Burns:Thesis,
+        AUTHOR = {Randal C. Burns},
+        TITLE = "Differential Compression: A Generalized Solution for Binary Files",
+        SCHOOL = "University of California at Santa Cruz, Department of Computer Science",
+        YEAR = "1997"
+}
+
+@Book{clr,
+  author = "Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest",
+  title = "Introduction to Algorithms",
+  publisher = "MIT Press",
+  year = 1993
+}
+
+@Article{Myers:Editor,
+  author =       "Christopher W. Fraser and Eugene W. Myers",
+  title =        "An Editor for Revision Control",
+  journal =      "ACM Transactions on Programming Languages and
+                 Systems",
+  volume =       "9",
+  number =       "2",
+  pages =        "277--295",
+  month =        apr,
+  year =         "1987"
+}
+
+@Misc{mozillaCvs,
+  author = "Webmaster",
+  date = "1998",
+  howpublished = "http://www.mozilla.org/cvs.html",
+  title = "Mozilla CVS Usage Instructions"
+}
+
+@Misc{w3,
+  title = "The HTTP Distribution and Replication Protocol",
+  month = aug,
+  year = "1997",
+  howpublished = "http://www.w3.org",
+  author = "Aurthur van Hoff and John Giannandrea and Mark Hapner and Steve Carter and Milo Medin"
+}
+
+@Misc{gdiff,
+  title = "Generic Diff Format Specification",
+  month = aug,
+  year = "1997",
+  howpublished = "http://www.w3.org",
+  author = "Aurthur van Hoff and Jonathan Payne"
+}
+
+@InProceedings{SIGCOMM97*181,
+  author =       "Jeffrey C. Mogul and Fred Douglis and Anja Feldmann
+                 and Balachander Krishnamurthy",
+  title =        "Potential benefits of delta-encoding and data
+                 compression for {HTTP}",
+  pages =        "181--196",
+  ISSN =         "0146-4833",
+  booktitle =    "Proceedings of the {ACM} {SIGCOMM} Conference :
+                 Applications, Technologies, Architectures, and
+                 Protocols for Computer Communication ({SIGCOMM}-97)",
+  month =        sep # "14--18~",
+  series =       "Computer Communication Review",
+  volume =       "27,4",
+  publisher =    "ACM Press",
+  address =      "New York",
+  year =         "1997",
+}
+
+@Misc{RFC1321,
+  author =       "R. Rivest",
+  title =        "{RFC 1321}: The {MD5} Message-Digest Algorithm",
+  month =        apr,
+  year =         "1992",
+  bibdate =      "Thu Oct 16 09:34:09 MDT 1997",
+  note =         "Status: INFORMATIONAL.",
+  URL =          "ftp://ftp.internic.net/rfc/rfc1321.txt,
+                 ftp://ftp.math.utah.edu/pub/rfc/rfc1321.txt",
+  acknowledgement = ack-nhfb,
+  format =       "TXT=35222 bytes",
+  online =       "yes",
+  status =       "INFORMATIONAL",
+}
+
+@MISC{Polstra96,
+      Author = "J. Polstra",
+      Title = "Program source for {CVSup}",
+      HowPublished = "ftp://ftp.cvsup.freebsd.org/pub/CVSup",
+      Year = 1996}
+
+@Misc{RFC1036,
+  author =       "M. R. Horton and R. Adams",
+  title =        "{RFC 1036}: Standard for interchange of {USENET}
+                 messages",
+  day =          "1",
+  month =        dec,
+  year =         "1987",
+  bibdate =      "Thu Oct 16 09:34:09 MDT 1997",
+  note =         "Obsoletes RFC0850 \cite{RFC0850}. Status: UNKNOWN.",
+  URL =          "ftp://ftp.internic.net/rfc/rfc1036.txt,
+                 ftp://ftp.internic.net/rfc/rfc850.txt,
+                 ftp://ftp.math.utah.edu/pub/rfc/rfc1036.txt,
+                 ftp://ftp.math.utah.edu/pub/rfc/rfc850.txt",
+  acknowledgement = ack-nhfb,
+  format =       "TXT=46891 bytes",
+  obsoletes =    "Obsoletes RFC0850 \cite{RFC0850}.",
+  online =       "yes",
+  status =       "UNKNOWN",
+}
+
+
+@Misc{RFC0977,
+  author =       "B. Kantor and P. Lapsley",
+  title =        "{RFC 977}: Network News Transfer Protocol: {A}
+                 Proposed Standard for the Stream-Based Transmission of
+                 News",
+  day =          "1",
+  month =        feb,
+  year =         "1986",
+  bibdate =      "Thu Oct 16 09:34:09 MDT 1997",
+  note =         "Status: PROPOSED STANDARD.",
+  URL =          "ftp://ftp.internic.net/rfc/rfc977.txt,
+                 ftp://ftp.math.utah.edu/pub/rfc/rfc977.txt",
+  acknowledgement = ack-nhfb,
+  format =       "TXT=55062 bytes",
+  online =       "yes",
+  status =       "PROPOSED STANDARD",
+}
+
+@Misc{RFC0850,
+  author =       "M. R. Horton",
+  title =        "{RFC 850}: Standard for interchange of {USENET}
+                 messages",
+  day =          "1",
+  month =        jun,
+  year =         "1983",
+  bibdate =      "Thu Oct 16 09:34:09 MDT 1997",
+  note =         "Obsoleted by RFC1036 \cite{RFC1036}. Status:
+                 UNKNOWN.",
+  URL =          "ftp://ftp.internic.net/rfc/rfc1036.txt,
+                 ftp://ftp.internic.net/rfc/rfc850.txt,
+                 ftp://ftp.math.utah.edu/pub/rfc/rfc1036.txt,
+                 ftp://ftp.math.utah.edu/pub/rfc/rfc850.txt",
+  acknowledgement = ack-nhfb,
+  format =       "TXT=43871 bytes",
+  obsoletedby =  "Obsoleted by RFC1036 \cite{RFC1036}.",
+  online =       "yes",
+  status =       "UNKNOWN",
+}
+
+@InProceedings{Salz:1992:IUT,
+  author =       "Rich Salz",
+  title =        "{InterNetNews: Usenet} Transport for {Internet}
+                 Sites",
+  crossref =     "USENIX:1992:PSU",
+  pages =        "93--98",
+  month =        "Summer",
+  year =         "1992",
+  bibdate =      "Fri Oct 18 07:24:24 MDT 1996",
+  bibsource =    "ftp://ftp.uu.net/library/bibliography",
+  acknowledgement = ack-nhfb,
+  affiliation =  "BBN Systems and Technologies",
+}
+
+@Proceedings{USENIX:1992:PSU,
+  editor =       "{USENIX Association}",
+  booktitle =    "Proceedings of the Summer 1992 {USENIX} Conference:
+                 June 8--12, 1992, San Antonio, Texas, USA",
+  title =        "Proceedings of the Summer 1992 {USENIX} Conference:
+                 June 8--12, 1992, San Antonio, Texas, {USA}",
+  publisher =    pub-USENIX,
+  address =      pub-USENIX:adr,
+  pages =        "vii + 253",
+  year =         "1992",
+  ISBN =         "1-880446-44-8",
+  LCCN =         "QA 76.76 O63 U83 1992",
+  bibdate =      "Sun Feb 18 07:46:09 MST 1996",
+  acknowledgement = ack-nhfb,
+  annote =       "Spine title: San Antonio conference proceedings.",
+  keywords =     "UNIX (Computer operating system) --- Congresses.",
+}
+
+@InProceedings{Berliner:1990:CIP,
+  author =       "Brian Berliner",
+  title =        "{CVS II}: Parallelizing Software Development",
+  crossref =     "USENIX:1990:PWU",
+  pages =        "341--352",
+  day =          "22--26",
+  month =        jan,
+  year =         "1990",
+  bibdate =      "Fri Oct 18 07:24:24 MDT 1996",
+  bibsource =    "ftp://ftp.uu.net/library/bibliography",
+  acknowledgement = ack-nhfb,
+  affiliation =  "Prisma, Inc.",
+}
+
+@Proceedings{USENIX:1990:PWU,
+  editor =       "{USENIX Association}",
+  key =          "USENIX Winter '90",
+  booktitle =    "Proceedings of the Winter 1990 {USENIX} Conference,
+                 January 22--26, 1990, Washington, {DC}, {USA}",
+  title =        "Proceedings of the Winter 1990 {USENIX} Conference,
+                 January 22--26, 1990, Washington, {DC}, {USA}",
+  publisher =    pub-USENIX,
+  address =      pub-USENIX:adr,
+  pages =        "xvi + 374",
+  year =         "1990",
+  LCCN =         "QA76.8.U65 U82 1990",
+  bibdate =      "Thu Sep 15 18:50:55 1994",
+  acknowledgement = ack-nhfb,
+  keywords =     "UNIX (Computer operating system) --- Congresses; UNIX
+                 (OPERATING SYSTEM); OPERATING SYSTEMS (COMPUTERS);
+                 CONFERENCES; CHECKOUT",
+  xxISBN =       "none",
+}
+
+@InProceedings{soda92*367,
+  author =       "J. Ian Munro and Thomas Papadakis and Robert
+                 Sedgewick",
+  title =        "Deterministic Skip Lists",
+  pages =        "367--375",
+  ISBN =         "0-89871-293-9",
+  editor =       "Frances {Frederickson, Grag; Graham, Ron; Hochbaum,
+                 Dorit S.; Johnson, Ellis; Kosaraju, S. Rao; Luby,
+                 Michael; Megiddo, Nimrod; Schieber, Baruch; Vaidya,
+                 Pravin; Yao}",
+  booktitle =    "Proceedings of the 3rd Annual {ACM}-{SIAM} Symposium
+                 on Discrete Algorithms ({SODA} '92)",
+  address =      "Orlando, FL, USA",
+  month =        jan,
+  year =         "1992",
+  publisher =    "SIAM",
+}
diff --git a/xdelta1/doc/old/dcc99/dcc99.sty b/xdelta1/doc/old/dcc99/dcc99.sty
new file mode 100755
index 0000000..ba27dc7
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/dcc99.sty
@@ -0,0 +1,56 @@
+\usepackage{xspace}
+\usepackage{epsf}
+%\usepackage{amsthm}
+%\usepackage{amstex}
+\usepackage{amsmath}
+
+\newenvironment{program}{\begin{itemize}\item[]\tt\hfill\begin{tabbing}}{\end{tabbing}\end{itemize}}
+
+\newcommand{\myfigure}[2]{
+        \begin{figure*}
+        \begin{center}
+        \def\@captype{figure}
+        \leavevmode
+        %\epsfxsize=8cm
+        \epsfbox{figs/#1.eps}
+        \caption{#2} \label{#1}
+        \end{center}
+        \end{figure*}
+        }
+
+\newcommand{\medfigure}[2]{
+        \begin{figure*}
+        \begin{center}
+        \def\@captype{figure}
+        \leavevmode
+        \epsfxsize=8cm
+        \epsfbox{figs/#1.eps}
+        \caption{#2} \label{#1}
+        \end{center}
+        \end{figure*}
+        }
+
+\newcommand{\bigfigure}[2]{
+        \begin{figure*}
+        \begin{center}
+        \def\@captype{figure}
+        \leavevmode
+        \epsfxsize=8cm
+        \epsfbox{figs/#1.eps}
+        \caption{#2} \label{#1}
+        \end{center}
+        \end{figure*}
+        }
+
+\def\xd{{\sc Xdelta}}
+\def\records{\textrm{\emph{records}}}
+\def\nil{\textrm{\emph{nil}}}
+\def\fingerprint{\textrm{\emph{fingerprint}}}
+\def\size{\textrm{\emph{size}}}
+\def\lmat{\textrm{\emph{match}}}
+\def\lcs{\text{{\textrm{\emph{lcs}}}}}
+\def\difference{\textrm{{\emph{difference}}}}
+\def\intervals{\textrm{{\emph{intervals}}}}
+\def\icpy#1#2#3{\texttt{copy} \; #1 \; #2 \; #3}
+\def\iins#1{\texttt{insert} \; #1}
+\def\inv#1{#1^{-1}}
diff --git a/xdelta1/doc/old/dcc99/dcc99.tex b/xdelta1/doc/old/dcc99/dcc99.tex
new file mode 100755
index 0000000..27ab7e1
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/dcc99.tex
@@ -0,0 +1,1297 @@
+\documentclass{llncs}
+
+\title{Versioned File Archiving, Compression, and Distribution}
+\titlerunning{Versioned File Archiving and Compression}
+
+\usepackage{dcc99}
+\usepackage{enumerate}
+
+\author{Josh MacDonald\inst{1}}
+
+\authorrunning{Josh MacDonald}
+
+\tocauthor{Josh MacDonald (University of California at Berkeley,
+Department of Electrical Engineering and Computer Sciences.)  }
+
+\institute{University of California at Berkeley, Department of
+Electrical Engineering and Computer Sciences, Berkeley CA 94720, USA
+}
+
+\date{29 Oct 1998}
+
+\nonfrenchspacing
+
+%\theoremstyle{marginbreak}
+
+\newtheorem{thrm}{{\sc Theorem}}
+\newtheorem{clm}{{\sc Claim}}
+\newtheorem{lemm}{{\sc Lemma}}
+\newtheorem{alg}{{\sc Algorithm}}
+
+%\Alph{alg}
+\renewcommand{\thealg}{\Alph{alg}}
+
+\begin{document}
+\bibliographystyle{acm}
+
+\maketitle
+\begin{abstract}
+The \xd {} system implements a technique for archiving and compressing
+collections of many similar file versions.  It stores only the
+differences between certain versions.  I describe and discuss an
+algorithm for computing \emph{file deltas}, present measurements, and
+demonstrate its application to versioned file-archival and efficient
+file-distribution network protocols.
+\end{abstract}
+
+% Put up your benchmark, whatever it is, on a ftp site somewhere, and
+% INCLUDE A MD5 CHECKSUM, traceability, etc.
+
+\section{Overview}
+
+The \emph{file delta} problem is to compute a small set of
+instructions for transforming one file into another---one that is
+expected to be a function of the file's changes, not its content.
+This technique is well established for versioned file-archival.
+Though the advantages of using file deltas to transmit changes over a
+network are clear, specifying and widely deploying such a system
+efficient enough to justify itself is not as easy as it seems.  There
+are a number of issues to overcome.  First, the execution cost of
+computing and compressing deltas can be prohibitive--a site
+administrator might rather let everyone on the network suffer through
+a congested network condition than be CPU-bound while delivering
+efficient deltas to an uncongested network.  Second, efficiently a
+integrating delta transmission into an application requires work; a
+server must store and name multiple versions of a file, compute deltas
+when requested, complicate existing protocols, and be fair---these are
+not always compatible.
+
+Recently there have been advances in delta algorithms, but their use
+in network delta communication has been slow to follow.  This work
+addresses many of these issues, and finishes with a few new challenges
+that I am currently working on.  I have designed and implemented a
+decentralized scheme for highly-available, versioned file-archival,
+with which I have implemented a delta-based distribution and
+replication protocol built upon a simple, distributed file-archive
+abstraction.  The system, called \xd, is implemented as the basis of
+multiple server, distributed version control in PRCS, the Project
+Revision Control System \cite{MacDonald:1998:SCM}.
+
+This paper outlines the \xd {} system in three sections: delta
+algorithms (\S\ref{sec:delta}), file-archival (\S\ref{sec:archival}),
+and distribution protocols (\S\ref{sec:distribution}).  Each section
+will detail related work, discuss previous implementations, outline a
+part of the system and measure it, and suggest future work.
+
+\section{Delta Algorithms}\label{sec:delta}
+
+The \emph{file delta problem} is to efficiently compute a delta $d$
+that can be stored compactly and used to construct a \emph{To} file
+$t^d$ from the set of $k^d$ \emph{From} files $F^d = \left\{ f^d_0
+\ldots f^d_{k^d} \right\}$.  The \emph{generate} operation computes
+$d$ from $F^d$ and $t^d$:
+
+\begin{equation}
+d = t^d \ominus F^d
+\end{equation}
+
+\noindent while the \emph{apply} operation computes the reverse:
+
+\begin{equation}
+t^d = d \oplus F^d
+\end{equation}
+
+For our purposes, a file will be defined to be a sequence of bytes.
+For a file $f$, $\size(f)$ denotes the length of $f$ in bytes and set
+of files $F$, $\size(F) = \sum_{f \in F} \size(f)$.  The notation,
+$f[i]$, denotes the byte at offset $i$ of $f$, where $0 \le i <
+size(f)$.
+
+A good solution should be fast, perform well on large inputs, and
+expect to benefit from preprocessing $F$ for repeated computations.
+Performance considerations for real files and memory systems make it
+desirable to operate in a single, sequential pass through $t$.
+
+The \emph{copy/insert} class of delta algorithms are those that
+produce a common delta encoding consisting of \emph{copy} and
+\emph{insert} operations.  This class of algorithms is useful because
+there is a straightforward definition of an optimal solution, and the
+implementation of \emph{apply} is extremely simple.  For reasons to
+come, this type of delta will be represented in two separate parts:
+the \emph{control} $C^d$ and \emph{insert-data} $I^d$.  The control
+contains a sequence of instructions $c^d_1 \ldots c^d_{z^d}$.  The
+insert-data is represented as a file containing the concatenation of
+the data inserted by each insert instruction.  Each instruction $c_i$
+is one of the two operations:
+
+\begin{align}
+&\icpy{m}{o}{l} \\
+&\iins{l}
+\end{align}
+
+\noindent These are executed in order to construct the \emph{To} file,
+where \texttt{copy} inserts the substring $f_m[o] \ldots f_m[o+l-1]$,
+and \texttt{insert} inserts the next $l$ bytes from $I^d$.
+
+The \emph{insert/delete} class of algorithms is characterized by
+\emph{insert} and \emph{delete} instructions.  Many existing tools for
+computing file deltas use this type of encoding, as it produces a form
+which is easy for humans to read.
+
+Existing work on delta algorithms uses \emph{paired}
+algorithms---those in which there is a single \emph{From} file.  For
+reasons which will become clear, the definition used here is more
+general than other presentations in allowing $F$ to be a set of files
+rather than a single file.  Of course, $F$ can be reduced to a single
+file by concatenation, but attempting to generalize paired algorithms
+to multiple \emph{From} files violates many of the assumptions made to
+improve these algorithms.
+
+\subsection{Related Work}
+
+Work on delta algorithms has been influenced by related work on the
+longest common subsequence problem, data compression, and pattern
+matching.
+
+The first technique for computing file deltas used an insert/delete
+algorithm based upon finding the longest common subsequence (LCS) of
+two files.  Among these, the UNIX \texttt{diff} utility was first used
+to list changes between two files in a line-by-line summary
+\cite{Miller:1985:FCP}.  The \texttt{diff} utility is
+\emph{line-oriented}---each insertion and deletion involves only
+complete lines.  It was adopted by the early version control tools
+SCCS \cite{Rochkind:ieee:tose:1975} and RCS \cite{Tichy:1985:RSV}.
+Line-oriented algorithms, however, perform poorly on files which are
+not line terminated such as images, rich-text data, and object files.
+
+Tichy developed a linear time and space, greedy copy/insert algorithm
+\cite{Tichy84} using a suffix tree to search for matching substrings
+of the files in question.  This simple greedy approach will be
+discussed next, and is easily shown to be optimal for copy/insert
+deltas under certain assumptions.
+
+Burns \cite{Burns:Thesis} presents a recent summary of previous work
+and discusses several paired, copy/insert algorithms based upon a
+greedy approach using hashed Rabin-Karp fingerprints for string
+matching.  He then refines it in several ways, because the simplest
+greedy algorithm requires space linear in the length of the file.  He
+analyzes constant-space versions of this algorithm, making the
+assumption that changes between the files are the result of only
+insertions and deletions, for example.  When $F$ is a set of files,
+however, many of these improvements fail.
+
+Hunt, Tichy, and Vo present an impressive paired delta algorithm
+called \emph{vdelta} \cite{Vo:1996:SCM}, which mixes Lempel-Ziv
+compression and differential compression to compute a compressed delta
+by using $F$ as a dictionary to compress $t$.  This particular
+approach is difficult to compare with others, because most delta
+algorithms compute uncompressed deltas.
+
+A delta can be applied in-place if application can be performed using
+the space containing the data to which the delta is applied.  An
+\emph{insert/delete} delta can always be applied in-place, but an
+arbitrary \emph{copy/insert} delta cannot.  Burns and Long have shown
+techniques for computing \emph{copy/insert} deltas that can be applied
+\emph{in-place} \cite{Burns:InPlace}.
+
+\subsection{Difference Metrics} \label{sec:metrics}
+
+Comparison of algorithms has been a difficult subject, as algorithms
+are studied variously in terms of delta size, compressed delta size,
+and optimality with a particular encoding.  A solution that is optimal
+in one encoding cannot be easily compared with another encoding,
+without an absolute metric.  Hunt, Tichy, and Vo suggest comparing
+delta algorithms with a difference metric based upon the length of the
+longest common subsequence \cite{Vo:1996:SCM}:
+
+\begin{equation}
+\difference = \frac{\size(f)+\size(t)}{2} - \size(\lcs(f,t))
+\end{equation}
+
+\noindent where $f$ is the single from input.  The $\difference$ value
+is compared to the size of a delta produced by an algorithm, allowing
+its performance to be judged relative to results of other algorithms.
+This is troublesome for several reasons: there is no linear time and
+space algorithm for computing the exact LCS; it does not apply to
+multiple input files---since it does not allow permuted or repeated
+copy regions; and it is not even the most appropriate dynamic
+programming style of solution since it weighs an \emph{insert} the
+same a \emph{delete} instruction.
+
+The copy/insert encoding is not optimal either; but it allows for
+permuted and repeated copied regions while the metric based on LCS
+does not.  Additionally:
+
+\begin{itemize}
+\item An exact solution is known that requires $O(\size(F))$ space \cite{Tichy84}
+\item It characterizes non-paired delta algorithms
+\item The particular, uncompressed encoding is useful in practice
+\end{itemize}
+
+For these reasons, it seems appropriate to use the size of the
+unencoded, optimal \emph{copy/insert} solution as a metric for
+comparing all delta algorithms.  Also, using an encoding-independent
+metric allows algorithm designers to study encoding separately from
+search and pattern matching issues.
+
+More precisely, the \emph{copy/insert metric} $m$ measures the upper
+bound on the size of the optimal sequence of \emph{copy/insert}
+instructions, described next.  Assuming an 8-bit byte, this metric
+estimates the total delta size in bits:
+
+\begin{align}
+m (C^d, I^d) &= \sum_{i = 1}^{z^d} m(c^d_i) \\
+m (\icpy{m}{o}{l}) &= 1 + \lceil\lg l\rceil + \lceil{\lg k^d}\rceil + \lceil{\lg o}\rceil \\
+m (\iins{l})       &= 1 + \lceil\lg l\rceil + 8 l
+\end{align}
+
+Earlier work on copy/insert algorithms has used a simpler metric,
+treating all copies with unit cost.  It then suffices to show that a
+simple greedy algorithm is optimal \cite{Burns:Thesis}.  The unit-cost
+copy metric is not an accurate estimate of the file difference, so I
+propose the above.  The greedy solution is not optimal for the refined
+metric.
+
+\subsection{The Greedy Algorithm for Copy/Insert Deltas} \label{sec:greedy}
+
+The greedy algorithm simply scans through the \emph{To} file, finding
+the longest match at each position and generating a copy instruction.
+All unmatched strings produce an insert instruction.
+
+\begin{alg}\label{alg:generate}
+Compute $(C^d, I^d) = t^d \ominus F^d$ where $d$ has a copy/insert
+encoding
+\end{alg}
+
+Assume that match $(m, o, l) = \lmat (F,t,i)$, where the longest match
+to $t$ starting at index $i$ in $F$ is $f_m[o] \ldots f_m[o+l-1]$.
+Another parameter, $s$, is used as a lower bound on the length of a
+copy instruction.  For now, assume $s=0$.  Given these, a program to
+compute greedy copy/insert deltas is given in Figure
+\ref{fig:generate}.
+
+\begin{figure*}
+\begin{program}
+ge\= ne\= ra\= te\= De\= lta($t^d$, $F^d$) \\
+  \> $i \leftarrow 0$; $z \leftarrow 0$; $I^d \leftarrow$ \textrm{\emph{empty}} \>\>\>\> \hspace{6cm} \= $\triangleright$ \hbox{Step 1: Initialize.} \\
+  \> while ($i < \size(t)$) \>\>\>\>\> $\triangleright$ \hbox{Step 2: Loop.} \\
+  \>\> $(m,o,l) \leftarrow \lmat (F^d,t^t,i)$ \\
+  \>\> if ($l \le s$) \\
+  \>\>\> if ($z > 0$ \textrm{\emph{and}} $c_z^d = \iins{j}$) \>\>\> $\triangleright$ \hbox{Step 3: Insert.} \\
+  \>\>\>\> $c_z^d \leftarrow \iins{j+1}$ \\
+  \>\>\> else \\
+  \>\>\>\> $z \leftarrow z + 1$; $c_z^d \leftarrow \iins{1}$ \\
+  \>\>\> $I^d \leftarrow I^d$ \textrm{\emph{append}} $t^d[i]$; $i \leftarrow i + 1$ \\
+  \>\> else \\
+  \>\>\> $z \leftarrow z + 1$; $c_z^d \leftarrow \icpy{m}{o}{l}$; $i \leftarrow i + 1$  \>\>\> $\triangleright$ \hbox{Step 4: Copy.} \\
+  \> $z^d \leftarrow z$ \>\>\>\>\> $\triangleright$ \hbox{Step 5: Finish.}
+\end{program}
+\caption{Algorithm \ref{alg:generate}}\label{fig:generate}
+\end{figure*}
+
+Steps 1 and 5 execute once in $O(1)$ steps.  In the worst case, the
+loop beginning in step 2 is executed $\size(t)$ times.  Each execution
+of the loop requires $O(1)$ steps, plus the time taken by $\lmat$.
+Altogether, he algorithm runs in $O(\size(t) \cdot M)$ steps, where
+$M$ is the time complexity of the $\lmat$ operation.
+
+Burns \cite{Burns:Thesis} shows that this algorithm is optimal when
+copies are treated with unit cost.  Burns and also Tichy
+\cite{Tichy84} demonstrate various $\lmat$ functions that all require
+linear time and space.  An algorithm requiring only constant space is
+required to operate on arbitrarily large files.
+
+None of the available constant-space improvements, however, apply for
+multiple input files, which will be used for file archiving.  As a
+result, \xd {} uses a linear-space approximation of the greedy
+algorithm.
+
+\subsection{The \xd {} Delta Algorithm}
+
+\xd {} uses a fast, linear time and space approximation to the greedy
+algorithm.  The actual space required is chosen to be a fraction of
+the input size less than approximately 0.5.  A \emph{fingerprint}
+function is a hashing function for fixed-length strings for which
+collisions are unlikely.  The algorithm uses a hashed index of the
+value of a fingerprint function at regular offsets in the \emph{From}
+data to perform string matching.  It then scans the \emph{To} file
+performing the greedy algorithm.  The approximation arises from hash
+and fingerprint collisions, and the approximate nature of the
+string-matching function.
+
+For some constant $s$ chosen to be a small power of 2, the algorithm
+computes a fingerprint on segments of length $s$ in each file $f$ at
+all offsets $i$ divisible by $s$ except, possibly, the last if $s$
+does not divide $\size(f)$---in this case the segment is too short.
+The fingerprint function $a_{fi} = \fingerprint(f, i)$ is evaluated in
+each file and inserted into a hash table, $B$, with hash function $H$.
+The number of such records is denoted $\records(F) = \sum_{f \in F}
+\lfloor \frac{\size(f)}{s} \rfloor$.  The hash table does not chain
+hash collisions.  Only a single $(f,i)$ pair or $\nil$ is recorded for
+each bucket.  The hash table is implemented as an array of 32-bit
+words of length $\records(F)$.  The $\nil$ value is encoded as the
+value 0, and $(f,i)$ is mapped into the remaining values.  Since $i$
+is bounded by $\lfloor \frac{\size(f)}{s} \rfloor$, $(f,i)$ can be
+easily fit into a 32-bit word provided that the number of files in $F$
+is less than $s$ and the length of $f$ is less than $2^{32}$.  Another
+array of words $c_{f}$ is used for each file to index $c_{f}[i] =
+a_{fi}$ so that a fingerprint collision can be easily detected.  The
+sum of lengths for these arrays is also $\records(F)$, so in bytes the
+algorithm requires:
+
+\begin{equation}
+O\left(\sum_{f \in F} 8 \lfloor \frac{\size(f)}{s}  \rfloor\right)
+\end{equation}
+
+\noindent for the two arrays, where 8 is the sum of 4 bytes per 32-bit
+word for each of the separate data structures.  The choice of $s$ will
+be discussed later, but should be chosen to be at least $2^4$, so the
+space required to run the algorithm is bounded by:
+
+\begin{equation}
+O\left(\frac{8 \cdot \size(F)}{s}\right) \le O\left(\frac{\size(F)}{2}\right) = O(\size(F)) \label{action-bound}
+\end{equation}
+
+Algorithm \ref{alg:match} locates matching strings at each offset in
+the \emph{To} file, supplying the match function used in algorithm
+\ref{alg:generate}.
+
+\begin{alg}\label{alg:match}
+Compute $(m,o,l) = \lmat (F,t,i)$.
+\end{alg}
+
+\begin{figure*}
+\begin{program}
+ma\=tc\=h($t^d$, $F^d$) \\
+  \> $x \leftarrow \fingerprint(t,i)$ \> \hspace{9cm} \= $\triangleright$ \hbox{Step 1: Fingerprint. } \\
+  \> if ($B[H(x)] = \nil$) \>\> $\triangleright$ \hbox{Step 2: Lookup.} \\
+  \>\> \textrm{\emph{return no match}} \\
+  \> else \\
+  \>\> $(m,o) \leftarrow B[H(x)]$ \\
+  \> if ($c_{f_m}[o] \not = x$) \textrm{\emph{return no match}} \>\> $\triangleright$ \hbox{Step 3: Test for collision.} \\
+  \> $l \leftarrow$ \textrm{\emph{length of longest matching substring at offsets $o$ and $i$}} \>\> $\triangleright$ \hbox{Step 4: Grow.} \\
+  \> if ($l < s$) \textrm{\emph{return no} match} \\
+  \> \textrm{\emph{return}} $(m,o,l)$ \\
+\end{program}
+\caption{Algorithm \ref{alg:match}}\label{fig:match}
+\end{figure*}
+
+The fingerprint can be efficiently computed incrementally while
+advancing through the \emph{To} file.  The two characters entering and
+leaving the fingerprint range are used to advance the result in $O(1)$
+steps.  Locating string matches at each index takes, in the worst
+case, $O(s) = O(1)$ steps for a failed match and $O(\size(t))$ for a
+successful one, but the total number of steps expended during all
+successful matches is bounded by $O(\size(t))$.  Using the result of
+\S\ref{sec:greedy}, this gives a total time complexity of
+$O(\size(t))$ for scanning the \emph{To} input, plus $O(\size(F))$ for
+constructing the index.
+
+\xd {} uses the \texttt{adler32} fingerprint function originally used
+in gzip \cite{Rsync}.
+
+\subsection{Analysis}
+
+A large value of $s$ reduces the work done and space used by the
+algorithm, but will locate fewer matches.  Too small a value of $s$
+can lead to copies so small that they they are less efficient than an
+equivalent insert encoding.  This last consideration gives a lower
+bound on $s$:
+
+\begin{align}
+m (\iins{s}) &> m (\icpy{f}{o}{s}) \\
+8 s          &> \lceil{\lg k^d}\rceil + \lceil{\lg o}\rceil \label{eqn:s}
+\end{align}
+
+\noindent The right-hand-side of (\ref{eqn:s}) is bounded by $\lceil
+\lg \size(F) \rceil$, yielding $s > \frac{1}{8}\lceil \lg \size(F)
+\rceil$.
+
+Assuming the inputs, hash values, and fingerprint values have uniform
+distributions, the approximations made so far can be expected to
+perform well, as I will show.  The key insight is that if a long match
+fails at one position due to a hashing collision, then it is likely to
+succeed at the next matching offsets.  That is, a failure to match
+$t[i \ldots i+s-1]$ at $f_m[sk \ldots s(k+1)-1]$ because $(m,k)$ is
+collides in the hash table is not a disaster because the next matching
+pair $t[i+s \ldots i+2s-1]$ and $f_m[s(k+1) \ldots s(k+2)-1]$ may
+succeed.  The expected number of misses for a long match is
+proportional to the expected number of hash collisions, and therefore,
+the match is expected to fail asymptotically $O(1)$ times before the
+match is discovered.  This causes an expected degradation that is
+linear only in the number of instructions.
+
+The hash function and fingerprint function, composed, reduce segments
+in $F$ to integers less than $\records(F)$, which is chosen as the
+table size.  When a conflict occurs during hashing, the algorithm must
+choose a winner.  Several policies could be chosen.  For example, a
+match appearing first in a file is potentially more valuable to the
+matching procedure since it may locate a match that contains
+colliding matches that occur later in the same file.  Here, I will
+analyze a uniform random trial to decide whether to replace the
+incumbent record or not.  By selecting the winner at random, the
+distribution of the hashing functions discussed above is not altered.
+Contrary to this analysis, however, simpler policies that never or
+always replace the colliding record seem to work equally well.
+
+Another array $trials[i]$ is required to contain the number of
+collisions which have occured in the $i^{th}$ bucket.  The incumbent
+record or $\nil$ in bucket $j$ is replaced with probability
+$P(\textrm{\emph{replace}}) = \frac{1}{trials[j]+1}$.  The additional
+array increases the space required by the algorithm in
+(\ref{action-bound}) by at most a factor of $3/2$, since it brings the
+number of arrays from 2 to 3.  The probability $P_k(i)$ represents the
+probability of the $k^{th}$ record surviving the $i^{th}$ trial.
+Then,
+
+\begin{equation}
+P_k(n) = \frac{1}{k} \cdot \frac{k}{k+1} \cdots \frac{n-2}{n-1} \cdot \frac{n-1}{n} = \frac{1}{n}
+\end{equation}
+
+\noindent so the probability of survival is uniform.
+
+The string matching function \emph{fails} when a record that would
+have matched was discarded in a collision.  The probability of failure
+is determined by assuming the hash functions behave randomly and
+computing the expected number of hash collisions.  After hashing $M =
+\records(F)$ records into $N$ buckets, the expected number of of empty
+buckets is:
+
+\begin{equation}
+E(\emph{\# of empty buckets}) = N \left( 1 - \frac{1}{N} \right)
+\end{equation}
+
+\noindent By choosing $N=M$, the expected number of empty buckets, and
+therefore collisions, is asymptotically $N \inv{e} \approx 0.63 N$.
+The expected number of trials before a successful match is found is
+the expected number of failures $E(failed) = \frac{e}{e-1}$.  For
+files relatively large compared to $s$, the matching algorithm is
+expected to succeed after $\frac{e}{e-1}$ failures.
+
+In addition to losing matches from hash collisions, matches are lost
+from only searching at a fraction of the offsets in $F$.  For matches
+of length $l \ge s$, the match can be expected to be discovered at one
+of the $\lfloor \frac{l}{s} \rfloor$ interior points recorded in $F$.
+The first such point may be offset at most $s-1$ bytes from the true
+beginning, and the $q^th$ such point is located at most $s q + s - 1$
+bytes from the true beginning.  From the above, we expect $q =
+\frac{e}{e-1}$, so the approximations produce matches which are
+expected to shorter than their true length by $\frac{s e}{e-1} - s -
+1$ bytes due to hash collisions.  Thus, the expected penalty is linear
+in the number of copies, not the length of the inputs.
+
+\subsection{Inversion of Copy/Insert Deltas} \label{sec:invert}
+
+Given file $f$ and paired delta $d$ that computes $t$ from $f$, we
+would like to compute a delta $\inv{d}$ that computes $f$ from $t$.
+The solution will set up more general, direct delta manipulation in
+the next section.  One might possess $f$ and $d$, and want to inform a
+peer possessing $t$ how to construct $f$ by sending $\inv{d}$.
+
+\begin{alg}\label{alg:invert}
+Compute $\inv{d}$ from $d$ and $f$.
+\end{alg}
+
+I use a balanced interval tree to construct the reverse mapping for
+copy instructions in $d$.  The tree supports insertion, deletion, and
+location of elements in $O(\lg V)$ steps for $V$, the number of
+intervals (see, for example, Cormen, Leiserson, and Rivest
+\cite{clr}).  The program in Figure \ref{fig:invert} computes the
+interval table $R$.
+
+\begin{figure*}
+\begin{program}
+in\= ve\= rt\= Copies ($f$, $d$) \\
+  \> $i \leftarrow 0$ \>\> \hspace{6cm} \= $\triangleright$ \hbox{Current instruction in $d$.} \\
+  \> $o_t \leftarrow 0$ \>\>\>             $\triangleright$ \hbox{Current offset in $t$.} \\
+  \> $R \leftarrow \textrm{\emph{empth}}$ \>\>\> $\triangleright$ \hbox{Empty interval tree.} \\
+  \> while ($i < z^d$) \\
+  \>\> if ($c_i^d = \icpy{f}{o}{l}$) \\
+  \>\>\> $R([o_t \ldots o_t + l)) \leftarrow [o \ldots o + l)$ \\
+  \>\>\> $o_t \leftarrow o_t + l$; $i \leftarrow i + 1$ \\
+  \>\> else ($c_i^d = \iins{l}$) \\
+  \>\>\> $o_t \leftarrow o_t + l$; $i \leftarrow i + 1$ \\
+\end{program}
+\caption{Invert Copies in $d$ from $f$}\label{fig:invert}
+\end{figure*}
+
+Using \texttt{invertCopies} to construct $R$, $\inv{d}$ is constructed
+with an in-order traversal of $R$.  Each range $r$ records a mapping
+from $[o_f \ldots o_f + l)$ in $f$ to $[o_t \ldots o_t + l)$ in $t$.
+Each such range may be used to construct $\icpy{t}{o_t}{l}$.  Insert
+instructions are generated for all ranges not covered by $R$.
+
+The performance of this algorithm depends on $z^d$, $z^{\inv{d}}$, and
+the $\size(I^{\inv{d}})$.  First, however, $z^d$ and $z^{\inv{d}}$ can
+be related.
+
+\begin{thrm} \label{thrm:zrel}
+$z^{\inv{d}}$ is bounded according to:
+\begin{equation}
+z^{\inv{d}} \le 2 z^d + 1
+\end{equation}
+\end{thrm}
+
+{\sc Proof} Let $z^{\inv{d}}_i$ by the number of instructions in
+$\inv{d}$ as a function of the number of instructions $i$ processed so
+far in $d$.  Observe that $z^{\inv{d}}_0 = 1$, corresponding to a
+single insert instruction in $\inv{d}$.  In the worst case, each
+copied range may remove one existing instruction and create three; the
+induction hypothesis is $z^{\inv{d}}_{i+1} = 2 + z^{\inv{d}}_{i}$. \qed
+
+The algorithm given does not produce an optimal delta, however.  Its
+performance degrades when $t$'s copied segments overlap in $f$--the
+previous analysis also suffers from repeated segments of length
+greater than $s$.  Neglecting this case, the size of the delta is
+$\size(\inv{d}) \approx \size(f) - (\size(t) - \size(d))$.
+
+The \texttt{invertCopies} procedure executes a loop $z^d$ times, each
+requiring $O(\lg z^d)$ steps.  The final construction, given $R$,
+requires $O(z^{\inv{d}} + \size(I^{\inv{d}}))$ steps to compute the
+instructions in $\inv{d}$.  Together, and using the results of theorem
+\ref{thrm:zrel}, the algorithm requires $O(z^d \lg z^d +
+\size(I^{\inv{d}}))$.  This time bound is acceptable, since $z^d$ is
+expected to be small--it corresponds to the number of non-overlapping,
+longest matching substrings between $t$ and $f$.
+
+\subsection{Applying Copy/Insert Deltas}
+
+A simple implementation of \emph{apply} for copy/insert deltas is
+straightforward and requires $O(\size(t))$ steps to apply $d$.  The
+\emph{reconstruct} operation takes a number of deltas and applies them
+all at once.  Reconstruct accepts a tree of deltas in which each leaf
+is represented by a literal file and each internal node is represented
+by a delta, and constructs the file that the root node's delta
+constructs.  It can be easily extended to operate on DAGs.
+Reconstruct can be considerably more efficient than simply applying
+each delta in sequence.
+
+The technique for reconstruction resembles the inversion algorithm
+above.  Suppose that $t_r$ is being reconstructed from the delta tree
+rooted at $d_r$, where interior delta nodes are denoted $d_i$ and
+leaf, literal nodes are denoted $l_i$.  Algorithm
+\ref{alg:reconstruct} computes an interval tree mapping ranges in
+$t_r$ to the literal data it is ultimately constructed from: files
+$l_i$ and insert data $I^{d_i}$.  It computes in a bottom-up traversal
+of the tree.  A range $[l \ldots h)_{f,o_f}$ indicates the mapping
+from $[l \ldots h)$ to $[o_f \ldots o_f + h - l)$ in $f$, where $f$
+can also be the insert-data of some delta $I^d_i$, which is treated as
+just another literal file.  Finally, the computed interval tree for
+$d_r$ is used to write out the result in $O(\size(t_r))$ steps.
+
+\begin{alg}\label{alg:reconstruct}
+Reconstruct $t_r$ from $d_r$.
+\end{alg}
+
+The program for computing $t_r$ is given in Figure
+\ref{fig:reconstruct}.  The function \texttt{translate} translates the
+interval $[o \ldots o + l)$ from interval tree $R_f$ to interval tree
+$R_t$.  Each call to \texttt{reconstructRange} requires, in addition
+to the recursive calls, $O(z \lg z)$ steps and $O(z)$ space to insert
+$z$ ranges into the resulting interval tree.  For literal files, the
+call executes in constant time.  For each delta $d$, $z$ is bounded by
+$z^d$ times the maximum of the number of ranges in each child's
+interval map.
+
+The maximum number of ranges for delta $d_1$ due to the path $d_1
+\rightarrow \ldots d_n \rightarrow l_i$ is $\prod_{i=1}^{n}{z^i}$, but
+is bounded by $O(\size(t^{d_1}))$ since there are only so many
+intervals.  The worst case occurs when a copy instruction copies from
+a range being constructed from the child delta which includes the
+range of every copy instruction in the child, and is unlikely in
+practice.
+
+Let value $z^*$ be the maximum such product for $d_r$.  The
+intermediate storage required is the size of the largest interval
+table, which is $O(z^*)$.  The time to reconstruct $t_r$ from a tree
+of $n$ deltas is $O(n z^* \lg z^* + \size(t_r))$.  This time
+complexity will be further examined for the archival scheme based upon
+it which follows.
+
+\begin{figure*}
+\begin{program}
+re\= construct($d_r$) \\
+  \> $R$ = reconstructRange($d_r$) \\
+  \> fo\= r (increasing ranges $r = [r_l \ldots r_h)_{l_r}$ in $R$) \\
+  \>\> output the segment beginning at $r_l$ in $l_r$ \\
+re\= co\= ns\= tructRange($d_i$) \hspace{3cm} \= $\triangleright$ \hbox{for a delta} \\
+\> $R =$ \textrm{\emph{empty interval tree}} \\
+\> $o_i = 0$ \>\>\> $\triangleright$ \hbox{offset in $I^{d_i}$} \\
+\> $o_t = 0$ \>\>\> $\triangleright$ \hbox{offset in $t^{d_i}$} \\
+\> for ($f \in F^{d_i}$) \\
+\>\> $\intervals[f] =$ reconstructRange($f$) \\
+\> for (each instruction $c_i$) \\
+\>\> if ($c_i = \icpy{f}{o}{l}$) \\
+\>\>\> translate ($R, intervals[f], o, l$) \\
+\>\>\> $o_t = o_t + l$ \\
+\>\> else if ($c_i = \iins{l}$) \\
+\>\>\> insert ($R$, $[o_t \ldots o_t + l)_{I^{d_i},o_i}$) \\
+\>\>\> $o_i = o_i + l$ \\
+\>\>\> $o_t = o_t + l$ \\
+\> for ($f \in F^{d_i}$) \\
+\>\> free $\intervals[f]$ \>\> $\triangleright$ \hbox{no longer required} \\
+re\= co\> ns\> tructRange($l_i$)              \> $\triangleright$ \hbox{for a literal file} \\
+\> $R$ = \textrm{\emph{empty interval tree}} \\
+\> insert ($R, [0 \ldots \size(l_i))_{l_i,0}$) \\
+\> return $R$ \\
+\end{program}
+\caption{Reconstruct}\label{fig:reconstruct}
+\end{figure*}
+
+Observe that this procedure allows a version to be partially
+extracted.  The time complexity to extract a partial version of length
+$p$ is still governed by $\size(t)$ from the $z^* \lg z^*$ term, but
+only in the worst cast.  Otherwise, the additional $\size(t)$ term is
+reduced to $\size(p)$, which is potentially significant.
+
+\subsection{Experimental Results}
+
+Several programs for computing file deltas are compared to evaluate
+their performance relative to the copy/insert metric $m$ defined in
+\S\ref{sec:metrics}.  A total of 25584 file pairs that changed
+in the Linux kernel releases between versions 2.1.0 and 2.1.28 were
+used; both forward and reverse deltas were computed and the ratio of a
+program's delta size to the metric is plotted against the \emph{To}
+file size in Figure \ref{sizes}.  The results are averaged on the
+graph, with error bars indicating the standard deviation.
+
+For the purposes of this abstract, only the results \xd {} and
+\emph{vdelta} are shown.
+
+\medfigure{sizes}{Relative delta sizes.}
+
+For small files, \emph{vdelta} outperforms \xd, but as the file size
+increases its performance degrades.  In fact, \xd's relative
+performance continues to improve as input size grows, but the
+copy/insert metric was too expensive to compute for larger files so
+these results could not be included in the same plot.  The performance
+of \xd {}  and \emph{vdelta} are, therefore, directly compared in Figure
+\ref{bigsizes} for files from 25 to 30 megabytes in size.  These
+files were the tarred contents of each of the Linux kernel releases
+used above.  This test is especially relevant for determining how
+practical it is to release software package changes as a delta against
+the previous release, not on a file-by-file basis, but from the old
+package to the new package.
+
+\medfigure{bigsizes}{Delta sizes for large files.}
+
+The linear-space approach has paid off on large input files.
+\emph{Vdelta}'s delta size is close to the compressed size of the
+\emph{To} file for many of the files in Figure \ref{bigsizes}, little
+space has been saved over simply compressing the \emph{To} file.  This
+is likely to be a result of the constant-space assumptions failing,
+and because the contents of the files may have been reordered.
+
+\emph{Unfinished}.
+
+\subsection{Future Work}
+
+Improvements in the space required by multi-input delta functions are
+necessary future work.
+
+The reconstruct algorithm given has a similarity to the nearly linear
+time scheme presented for an editor with built-in version control by
+Fraser and Myers \cite{Myers:Editor}, though it does not directly
+apply.
+
+The results achieved by the \emph{vdelta} algorithm are very
+promising, but do not directly extend to all of the techniques
+presented here.  Along these lines, the techniques presented below
+suggest that considering the delta problem in isolation is not the
+best way to proceed.  There are strong connections to data compression
+and text retrieval, here; these can be taken advantage of when
+applying delta algorithms to particular application domains.
+
+\section{Versioned-File Archives}\label{sec:archival}
+
+A versioned file archive supports the \emph{get}, \emph{put}, and
+\emph{delete} operations.  \emph{Put} inserts a file into the archive,
+returning a name by which to retrieve it, and \emph{get} retrieves the
+file.  \emph{Delete} indicates that a file will never be required
+again and that it's storage may be reclaimed.
+
+The archive stores multiple versions of a \emph{family} of files that
+are expected to be similar.  Typically, an ancestry tree is imposed
+upon the archive; every version except the root has a parent.  Changes
+between parent and child are stored as a delta.  Requiring an
+application to know the ancestry proves difficult and inefficient, as
+this information is not always available and the storage model can
+lead to unpredictable performance.  This mechanism has succeeded
+because the version control utilities which use it trusts users make
+the right decision by understanding the model, version naming
+conventions, and performance implications.  Implementing efficient
+storage management on top of RCS, for example, proves difficult for
+these reasons \cite{MacDonald:1998:SCM}.
+
+The goal is to reduce the space required to store many versions in a
+family by taking advantage of their similarity and possibly their
+ancestry, while maintaining high performance and reliability for the
+\emph{get}, \emph{put}, and \emph{delete} operations.
+
+\subsection{Related Work}
+
+Compact, versioned-file archiving can be achieved by storing literal
+files along with delta chains or trees, but other solutions are
+possible.  Techniques for storing multiple versions have been studied
+and applied in several application areas: database management systems,
+programming language environments, version-control, and file-backup.
+
+Both SCCS and RCS store an ancestry tree of versions where each vertex
+represents a version and each edge represents a delta.  One version is
+stored as a literal file $L$ and the rest are reconstructed by the
+application of deltas to the literal file.  An archive using this
+organization often has unpredictable performance because the
+efficiency of an operation often depends on its distance from $L$.
+
+SCCS doesn't actually store a literal file with separate deltas, but
+merges them together.  Any version can be extracted in a single pass
+through the archive, collecting only those lines that are present in
+the version being extracted.  This requires time linear in the size of
+the archive, including all deltas, not the file being extracted.
+
+RCS improves upon this model by storing the literal file and deltas
+separately.  The literal file is chosen to be a particular leaf node,
+causing retrieval and insertion on other branches to be much more
+expensive than on the distinguished \emph{trunk}, which contains the
+literal file.  Accessing any other branch requires the application of
+a series of deltas---the reconstruct problem.  RCS builds a data
+structure representing a series of lines and applies each delta in
+succession.  Let $L$ be the sum of line counts for the deltas being
+applied.  Reconstruct requires at least $O(L \lg L)$ steps using a
+balanced tree, though RCS in fact uses an $O(L^2)$ algorithm for
+simplicity\cite{Yu:1994:LTS}.
+
+Rosenkrantz and Yu demonstrate a reconstruct algorithm requiring
+$O(L)$ steps by computing a special form of the insert/delete delta
+\cite{Yu:1994:LTS}.
+
+Severance and Lohman show how to use file deltas for the storage of
+versions of large objects in databases and, more generally, for
+implementing transactions \cite{Severance:1976:TODS}.  Alderson
+presents a space-efficient technique based on B-trees and file deltas
+that allows partial records to be retrieved without fully constructing
+the entire record, and for which the get operation has a predictable
+time-complexity for all versions \cite{Alderson:1988:JSE}.  Fraser and
+Myers demonstrate an editor with built-in version-control capabilities
+that uses AVL dags.  It too has a nearly linear-time reconstruct
+operation \cite{Myers:Editor}.  These other storage schemes apply
+equally well to the file-archiving problem as presented, but
+constructing an archive out of deltas allows for the efficient
+transfer of archive components.
+
+Burns and Long describe a technique for distributed backup based on
+delta compression \cite{Burns:Backup}.  Instead of a version tree,
+however, they use a technique called \emph{version jumping} which
+involves storing a number of \emph{clusters} consisting of one
+literal file and unit-length delta chains.  This allows them to
+guarantee a file can be reconstructed with only two file accesses,
+which is important when slow storage is used.  Analysis is performed
+to decide when a new literal file should be created, rather than a
+delta.
+
+%\subsection{Problems With RCS}
+
+%PRCS uses RCS to implement efficient storage for a higher-level
+%version control system.  During its development, many problems with
+%RCS were encountered.
+
+%The \emph{version tree} storage model is flawed for two reasons:
+
+%\begin{itemize}
+%\item It discriminates against versions which are not $L$'s direct
+%ancestors.  The cost of inserting or extracting a file depends upon
+%its ancestry, not its age.  This can often be integrated into the
+%application so that the user is aware of the penalties, as with RCS,
+%but just as often not.
+%\item Higher level version control utilities which do not wish to
+%present this implementation detail and performance penalty to the user
+%must arbitrarily choose new versions, as it cannot guess what the user
+%will do in the future from the previous insertion or retrieval
+%operations.
+%\end{itemize}
+
+%\noindent The semantics of a version tree do not make for a good
+%implementation of the required interface since the performance is
+%unpredictable.  In addition to problems with the version tree storage
+%model:
+
+%\begin{itemize}
+%\item The delta mechanism is line-oriented and therefore unacceptable
+%\item Until the recently there was no complete library implementation
+%of RCS.  Even so, the interface is cluttered by features implementing
+%a particular version control policy
+%\item Archive compression is expensive to achieve, since RCS does not
+%directly support compression.  An archive could be compressed in such
+%a way that only the necessary portions needed uncompression
+%\item There is no guarantee that deleted space is reclaimed.  A
+%version may remain necessary because it is on a path linking other,
+%live versions.  Though it may be desirable to automatically discard
+%versions as they reach a certain age, this restriction makes it
+%difficult.
+%\end{itemize}
+
+%\noindent These considerations and more to come called for a new
+%archival technique.
+
+\subsection{File Archiving With \xd}
+
+The \xd {} archive organization was originally designed as a
+replacement for RCS to be used in a distributed version control
+system.  It stores a DAG of both literal files and deltas.  Using an
+extension to the techniques discussed in \S\ref{sec:delta}, it
+also allows new versions to be efficiently transferred between
+archives as deltas.  The internal organization is described here, and
+network communication is described in the next section.
+
+\xd {} does not depend on a file's ancestry for organizational
+purposes.  The archive consists only of a series of versions in
+increasing order of age.  As branches of the family tree diverge, even
+though deltas between a version and its parent may be small, deltas
+between two leaves of the family tree may be quite large.  Therefore,
+storing deltas in a simple series threatens to be quite inefficient
+since these \emph{branch-crossing} deltas between leaves may require
+much more storage than the equivalent encoding using only deltas
+between parent and child.  However, performance is critical, so
+storing versions as a simple series is appealing because it makes the
+time to retrieve a version to grow with its age, not as a function of
+its ancestry.
+
+This suggests the organization of the \xd {} archive--simply a series
+\emph{clusters} as in the \emph{version-jumping} technique.  The
+organization allows the time to retrieve any version to be bounded,
+while still addressing the diverging branch issue, using a combination
+of version-jumping and DAGs of deltas.  When the time to retrieve the
+eldest version in a cluster reaches some threshold, its growth is
+halted.  As with version-jumping, new literal files are occasionally
+introduced into storage to maintain several invariants.
+
+\bigfigure{dependency}{Sample \xd {} Cluster}
+
+When inserting a version, either a \emph{forward} delta is inserted to
+produce the new version from the most recent literal file in the
+archive, or the new version becomes the literal file and a
+\emph{reverse} delta replaces the previous literal file.  The decision
+to choose one over the other will be addressed later.  In either case,
+the contents of the insert-data of recent deltas are used as
+additional sources for \emph{copy} instructions for the new delta, as
+illustrated in Figure \ref{dependency}.
+
+\bigfigure{onestep}{Sample Deltas}
+
+Figure \ref{onestep} illustrates the process on eight string versions
+$F1 \ldots F8$.  The one literal file is $F7$.  For demonstration, the
+example uses a simpler delta algorithm that only copies similar
+characters when they occur at the same offset in both files.  In a
+realistic example, each character would also be represented by a
+longer, matching segment.  The first column represents the full text
+of each string; these strings were derived according to the ancestry
+tree in Figure \ref{strings}--each parent-child relation contains at
+least six matching characters.
+
+\bigfigure{strings}{String Relations in Figure \ref{onestep}}
+
+When the first version is inserted into the archive, it becomes the
+literal file.  Subsequent versions produce reverse deltas for some
+period of time until the time to extract the first file becomes
+excessive, at which point the literal file is \emph{frozen}.  Forward
+deltas may then be inserted until the storage efficiency degrades, as
+measured by relative delta size, for example.
+
+The time required to insert a version is always just the time to
+compute a single delta.  Deletion requires $O(1)$ time.  Retrieval is
+implemented with reconstruct, whose time complexity is $O(n z^* \lg
+z^* + \size(t))$ to compute version $t$ from $n$ deltas, where $z^*$
+is bounded by the maximum product of the instruction counts on all
+paths from root to leaf and also by $\size(t)$.  Even assuming a small
+number of changes in each version, the time to retrieve a version is
+still $O(n \size(t))$, which is an unacceptable rate of growth, left
+unchecked.  The maximum depth of a reverse delta DAG effects the time
+required to retrieve the oldest version in a cluster, and therefore
+determines when the literal file should be frozen.
+
+Burns and Long show that version jumping does not result in a great
+loss of storage efficiency \cite{Burns:Backup}, and derive a
+worst-case analytic point at which storing a new literal file should
+be introduced as a function of the \emph{compressibility}, or
+fractional size, of the delta.  A simple heuristic for deciding to
+introduce a new literal file is used: introduce a new literal file
+when inserting a delta will increase the compression ratio of the
+cluster measured as the total size of all versions divided by the
+total size of all deltas and the literal file.  The cycle of reverse
+deltas, followed by a literal file, followed by forward deltas,
+followed by a version jump repeats indefinitely.
+
+%The storage efficiency in \xd {} is improved over the version jumping
+%scheme, and slightly different, since previous deltas' insert-data
+%were not used in Burn's calculations--these only improve forward delta
+%storage efficiency.
+
+In Figure \ref{onestep}, the columns illustrate the relation between
+each file and the delta that constitutes it.  In the control and
+insert-data columns, a shaded region indicates that the text is either
+copied or inserted at that position in the file.  In the control
+column, two shadings are used to distinguish copies from the
+subsequent literal file and copies from previous deltas.  For
+instance, the characters \texttt{EN} in \texttt{ESSELENIAN} are copied
+from the insert-data segment of the delta representing
+\texttt{DISELENIDE}.  The \texttt{DIS} in \texttt{DISELENIDE} is
+copied from the literal file \texttt{DISULPHONE} which follows it.
+This illustrates how using previous deltas handles diverging files.
+The intervening insertion of \texttt{DISULPHINE}, on a different
+branch, does not disturb the encoding efficiency.  The number of
+previous deltas used must be somehow chosen and limited in number.  A
+window size $w$ is chosen according to available space.  Increasing
+$w$ promises more available matches, but at the same time unrelated
+data threatens to evict matching data from the hash table.  The
+previous deltas chosen are the most recent, but other strategies for
+locating possibly related files can be used.  The ancestry of a
+version can be used, in addition, to select the most recent delta
+computed \emph{to} an ancestor of the one being inserted, it is likely
+related.
+
+In addition to these properties,
+
+\begin{itemize}
+\item \xd {} uses an efficient, non-line-oriented delta mechanism
+\item The archive can trade time for space by precomputing and
+adjusting the delta DAG depth
+\item The number of deltas that must be applied to retrieve a version
+is proportional to the number of put operations since that version was
+created; RCS does not have this property, for example
+\item Knowledge of a versions ancestry is not required for
+organizational purposes
+\item Partial compression is possible--older versions may be
+compressed without affecting the retrieval time of newer versions, and
+when combined with precomputed indices, they may be lazily
+uncompressed
+\item Obsolete deltas may be simply deleted as soon as no other live
+deltas reference their insert-data.
+\end{itemize}
+
+%\item Higher level tools are free from organizational concerns when a version's ancestry is unavailable
+%\item The implementation was designed for use as a library, and includes no policy
+
+\subsection{Experimental Results}
+
+\emph{Unfinished}.
+
+%%Ideally: Compare storage, put, and get measurements for my scheme
+%%vs. version jumping vs. forward/reverse chaining vs. store each.  on
+%%branch, off branch, other positions.  compressed or uncompressed.  On
+%%two random, evolving files, then on the FreeBSD source dir.
+
+%%Begin with an RCS file.
+%%Run once compressed, once uncompressed.
+%%Have an API for each checkin.  One client per policy.
+%%The API computes the scores.
+
+%An experiment was done comparing the RCS and {\sc Xdelta} archives for
+%each of the RCS files extracted from FreeBSD's CVS repository in the
+%\texttt{src/sys/vm} subdirectory, taken on May 3, 1998.  The
+%collection totaled 35 files and 1608 versions, of which only 134
+%versions were off the RCS trunk.  The average number of versions per
+%file is 45.9, with a standard deviation of 39.6.  The resulting
+%uncompressed archive sizes are as follows:
+
+%\begin{center}
+%\begin{tabular}{|l|l|} \hline
+%Archive size & (bytes) \\ \hline
+%RCS          & 1617850 \\ \hline
+%{\sc Xdelta} $(w=10)$ & 1686808 \\ \hline
+%\end{tabular}
+%\end{center}
+
+%Due to space limitations in the abstract, more complete results are
+%omitted.  The results show that the new scheme is not much worse than
+%RCS in terms of storage space, yet the \xd {} archive can exploit
+%compression, where RCS cannot.
+
+%The results show that for an uncompressed archive, the performance of
+%{\sc Xdelta} is not much worse than RCS.  However, {\sc Xdelta} is
+%capable of efficiently operating on compressed archives and RCS is
+%not, so the advantages seem to outweigh the disadvantages.  The
+%difference in compressed archive sizes is so great because the
+%compression of many small files is not likely to be as good as the
+%single compression of one large file.
+
+\subsection{Future Work}
+
+Delta compression techniques have proven successful, but archival
+techniques have received little exploration.  As computers become more
+and more dependent upon network communication and distributed data,
+distributed file-archival techniques will increase in importance.
+
+A popular method for viewing the history of a version-controlled
+document involves attributing each line with the name of the author
+and how recently it was changed or introduced.  Directly constructing
+such an annotation from copy/insert deltas is not as
+straight-forward, and more difficult to present since it is not
+line-oriented.  Another type of annotation allows a file to be viewed
+in a particular context, allowing not only how each line was authored,
+but the author of the next modification or deletion.  More advanced
+tools for viewing (or querying) relations between files in a
+file-archive are needed.
+
+The windowing technique technique presented for determining a set of
+input files could be replaced with a coarse text retrieval algorithm
+to determine the set of files likely to contain substrings of the
+output file.
+
+\section{Distribution Protocols}\label{sec:distribution}
+
+There is a broad class of applications that operate on large
+quantities of data, often highly similar or version controlled, and
+need to move that data across slow networks frequently.  Delta
+compression can be used both for versioned file archival, for reducing
+network transmission, as a network data cache.  The effort required to
+implement these operations efficiently, however, is considerable, and
+has hindered advances so far.  In this section, I propose a simple,
+yet powerful, abstraction for the purposes of constructing application
+protocols, according to the following considerations:
+
+\begin{itemize}
+\item Data should be named by content.  The MD5 checksum
+\cite{RFC1321}, for example, can be used to name a file; doing so
+removes the need for any global consistency.
+\item Versions are read-only and should be highly available; therefore
+replication is required
+\item Disk space is more available than network bandwidth
+\item A moderate amount of computation for each client connection is
+permitted, but should be minimized
+\item Compressing data on a per-connection, per-transfer basis heavily
+loads a server, and is undesirable, as evidenced by the maintainers of
+popular CVS servers \cite{mozillaCvs}
+\item Each server should be autonomous, so there are no global
+consistency issues; deltas must be receivable out of order
+\item Servers must be allowed to store disjoint sets of files
+\item Servers should transfer files using a minimum of network
+bandwidth
+\item Pairwise peer synchronization should be used to exchange archive
+contents; at the application level, synchronization can be pushed or
+pulled, since the protocol is symmetric
+\item A server should be easily usable as a proxy-cache.
+\end{itemize}
+
+\noindent A scheme that allows the direct exchange of pre-compressed
+deltas is desirable.  Each archive maintains a set of versions for
+each family in a hierarchically named set of file families.  The
+application is responsible for deciding which files should be stored
+at each server.  The underlying storage mechanism only provides
+efficient delta-storage and push/pull delta-transfer.  Aside from
+efficiency issues, this type of service resembles the operation of
+NNTP servers for news transport as described in RFC 1036
+\cite{RFC1036}.  This is a nice abstraction for building application
+servers; an application may co-reside with a distribution server,
+leaving the details of efficient transfer to the abstraction and only
+implementing application specific control and policy.  Since the
+service can be easily proxied, it reside on a client machine or a slow
+network boundary.  This allows all the details of efficient transport
+to be left to a decentralized, and thus locally administered, service,
+so client to server protocols need not be effected.
+
+All of this requires a small modification to the copy/insert delta
+format, described next.
+
+\subsection{Normalized Copy/Insert Deltas}
+
+According to the above list of considerations, each server may store a
+different set of files, and have received them in a different order
+from everyone else.  Deltas depending on the insert-data of other
+deltas, however, cannot be easily exchanged because a server's peer is
+not guaranteed to have the same set of deltas, or to have received its
+versions in the same order.  A \emph{normalized} copy/insert delta
+includes additional information to avoid this problem.  The header for
+delta $d$ names each dependent file $f^d_i \in F^d$ by its MD5
+checksum.  Additionally, when $f^d_i$ is the insert-data of delta
+$d_i$, it also includes the MD5 checksum of the file constructed by
+$d_i$, $t^{d_i}$.  An alternate sequence of copy instructions is
+included for each copy instruction in $d_i$, allowing the copy to be
+performed either from the insert-data of the delta or the literal
+file, whichever is available.  This allows, in many cases, a server to
+send its peer a version by simply sending its existing delta, perhaps
+pre-compressed.
+
+These modifications increases the cost of a copy instruction by a
+small constant factor, except in pathological cases where one version
+contains literal copies of another delta in the archive.  A single
+copy instruction may be followed by one or more normalized copy
+instructions because copies from the insert-data of a delta may be
+fragmented in the file it constructs.
+
+\subsection{Related Work}
+
+Douglis and others have studied the addition of delta compression to
+\texttt{http} \cite{SIGCOMM97*181}.  Their results are encouraging,
+showing substantial decreases in both end-to-end latency and network
+transmission for several delta transfer strategies.  There is an
+official W3 Consortium proposal for the distribution and replication
+of \texttt{http} \cite{w3}.  It includes the specification of a
+standard copy/insert delta format for exchange \cite{gdiff}.  The
+protocol includes extension for replicating content versions using
+delta transfers.  Content is also named by a configurable message
+digest, such as MD5.  This work has not dealt directly with
+implementation issues, but has specified an exchange protocol.
+
+The \emph{rsync} algorithm, due to Tridgell and Mackerras, is for
+remotely synchronizing the contents of a pair of files \cite{Rsync}.
+It does this using a computation similar to algorithm
+\ref{alg:generate}, but transfers a table of checksums for one file to
+the peer who performs string matching in the other file using MD5
+checksums rather than direct string comparison.  The peer then replies
+with a request for the list of blocks that it is missing.  This is
+quite effective for synchronizing files between two peers that do not
+share any versions in common.
+
+\emph{CVSup} \cite{Polstra96} is a distribution protocol for CVS that
+globally synchronizes the contents of client CVS repositories with a
+mirror or the master repository.  This is accomplished primarily by
+decomposing RCS files in the repository and transferring only the
+deltas that are missing on the client side.  This model requires
+centralized control.
+
+\subsection{A Distributed Archive}
+
+A distributed archive consists of a network of autonomous archives as
+described above.  An application is responsible for controlling each
+archive appropriately.  I'll analyze a simple arrangement first, as it
+demonstrates an important special case.  Once the simple arrangement
+has been described, I will extend the results for less constrained
+circumstances.
+
+Suppose that for a file family being archived, the policy of the
+application running on client $S_c$ is to replicate every version in
+server $S_s$.  Then $S_s$ can efficiently send $S_c$ new versions as a
+delta with little computation.  Only the literal file, for which no
+delta is immediately available, requires processing, and the result
+can be cached.  If the version being sent is already available as a
+delta, it can just be sent.  If the distributed storage can be
+arranged as a tree in which each child replicates at least its
+parent's set of versions, this situation applies.
+
+All of this relies on the normalized delta--it allows copies from both
+a \emph{site-specific}, readily available segment and a
+\emph{universal}, but perhaps not physically present, segment.  When
+transferring a delta the site-specific segment may be missing at the
+receiver.  All the sender need do is verify that the receiver can
+construct each of the necessary universal segments, allowing it to
+internalize the delta by translating it to depend upon its own
+site-specific segments.  The client, therefore, is responsible for the
+majority of the work required to receive.  Suppose that before
+synchronization $S_c$ contains the set of versions $F_c$, and $S_s$
+contains the set of versions $F_s$.  $S_c$ requests a transfer of the
+difference $F_t = F_s - F_c$.
+
+\begin{clm}
+For each version $f$ to be sent, if $S_s$ is storing $f$ as delta
+$d_f$ it can simply send $d_f$.  Otherwise $f$ is stored as a literal
+file, and $S_s$ can compute and send a forward delta $f \ominus f_c$,
+for some recent $f_c \in F_c$.
+\end{clm}
+
+{\sc Proof} Each delta that was sent must be applicable by the
+receiver after the complete transmission.  Since the client requested
+all versions, those that were stored and sent as deltas depend on
+either a version that the client already has, one of the other deltas
+that was sent, or a literal file for which a forward delta was sent.
+Since the forward deltas that were computed depend only on versions
+already in $F_c$, no cyclic dependencies are introduced at the
+client. \qed
+
+Assuming archives synchronize with each other with period $p$ and
+versions are deleted when their age surpasses $a$, then an archive may
+pre-compute only a single, forward delta for each literal file in the
+archive.  The \emph{From} input for this computation should be the
+first version whose age is greater than $p$ and less than $a-p$.  Each
+server can also keep a record of its peers' contents to allow
+incremental log updates and each archive to compute a forward delta
+that the greatest number of its peers will be capable of applying.
+
+\subsection{Arbitrary Policies}
+
+The previous section dealt only with the case where the client's
+policy is to archive every file archived by the server.  This special
+case allows many new deltas to be sent uninterpreted because the
+client replicates every version in the server.  The case of a literal
+file is no different, but when a server must send an existing delta to
+a peer replicating fewer versions than itself, it must translate out
+the peer's missing references before sending.  Suppose that $S_c$
+requests $F_t$, where $F_t \cup F_c$ is a subset of the server's set
+of files $F_s$ and therefore $S_s$ may not be able to directly send a
+delta.
+
+Computing such a delta is essentially similar to the reconstruct
+operation.  First, \texttt{reconstructRange} is used to construct an
+interval tree $R$.  Each copied range in $R$ is used to either
+construct a copy instruction, if $S_s$ has the necessary reference, or
+is translated into an insert instruction if $S_s$ does not have the
+reference.  This procedure reduces to the above special case when the
+client has requested every file that the server contains.  Again, the
+time complexity does not directly depend on the size of the version
+involved, but on the number of changes and deltas between them.
+
+\subsection{Receiving Normalized Deltas}
+
+It is guaranteed that when an archive receives a delta from a peer, it
+can apply that delta, though not as efficiently as possible.  In fact,
+\texttt{reconstruct} will operate as given by simply using the
+normalized copy indices when a segment is missing.  However, the
+reconstruct algorithm given assumed that all cross-edges in the DAG's
+depth-first-subtree were directed at literal files, allowing the
+recursive algorithm to free a node's interval table immediately after
+its parent has used it.  Foreign deltas do not maintain this
+invariant; so an efficient implementation of \texttt{reconstructRange}
+must instead compute interval trees in a bottom-up DAG traversal; each
+node's interval tree can be discarded after each parent's
+interval-tree has been computed.  This increases the space required by
+the algorithm by, at most, a factor of 2, since one additional
+interval-tree may required.
+
+Given an implementation of \texttt{reconstructRange}, a delta can be
+internalized by computing the range table mapping copy ranges to local
+segment ranges, and re-generated as in algorithm \ref{alg:invert}.
+
+\subsection{Future Work}
+
+I have implemented the system described as the basis of a distributed
+version-control system.  The synchronize operation is extended to use
+the \emph{rsync} algorithm when peers share no files in common, and to
+send the literal file when one peer contains no files.  Future work
+will include a complete experimental analysis of the system's
+performance and behavior.  Making such an archive operate securely and
+with minimum trust requirement is a future challenge.
+
+\section{Conclusion}
+
+The file delta problem and several applications have been examined.
+Many applications desires both compression, differential compression,
+and other features which complicate the direct application of
+available delta algorithms.  These additional considerations
+influenced the design of a new system with a new delta algorithm.
+
+The \xd {} delta algorithm requires linear space, but requires less space
+than the size of the inputs, meaning the algorithm is feasible for
+files which are required to reside in memory by other applications.
+The algorithm trades space to improve delta size, and approximates the
+exact algorithm to reduce execution space and time.  It handles
+multiple inputs, a subject which has not previously been studied, and
+performs especially well on large inputs.
+
+The \xd {} archiving scheme was designed as a replacement for RCS with
+network distribution in mind.  It replaces the ancestry tree with a
+serial model using a combination of version-jumping, forward deltas,
+and reverse deltas.  Multiple \emph{From} inputs are used when
+computing deltas, allowing the contents of more than one previous
+version to be referenced by copy instructions.
+
+Finally, a scheme for decentralized network file archiving was
+presented.  The copy/insert delta encoding is altered so that each
+copy instruction is replaced by two sets of instructions, allowing a
+two machines to directly exchange deltas without any computation in
+some cases.  I propose the distributed file archive as a abstraction
+for efficiently implementing certain types of distributed
+applications, such as version-control, software-update, groupware, and
+\texttt{http} caching and replication.
+
+\bibliography{dcc99}
+
+\end{document}
diff --git a/xdelta1/doc/old/dcc99/dead.code b/xdelta1/doc/old/dcc99/dead.code
new file mode 100755
index 0000000..340b151
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/dead.code
@@ -0,0 +1,518 @@
+The first technique for computing file deltas was based upon finding
+the longest common subsequence (LCS) of two files \cite{Hunt77}.
+Improvements to the file delta problem have been influenced by
+compression techniques, but have been much slower in being adopted for
+file-archival and transmition, perhaps because the market for such
+improvements has been small.  Recently, these techniques have become
+feasible and the growth of the internet has renewed interest in these
+approaches.
+
+Systems for distributed file-backup have been built upon the storage
+of file deltas \cite{Burns:Backup}, this work applies for a single,
+centralized server.  Protocols for the delta-based distribution and
+replication of \texttt{http} have been proposed \cite{w3}.  The
+present work describes a decentralized protocol with several features
+required for an efficient implementation.  These compressed transport
+protocols have applications to version control, file backup,
+\texttt{http}, software update, groupware applications, and many more.
+
+
+\begin{appendix}
+\section{Optimality of Algorithm \ref{alg:generate}} \label{app:proof}
+
+This is B.S.
+
+You know that the new encoding is not optimal because copies are not
+unit cost.  BUT, we do know that this encoding is no more than a
+factor of $min(s)$ greater than a similar metric for the unit-cost
+solution.
+
+Also, for the min copy length solution, its another factor of $s$
+worst, PER INSTRUCTION, this is good.
+
+The proof uses the number of copy instructions encoded by a greedy
+algorithm $g$ and an optimal algorithm $h$ for prefixes of the file
+being constructed.  $g_i$ and $h_i$ are partial solutions which
+consist of a sequence of instructions which contains exactly $i$ copy
+instructions and no more than $i+1$ insert instructions.  $m$ is the
+copy/insert metric for delta size developed in section
+\ref{sec:greedy} and $e(g_i)$ denotes the sum of the length operands
+to each instruction.  Initially, we know:
+
+\begin{align}
+m(g_0) &= 0 \\
+m(h_0) &= 0 \\
+e(g_0) &= 0 \\
+e(h_0) &= 0
+\end{align}
+
+\noindent and the following lemma:
+
+\begin{lemm}
+Suppose that $e(g_i) = e(h_j)$ and $m(g_i) \le m(h_j)$.  Then for all
+$k>i$, $l>j$ such that $e(g_k) = e(h_l)$, $m(g_k) \le m(h_l)$ must
+hold.
+\end{lemm}
+
+\noindent {\sc Proof} This is demonstrated by case analysis.  FILL ME
+IN: PICTURES HELP!
+
+\end{appendix}
+
+
+
+
+A distributed \xd {} file-archive is set of \xd {} file-archives.  These
+archives may require significant space, and should be placed at the
+border of a slow network link to reduce communication across the slow
+link.  The archive stores multiple file families named in a
+hierarchical fashion.  Versions inside a particular family are named
+by their MD5 checksum.  The contents of each of the archives may be
+disjoint--the application must decide at each particular node which
+versions of which families should be stored, but the distributed
+archive does not, as presented, require any centralized control.
+
+This model suggests a two-level transport protocol: an efficient
+server-to-server communication is used to reduce transport over slow
+links, while a simpler protocol is used for the client-server
+interaction.  This greatly reduces application complexity, and fits
+common network topologies--server-proxies should be placed at the
+gateway between a high-speed LAN and a slow internet or modem link.
+
+A \emph{synchronize} operation between two servers allows them to
+exchange each other's state and request copies of desired files.
+Since it is a symmetric operation, it allows for both push and pull
+configurations.  The goal is to implement synchronize efficiently and
+minimize network transfer.
+
+There is an immediate obstacle.  Since the set of files and order they
+were received in may differ on each server, they cannot simply
+exchange their deltas.  We would like to synchronize servers by
+exchanging as many un-interpreted files as possible, as they can be
+efficiently copied to the network.  Ideally, each server would simply
+send a precomputed delta for each file the peer is lacking, but the
+deltas cannot be easily exchanged because they depend on \emph{other}
+deltas which the peer may not have.
+A \emph{normalized copy/insert delta} contains additional information
+for each instruction which copies from another delta.  Each delta
+contains the MD5 checksum of each input file, and for each input file
+which is also a delta, the MD5 checksum of the file the delta
+represents.  This allows the normalized delta $d_1$ which copies from
+another delta $d_2$ to be applied by someone who posseses either the
+actual delta $d_2$ or the file which $d_2$ constructs.  The copy
+instruction for $d_2$ is followed by an alternate instruction sequence
+to be used when $d_2$ is not present, these index the actual file.
+
+
+A normalized copy/insert delta can be transmitted if the receiving
+peer will, at the end of the transmission, have enough files to apply
+it.  The resulting protocol places most of the computation required to
+accept a new file version on the receiver-side of the connection.
+
+At synchronization, each server sends an incremental log update of
+file additions since the last synchronize.  Global deletion policy
+must be handled by the application.  After synchronizing logs, each
+server transmits a list of file versions it wants to receive.  For
+each family requested, the server knows: $S$, the set of versions it
+has; $P_b$, the set of versions the peer has before the transfer; $W$,
+the set of files the peer wants; and $P_a = P_b+W$, the set of files
+the peer will have after the transfer.  Then, for each file $f$ in
+$W$, it computes a strategy for sending $f$:
+
+\begin{itemize}
+\item If $f$ is not stored literally, then it is stored as a reverse
+delta $d$.  If $P_a$ contains every MD5 checksum that $d$ depends on,
+then send the literal delta (or a pre-compressed copy).
+\item If $f$ is stored literally, and $P_b \cap S \not = \emptyset$, a
+forward delta must be computed for sending the peer.  The server is
+required to reconstruct a recent version which the peer has then
+compute the forward delta.  This forward delta may be cached, and the
+number of such forward deltas required is limited by how recently its
+peers last synchronized.
+\item If $S$ and $P_b$ contain no common elements and $P_b$ is not
+empty, the rsync algorithm may be applied.
+\item Otherwise, the literal file must be sent.
+\end{itemize}
+
+For a peer who's policy is to request every file version in $S-P_b$,
+sending $n$ file versions from the same family always results in
+sending at least $n-1$ pre-computed deltas and at most one forward
+delta (which can be cached).  This suggests that a tree network
+topology where each file archive contains at least the contents of its
+parent will produce efficient delta transfers.
+
+
+
+
+
+
+
+
+
+
+
+Network transmissions can be reduced in size by sending file deltas
+rather than literal files.  It can improve protocols for file-backup,
+software-update, distributed version-control, and http.  This section
+will describe a protocol for the efficient peer-to-peer
+synchronization of two \xd {} file archives.  This suggests a framework
+for implementing the server and proxy-cache of a generic application
+requiring delta communication, high availability, and replicated,
+compressed file-archival.
+
+
+There are two modes of operation possible, one when forward deltas are
+being inserted and one
+
+Instead of using a version tree organization, it stores only the
+youngest version of the file family and reverse deltas.  Since there
+are no branches, each version of a file is simply identified by a
+serial number.  The deltas computed are not the same as the reverse
+deltas used in RCS, instead they are computed from the set consisting
+of the youngest file and a window of previous deltas' insert-data to
+the second youngest file.  Figure \ref{fig:onestep} illustrates this
+process.  Each delta encodes the residual data required to construct
+it from the deltas which came before it and the version which follows
+it in time.  Suppose the archive $A$ consists of an ordered set of $n$
+versions labelled $a_i$.  For each $0 \le i < n-1$, $a_i$ is stored as
+a delta $d_i$, otherwise it is stored as the literal file $a_{n-1}$.
+Logically, the $A$ contains each of $n$ files, but is physically
+stored as $n-1$ deltas and a literal file.
+
+\begin{equation}
+d_i = generate ( \left\{ d_j | j < i \wedge j \ge i-w \right\} \cup a_{i+1}, a_i )
+\end{equation}
+
+Here, $w$ is the \emph{window-size} parameter, and limits the number
+of deltas presented to {\tt generate}.  Conceptually, files are
+retrieved by the repeated application of these deltas.  The $i^{th}$
+version put into an archive of $n$ versions requires the application
+of $n-i$ deltas.
+
+$O(\underset{\textrm{\emph{all paths}} d_r \rightarrow d_1 \rightarrow \ldots d_n \rightarrow l_i}{\max} 1)$.
+
+The implementation of apply is straightforward.  Reconstruct can be
+made quite efficient.  When multiple from inputs are allowed to the
+delta algorithm, a delta chain measured in length becomes a delta-dag
+measured in depth.  For the purposes of analysis, let $copies(d)$ be
+the number of copy instructions in delta $d$, $inserts(d)$ be the
+number of insert instructions, and $instructions(d)$ be the sum.
+
+An interval tree $intervals(d)$ can be built for locating the
+instruction of a particular offset in the file $d$ constructs.  In
+addition, it maps each insert-instruction into an appropriate offset
+in the delta's insert-data.  Constructing the interval table requires
+in $O(instructions(d) \lg instructions(d))$ steps and
+$O(instructions(d))$ space \cite{clr}.
+
+A recursive function Reconstruct-Range outputs
+
+$(d_i, r_l, r_h)$
+outputs a range $r_l \ldots r_h$ from file $f_i$ which is represented
+by delta $d_i$.  $f_0$ is represented by a literal file.
+
+Reconstruct-Range(
+
+
+
+
+
+For each instruction in $d_i$ containing elements in the range,
+
+\begin{itemize}
+\item If the instruction is $\texttt{copy} \; f_k \; o_k \; l_k$ and
+$k > 0$ recurse on the appropriate offset and length in $d_k$,
+otherwise copy the appropriate range out of the literal file $f_0$.
+\item If the instruction is $\texttt{insert} \; l$, output the
+appropriate range in $d_i$'s insert-data.
+\end{itemize}
+
+It takes $O(\lg instructions(d))$ steps to locate the instruction
+containing $r_l$.  If the instruction is {\tt copy},
+
+
+We can compute $reconstruct(d_1 \ldots
+d_n)$ with the following function:
+
+\begin{tabbing}
+reconstructRange (d, o, l) \{ \\
+  /* Output length $l$ beginning at offset $o$ from the file \\
+   * which delta $d$ constructs. */ \\
+\\
+  while (l > 0) \{ \\
+    $i \leftarrow \emph{instruction containing} o$ \\
+    if ($i = \texttt{copy} \; f \; o_f \; l_f$) \{ \\
+      reconstructRange (deltaWhichConstructs(f),
+
+
+
+\end{tabbing}
+An additional operation $index$ precomputes an index for the set of
+input files the {\tt generate} operation will later use.  The $index$
+operation computes the $adler32$ function on short segments of each $f
+\in F$.  The checksum length $l$ is chosen as a small power of
+2--values of between $2^4$ and $2^7$ have been used.  An array of
+checksum values $c_{f}[i]$ is built for each $f$ where $i$ indexes the
+checksum beginning at an offset $il$.  For each distinct set $F$ that
+will be used during {\tt generate}, an additional hash table is built.
+The table $t_F$ contains the data $(f,i)$ for each checksum offset $i$
+in $f$ keyed by $c_{f}[i]$.  The table is easy to compute from the $c$
+arrays so it is often left until {\tt generate}.
+
+During {\tt generate}, the file $t$ is scanned.  At each offset $j$
+the same checksum is computed and tested in the table.  When a match
+for $(f,i)$ is found the files are compared at offset $f$'s offset
+$il$ and $t$'s offset $j$.  A record of the match is constructed out
+of the longest matching substrings of $f$ and $t$ at those alignments.
+These records are used to emit a sequence of instructions for
+constructing $t$ from $p$ and $F$ and the scan is resumed after the
+match.  For each match $(f, t, i, j)$ a {\tt copy} instruction is
+emitted, and for each range $k..l$ that was not matched an
+{\tt insert} instruction is emitted along with the missing segment.
+
+\subsection{Encoding}
+
+% informal here...
+
+So far, the issue of encoding has not been raised.  Since there are
+many encoding approaches and I must choose one to measure with, I will
+define a class of {\tt generate} functions that produce patches for
+the pre-defined instruction set of a standard apply function.  This is
+a fair assumption, as it has arisen in practice \cite{w3} and since it
+is simple to implement {\tt apply}, making applications of the delta
+algorithm easier to write and standardize.
+
+Abstractly, the \emph{copy/insert} class of deltas are represented by
+a sequence of instructions and a segment, {\tt insert-data}.  For
+these deltas, {\tt apply} constructs its output by executing a
+sequence of the following instructions:
+
+\begin{itemize}
+\item {\tt copy} $f$ $o$ $l$
+
+Copy $l$ bytes at offset $o$ of file $f$ into the output file.
+\item {\tt insert} $l$
+
+Read $l$ bytes from {\tt insert-data} and insert them into the output
+file.
+\end{itemize}
+
+For reasons that will be discussed in the following section, \xd
+encodes deltas in two seperate parts: the control instructions, and
+{\tt insert-data}, the concatenation of each {\tt insert}
+instruction's data.  This turns out to be useful in two ways: {\tt
+insert-data} may be treated as a file for inputs to other
+computations, and {\tt apply} can efficiently produce a partial output
+by seeking through the control segment without reading the entire data
+segment.  This does not exactly specify a format for the
+\emph{copy/insert} delta, leaving the exact storage up to the
+application.  Another encoding that appears in the W3 Consortium's
+proposed standard delta format, named \emph{GDIFF}, is to simply
+append the data for each {\tt insert} instruction after the
+instruction itself, making the delta a single stream.  Other encodings
+are more compressed, such the one used by Vo's \emph{vdelta}
+algorithm.  Again, using a simple, uncompressed format proves useful
+for file-archival, suggesting that general compression techniques be
+used orthogonally to delta-encoding for a complete system.
+
+\subsection{Analysis}
+
+% need some diagrams here
+
+By pre-defining an abstract delta format the comparison of algorithms
+is much easier.  The algorithm described above computes a
+\emph{copy/insert} delta.  {\tt index} first computes an array for
+each file then the hash table.
+
+\begin{tabbing}
+preprocess ($F$) \\
+  $T \leftarrow$ \emph{empty hash table}
+  for each $f \in F$ \\
+    $c_f$ = generateChecksums ($f$) \\
+  for each $f \in F$ \\
+    addToTable ($T$, $c_f$, $f$) \\
+\\
+generateChecksums($f$) \\
+  $count \leftarrow (length(f)-1)/l$ \\
+  $array \leftarrow new checksum[count]$ \\
+  for $i = 0..count$ \\
+    $array[i] \leftarrow$ adler32 ($f$, $i*l$, $l$) \\
+  return $array$ \\
+addToTable($T$, $c$, $f$) \\
+  $count \leftarrow (length(f)-1)/l$ \\
+  for $i = 0..count$ \\
+    $insert (T, c[i], [i,f])$
+\end{tabbing}
+
+The {\tt generateChecksums} function fills in an array of length
+$floor(length(f) / l)$.  Each entry is the 32-bit adler32 checksum for
+the range of length $l$ for a particular offset.  Let $length(F) =
+\sum_{f \in F} length(f)$.  This step has $O(length(F))$ time
+complexity and requires $length(F)/l = O(length(F))$ space.
+
+The {\tt addToTable} function inserts $length(F)/l$ checksums into a
+table in $length(F)/l$ time and space as well.  All together, {\tt
+apreprocess} requires $O(length(F)/l)$ time and space and has small
+coefficients.
+
+% Take a look at how rsync deals with this.
+
+\begin{tabbing}
+generate ($F$, $t$) \\
+  for $i = 0..length(t)-l$ \\
+    $a \leftarrow $ adler32($t$, $i$, $l$) \\
+    if ($(f, j) \leftarrow$ lookup ($T$, $a$) $\wedge$ \\
+        $c_f[j] = a$ $\wedge$ \\
+        $f$ and $t$ match at $jl$ and $i$) \\
+      emitMatch ($f$, $t$, $jl$, $i$)
+\end{tabbing}
+
+The {\tt generate} operation searches for matching checksums in $t$.
+It requires constant additional space and $length(t)$ operations to
+scan $t$ and in the worse case, $2 length(t)$ operations for finding
+matches by literally comparing files.  The resulting
+\emph{copy/insert} {\tt generate} algorithm is linear in both time and
+space.  The linear space requirement is not ideal.  For $l=16$, the
+algorithm requires a memory approximately $1/2$ the size of the
+inputs.
+
+In practice, {\tt generate} is implemented in a single page-by-page
+pass through $t$.  Therefore, when a partial match is found, the match
+is grown as far forward in the files as possible, but will only grow
+backwards up to the first page boundary.
+
+For speed and space concerns, the hash table is implemented as a
+single integer array with length chosen to be approximately the size
+of the input.  Each bucket contains $f$ and $i$, and no duplicate
+records are kept.  This leads to a clobbering decision--how to handle
+multiple checksums with the same hash code.  By keeping only one
+record for each bucket the inner {\tt generate} loop is quite
+efficient and lengthy, repeated segments in the inputs do not produce
+over-full buckets.  Several policies have been used:
+
+\begin{itemize}
+\item ordered winner
+
+If the checksums are in the same file, the first to appear wins,
+otherwise an arbitrary order is placed on $F$ to determine the winner.
+
+\item random winner
+
+At each collision, a random trial is performed to determine the
+winner.  By setting the probability of clobbering in the $k^{th}$
+trial to $P(k) = 1/(k+1)$, the winner is uniformely distributed over
+all like checksum hash values.
+
+\item weighted winner
+
+A match occuring earlier in a file rather than later is desirable
+since matches grow foward and not backward.  This can be encoded in
+the above decision's trial probability to favor earlier matches, for
+example.
+\end{itemize}
+
+How confident can we be that this algorithm computes a compact delta?
+There are many approximations and assumptions that have been made, but
+the following property may be shown:
+
+\begin{theorem}
+For a match to be discovered between files $f$ and $t$ of length $k
+\ge 2l$, the probability of emitting a copy instruction is
+$\frac{1}{number of}$.
+\end{theorem}
+
+[I'd like to show that it is not much worse than optimal.]  And since
+it is fast and performs well in practice, it seems very good.
+
+\subsection{The \emph{copy/insert} Delta}\label{sec:copyinsert}
+
+% Move this section?  Pull it out of analysis?
+
+Deletions are cheap, insertion is expensive.  This could be done as a
+better dynamic program, but more expensive than the LCS algorithms.
+
+This simple encoding
+
+
+
+
+
+
+
+
+
+
+
+
+
+storage mechanism does not use branches and never
+stores forward deltas.  To avoid accumulating multiple copies of
+deltas transforming one diverging branch into another, {\sc Xdelta}
+computes a new delta based not only on two input files, but on
+previous deltas as well.  The equivalent {\sc Xdelta} encoding is
+illustrated in figure \ref{xdelta}.  The delta algorithm employed by
+{\sc Xdelta} encodes deltas as a sequence of \texttt{copy} and
+\texttt{insert} instructions.  A copy instruction occupies $O(1)$
+space, while an insertion of length $N$ requires $O(N)$ space.  Note
+that forward insertions are encoded as reverse deletions and forward
+deletions are encoded as reverse insertions.  We are only concerned
+with insertions, since deletions are not reflected in the sequence of
+\texttt{copy} and \texttt{insert} instructions.
+
+%RCS succeeds at efficiently storing
+%these five versions because files on the $1.1.1.x$ branch do not
+%interfere with deltas computed for files on the $1.x$ branch.  The
+%next delta computed on either branch is not affected by the
+%differences between files at the head of either branch.  In this way,
+%parallel development does not impact the storage mechanism.  The RCS
+%mechanism does, however, have a great impact on the amount of work
+%required to extract each version: files checked in on the $1.x$ branch
+%are available in time proportional to the distance from the head,
+%while files checked in on the $1.1.1.x$ branch are available in time
+%proportional to the distance from the root version ($1.1$) plus the
+%number of files on the $1.x$ branch.  Unfortunately, this type of
+%scenario degrades the performance of the RCS storage mechanism and is
+%exactly what version control utilities are designed to handle.  This
+%feature of the RCS storage mechanism makes efficient allocation of new
+%version numbers difficult for both users and higher level version
+%control utilities.
+
+%\section{Delta Algorithms}
+
+%\section{And Compression...}
+
+%\section{Encoding/Matching (Empirical) Gripe}
+
+%\section{Delta Algorithm}
+
+%\section{Empirical Results on Delta Algorithm}
+
+%\section{Storage Model}
+
+%\section{Empirical Results on Storage Model}
+
+%\section{Comparison to RCS}
+
+%* Ability to delete old files
+%* Usage of a binary delta
+%* Freedom from version tree:
+%    performance implications
+%    lack of information
+%* Available as a library without the clutter
+%* file retrieval time is always proportional to its age, not ancestry
+%* partial compression, late decompression
+%* cached indices
+
+%\section{Distribution Model}
+
+%What to solve.  What are the network applications.
+
+%\section{Normalized Deltas}
+
+%How to achive it.
+
+%\section{Implementation of DRP}
+
+%Complete 4-method protocol description.
+
+%\section{Conclusion}
diff --git a/xdelta1/doc/old/dcc99/exact-delta/CVS/Entries b/xdelta1/doc/old/dcc99/exact-delta/CVS/Entries
new file mode 100755
index 0000000..ae08c72
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/exact-delta/CVS/Entries
@@ -0,0 +1,4 @@
+/delta.cc/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/suffix.cc/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/suffix.h/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+D
diff --git a/xdelta1/doc/old/dcc99/exact-delta/CVS/Repository b/xdelta1/doc/old/dcc99/exact-delta/CVS/Repository
new file mode 100755
index 0000000..ef5ef48
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/exact-delta/CVS/Repository
@@ -0,0 +1 @@
+xdelta11/xdelta11/doc/dcc99/exact-delta
diff --git a/xdelta1/doc/old/dcc99/exact-delta/CVS/Root b/xdelta1/doc/old/dcc99/exact-delta/CVS/Root
new file mode 100755
index 0000000..645ccf1
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/exact-delta/CVS/Root
@@ -0,0 +1 @@
+:ext:jmacd@cvs.xdelta.sourceforge.net:/cvsroot/xdelta
diff --git a/xdelta1/doc/old/dcc99/exact-delta/delta.cc b/xdelta1/doc/old/dcc99/exact-delta/delta.cc
new file mode 100755
index 0000000..ed27060
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/exact-delta/delta.cc
@@ -0,0 +1,176 @@
+/* $Header: /home/tully/hilfingr/work/delta/RCS/delta.cc,v 1.6 1995/08/11 02:06:27 hilfingr Exp $                                                               */
+/* delta.c: Produce a delta indicating how to convert one file to */
+/* another. */
+
+/* Copyright (C) 1995, Paul N. Hilfinger.  All Rights Reserved.         */
+
+#include <stdio.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <iostream.h>
+#include <fstream.h>
+#include <strstream.h>
+#include "suffix.h"
+
+int/*waslong*/ cim = 0;
+int/*waslong*/ ilen = 0;
+
+int/*waslong*/
+ilog2 (int/*waslong*/ arg)
+{
+  int/*waslong*/ log = 0;
+
+  while (arg >>= 1) log += 1;
+
+  return log;
+}
+
+void
+measureInsert (int/*waslong*/ len)
+{
+  ilen += len;
+}
+
+void
+measureCopy (int/*waslong*/ len, int/*waslong*/ at)
+{
+  if (ilen > 0)
+    {
+      cim += 1 + ilog2 (ilen) + 8*ilen;
+#if 0
+      printf ("insert %ld %ld\n", ilen, cim);
+#endif
+      ilen = 0;
+    }
+
+  if (len > 0)
+    {
+      cim += 1 + ilog2 (len) + ilog2(at);
+#if 0
+      printf ("copy %ld %ld\n", len, cim);
+#endif
+    }
+}
+
+/* Usage: */
+/*     delta file1 file2 */
+/* Produces on standard output a sequence of commands for converting */
+/* the contents of FILE1 to those of FILE2.  Each command has the */
+/* following form:  */
+/*    <p><n0><n1><x> */
+/* where <p> is a signed number, <n0> and <n1> are nonnegative */
+/* numbers, and <x> is a sequence of <n1> characters. This command */
+/* means "Append <x> and then append <n0> characters starting from */
+/* position P+<p> in FILE1.  Set P to P+<p>+<n0>."  Initially, P is 0 */
+/* (characters in FILE1 are numbered from 0).  Numbers are */
+/* represented in base 32 (see num32.h and num32.cc).  */
+
+/* Don't bother to generate a move for any block less than */
+/* MOVE_THRESHOLD long. */
+const int/*waslong*/ MOVE_THRESHOLD = 6;
+
+/* Output on cout the delta between the string */
+/* T.string()[0..T.length()-1] and S1[0..N1-1], using P0 as the value */
+/* of P (above), and setting it to the final value of P when done. */
+/* Add OFFST to the positions of moved strings within S0. */
+void diffSegment(SuffixTree& T, const byte* S1, int N1,
+                 int /*waslong*/ offst, int /*waslong*/& P0)
+{
+    int /*waslong*/ P;
+    int L;
+
+    P = P0;
+    L = N1;
+    while (L > 0) {
+        int/*waslong*/ start;
+        int/*waslong*/ len, i;
+
+        i = 0;
+        while (true) {
+            start = P - offst; len = 0;
+            if (i >= L)
+                break;
+            T.longestPrefix(S1+i, L-i, start, len);
+            if (len >= MOVE_THRESHOLD)
+                break;
+            i += 1;
+        }
+
+        measureInsert (i);
+        measureCopy (len, start + offst + P);
+
+        L -= i;
+        while (i > 0) {
+            S1 += 1; i -= 1;
+        }
+        S1 += len;
+        L -= len;
+        P = start + offst + len;
+    }
+
+    P0 = P;
+}
+
+
+main(int argc, char* argv[])
+{
+    ifstream F1, F2;
+    byte *S1;
+    byte *S2;
+    int /*waslong*/ N1, N2;
+    int /*waslong*/ P, offst;
+    struct stat buf1, buf2;
+    SuffixTree T;
+
+    if (argc < 3) {
+        cerr << "Usage: " << argv[0] << " from to" << "\n";
+        exit(1);
+    }
+
+    F1.open(argv[1]);
+    if (F1.fail()) {
+        cerr << "Could not open " << argv[1] << ".\n";
+        exit(1);
+    }
+
+    F2.open(argv[2]);
+    if (F2.fail()) {
+        cerr << "Could not open " << argv[2] << ".\n";
+        exit(1);
+    }
+
+    if (stat (argv[1], &buf1)) {
+        cerr << "Could not stat " << argv[1] << ".\n";
+        exit(1);
+    }
+
+    if (stat (argv[2], &buf2)) {
+        cerr << "Could not stat " << argv[2] << ".\n";
+        exit(1);
+    }
+
+    N1 = buf1.st_size;
+    N2 = buf2.st_size;
+
+    S1 = (byte*)allocate(N1);
+    S2 = (byte*)allocate(N2);
+
+    F1.read(S1, N1);
+    F2.read(S2, N2);
+
+    if (F2.fail() || F1.fail()) {
+        cerr << "Read failed.\n";
+        exit(1);
+    }
+
+    P = 0; offst = 0;
+    T.init(S1, N1);
+
+    diffSegment(T, S2, N2, 0, P);
+
+    measureCopy (0, 0);
+
+    printf ("%d\n", (cim+4)/8); /* into bytes */
+
+    exit(0);
+}
diff --git a/xdelta1/doc/old/dcc99/exact-delta/suffix.cc b/xdelta1/doc/old/dcc99/exact-delta/suffix.cc
new file mode 100755
index 0000000..cf31e90
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/exact-delta/suffix.cc
@@ -0,0 +1,427 @@
+/* $Header: /home/tully/hilfingr/work/delta/RCS/suffix.cc,v 1.6 1995/08/11 07:24:10 hilfingr Exp hilfingr $                                                             */
+/* suffix.cc:                                                           */
+
+/* Copyright (C) 1995, Paul N. Hilfinger.  All Rights Reserved.         */
+
+#include <iostream.h>
+
+#include <stdio.h>
+#include <stddef.h>
+#include <stdlib.h>
+#include <limits.h>
+#include <string.h>
+#include "suffix.h"
+
+/* This file has been grossly hacked by Josh. */
+
+/* Notionally, the string theString has appended to it a sentinel */
+/* character that is unequal to any other character.  This value can't */
+/* be represented directly in a byte, however, so we must take care */
+/* throughout to avoid actually trying to look at or compare the */
+/* sentinel character directly. */
+
+/* Each SuffixTree contains nonterminal nodes identified by integers    */
+/* in the range 0 .. N and terminal nodes identified by integers in     */
+/* the range N+1 .. 2N.  Each node represents a string, and is said to  */
+/* be the LOCUS of that string.  Nonterminal node 0 represents the      */
+/* null string.  Nonterminal node k>1, if it exists, is the locus of    */
+/* the longest prefix of theString[k-1 .. N-1] that is present in       */
+/* theString[j..N-1], 0<=j<k-1; there is at most one nonterminal node   */
+/* for each prefix.  The prefix itself (whether or not a nonterminal */
+/* node exists for it) is called head(k). Terminal node N+k, k>0, */
+/* represents the suffix theString[k-1..N-1].  There is one terminal */
+/* node for each suffix.        */
+
+/* The EXTENDED LOCUS of a string is the locus of the shortest string */
+/* in the tree that has that string as a prefix.  The CONTRACTED LOCUS */
+/* of a string is the locus of the longest string in the tree that is */
+/* a prefix of that string. */
+
+/* Each edge of the tree is labeled with a non-null string such that    */
+/* the concatenation of the strings on all edges leading from the root  */
+/* to a node is the string represented by that node.  For each          */
+/* nonterminal node k, inArcLen[k] is the length of the string          */
+/* labeling the edge incoming to k.  All nonterminal nodes have at      */
+/* least two edges leading from them, each beginning with a distinct    */
+/* character.                                                           */
+
+/* For nonterminal node m and character c, the hash table edgeMap maps  */
+/* (m,c) to the edge from m whose label begins with c, if there is      */
+/* one.  The member array edges contains all edges, and each edge is    */
+/* represented by its index in edges.  Each bin in edgeMap is linked    */
+/* through the next fields of the edges.  The hash function is such     */
+/* that at most one entry whose source is a given node can appear on a  */
+/* given hash chain.                                                    */
+
+/* This data structure and the algorithm for createSuffixTree, below, */
+/* were originally described in Edward M. McCreight, ``A */
+/* Space-Economical Suffix Tree Construction Algorithm'', JACM 23, 2 */
+/* (April, 1976), pp 262-272.                   */
+
+const NodeNum Root = 0;
+const int TERMINAL_FLAG = 0x40000000;
+const xbyte SENTINEL_CHAR = 0x1ff;
+
+void bail (void)
+{
+  printf ("-1\n");
+  exit (2);
+}
+
+void* allocate(int size)
+{
+  void* p = malloc (size);
+  static int total = 0;
+
+  total += size;
+
+  if (total >= 1<<30)
+    bail ();
+
+  if (! p)
+    bail ();
+
+  return p;
+}
+
+extern Edge _NULL_EDGE;
+Edge _NULL_EDGE(Root, Root, -1);
+static Edge* const NULL_EDGE = &_NULL_EDGE;
+
+inline NodeNum hash(xbyte c, NodeNum n)
+{
+    return (c | (c << 8)) ^ n;
+}
+
+#define member SuffixTree::
+
+member SuffixTree()
+{
+    theString = (byte*) "";
+    N = 1;
+    inArcLen = NULL;
+    nextEdge = NULL;
+    edges = NULL;
+    edgeMap = NULL;
+}
+
+member ~SuffixTree()
+{
+    delete [] inArcLen;
+    delete [] edges;
+    delete [] edgeMap;
+    inArcLen = NULL; edges = NULL; edgeMap = NULL;
+}
+
+void member init(const byte* S, int/*waslong*/ L)
+{
+    this->~SuffixTree();
+
+    N = L + 1;
+    theString = S;
+
+    createSuffixTree();
+}
+
+/* The step (in createSuffixTree: see below) at which node M>0 was */
+/* created.  Step k>0 considers the suffix beginning at theString[k-1]. */
+inline int member toStep(NodeNum m) const
+{
+    return m & ~TERMINAL_FLAG;
+}
+
+/* The leaf node corresponding to the suffix beginning at character M. */
+inline NodeNum member toLeaf(int m) const
+{
+    return m | TERMINAL_FLAG;
+}
+
+
+/* The length of a suffix of which node M is a part.  If M is a */
+/* terminal node, there is only one such suffix. */
+inline Length member suffixLength(NodeNum m) const
+{
+    return N - toStep(m) + 1;
+}
+
+/* True iff M is a terminal node */
+inline bool member isTerminal(NodeNum M) const
+{
+    return (M & TERMINAL_FLAG) != 0;
+}
+
+/* The length of the arc incoming to M, given that L is the length of */
+/* the string associated with M's parent. */
+inline Length member inLength(NodeNum m, Length L) const
+{
+    if (isTerminal(m))
+        return suffixLength(m) - L;
+    else
+        return inArcLen[m];
+}
+
+/* The starting position in string() of the string associated with */
+/* m>0. */
+inline int member suffixStart(NodeNum m) const
+{
+    return toStep(m)-1;
+}
+
+/* Create a new edge from n0 to n1 whose label begins with string x. */
+inline void member createEdge(NodeNum n0, NodeNum n1, xbyte x)
+{
+    assert (n0 >= 0 && n1 >= 0);
+    assert (nextNode(n0, x) == Root);
+    assert (nextEdge - edges < 2*N);
+    int h = hash(x, n0);
+
+    if (edgeMap[h] == NULL_EDGE)
+      *nextEdge = Edge(n0, n1, -1);
+    else
+      *nextEdge = Edge(n0, n1, edgeMap[h] - edges);
+
+    edgeMap[h] = nextEdge;
+
+    nextEdge += 1;
+}
+
+/* Insert new node N2 on edge E, where the source of E  */
+/* represents a string of length L0 and L2 is the length of the string */
+/* between the source of E and N2. */
+inline void member splitEdge(Edge* e, NodeNum n2, Length L0, Length L2)
+{
+    NodeNum n0 = e->from, n1 = e->to;
+
+    assert( e != NULL_EDGE && ! isTerminal(n0) &&
+           ! isTerminal(n2) && L2 < inLength(n1, L0));
+
+    assert (n0 >= 0 && n1 >= 0 && n2 >= 0);
+
+    inArcLen[n2] = L2;
+    if (! isTerminal(n1))
+        inArcLen[n1] -= L2;
+    e->to = n2;
+    createEdge(n2, n1, theString[suffixStart(n1) + L0 + L2]);
+}
+
+/* Insert edge to new leaf node N1 from N0, where N0 represents a */
+/* string of length L. */
+inline void member addLeaf(NodeNum n0, NodeNum n1, Length L)
+{
+    assert(isTerminal(n1) && ! isTerminal(n0) && suffixStart(n1)+L < N);
+    assert (n0 >= 0);
+    assert (n1 >= 0);
+    if (suffixStart(n1) + L == N-1)
+        createEdge(n0, n1, SENTINEL_CHAR);
+    else
+        createEdge(n0, n1, theString[suffixStart(n1)+L]);
+}
+
+/* The edge from SRC labeled with a string beginning with C, if any, */
+/* or NULL_EDGE otherwise. */
+inline Edge* edge(NodeNum src, xbyte c, Edge* const edgeMap[], Edge* edges)
+{
+    Edge* e;
+
+    e = edgeMap[hash(c, src)];
+
+    for (;; e = edges + e->next)
+      {
+        if (e->from == src)
+          return e;
+
+        if (e->next == -1)
+          return NULL_EDGE;
+      }
+
+    return NULL_EDGE;
+}
+
+/* Node arrived at by following the arc whose label begins with C, if */
+/* any, from nonterminal node SRC.  Returns Root if there is no such */
+/* node. */
+inline NodeNum member nextNode(NodeNum src, xbyte c) const
+{
+    return edge(src, c, edgeMap, edges) -> to;
+}
+
+void member longestPrefix(const byte* S1, int/*waslong*/ N1,
+                          int/*waslong*/& start, int/*waslong*/& length) const
+{
+    int N0 = N-1;
+    int L;                      /* Length of S1 scanned so far. */
+    NodeNum m;                  /* Extended locus of S1[0..L-1].  */
+    int r;                      /* Characters remaining in current arc */
+                                /* (incoming to node m). */
+    int s;                      /* Start of current prefix in S. */
+
+    L = 0; r = 0; m = Root; s = 0;
+    while (true) {
+        while (r > 0) {
+            if (S1[L] != theString[s+L]) {
+                start = s; length = L;
+                return;
+            }
+            r -= 1; L += 1;
+        }
+
+        if (L == N1 || s+L == N0) {
+            start = s; length = L;
+            return;
+        }
+
+        m = nextNode(m, S1[L]);
+        if (m == Root) {
+            start = s; length = L;
+            return;
+        } else if (isTerminal(m))
+            /* r := remaining length - 2 (so as not to include the */
+            /* sentinel character or the first character on the arc). */
+            r = suffixLength(m) - L - 2;
+        else
+            /* r := arc length - 1 (so as not to include the first */
+            /* character on the arc). */
+            r = inArcLen[m] - 1;
+        s = suffixStart(m);
+        L += 1;                 /* Skip first character on arc. */
+        if (L+r > N1)
+            r = N1 - L;
+    }
+}
+
+/* Assuming that N and theString are set correctly, set edgeMap,        */
+/* edges, and inArcLen to represent a tree corresponding to the         */
+/* suffixes of theString, as described above.                           */
+void member createSuffixTree()
+{
+    if (N == 1)
+        return;
+
+    inArcLen = (Length*) allocate (sizeof(Length) * (N+1));
+    nextEdge = edges = (Edge*) allocate (sizeof(Edge) * (2*N));
+    edgeMap = (Edge**) allocate (sizeof(Edge*) * (0x20000+N+1));
+
+    /* For nonterminal node 0<m<k-1 (where k is the current step in the */
+    /* algorithm---the step at which node k or node N+k is created), */
+    /* with m the locus of string xS (x a character, S a string), */
+    /* suffix[m] is the locus of S. */
+    NodeNum* suffix = (NodeNum*) allocate (sizeof(NodeNum) * (N+1));
+    memset(suffix, '\000', sizeof(NodeNum) * (N+1));
+
+    for (int/*waslong*/ y = 0x20000+N+1; y >= 0; y -= 1)
+        edgeMap[y] = NULL_EDGE;
+    inArcLen[Root] = 0;
+
+    /* Step 1. */
+    addLeaf(Root, toLeaf(1), 0);
+    /* The tree now contains the trivial suffix theString[0..N-1]. */
+
+    NodeNum nextPrefix;         /* At the beginning of step k, a */
+                                /* nonterminal node representing a prefix */
+                                /* of head(k). */
+    int nextPrefixLen;          /* At the beginning of step k, the */
+                                /* length of the prefix denoted by */
+                                /* nextPrefix. */
+    NodeNum lastHead;           /* At the beginning of step k, the */
+                                /* locus of head(k-1). */
+    int lastHeadLen;            /* At the beginning of step k, the */
+                                /* length of head(k-1). */
+
+
+    lastHead = Root; lastHeadLen = 0;
+    nextPrefix = Root; nextPrefixLen = 0;
+    /* Steps 2 to N. */
+    for (NodeNum k = 2; k <= N; k += 1) {
+        /* The tree now contains the strings theString[j..N-1], */
+        /* 0 <= j< k-1 (call this tree T(k-1)). */
+        NodeNum d0, d1;
+        int/*waslong*/ r, L;
+
+        /* The suffix theString[k-1..N-1]; */
+        const byte* const suff_k = theString+k-1;
+        /* Its length. */
+        const int/*waslong*/ suff_k_len = N - k;
+
+        /* tail(head(k-1)) == theString[k-1 .. k-3+lastHeadLen] is */
+        /* guaranteed to be a prefix of some string currently in the */
+        /* tree.  Rescan to find (or if necessary, create) the locus */
+        /* of tail(head(k-1)) in the tree, setting d1 to that locus. */
+        /* Set nextPrefix and nextPrefixLen for the next iteration. */
+        /* The sentinel character is guaranteed not to be a part of */
+        /* head(k-1). */
+
+        d0 = d1= nextPrefix;
+        L = nextPrefixLen;
+        nextPrefix = Root; nextPrefixLen = 0;
+        while (L < lastHeadLen-1) {
+            Edge* e = edge(d0, suff_k[L], edgeMap, edges);
+            assert(e != NULL_EDGE);
+            d1 = e->to;
+            assert (d1 != Root);
+            r = inLength(d1, L);
+            if (r + L >= lastHeadLen) {
+                r = lastHeadLen - 1 - L;
+                splitEdge(e, k, L, r);
+                d1 = k;
+                break;
+            }
+            L += r;
+            d0 = d1;
+            assert (d1 <= N);
+            nextPrefix = suffix[d1];
+            nextPrefixLen = L-1;
+            assert(! isTerminal(nextPrefix) &&
+                   (nextPrefix == Root) == (nextPrefixLen == 0));
+        }
+
+        /* Estabish the suffix link for head(k-1). */
+        assert (lastHead <= N);
+        if (suffix[lastHead] == Root) {
+            assert( !isTerminal(d1));
+            suffix[lastHead] = d1;
+        }
+
+        /* Now scan down the tree from d1 until we "fall out" of the */
+        /* tree.  Insert a new leaf pointer (to a node representing */
+        /* suff_k) at that point, also creating, if necessary, a */
+        /* new nonterminal node if we fall out in the middle of an */
+        /* edge.  The node from which we insert the new leaf pointer */
+        /* is the locus of head(k).  Here, it is possible to run off */
+        /* the end of suff_k.  When this happens, we act as if  */
+        /* SENTINEL_CHAR were the offending character. */
+        L = lastHeadLen == 0 ? 0 : lastHeadLen - 1;
+        d0 = d1;
+        while (true) {
+            int r0, i;
+
+            Edge* e = edge(d0, suff_k[L], edgeMap, edges);
+            d1 = e->to;
+            if (d1 == Root)
+                break;
+            r0 = inLength(d1, L);
+
+            if (r0+L > suff_k_len)
+                r = suff_k_len - L;
+            else
+                r = r0;
+            const byte* const suff_d1 = theString + suffixStart(d1);
+            for (i = 1; i < r && suff_k[L+i] == suff_d1[L+i]; i += 1)
+              {}
+            if (i == r0) {
+                L += r;
+                d0 = d1;
+                assert (d1 <= N);
+                nextPrefix = suffix[d1]; nextPrefixLen = L-1;
+            } else {
+                splitEdge(e, k, L, i);
+                d0 = d1 = k;
+                L += i;
+                break;
+            }
+        }
+        addLeaf(d0, toLeaf(k), L);
+        lastHead = d0; lastHeadLen = L;
+    }
+
+    delete [] suffix;
+}
diff --git a/xdelta1/doc/old/dcc99/exact-delta/suffix.h b/xdelta1/doc/old/dcc99/exact-delta/suffix.h
new file mode 100755
index 0000000..249f0ad
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/exact-delta/suffix.h
@@ -0,0 +1,117 @@
+/* -*-Mode: c++;-*- */
+
+/* $Header: /home/tully/hilfingr/work/delta/RCS/suffix.h,v 1.6 1995/08/11 07:24:10 hilfingr Exp $                                                               */
+/* suffix.h: Definitions for suffix-tree data type.                     */
+
+/* Copyright (C) 1995, Paul N. Hilfinger.  All Rights Reserved.         */
+
+
+#ifndef _SUFFIX_H_
+#define _SUFFIX_H_
+
+#include <assert.h>
+
+typedef unsigned char byte;
+
+class Edge;                     /* Edge between two nodes. */
+
+void* allocate(int size);
+
+class SuffixTree {
+    /* A suffix tree is the set of all suffixes of a particular string. */
+public:
+    /* The set { "" } (all suffixes of the empty string). Sets */
+    /* string() to "" and length() to 0. */
+    SuffixTree();
+
+    SuffixTree(const SuffixTree& T);
+
+    ~SuffixTree();
+
+    /* Set *this to a suffix tree for S[0..L-1]. */
+    /* The string S must continue to exist and its contents remain */
+    /* unchanged until the next application of init or until *this is */
+    /* destroyed. Sets string() to S and length() to L. */
+    void init(const byte* S, int/*waslong*/ L);
+
+    /* See definitions of default constructor and init (above). */
+    const byte* string() const;
+    const int/*waslong*/ length() const;
+
+    /* Set LENGTH to the length of the longest prefix of S1[0..N1-1] that */
+    /* occurs in string(), and START to an index in S1 of the */
+    /* beginning of that prefix. */
+    void longestPrefix(const byte* S1, int/*waslong*/ N1,
+                       int/*waslong*/& start, int/*waslong*/& length) const;
+private:
+
+    /* See suffix.cc for an explanation of the data structure. */
+
+    typedef int/*waslong*/ NodeNum;
+    typedef int/*waslong*/ Length;
+
+    /* Extended bytes: Includes the notional end-of-string character. */
+    typedef int xbyte;
+
+    const byte* theString;
+                                /* Value of string(). */
+
+    int N;                      /* strlen(theString)+1. */
+
+    Length* inArcLen;           /* inArcLen[k] is the length of the */
+                                /* string labeling the arc leading to */
+                                /* nonterminal node k. */
+
+    Edge* edges;                /* Array of all edges */
+    Edge* nextEdge;             /* Next free edge in edges */
+    Edge** edgeMap;             /* Hash table: NodeNum x char -> NodeNum. */
+
+    /* See definitions in suffix.cc */
+
+    Length suffixLength(NodeNum m) const;
+    bool isTerminal(NodeNum m) const;
+    int toStep(NodeNum m) const;
+    NodeNum toLeaf(int m) const;
+    Length inLength(NodeNum m, Length L) const;
+    NodeNum nextNode(NodeNum src, xbyte c) const;
+    int suffixStart(NodeNum m) const;
+    void splitEdge(Edge* e, NodeNum n2, Length L0, Length L2);
+    void addLeaf(NodeNum n0, NodeNum n1, Length L);
+    void createEdge(NodeNum n0, NodeNum n1, xbyte x);
+
+    void createSuffixTree();
+};
+
+inline const byte* SuffixTree::string() const
+{
+    return theString;
+}
+
+void bail (void);
+
+inline const int/*waslong*/ SuffixTree::length() const
+{
+    return N-1;
+}
+
+typedef SuffixTree::NodeNum NodeNum;
+typedef SuffixTree::xbyte xbyte;
+typedef SuffixTree::Length Length;
+
+class Edge {
+public:
+  Edge() {}
+  Edge(NodeNum from0, NodeNum to0, int next0)
+    : from(from0), to(to0), next(next0)
+  {
+    assert (to0 >= 0);
+    assert (from0 >= 0);
+  }
+
+  NodeNum from, to;     /* Source and sink nodes. */
+
+  int next;
+};
+
+
+#endif
diff --git a/xdelta1/doc/old/dcc99/figs/CVS/Entries b/xdelta1/doc/old/dcc99/figs/CVS/Entries
new file mode 100755
index 0000000..ee36796
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/CVS/Entries
@@ -0,0 +1,23 @@
+/bigsizes.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/dependency.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/dependency.fig/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/dependency.fig.normalsize/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/jumping.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/jumping.fig/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/normalize.fig/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/onestep.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/onestep.fig/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/onestep.fig.normalsize/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/rcs.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/rcs.fig/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/sizes.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/strings.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/strings.fig/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/strings.fig.normalsize/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/strings.fig.normalsize.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/xdarchive.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/xdarchive.fig/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/xdarchive.fig.normalsize/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/xdelta.eps/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+/xdelta.fig/1.1.1.1/Tue Jun 12 03:16:40 2001/-ko/
+D
diff --git a/xdelta1/doc/old/dcc99/figs/CVS/Repository b/xdelta1/doc/old/dcc99/figs/CVS/Repository
new file mode 100755
index 0000000..878929c
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/CVS/Repository
@@ -0,0 +1 @@
+xdelta11/xdelta11/doc/dcc99/figs
diff --git a/xdelta1/doc/old/dcc99/figs/CVS/Root b/xdelta1/doc/old/dcc99/figs/CVS/Root
new file mode 100755
index 0000000..645ccf1
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/CVS/Root
@@ -0,0 +1 @@
+:ext:jmacd@cvs.xdelta.sourceforge.net:/cvsroot/xdelta
diff --git a/xdelta1/doc/old/dcc99/figs/bigsizes.eps b/xdelta1/doc/old/dcc99/figs/bigsizes.eps
new file mode 100755
index 0000000..271f7f9
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/bigsizes.eps
@@ -0,0 +1,766 @@
+%!PS-Adobe-3.0 EPSF-3.0
+%%Creator: MATLAB, The Mathworks, Inc.
+%%Title: ../figs/bigsizes.eps
+%%CreationDate: 11/14/98  05:04:11
+%%DocumentNeededFonts: Helvetica
+%%DocumentProcessColors: Cyan Magenta Yellow Black
+%%LanguageLevel: 2
+%%Pages: 1
+%%BoundingBox:    70   196   550   600
+%%EndComments
+
+%%BeginProlog
+
+% MathWorks dictionary
+/MathWorks 150 dict begin
+
+% definition operators
+/bdef {bind def} bind def
+/ldef {load def} bind def
+/xdef {exch def} bdef
+/xstore {exch store} bdef
+
+% operator abbreviations
+/c  /clip ldef
+/cc /concat ldef
+/cp /closepath ldef
+/gr /grestore ldef
+/gs /gsave ldef
+/mt /moveto ldef
+/np /newpath ldef
+/cm /currentmatrix ldef
+/sm /setmatrix ldef
+/rc {rectclip} bdef
+/rf {rectfill} bdef
+/rm /rmoveto ldef
+/rl /rlineto ldef
+/s /show ldef
+/sc {setcmykcolor} bdef
+/sr /setrgbcolor ldef
+/sg /setgray ldef
+/w /setlinewidth ldef
+/j /setlinejoin ldef
+/cap /setlinecap ldef
+
+% page state control
+/pgsv () def
+/bpage {/pgsv save def} bdef
+/epage {pgsv restore} bdef
+/bplot /gsave ldef
+/eplot {stroke grestore} bdef
+
+% orientation switch
+/portraitMode   0 def
+/landscapeMode  1 def
+
+% coordinate system mappings
+/dpi2point 0 def
+
+% font control
+/FontSize 0 def
+/FMS {
+        /FontSize xstore                %save size off stack
+        findfont
+        [FontSize 0 0 FontSize neg 0 0]
+        makefont
+        setfont
+        }bdef
+
+/reencode {
+exch dup where
+{pop load} {pop StandardEncoding} ifelse
+exch
+dup 3 1 roll
+findfont dup length dict begin
+  { 1 index /FID ne {def}{pop pop} ifelse } forall
+  /Encoding exch def
+  currentdict
+end
+definefont pop
+} bdef
+
+/isroman {
+findfont /CharStrings get
+/Agrave known
+} bdef
+
+/FMSR {
+3 1 roll 1 index
+dup isroman
+{reencode} {pop pop} ifelse
+exch FMS
+} bdef
+
+/csm {
+        1 dpi2point div -1 dpi2point div scale
+        neg translate
+        landscapeMode eq {90 rotate} if
+        } bdef
+
+% line types: solid, dotted, dashed, dotdash
+/SO { [] 0 setdash } bdef
+/DO { [.5 dpi2point mul 4 dpi2point mul] 0 setdash } bdef
+/DA { [6 dpi2point mul] 0 setdash } bdef
+/DD { [.5 dpi2point mul 4 dpi2point mul 6 dpi2point mul 4 dpi2point mul] 0 setdash } bdef
+
+% macros for lines and objects
+/L {
+        lineto
+        stroke
+        } bdef
+/MP {
+        3 1 roll moveto
+        1 sub {rlineto} repeat
+        } bdef
+/AP {
+        {rlineto} repeat
+        } bdef
+/PP {
+        closepath eofill
+        } bdef
+/DP {
+        closepath stroke
+        } bdef
+/MR {
+        4 -2 roll moveto
+        dup  0 exch rlineto
+        exch 0 rlineto
+        neg  0 exch rlineto
+        closepath
+        } bdef
+/FR {
+        MR stroke
+        } bdef
+/PR {
+        MR fill
+        } bdef
+/L1i {
+        { currentfile picstr readhexstring pop } image
+        } bdef
+
+/tMatrix matrix def
+/MakeOval {
+        newpath
+        tMatrix currentmatrix pop
+        translate scale
+        0 0 1 0 360 arc
+        tMatrix setmatrix
+        } bdef
+/FO {
+        MakeOval
+        stroke
+        } bdef
+/PO {
+        MakeOval
+        fill
+        } bdef
+
+/PD {
+        currentlinecap 1 setlinecap 3 1 roll 2 copy moveto lineto stroke setlinecap
+        } bdef
+
+/FA {
+        newpath
+        tMatrix currentmatrix pop
+        translate scale
+        0 0 1 5 -2 roll arc
+        tMatrix setmatrix
+        stroke
+        } bdef
+/PA {
+        newpath
+        tMatrix currentmatrix pop
+        translate 0 0 moveto scale
+        0 0 1 5 -2 roll arc
+        closepath
+        tMatrix setmatrix
+        fill
+        } bdef
+
+
+/FAn {
+        newpath
+        tMatrix currentmatrix pop
+        translate scale
+        0 0 1 5 -2 roll arcn
+        tMatrix setmatrix
+        stroke
+        } bdef
+/PAn {
+        newpath
+        tMatrix currentmatrix pop
+        translate 0 0 moveto scale
+        0 0 1 5 -2 roll arcn
+        closepath
+        tMatrix setmatrix
+        fill
+        } bdef
+
+
+
+currentdict end def
+%%EndProlog
+
+%%BeginSetup
+MathWorks begin
+
+0 cap
+
+end
+%%EndSetup
+
+%%Page: 1 1
+%%BeginPageSetup
+%%PageBoundingBox:    70   196   550   600
+MathWorks begin
+bpage
+%%EndPageSetup
+
+%%BeginObject: graph1 1
+bplot
+
+/dpi2point 12 def
+portraitMode 0216 7344 csm
+
+  633   133  5756  4856 rc
+88 dict begin %Colortable dictionary
+/c0 { 0 0 0 sr} bdef
+/c1 { 1 1 1 sr} bdef
+/c2 { 1 0 0 sr} bdef
+/c3 { 0 1 0 sr} bdef
+/c4 { 0 0 1 sr} bdef
+/c5 { 1 1 0 sr} bdef
+/c6 { 1 0 1 sr} bdef
+/c7 { 0 1 1 sr} bdef
+1 j
+1 sg
+   0    0 6916 5185 rf
+6 w
+0 4225 5358 0 0 -4225 899 4613 4 MP
+PP
+-5358 0 0 4225 5358 0 0 -4225 899 4613 5 MP stroke
+DO
+4 w
+SO
+6 w
+0 sg
+ 899 4613 mt 6257 4613 L
+ 899  388 mt 6257  388 L
+ 899 4613 mt  899  388 L
+6257 4613 mt 6257  388 L
+ 899 4613 mt 6257 4613 L
+ 899 4613 mt  899  388 L
+ 899 4613 mt  899 4559 L
+ 899  388 mt  899  442 L
+%%IncludeResource: font Helvetica
+/Helvetica /ISOLatin1Encoding 120 FMSR
+
+ 816 4759 mt 
+(2.4) s
+1664 4613 mt 1664 4559 L
+1664  388 mt 1664  442 L
+1581 4759 mt 
+(2.5) s
+2430 4613 mt 2430 4559 L
+2430  388 mt 2430  442 L
+2347 4759 mt 
+(2.6) s
+3195 4613 mt 3195 4559 L
+3195  388 mt 3195  442 L
+3112 4759 mt 
+(2.7) s
+3961 4613 mt 3961 4559 L
+3961  388 mt 3961  442 L
+3878 4759 mt 
+(2.8) s
+4726 4613 mt 4726 4559 L
+4726  388 mt 4726  442 L
+4643 4759 mt 
+(2.9) s
+5492 4613 mt 5492 4559 L
+5492  388 mt 5492  442 L
+5459 4759 mt 
+(3) s
+6257 4613 mt 6257 4559 L
+6257  388 mt 6257  442 L
+6174 4759 mt 
+(3.1) s
+5987 4961 mt 
+(x 10) s
+%%IncludeResource: font Helvetica
+/Helvetica /ISOLatin1Encoding 80 FMSR
+
+6213 4887 mt 
+(7) s
+ 899 4613 mt  953 4613 L
+6257 4613 mt 6203 4613 L
+%%IncludeResource: font Helvetica
+/Helvetica /ISOLatin1Encoding 120 FMSR
+
+ 798 4657 mt 
+(0) s
+ 899 4085 mt  953 4085 L
+6257 4085 mt 6203 4085 L
+ 798 4129 mt 
+(1) s
+ 899 3557 mt  953 3557 L
+6257 3557 mt 6203 3557 L
+ 798 3601 mt 
+(2) s
+ 899 3029 mt  953 3029 L
+6257 3029 mt 6203 3029 L
+ 798 3073 mt 
+(3) s
+ 899 2501 mt  953 2501 L
+6257 2501 mt 6203 2501 L
+ 798 2545 mt 
+(4) s
+ 899 1972 mt  953 1972 L
+6257 1972 mt 6203 1972 L
+ 798 2016 mt 
+(5) s
+ 899 1444 mt  953 1444 L
+6257 1444 mt 6203 1444 L
+ 798 1488 mt 
+(6) s
+ 899  916 mt  953  916 L
+6257  916 mt 6203  916 L
+ 798  960 mt 
+(7) s
+ 899  388 mt  953  388 L
+6257  388 mt 6203  388 L
+ 798  432 mt 
+(8) s
+ 899  334 mt 
+(x 10) s
+%%IncludeResource: font Helvetica
+/Helvetica /ISOLatin1Encoding 80 FMSR
+
+1125  260 mt 
+(6) s
+ 899 4613 mt 6257 4613 L
+ 899  388 mt 6257  388 L
+ 899 4613 mt  899  388 L
+6257 4613 mt 6257  388 L
+gs 899 388 5359 4226 rc
+
+gr 
+/c8 { 1.000000 0.000000 0.000000 sr} bdef
+c8
+  36   36 1316 4567 FO
+  36   36 1309 4567 FO
+  36   36 1316 4567 FO
+  36   36 1309 4567 FO
+  36   36 1332 4306 FO
+  36   36 1316 4299 FO
+  36   36 1332 4306 FO
+  36   36 1316 4299 FO
+  36   36 1340 4312 FO
+  36   36 1332 4298 FO
+  36   36 1340 4312 FO
+  36   36 1332 4298 FO
+  36   36 1371 3970 FO
+  36   36 1340 3954 FO
+  36   36 1371 3970 FO
+  36   36 1340 3954 FO
+  36   36 1410 3648 FO
+  36   36 1371 3626 FO
+  36   36 1410 3648 FO
+  36   36 1371 3626 FO
+  36   36 1418 4170 FO
+  36   36 1410 4172 FO
+  36   36 1418 4170 FO
+  36   36 1410 4172 FO
+  36   36 1497 2565 FO
+  36   36 1418 2544 FO
+  36   36 1497 2565 FO
+  36   36 1418 2544 FO
+  36   36 1794 3218 FO
+  36   36 1497 3247 FO
+  36   36 1794 3218 FO
+  36   36 1497 3247 FO
+  36   36 2116 1054 FO
+  36   36 1794 1092 FO
+  36   36 2116 1054 FO
+  36   36 1794 1092 FO
+  36   36 2116 4064 FO
+  36   36 2116 4083 FO
+  36   36 2116 4064 FO
+  36   36 2116 4083 FO
+  36   36 2265 2045 FO
+  36   36 2116 2040 FO
+  36   36 2265 2045 FO
+  36   36 2116 2040 FO
+  36   36 2288 4268 FO
+  36   36 2265 4259 FO
+  36   36 2288 4268 FO
+  36   36 2265 4259 FO
+  36   36 2280 4535 FO
+  36   36 2288 4540 FO
+  36   36 2280 4535 FO
+  36   36 2288 4540 FO
+  36   36 2273 4211 FO
+  36   36 2280 4204 FO
+  36   36 2273 4211 FO
+  36   36 2280 4204 FO
+  36   36 2876 1293 FO
+  36   36 2273 1396 FO
+  36   36 2876 1293 FO
+  36   36 2273 1396 FO
+  36   36 3621  962 FO
+  36   36 2876 1071 FO
+  36   36 3621  962 FO
+  36   36 2876 1071 FO
+  36   36 4162  856 FO
+  36   36 3621  925 FO
+  36   36 4162  856 FO
+  36   36 3621  925 FO
+  36   36 4154 4334 FO
+  36   36 4162 4325 FO
+  36   36 4154 4334 FO
+  36   36 4162 4325 FO
+  36   36 4444 1191 FO
+  36   36 4154 1222 FO
+  36   36 4444 1191 FO
+  36   36 4154 1222 FO
+  36   36 4538 3486 FO
+  36   36 4444 3467 FO
+  36   36 4538 3486 FO
+  36   36 4444 3467 FO
+  36   36 4459 3361 FO
+  36   36 4538 3360 FO
+  36   36 4459 3361 FO
+  36   36 4538 3360 FO
+  36   36 4467 4222 FO
+  36   36 4459 4215 FO
+  36   36 4467 4222 FO
+  36   36 4459 4215 FO
+  36   36 4875  604 FO
+  36   36 4467  650 FO
+  36   36 4875  604 FO
+  36   36 4467  650 FO
+  36   36 4875 4589 FO
+  36   36 4875 4588 FO
+  36   36 4875 4589 FO
+  36   36 4875 4588 FO
+  36   36 5212 1088 FO
+  36   36 4875 1134 FO
+  36   36 5212 1088 FO
+  36   36 4875 1134 FO
+  36   36 5212 4554 FO
+  36   36 5212 4552 FO
+  36   36 5212 4554 FO
+  36   36 5212 4552 FO
+  36   36 5627 1945 FO
+  36   36 5212 1983 FO
+  36   36 5627 1945 FO
+  36   36 5212 1983 FO
+  36   36 5996 2577 FO
+  36   36 5627 2616 FO
+  36   36 5996 2577 FO
+  36   36 5627 2616 FO
+  36   36 6168 1397 FO
+  36   36 5996 1388 FO
+gs 899 388 5359 4226 rc
+
+gr 
+0 j
+0 -58 -58 0 0 58 58 0 1287 4576 5 MP
+/c9 { 0.000000 0.000000 1.000000 sr} bdef
+c9
+DP
+0 -58 -58 0 0 58 58 0 1280 4577 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1287 4576 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1280 4577 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1303 4571 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1287 4574 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1303 4571 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1287 4574 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1311 4576 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1303 4578 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1311 4576 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1303 4578 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1342 4552 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1311 4558 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1342 4552 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1311 4558 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1381 4576 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1342 4581 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1381 4576 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1342 4581 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1389 4527 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1381 4532 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1389 4527 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1381 4532 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1468 4562 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1389 4571 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1468 4562 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1389 4571 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1765 4493 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1468 4538 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1765 4493 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1468 4538 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2087 4489 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1765 4538 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2087 4489 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1765 4538 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2087 4565 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2087 4563 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2087 4565 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2087 4563 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2236 4546 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2087 4573 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2236 4546 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2087 4573 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2259 4568 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2236 4571 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2259 4568 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2236 4571 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2251 4578 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2259 4576 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2251 4578 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2259 4576 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2244 4561 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2251 4561 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2244 4561 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2251 4561 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2847 4416 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2244 4502 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2847 4416 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2244 4502 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3592 4417 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2847 4524 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3592 4417 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2847 4524 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4133 4428 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3592 4505 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4133 4428 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3592 4505 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4125 4553 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4133 4550 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4125 4553 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4133 4550 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4415 4546 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4125 4560 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4415 4546 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4125 4560 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4509 4537 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4415 4550 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4509 4537 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4415 4550 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4430 4568 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4509 4560 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4430 4568 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4509 4560 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4438 4554 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4430 4556 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4438 4554 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4430 4556 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4846 4459 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4438 4529 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4846 4459 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4438 4529 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4846 4578 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4846 4579 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4846 4578 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4846 4579 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5183 4487 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4846 4545 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5183 4487 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4846 4545 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5183 4574 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5183 4575 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5183 4574 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5183 4575 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5598 4482 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5183 4534 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5598 4482 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5183 4534 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5967 4487 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5598 4541 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5967 4487 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5598 4541 5 MP
+DP
+0 -58 -58 0 0 58 58 0 6139 4533 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5967 4560 5 MP
+DP
+gs 899 388 5359 4226 rc
+
+gr 
+0 sg
+%%IncludeResource: font Helvetica
+/Helvetica /ISOLatin1Encoding 120 FMSR
+
+ 744 2970 mt  -90 rotate
+(Delta Size \(bytes\)) s
+90 rotate
+3066 4901 mt 
+(To File Size \(bytes\)) s
+1 sg
+0 369 1239 0 0 -369 4880 861 4 MP
+PP
+-1239 0 0 369 1239 0 0 -369 4880 861 5 MP stroke
+DO
+4 w
+SO
+6 w
+0 sg
+4880  861 mt 6119  861 L
+4880  492 mt 6119  492 L
+4880  861 mt 4880  492 L
+6119  861 mt 6119  492 L
+4880  861 mt 6119  861 L
+4880  861 mt 4880  492 L
+4880  861 mt 6119  861 L
+4880  492 mt 6119  492 L
+4880  861 mt 4880  492 L
+6119  861 mt 6119  492 L
+5683  659 mt 
+(Vdelta) s
+gs 4880 492 1240 370 rc
+
+gr 
+c8
+  36   36 4987  615 FO
+  36   36 5415  615 FO
+gs 4880 492 1240 370 rc
+
+gr 
+0 sg
+5683  782 mt 
+(Xdelta) s
+gs 4880 492 1240 370 rc
+
+gr 
+0 -58 -58 0 0 58 58 0 4958 709 5 MP
+c9
+DP
+0 -58 -58 0 0 58 58 0 5386 709 5 MP
+DP
+gs 4880 492 1240 370 rc
+
+gr 
+
+end
+
+eplot
+%%EndObject graph 1
+
+epage
+end
+
+showpage
+
+%%Trailer
+%%EOF
diff --git a/xdelta1/doc/old/dcc99/figs/dependency.eps b/xdelta1/doc/old/dcc99/figs/dependency.eps
new file mode 100755
index 0000000..7a04029
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/dependency.eps
@@ -0,0 +1,463 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: dependency.fig
+%%Creator: fig2dev Version 3.1 Patchlevel 2
+%%CreationDate: Sun Nov  8 19:15:14 1998
+%%For: jmacd@axis.hip.berkeley.edu (Josh)
+%%Orientation: Portrait
+%%BoundingBox: 0 0 282 272
+%%Pages: 0
+%%BeginSetup
+%%IncludeFeature: *PageSize Letter
+%%EndSetup
+%Magnification: 1.00
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+0.0 271.0 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+ /DrawEllipse {
+        /endangle exch def
+        /startangle exch def
+        /yrad exch def
+        /xrad exch def
+        /y exch def
+        /x exch def
+        /savematrix mtrx currentmatrix def
+        x y tr xrad yrad sc 0 0 1 startangle endangle arc
+        closepath
+        savematrix setmatrix
+        } def
+
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+%%EndProlog
+
+$F2psBegin
+10 setmiterlimit
+n 0 792 m 0 0 l 612 0 l 612 792 l cp clip
+ 0.06000 0.06000 sc
+/Times-Roman ff 165.00 scf sf
+286 4486 m
+gs 1 -1 sc (contents) col-1 sh gr
+7.500 slw
+% Polyline
+gs  clippath
+2888 314 m 2983 235 l 2936 350 l 3033 220 l 2985 184 l  cp clip
+n 2143 1357 m 3000 214 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2888 314 m 2983 235 l 2936 350 l 2912 332 l 2888 314 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2867 279 m 2983 236 l 2900 329 l 3035 239 l 3002 189 l  cp clip
+n 2148 794 m 3006 222 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2867 279 m 2983 236 l 2900 329 l 2884 304 l 2867 279 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2935 349 m 2993 240 l 2993 364 l 3033 207 l 2975 192 l  cp clip
+n 2143 3643 m 3000 214 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2935 349 m 2993 240 l 2993 364 l 2964 357 l 2935 349 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2929 346 m 2992 239 l 2986 363 l 3033 208 l 2976 191 l  cp clip
+n 2143 3071 m 3000 214 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2929 346 m 2992 239 l 2986 363 l 2958 355 l 2929 346 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2920 341 m 2990 239 l 2976 362 l 3033 210 l 2977 189 l  cp clip
+n 2143 2500 m 3000 214 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2920 341 m 2990 239 l 2976 362 l 2948 352 l 2920 341 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2853 2470 m 2973 2500 l 2853 2530 l 3015 2530 l 3015 2470 l  cp clip
+n 2143 2500 m 3000 2500 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2853 2470 m 2973 2500 l 2853 2530 l 2853 2500 l 2853 2470 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2888 2600 m 2983 2521 l 2936 2636 l 3033 2506 l 2985 2470 l  cp clip
+n 2143 3643 m 3000 2500 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2888 2600 m 2983 2521 l 2936 2636 l 2912 2618 l 2888 2600 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2867 2565 m 2983 2522 l 2900 2615 l 3035 2525 l 3002 2475 l  cp clip
+n 2148 3080 m 3006 2508 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2867 2565 m 2983 2522 l 2900 2615 l 2884 2590 l 2867 2565 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2853 756 m 2973 786 l 2853 816 l 3015 816 l 3015 756 l  cp clip
+n 2143 786 m 3000 786 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2853 756 m 2973 786 l 2853 816 l 2853 786 l 2853 756 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2867 850 m 2983 808 l 2900 900 l 3035 811 l 3002 761 l  cp clip
+n 2148 1365 m 3006 794 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2867 850 m 2983 808 l 2900 900 l 2884 875 l 2867 850 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2929 918 m 2992 811 l 2986 935 l 3033 780 l 2976 763 l  cp clip
+n 2143 3643 m 3000 786 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2929 918 m 2992 811 l 2986 935 l 2958 927 l 2929 918 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2920 913 m 2990 811 l 2976 934 l 3033 782 l 2977 761 l  cp clip
+n 2143 3071 m 3000 786 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2920 913 m 2990 811 l 2976 934 l 2948 924 l 2920 913 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2853 1327 m 2973 1357 l 2853 1387 l 3015 1387 l 3015 1327 l  cp clip
+n 2143 1357 m 3000 1357 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2853 1327 m 2973 1357 l 2853 1387 l 2853 1357 l 2853 1327 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2888 1457 m 2983 1378 l 2936 1493 l 3033 1363 l 2985 1327 l  cp clip
+n 2143 2500 m 3000 1357 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2888 1457 m 2983 1378 l 2936 1493 l 2912 1475 l 2888 1457 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2920 1484 m 2990 1382 l 2976 1505 l 3033 1353 l 2977 1332 l  cp clip
+n 2143 3643 m 3000 1357 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2920 1484 m 2990 1382 l 2976 1505 l 2948 1495 l 2920 1484 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2853 3041 m 2973 3071 l 2853 3101 l 3015 3101 l 3015 3041 l  cp clip
+n 2143 3071 m 3000 3071 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2853 3041 m 2973 3071 l 2853 3101 l 2853 3071 l 2853 3041 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2867 3136 m 2983 3094 l 2900 3186 l 3035 3097 l 3002 3047 l  cp clip
+n 2148 3651 m 3006 3080 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2867 3136 m 2983 3094 l 2900 3186 l 2884 3161 l 2867 3136 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2853 3613 m 2973 3643 l 2853 3673 l 3015 3673 l 3015 3613 l  cp clip
+n 2143 3643 m 3000 3643 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2853 3613 m 2973 3643 l 2853 3673 l 2853 3643 l 2853 3613 l  cp gs 0.00 setgray ef gr  col-1 s
+% Ellipse
+n 2071 214 80 80 0 360 DrawEllipse gs col-1 s gr
+
+% Ellipse
+n 2071 786 80 80 0 360 DrawEllipse gs col-1 s gr
+
+% Ellipse
+n 2071 1357 80 80 0 360 DrawEllipse gs col-1 s gr
+
+% Ellipse
+n 2071 2500 80 80 0 360 DrawEllipse gs col-1 s gr
+
+% Ellipse
+n 2071 3071 80 80 0 360 DrawEllipse gs col-1 s gr
+
+% Ellipse
+n 2071 3643 80 80 0 360 DrawEllipse gs col-1 s gr
+
+% Polyline
+n 286 143 m 1143 143 l 1143 286 l 286 286 l cp gs col-1 s gr 
+% Polyline
+n 286 714 m 1143 714 l 1143 857 l 286 857 l cp gs col-1 s gr 
+% Polyline
+n 286 1286 m 1143 1286 l 1143 1429 l 286 1429 l cp gs col-1 s gr 
+% Polyline
+n 286 2429 m 1143 2429 l 1143 2571 l 286 2571 l cp gs col-1 s gr 
+% Polyline
+n 286 3000 m 1143 3000 l 1143 3143 l 286 3143 l cp gs col-1 s gr 
+% Polyline
+n 286 3571 m 1143 3571 l 1143 3714 l 286 3714 l cp gs col-1 s gr 
+% Polyline
+n 3000 143 m 3428 143 l 3428 286 l 3000 286 l cp gs col7 0.75 shd ef gr gs col-1 s gr 
+% Polyline
+n 3000 714 m 3428 714 l 3428 857 l 3000 857 l cp gs col7 0.75 shd ef gr gs col-1 s gr 
+% Polyline
+n 3000 1286 m 3428 1286 l 3428 1429 l 3000 1429 l cp gs col7 0.75 shd ef gr gs col-1 s gr 
+% Polyline
+n 3000 2429 m 3428 2429 l 3428 2571 l 3000 2571 l cp gs col7 0.75 shd ef gr gs col-1 s gr 
+% Polyline
+n 3000 3000 m 3428 3000 l 3428 3143 l 3000 3143 l cp gs col7 0.75 shd ef gr gs col-1 s gr 
+% Polyline
+n 3000 3571 m 3428 3571 l 3428 3714 l 3000 3714 l cp gs col7 0.75 shd ef gr gs col-1 s gr 
+% Polyline
+gs  clippath
+1282 729 m 1165 771 l 1249 679 l 1114 769 l 1147 819 l  cp clip
+n 2000 214 m 1143 786 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 1282 729 m 1165 771 l 1249 679 l 1265 704 l 1282 729 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1282 1300 m 1165 1342 l 1249 1251 l 1114 1340 l 1147 1390 l  cp clip
+n 2000 786 m 1143 1357 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 1282 1300 m 1165 1342 l 1249 1251 l 1265 1275 l 1282 1300 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1282 1872 m 1165 1914 l 1249 1822 l 1114 1912 l 1147 1962 l  cp clip
+n 2000 1357 m 1143 1929 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 1282 1872 m 1165 1914 l 1249 1822 l 1265 1847 l 1282 1872 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1249 2035 m 1165 1943 l 1282 1986 l 1147 1896 l 1114 1946 l  cp clip
+n 2000 2500 m 1143 1929 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 1249 2035 m 1165 1943 l 1282 1986 l 1265 2011 l 1249 2035 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1207 2065 m 1159 1950 l 1255 2029 l 1158 1899 l 1110 1935 l  cp clip
+n 2000 3071 m 1143 1929 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 1207 2065 m 1159 1950 l 1255 2029 l 1231 2047 l 1207 2065 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1182 2074 m 1155 1953 l 1236 2047 l 1163 1902 l 1109 1929 l  cp clip
+n 2000 3643 m 1143 1929 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 1182 2074 m 1155 1953 l 1236 2047 l 1209 2060 l 1182 2074 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+n 286 1857 m 1143 1857 l 1143 2000 l 286 2000 l cp gs col7 0.75 shd ef gr gs col-1 s gr 
+% Polyline
+gs  clippath
+4291 1147 m 4321 1027 l 4351 1147 l 4351 985 l 4291 985 l  cp clip
+n 4321 1286 m 4321 1000 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 4291 1147 m 4321 1027 l 4351 1147 l 4321 1147 l 4291 1147 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+4351 2746 m 4321 2866 l 4291 2746 l 4291 2908 l 4351 2908 l  cp clip
+n 4321 2893 m 4321 2607 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 4351 2746 m 4321 2866 l 4291 2746 l 4321 2746 l 4351 2746 l  cp gs 0.00 setgray ef gr  col-1 s
+/Times-Roman ff 165.00 scf sf
+4143 1429 m
+gs 1 -1 sc (reverse) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+4143 2571 m
+gs 1 -1 sc (forward) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+4143 2000 m
+gs 1 -1 sc (literal) col-1 sh gr
+% Polyline
+n 1902 0 m 1857 0 1857 384 45 arcto 4 {pop} repeat
+  1857 429 3526 429 45 arcto 4 {pop} repeat
+  3571 429 3571 45 45 arcto 4 {pop} repeat
+  3571 0 1902 0 45 arcto 4 {pop} repeat
+ cp gs col-1 s gr 
+% Polyline
+n 1902 571 m 1857 571 1857 955 45 arcto 4 {pop} repeat
+  1857 1000 3526 1000 45 arcto 4 {pop} repeat
+  3571 1000 3571 616 45 arcto 4 {pop} repeat
+  3571 571 1902 571 45 arcto 4 {pop} repeat
+ cp gs col-1 s gr 
+% Polyline
+n 1902 1143 m 1857 1143 1857 1526 45 arcto 4 {pop} repeat
+  1857 1571 3526 1571 45 arcto 4 {pop} repeat
+  3571 1571 3571 1188 45 arcto 4 {pop} repeat
+  3571 1143 1902 1143 45 arcto 4 {pop} repeat
+ cp gs col-1 s gr 
+% Polyline
+n 1902 2286 m 1857 2286 1857 2669 45 arcto 4 {pop} repeat
+  1857 2714 3526 2714 45 arcto 4 {pop} repeat
+  3571 2714 3571 2331 45 arcto 4 {pop} repeat
+  3571 2286 1902 2286 45 arcto 4 {pop} repeat
+ cp gs col-1 s gr 
+% Polyline
+n 1902 2857 m 1857 2857 1857 3241 45 arcto 4 {pop} repeat
+  1857 3286 3526 3286 45 arcto 4 {pop} repeat
+  3571 3286 3571 2902 45 arcto 4 {pop} repeat
+  3571 2857 1902 2857 45 arcto 4 {pop} repeat
+ cp gs col-1 s gr 
+% Polyline
+n 1902 3429 m 1857 3429 1857 3812 45 arcto 4 {pop} repeat
+  1857 3857 3526 3857 45 arcto 4 {pop} repeat
+  3571 3857 3571 3474 45 arcto 4 {pop} repeat
+  3571 3429 1902 3429 45 arcto 4 {pop} repeat
+ cp gs col-1 s gr 
+/Times-Roman ff 165.00 scf sf
+0 286 m
+gs 1 -1 sc (F1) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+0 857 m
+gs 1 -1 sc (F2) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+0 1429 m
+gs 1 -1 sc (F3) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+0 2000 m
+gs 1 -1 sc (F4) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+0 2571 m
+gs 1 -1 sc (F5) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+0 3143 m
+gs 1 -1 sc (F6) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+0 3714 m
+gs 1 -1 sc (F7) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+3714 286 m
+gs 1 -1 sc (D1) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+3714 857 m
+gs 1 -1 sc (D2) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+3714 1429 m
+gs 1 -1 sc (D3) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+3714 2571 m
+gs 1 -1 sc (D5) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+3714 3143 m
+gs 1 -1 sc (D6) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+3714 3714 m
+gs 1 -1 sc (D7) col-1 sh gr
+% Polyline
+gs  clippath
+2041 3861 m 2071 3741 l 2101 3861 l 2101 3699 l 2041 3699 l  cp clip
+n 2071 4143 m 2071 3714 l gs col-1 s gr gr
+
+% arrowhead
+n 2041 3861 m 2071 3741 l 2101 3861 l 2071 3861 l 2041 3861 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+3041 3861 m 3071 3741 l 3101 3861 l 3101 3699 l 3041 3699 l  cp clip
+n 3071 4143 m 3071 3714 l gs col-1 s gr gr
+
+% arrowhead
+n 3041 3861 m 3071 3741 l 3101 3861 l 3071 3861 l 3041 3861 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+327 3861 m 357 3741 l 387 3861 l 387 3699 l 327 3699 l  cp clip
+n 357 4143 m 357 3714 l gs col-1 s gr gr
+
+% arrowhead
+n 327 3861 m 357 3741 l 387 3861 l 357 3861 l 327 3861 l  cp gs 0.00 setgray ef gr  col-1 s
+/Times-Roman ff 165.00 scf sf
+2000 4286 m
+gs 1 -1 sc (control) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+3000 4486 m
+gs 1 -1 sc (data) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+3000 4286 m
+gs 1 -1 sc (insert) col-1 sh gr
+/Times-Roman ff 165.00 scf sf
+286 4286 m
+gs 1 -1 sc (version) col-1 sh gr
+% Polyline
+gs  clippath
+2853 184 m 2973 214 l 2853 244 l 3015 244 l 3015 184 l  cp clip
+n 2143 214 m 3000 214 l gs col7 0.75 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2853 184 m 2973 214 l 2853 244 l 2853 214 l 2853 184 l  cp gs 0.00 setgray ef gr  col-1 s
+$F2psEnd
+rs
diff --git a/xdelta1/doc/old/dcc99/figs/dependency.fig b/xdelta1/doc/old/dcc99/figs/dependency.fig
new file mode 100755
index 0000000..eaf2e6f
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/dependency.fig
@@ -0,0 +1,174 @@
+#FIG 3.1
+Portrait
+Center
+Inches
+1200 2
+6 0 0 4714 4500
+6 0 0 4714 3857
+6 286 0 3428 3857
+6 2143 179 3036 3679
+6 2143 179 3036 3643
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 214 3000 214
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 1357 3000 214
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2148 794 3006 222
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 3643 3000 214
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 3071 3000 214
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 2500 3000 214
+-6
+6 2143 2464 3036 3643
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 2500 3000 2500
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 3643 3000 2500
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2148 3080 3006 2508
+-6
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 786 3000 786
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2148 1365 3006 794
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 3643 3000 786
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 3071 3000 786
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 1357 3000 1357
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 2500 3000 1357
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 3643 3000 1357
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 3071 3000 3071
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2148 3651 3006 3080
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2143 3643 3000 3643
+-6
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 2071 214 80 80 2071 214 2107 286
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 2071 786 80 80 2071 786 2107 857
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 2071 1357 80 80 2071 1357 2107 1429
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 2071 2500 80 80 2071 2500 2107 2571
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 2071 3071 80 80 2071 3071 2107 3143
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 2071 3643 80 80 2071 3643 2107 3714
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         286 143 1143 143 1143 286 286 286 286 143
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         286 714 1143 714 1143 857 286 857 286 714
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         286 1286 1143 1286 1143 1429 286 1429 286 1286
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         286 2429 1143 2429 1143 2571 286 2571 286 2429
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         286 3000 1143 3000 1143 3143 286 3143 286 3000
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         286 3571 1143 3571 1143 3714 286 3714 286 3571
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         3000 143 3428 143 3428 286 3000 286 3000 143
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         3000 714 3428 714 3428 857 3000 857 3000 714
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         3000 1286 3428 1286 3428 1429 3000 1429 3000 1286
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         3000 2429 3428 2429 3428 2571 3000 2571 3000 2429
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         3000 3000 3428 3000 3428 3143 3000 3143 3000 3000
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         3000 3571 3428 3571 3428 3714 3000 3714 3000 3571
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2000 214 1143 786
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2000 786 1143 1357
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2000 1357 1143 1929
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2000 2500 1143 1929
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2000 3071 1143 1929
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2000 3643 1143 1929
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         286 1857 1143 1857 1143 2000 286 2000 286 1857
+-6
+6 4143 857 4714 3000
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4321 1286 4321 1000
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 0 1 2
+        1 1 1.00 60.00 120.00
+         4321 2893 4321 2607
+4 0 -1 0 0 0 11 0.0000 0 86 500 4143 1429 reverse\001
+4 0 -1 0 0 0 11 0.0000 0 121 536 4143 2571 forward\001
+4 0 -1 0 0 0 11 0.0000 0 121 393 4143 2000 literal\001
+-6
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 3 0 0 5
+         3571 429 3571 0 1857 0 1857 429 3571 429
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 3 0 0 5
+         3571 1000 3571 571 1857 571 1857 1000 3571 1000
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 3 0 0 5
+         3571 1571 3571 1143 1857 1143 1857 1571 3571 1571
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 3 0 0 5
+         3571 2714 3571 2286 1857 2286 1857 2714 3571 2714
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 3 0 0 5
+         3571 3286 3571 2857 1857 2857 1857 3286 3571 3286
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 3 0 0 5
+         3571 3857 3571 3429 1857 3429 1857 3857 3571 3857
+4 0 -1 0 0 0 11 0.0000 0 121 186 0 286 F1\001
+4 0 -1 0 0 0 11 0.0000 0 121 186 0 857 F2\001
+4 0 -1 0 0 0 11 0.0000 0 121 186 0 1429 F3\001
+4 0 -1 0 0 0 11 0.0000 0 121 186 0 2000 F4\001
+4 0 -1 0 0 0 11 0.0000 0 121 186 0 2571 F5\001
+4 0 -1 0 0 0 11 0.0000 0 121 186 0 3143 F6\001
+4 0 -1 0 0 0 11 0.0000 0 121 186 0 3714 F7\001
+4 0 -1 0 0 0 11 0.0000 0 121 207 3714 286 D1\001
+4 0 -1 0 0 0 11 0.0000 0 121 207 3714 857 D2\001
+4 0 -1 0 0 0 11 0.0000 0 121 207 3714 1429 D3\001
+4 0 -1 0 0 0 11 0.0000 0 121 207 3714 2571 D5\001
+4 0 -1 0 0 0 11 0.0000 0 121 207 3714 3143 D6\001
+4 0 -1 0 0 0 11 0.0000 0 121 207 3714 3714 D7\001
+-6
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         2071 4143 2071 3714
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         3071 4143 3071 3714
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         357 4143 357 3714
+4 0 -1 0 0 0 11 0.0000 0 121 493 2000 4286 control\001
+4 0 -1 0 0 0 11 0.0000 0 121 293 3000 4486 data\001
+4 0 -1 0 0 0 11 0.0000 0 121 393 3000 4286 insert\001
+4 0 -1 0 0 0 11 0.0000 0 121 507 286 4286 version\001
+4 0 -1 0 0 0 11 0.0000 0 107 600 286 4486 contents\001
+-6
diff --git a/xdelta1/doc/old/dcc99/figs/dependency.fig.normalsize b/xdelta1/doc/old/dcc99/figs/dependency.fig.normalsize
new file mode 100755
index 0000000..83ce9ea
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/dependency.fig.normalsize
@@ -0,0 +1,174 @@
+#FIG 3.1
+Landscape
+Center
+Inches
+1200 2
+6 0 0 9900 9450
+6 0 0 9900 8100
+6 600 0 7200 8100
+6 4500 375 6375 7725
+6 4500 375 6375 7650
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 450 6300 450
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 2850 6300 450
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4512 1667 6312 467
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 7650 6300 450
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 6450 6300 450
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 5250 6300 450
+-6
+6 4500 5175 6375 7650
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 5250 6300 5250
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 7650 6300 5250
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4512 6467 6312 5267
+-6
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 1650 6300 1650
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4512 2867 6312 1667
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 7650 6300 1650
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 6450 6300 1650
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 2850 6300 2850
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 5250 6300 2850
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 7650 6300 2850
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 6450 6300 6450
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4512 7667 6312 6467
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4500 7650 6300 7650
+-6
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 4350 450 168 168 4350 450 4425 600
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 4350 1650 168 168 4350 1650 4425 1800
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 4350 2850 168 168 4350 2850 4425 3000
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 4350 5250 168 168 4350 5250 4425 5400
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 4350 6450 168 168 4350 6450 4425 6600
+1 3 0 1 -1 7 0 0 -1 0.000 1 0.0000 4350 7650 168 168 4350 7650 4425 7800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         600 300 2400 300 2400 600 600 600 600 300
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         600 1500 2400 1500 2400 1800 600 1800 600 1500
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         600 2700 2400 2700 2400 3000 600 3000 600 2700
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         600 5100 2400 5100 2400 5400 600 5400 600 5100
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         600 6300 2400 6300 2400 6600 600 6600 600 6300
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         600 7500 2400 7500 2400 7800 600 7800 600 7500
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         6300 300 7200 300 7200 600 6300 600 6300 300
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         6300 1500 7200 1500 7200 1800 6300 1800 6300 1500
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         6300 2700 7200 2700 7200 3000 6300 3000 6300 2700
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         6300 5100 7200 5100 7200 5400 6300 5400 6300 5100
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         6300 6300 7200 6300 7200 6600 6300 6600 6300 6300
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         6300 7500 7200 7500 7200 7800 6300 7800 6300 7500
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4200 450 2400 1650
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4200 1650 2400 2850
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4200 2850 2400 4050
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4200 5250 2400 4050
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4200 6450 2400 4050
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4200 7650 2400 4050
+2 2 0 1 -1 7 0 0 15 0.000 0 0 -1 0 0 5
+         600 3900 2400 3900 2400 4200 600 4200 600 3900
+-6
+6 8700 1800 9900 6300
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         9075 2700 9075 2100
+2 1 0 1 -1 7 0 0 15 0.000 0 0 -1 0 1 2
+        1 1 1.00 60.00 120.00
+         9075 6075 9075 5475
+4 0 -1 0 0 0 24 0.0000 0 180 1050 8700 3000 reverse\001
+4 0 -1 0 0 0 24 0.0000 0 255 1125 8700 5400 forward\001
+4 0 -1 0 0 0 24 0.0000 0 255 825 8700 4200 literal\001
+-6
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 7 0 0 5
+         7500 900 7500 0 3900 0 3900 900 7500 900
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 7 0 0 5
+         7500 2100 7500 1200 3900 1200 3900 2100 7500 2100
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 7 0 0 5
+         7500 3300 7500 2400 3900 2400 3900 3300 7500 3300
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 7 0 0 5
+         7500 5700 7500 4800 3900 4800 3900 5700 7500 5700
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 7 0 0 5
+         7500 6900 7500 6000 3900 6000 3900 6900 7500 6900
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 7 0 0 5
+         7500 8100 7500 7200 3900 7200 3900 8100 7500 8100
+4 0 -1 0 0 0 24 0.0000 0 255 390 0 600 F1\001
+4 0 -1 0 0 0 24 0.0000 0 255 390 0 1800 F2\001
+4 0 -1 0 0 0 24 0.0000 0 255 390 0 3000 F3\001
+4 0 -1 0 0 0 24 0.0000 0 255 390 0 4200 F4\001
+4 0 -1 0 0 0 24 0.0000 0 255 390 0 5400 F5\001
+4 0 -1 0 0 0 24 0.0000 0 255 390 0 6600 F6\001
+4 0 -1 0 0 0 24 0.0000 0 255 390 0 7800 F7\001
+4 0 -1 0 0 0 24 0.0000 0 255 435 7800 600 D1\001
+4 0 -1 0 0 0 24 0.0000 0 255 435 7800 1800 D2\001
+4 0 -1 0 0 0 24 0.0000 0 255 435 7800 3000 D3\001
+4 0 -1 0 0 0 24 0.0000 0 255 435 7800 5400 D5\001
+4 0 -1 0 0 0 24 0.0000 0 255 435 7800 6600 D6\001
+4 0 -1 0 0 0 24 0.0000 0 255 435 7800 7800 D7\001
+-6
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         4350 8700 4350 7800
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         6450 8700 6450 7800
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         750 8700 750 7800
+4 0 -1 0 0 0 24 0.0000 0 255 1035 4200 9000 control\001
+4 0 -1 0 0 0 24 0.0000 0 255 615 6300 9420 data\001
+4 0 -1 0 0 0 24 0.0000 0 255 825 6300 9000 insert\001
+4 0 -1 0 0 0 24 0.0000 0 255 1065 600 9000 version\001
+4 0 -1 0 0 0 24 0.0000 0 225 1260 600 9420 contents\001
+-6
diff --git a/xdelta1/doc/old/dcc99/figs/jumping.eps b/xdelta1/doc/old/dcc99/figs/jumping.eps
new file mode 100755
index 0000000..f3e3715
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/jumping.eps
@@ -0,0 +1,154 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: jumping.fig
+%%Creator: fig2dev Version 3.1 Patchlevel 2
+%%CreationDate: Sun Nov  8 08:25:36 1998
+%%For: jmacd@axis.hip.berkeley.edu (Josh)
+%%Orientation: Portrait
+%%BoundingBox: 0 0 194 30
+%%Pages: 0
+%%BeginSetup
+%%IncludeFeature: *PageSize Letter
+%%EndSetup
+%Magnification: 1.00
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+1.0 29.0 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+%%EndProlog
+
+$F2psBegin
+10 setmiterlimit
+n 0 792 m 0 0 l 612 0 l 612 792 l cp clip
+ 0.06000 0.06000 sc
+7.500 slw
+% Polyline
+gs  clippath
+2737 425 m 2857 455 l 2737 485 l 2899 485 l 2899 425 l  cp clip
+n 304 455 m 2884 455 l gs col-1 s gr gr
+
+% arrowhead
+n 2737 425 m 2857 455 l 2737 485 l 2737 455 l 2737 425 l  cp gs 0.00 setgray ef gr  col-1 s
+/Times-Roman ff 255.00 scf sf
+382 227 m
+gs 1 -1 sc (R) col-1 sh gr
+% Polyline
+n 609 0 m 915 0 l 915 303 l 609 303 l cp gs col-1 s gr 
+/Times-Roman ff 255.00 scf sf
+685 227 m
+gs 1 -1 sc (L) col-1 sh gr
+% Polyline
+n 915 0 m 1221 0 l 1221 303 l 915 303 l cp gs col-1 s gr 
+/Times-Roman ff 255.00 scf sf
+992 227 m
+gs 1 -1 sc (F) col-1 sh gr
+% Polyline
+n 0 0 m 306 0 l 306 303 l 0 303 l cp gs col-1 s gr 
+/Times-Roman ff 255.00 scf sf
+76 227 m
+gs 1 -1 sc (R) col-1 sh gr
+% Polyline
+n 1221 0 m 1527 0 l 1527 303 l 1221 303 l cp gs col-1 s gr 
+/Times-Roman ff 255.00 scf sf
+1297 227 m
+gs 1 -1 sc (F) col-1 sh gr
+% Polyline
+n 1983 0 m 2289 0 l 2289 303 l 1983 303 l cp gs col-1 s gr 
+/Times-Roman ff 255.00 scf sf
+2059 227 m
+gs 1 -1 sc (R) col-1 sh gr
+% Polyline
+n 2289 0 m 2595 0 l 2595 303 l 2289 303 l cp gs col-1 s gr 
+/Times-Roman ff 255.00 scf sf
+2365 227 m
+gs 1 -1 sc (L) col-1 sh gr
+% Polyline
+n 2595 0 m 2898 0 l 2898 303 l 2595 303 l cp gs col-1 s gr 
+/Times-Roman ff 255.00 scf sf
+2669 227 m
+gs 1 -1 sc (F) col-1 sh gr
+% Polyline
+n 1677 0 m 1983 0 l 1983 303 l 1677 303 l cp gs col-1 s gr 
+/Times-Roman ff 255.00 scf sf
+1753 227 m
+gs 1 -1 sc (R) col-1 sh gr
+% Polyline
+n 2898 0 m 3204 0 l 3204 303 l 2898 303 l cp gs col-1 s gr 
+/Times-Roman ff 255.00 scf sf
+2975 227 m
+gs 1 -1 sc (F) col-1 sh gr
+% Polyline
+n 306 0 m 609 0 l 609 303 l 306 303 l cp gs col-1 s gr 
+$F2psEnd
+rs
diff --git a/xdelta1/doc/old/dcc99/figs/jumping.fig b/xdelta1/doc/old/dcc99/figs/jumping.fig
new file mode 100755
index 0000000..7157399
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/jumping.fig
@@ -0,0 +1,70 @@
+#FIG 3.1
+Portrait
+Center
+Inches
+1200 2
+6 0 0 3225 493
+6 0 0 3204 303
+6 0 0 1527 303
+6 0 0 1527 303
+6 306 0 609 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         306 0 609 0 609 303 306 303 306 0
+4 0 -1 0 0 0 17 0.0000 0 177 168 382 227 R\001
+-6
+6 609 0 915 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         609 0 915 0 915 303 609 303 609 0
+4 0 -1 0 0 0 17 0.0000 0 177 153 685 227 L\001
+-6
+6 915 0 1221 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         915 0 1221 0 1221 303 915 303 915 0
+4 0 -1 0 0 0 17 0.0000 0 177 137 992 227 F\001
+-6
+6 0 0 306 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         0 0 306 0 306 303 0 303 0 0
+4 0 -1 0 0 0 17 0.0000 0 177 168 76 227 R\001
+-6
+6 1221 0 1527 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1221 0 1527 0 1527 303 1221 303 1221 0
+4 0 -1 0 0 0 17 0.0000 0 177 137 1297 227 F\001
+-6
+-6
+-6
+6 1677 0 3204 303
+6 1677 0 3204 303
+6 1983 0 2289 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1983 0 2289 0 2289 303 1983 303 1983 0
+4 0 -1 0 0 0 17 0.0000 0 177 168 2059 227 R\001
+-6
+6 2289 0 2595 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2289 0 2595 0 2595 303 2289 303 2289 0
+4 0 -1 0 0 0 17 0.0000 0 177 153 2365 227 L\001
+-6
+6 2595 0 2898 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2595 0 2898 0 2898 303 2595 303 2595 0
+4 0 -1 0 0 0 17 0.0000 0 177 137 2669 227 F\001
+-6
+6 1677 0 1983 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1677 0 1983 0 1983 303 1677 303 1677 0
+4 0 -1 0 0 0 17 0.0000 0 177 168 1753 227 R\001
+-6
+6 2898 0 3204 303
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2898 0 3204 0 3204 303 2898 303 2898 0
+4 0 -1 0 0 0 17 0.0000 0 177 137 2975 227 F\001
+-6
+-6
+-6
+-6
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         304 455 2884 455
+-6
diff --git a/xdelta1/doc/old/dcc99/figs/normalize.fig b/xdelta1/doc/old/dcc99/figs/normalize.fig
new file mode 100755
index 0000000..4bcf428
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/normalize.fig
@@ -0,0 +1,256 @@
+#FIG 3.1
+Landscape
+Center
+Inches
+1200 2
+6 2100 9900 15300 10875
+4 0 -1 0 0 12 34 0.0000 4 300 2100 2100 10275 Actual \001
+4 0 -1 0 0 12 34 0.0000 4 300 1200 2100 10755 File\001
+4 0 -1 0 0 12 34 0.0000 4 375 1200 5700 10275 Copy\001
+4 0 -1 0 0 12 34 0.0000 4 375 2400 5700 10755 Segments\001
+4 0 -1 0 0 12 34 0.0000 4 285 1800 9300 10200 Insert\001
+4 0 -1 0 0 12 34 0.0000 4 375 2400 9300 10680 Segments\001
+4 0 -1 0 0 12 34 0.0000 4 390 2400 12900 10275 Physical\001
+4 0 -1 0 0 12 34 0.0000 4 375 2100 12900 10755 Storage\001
+-6
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 600 4500 600 4500 1200 1500 1200 1500 600
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 1800 4500 1800 4500 2400 1500 2400 1500 1800
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 3000 4500 3000 4500 3600 1500 3600 1500 3000
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 4200 4500 4200 4500 4800 1500 4800 1500 4200
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 5400 4500 5400 4500 6000 1500 6000 1500 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 5400 4500 5400 4500 6000 1500 6000 1500 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 4200 4500 4200 4500 4800 1500 4800 1500 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 3000 4500 3000 4500 3600 1500 3600 1500 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 1800 4500 1800 4500 2400 1500 2400 1500 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 600 4500 600 4500 1200 1500 1200 1500 600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 6600 4500 6600 4500 7200 1500 7200 1500 6600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 600 8100 600 8100 1200 5100 1200 5100 600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 1800 8100 1800 8100 2400 5100 2400 5100 1800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 3000 8100 3000 8100 3600 5100 3600 5100 3000
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 4200 8100 4200 8100 4800 5100 4800 5100 4200
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 5400 8100 5400 8100 6000 5100 6000 5100 5400
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 6600 8100 6600 8100 7200 5100 7200 5100 6600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 600 11700 600 11700 1200 8700 1200 8700 600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 1800 11700 1800 11700 2400 8700 2400 8700 1800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 3000 11700 3000 11700 3600 8700 3600 8700 3000
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 4200 11700 4200 11700 4800 8700 4800 8700 4200
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 5400 11700 5400 11700 6000 8700 6000 8700 5400
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 6600 11700 6600 11700 7200 8700 7200 8700 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5400 600 8100 600 8100 1200 5400 1200 5400 600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 600 9000 600 9000 1200 8700 1200 8700 600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5400 1800 6000 1800 6000 2400 5400 2400 5400 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 1800 6600 1800 6600 2400 6300 2400 6300 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7200 1800 8100 1800 8100 2400 7200 2400 7200 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 1800 9000 1800 9000 2400 8700 2400 8700 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9600 1800 9900 1800 9900 2400 9600 2400 9600 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10200 1800 10800 1800 10800 2400 10200 2400 10200 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5100 3000 6000 3000 6000 3600 5100 3600 5100 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 3000 6600 3000 6600 3600 6300 3600 6300 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7200 3000 7500 3000 7500 3600 7200 3600 7200 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7800 3000 8100 3000 8100 3600 7800 3600 7800 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9600 3000 9900 3000 9900 3600 9600 3600 9600 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10200 3000 10800 3000 10800 3600 10200 3600 10200 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11100 3000 11400 3000 11400 3600 11100 3600 11100 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6900 4200 7200 4200 7200 4200 6900 4200 6900 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5700 4200 6000 4200 6000 4800 5700 4800 5700 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 4200 6600 4200 6600 4800 6300 4800 6300 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5100 4200 5400 4200 5400 4800 5100 4800 5100 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7200 4200 7500 4200 7500 4800 7200 4800 7200 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6000 4200 6300 4200 6300 4800 6000 4800 6000 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6600 4200 7200 4200 7200 4800 6600 4800 6600 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5700 5400 6000 5400 6000 6000 5700 6000 5700 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 5400 6600 5400 6600 6000 6300 6000 6300 5400
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6000 5400 6300 5400 6300 6000 6000 6000 6000 5400
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6600 5400 7200 5400 7200 6000 6600 6000 6600 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10800 5400 11700 5400 11700 6000 10800 6000 10800 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 5400 9300 5400 9300 6000 8700 6000 8700 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11100 4200 11700 4200 11700 4800 11100 4800 11100 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5100 6600 5400 6600 5400 7200 5100 7200 5100 6600
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6000 6600 6300 6600 6300 7200 6000 7200 6000 6600
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6600 7200 7200 7200 7200 6600 6600 6600 6600 7200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         7500 6600 8100 6600 8100 7200 7500 7200 7500 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9000 6600 9600 6600 9600 7200 9000 7200 9000 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9900 6600 10200 6600 10200 7200 9900 7200 9900 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10800 6600 11100 6600 11100 7200 10800 7200 10800 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 6600 13500 6600 13500 7200 12300 7200 12300 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 4800 12900 4800 12900 4200 12300 4200 12300 4800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 3600 13500 3600 13500 3000 12300 3000 12300 3600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 2400 13500 2400 13500 1800 12300 1800 12300 2400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 600 12600 600 12600 1200 12300 1200 12300 600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1500 7800 4500 7800 4500 8400 1500 8400 1500 7800
+2 2 0 1 -1 7 0 0 20 0.000 0 0 -1 0 0 5
+         1500 7800 4500 7800 4500 8400 1500 8400 1500 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 7800 4500 7800 4500 8400 1500 8400 1500 7800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 7800 8100 7800 8100 8400 5100 8400 5100 7800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 7800 11700 7800 11700 8400 8700 8400 8700 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 7800 11700 7800 11700 8400 8700 8400 8700 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 7800 15300 7800 15300 8400 12300 8400 12300 7800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1496 8996 4496 8996 4496 9596 1496 9596 1496 8996
+2 2 0 1 -1 7 0 0 20 0.000 0 0 -1 0 0 5
+         1496 8996 4496 8996 4496 9596 1496 9596 1496 8996
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5096 8996 8096 8996 8096 9596 5096 9596 5096 8996
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1496 8996 4496 8996 4496 9596 1496 9596 1496 8996
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5100 9000 5400 9000 5400 9600 5100 9600 5100 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5400 9000 5700 9000 5700 9600 5400 9600 5400 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5700 9000 6000 9000 6000 9600 5700 9600 5700 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6000 9000 6300 9000 6300 9600 6000 9600 6000 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6600 9000 7200 9000 7200 9600 6600 9600 6600 9000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9900 9000 10200 9000 10200 9600 9900 9600 9900 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         7200 9000 7500 9000 7500 9600 7200 9600 7200 9000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11100 9000 11700 9000 11700 9600 11100 9600 11100 9000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 9000 13200 9000 13200 9600 12300 9600 12300 9000
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8696 8996 11696 8996 11696 9596 8696 9596 8696 8996
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 5400 13800 5400 13800 6000 12300 6000 12300 5400
+2 4 0 1 -1 7 0 0 -1 0.000 0 0 7 0 0 5
+         13950 6150 13950 450 4950 450 4950 6150 13950 6150
+4 0 -1 0 0 0 34 0.0000 0 345 1035 300 8250 F7 = \001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 7050 F6 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 5850 F5 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 3450 F3 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 2250 F2 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 1050 F1 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 9450 F8 =\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 1200 DISULPHIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 2400 BISULPHIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 3600 DISELENIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 4800 DISULPHINE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 6000 ESSELENIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 7200 DISULPHONE\001
+4 0 -1 0 0 5 34 0.0000 0 285 2700 5400 1200 ISULPHIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 8700 1200 D\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 5400 2400 IS\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 6300 2400 L\001
+4 0 -1 0 0 5 34 0.0000 0 285 900 7200 2400 IDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 8700 2400 B\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 9600 2400 U\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 10200 2400 PH\001
+4 0 -1 0 0 5 34 0.0000 0 285 1800 9600 3600 E EN D\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 5100 3600 DIS L  I E\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 8700 6000 ES\001
+4 0 -1 0 0 5 34 0.0000 0 285 900 10800 6000 IAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 1500 5700 6000 SELEN\001
+4 0 -1 0 0 5 34 0.0000 0 285 2400 5100 4800 DISULPHI\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 11100 4800 NE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 5100 7200 D  U PH NE\001
+4 0 -1 0 0 5 34 0.0000 0 285 2400 8700 7200  IS U  O\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 8400 TROEZENIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 8700 8400 TROEZENIAN\001
+4 0 -1 0 0 12 34 0.0000 4 285 3000 1496 9521 ESSELENIST\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 9450 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 8250 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 7050 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 5850 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 4650 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 3450 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 2250 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 1050 =\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 9450 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 7050 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 5850 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 4650 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 3450 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 2250 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 1050 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 8250 +\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 4650 F4 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 9450 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 8250 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 6975 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 5850 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 4575 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 3450 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 2250 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 1050 =\001
+4 0 -1 0 0 5 34 0.0000 0 285 6600 5100 9600 ESSE ENI        L   ST\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 12300 1200 D\001
+4 0 -1 0 0 5 34 0.0000 0 285 1200 12300 2400 BUPH\001
+4 0 -1 0 0 5 34 0.0000 0 285 1200 12300 3600 EEND\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 12300 4800 NE\001
+4 0 -1 0 0 5 34 0.0000 0 285 1500 12300 6000 ESIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 1200 12300 7200 ISUO\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 12300 8400 TROEZENIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 900 12300 9600 LST\001
diff --git a/xdelta1/doc/old/dcc99/figs/onestep.eps b/xdelta1/doc/old/dcc99/figs/onestep.eps
new file mode 100755
index 0000000..80f4ed8
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/onestep.eps
@@ -0,0 +1,930 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: onestep.fig
+%%Creator: fig2dev Version 3.1 Patchlevel 2
+%%CreationDate: Sun Nov  8 03:20:13 1998
+%%For: jmacd@axis.hip.berkeley.edu (Josh)
+%%Orientation: Portrait
+%%BoundingBox: 0 0 336 229
+%%Pages: 0
+%%BeginSetup
+%%IncludeFeature: *PageSize Letter
+%%EndSetup
+%Magnification: 1.00
+%%EndComments
+/MyAppDict 100 dict dup begin def
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+0.0 228.0 translate
+1 -1 scale
+.9 .9 scale % to make patterns same scale as in xfig
+
+% This junk string is used by the show operators
+/PATsstr 1 string def
+/PATawidthshow {        % cx cy cchar rx ry string
+  % Loop over each character in the string
+  {  % cx cy cchar rx ry char
+    % Show the character
+    dup                         % cx cy cchar rx ry char char
+    PATsstr dup 0 4 -1 roll put % cx cy cchar rx ry char (char)
+    false charpath              % cx cy cchar rx ry char
+    /clip load PATdraw
+    % Move past the character (charpath modified the
+    % current point)
+    currentpoint                        % cx cy cchar rx ry char x y
+    newpath
+    moveto                      % cx cy cchar rx ry char
+    % Reposition by cx,cy if the character in the string is cchar
+    3 index eq {                        % cx cy cchar rx ry
+      4 index 4 index rmoveto
+    } if
+    % Reposition all characters by rx ry
+    2 copy rmoveto              % cx cy cchar rx ry
+  } forall
+  pop pop pop pop pop           % -
+  currentpoint
+  newpath
+  moveto
+} bind def
+/PATcg {
+  7 dict dup begin
+    /lw currentlinewidth def
+    /lc currentlinecap def
+    /lj currentlinejoin def
+    /ml currentmiterlimit def
+    /ds [ currentdash ] def
+    /cc [ currentrgbcolor ] def
+    /cm matrix currentmatrix def
+  end
+} bind def
+% PATdraw - calculates the boundaries of the object and
+% fills it with the current pattern
+/PATdraw {                      % proc
+  save exch
+    PATpcalc                    % proc nw nh px py
+    5 -1 roll exec              % nw nh px py
+    newpath
+    PATfill                     % -
+  restore
+} bind def
+% PATfill - performs the tiling for the shape
+/PATfill { % nw nh px py PATfill -
+  PATDict /CurrentPattern get dup begin
+    setfont
+    % Set the coordinate system to Pattern Space
+    PatternGState PATsg
+    % Set the color for uncolored pattezns
+    PaintType 2 eq { PATDict /PColor get PATsc } if
+    % Create the string for showing
+    3 index string              % nw nh px py str
+    % Loop for each of the pattern sources
+    0 1 Multi 1 sub {           % nw nh px py str source
+        % Move to the starting location
+        3 index 3 index         % nw nh px py str source px py
+        moveto                  % nw nh px py str source
+        % For multiple sources, set the appropriate color
+        Multi 1 ne { dup PC exch get PATsc } if
+        % Set the appropriate string for the source
+        0 1 7 index 1 sub { 2 index exch 2 index put } for pop
+        % Loop over the number of vertical cells
+        3 index                 % nw nh px py str nh
+        {                       % nw nh px py str
+          currentpoint          % nw nh px py str cx cy
+          2 index show          % nw nh px py str cx cy
+          YStep add moveto      % nw nh px py str
+        } repeat                % nw nh px py str
+    } for
+    5 { pop } repeat
+  end
+} bind def
+
+% PATkshow - kshow with the current pattezn
+/PATkshow {                     % proc string
+  exch bind                     % string proc
+  1 index 0 get                 % string proc char
+  % Loop over all but the last character in the string
+  0 1 4 index length 2 sub {
+                                % string proc char idx
+    % Find the n+1th character in the string
+    3 index exch 1 add get      % string proe char char+1
+    exch 2 copy                 % strinq proc char+1 char char+1 char
+    % Now show the nth character
+    PATsstr dup 0 4 -1 roll put % string proc chr+1 chr chr+1 (chr)
+    false charpath              % string proc char+1 char char+1
+    /clip load PATdraw
+    % Move past the character (charpath modified the current point)
+    currentpoint newpath moveto
+    % Execute the user proc (should consume char and char+1)
+    mark 3 1 roll               % string proc char+1 mark char char+1
+    4 index exec                % string proc char+1 mark...
+    cleartomark                 % string proc char+1
+  } for
+  % Now display the last character
+  PATsstr dup 0 4 -1 roll put   % string proc (char+1)
+  false charpath                % string proc
+  /clip load PATdraw
+  neewath
+  pop pop                       % -
+} bind def
+% PATmp - the makepattern equivalent
+/PATmp {                        % patdict patmtx PATmp patinstance
+  exch dup length 7 add         % We will add 6 new entries plus 1 FID
+  dict copy                     % Create a new dictionary
+  begin
+    % Matrix to install when painting the pattern
+    TilingType PATtcalc
+    /PatternGState PATcg def
+    PatternGState /cm 3 -1 roll put
+    % Check for multi pattern sources (Level 1 fast color patterns)
+    currentdict /Multi known not { /Multi 1 def } if
+    % Font dictionary definitions
+    /FontType 3 def
+    % Create a dummy encoding vector
+    /Encoding 256 array def
+    3 string 0 1 255 {
+      Encoding exch dup 3 index cvs cvn put } for pop
+    /FontMatrix matrix def
+    /FontBBox BBox def
+    /BuildChar {
+        mark 3 1 roll           % mark dict char
+        exch begin
+        Multi 1 ne {PaintData exch get}{pop} ifelse  % mark [paintdata]
+          PaintType 2 eq Multi 1 ne or
+          { XStep 0 FontBBox aload pop setcachedevice }
+          { XStep 0 setcharwidth } ifelse
+          currentdict           % mark [paintdata] dict
+          /PaintProc load       % mark [paintdata] dict paintproc
+        end
+        gsave
+          false PATredef exec true PATredef
+        grestore
+        cleartomark             % -
+    } bind def
+    currentdict
+  end                           % newdict
+  /foo exch                     % /foo newlict
+  definefont                    % newfont
+} bind def
+% PATpcalc - calculates the starting point and width/height
+% of the tile fill for the shape
+/PATpcalc {     % - PATpcalc nw nh px py
+  PATDict /CurrentPattern get begin
+    gsave
+        % Set up the coordinate system to Pattern Space
+        % and lock down pattern
+        PatternGState /cm get setmatrix
+        BBox aload pop pop pop translate
+        % Determine the bounding box of the shape
+        pathbbox                        % llx lly urx ury
+    grestore
+    % Determine (nw, nh) the # of cells to paint width and height
+    PatHeight div ceiling               % llx lly urx qh
+    4 1 roll                            % qh llx lly urx
+    PatWidth div ceiling                % qh llx lly qw
+    4 1 roll                            % qw qh llx lly
+    PatHeight div floor                 % qw qh llx ph
+    4 1 roll                            % ph qw qh llx
+    PatWidth div floor                  % ph qw qh pw
+    4 1 roll                            % pw ph qw qh
+    2 index sub cvi abs                 % pw ph qs qh-ph
+    exch 3 index sub cvi abs exch       % pw ph nw=qw-pw nh=qh-ph
+    % Determine the starting point of the pattern fill
+    %(px, py)
+    4 2 roll                            % nw nh pw ph
+    PatHeight mul                       % nw nh pw py
+    exch                                % nw nh py pw
+    PatWidth mul exch                   % nw nh px py
+  end
+} bind def
+
+% Save the original routines so that we can use them later on
+/oldfill        /fill load def
+/oldeofill      /eofill load def
+/oldstroke      /stroke load def
+/oldshow        /show load def
+/oldashow       /ashow load def
+/oldwidthshow   /widthshow load def
+/oldawidthshow  /awidthshow load def
+/oldkshow       /kshow load def
+
+% These defs are necessary so that subsequent procs don't bind in
+% the originals
+/fill      { oldfill } bind def
+/eofill    { oldeofill } bind def
+/stroke    { oldstroke } bind def
+/show      { oldshow } bind def
+/ashow     { oldashow } bind def
+/widthshow { oldwidthshow } bind def
+/awidthshow { oldawidthshow } bind def
+/kshow     { oldkshow } bind def
+/PATredef {
+  MyAppDict begin
+    {
+    /fill { /clip load PATdraw newpath } bind def
+    /eofill { /eoclip load PATdraw newpath } bind def
+    /stroke { PATstroke } bind def
+    /show { 0 0 null 0 0 6 -1 roll PATawidthshow } bind def
+    /ashow { 0 0 null 6 3 roll PATawidthshow }
+    bind def
+    /widthshow { 0 0 3 -1 roll PATawidthshow }
+    bind def
+    /awidthshow { PATawidthshow } bind def
+    /kshow { PATkshow } bind def
+  } {
+    /fill   { oldfill } bind def
+    /eofill { oldeofill } bind def
+    /stroke { oldstroke } bind def
+    /show   { oldshow } bind def
+    /ashow  { oldashow } bind def
+    /widthshow { oldwidthshow } bind def
+    /awidthshow { oldawidthshow } bind def
+    /kshow  { oldkshow } bind def
+    } ifelse
+  end
+} bind def
+false PATredef
+% Conditionally define setcmykcolor if not available
+/setcmykcolor where { pop } {
+  /setcmykcolor {
+    1 sub 4 1 roll
+    3 {
+        3 index add neg dup 0 lt { pop 0 } if 3 1 roll
+    } repeat
+    setrgbcolor - pop
+  } bind def
+} ifelse
+/PATsc {                % colorarray
+  aload length          % c1 ... cn length
+    dup 1 eq { pop setgray } { 3 eq { setrgbcolor } { setcmykcolor
+  } ifelse } ifelse
+} bind def
+/PATsg {                % dict
+  begin
+    lw setlinewidth
+    lc setlinecap
+    lj setlinejoin
+    ml setmiterlimit
+    ds aload pop setdash
+    cc aload pop setrgbcolor
+    cm setmatrix
+  end
+} bind def
+
+/PATDict 3 dict def
+/PATsp {
+  true PATredef
+  PATDict begin
+    /CurrentPattern exch def
+    % If it's an uncolored pattern, save the color
+    CurrentPattern /PaintType get 2 eq {
+      /PColor exch def
+    } if
+    /CColor [ currentrgbcolor ] def
+  end
+} bind def
+% PATstroke - stroke with the current pattern
+/PATstroke {
+  countdictstack
+  save
+  mark
+  {
+    currentpoint strokepath moveto
+    PATpcalc                            % proc nw nh px py
+    clip newpath PATfill
+    } stopped {
+        (*** PATstroke Warning: Path is too complex, stroking
+          with gray) =
+    cleartomark
+    restore
+    countdictstack exch sub dup 0 gt
+        { { end } repeat } { pop } ifelse
+    gsave 0.5 setgray oldstroke grestore
+  } { pop restore pop } ifelse
+  newpath
+} bind def
+/PATtcalc {             % modmtx tilingtype PATtcalc tilematrix
+  % Note: tiling types 2 and 3 are not supported
+  gsave
+    exch concat                                 % tilingtype
+    matrix currentmatrix exch                   % cmtx tilingtype
+    % Tiling type 1 and 3: constant spacing
+    2 ne {
+        % Distort the pattern so that it occupies
+        % an integral number of device pixels
+        dup 4 get exch dup 5 get exch           % tx ty cmtx
+        XStep 0 dtransform
+        round exch round exch                   % tx ty cmtx dx.x dx.y
+        XStep div exch XStep div exch           % tx ty cmtx a b
+        0 YStep dtransform
+        round exch round exch                   % tx ty cmtx a b dy.x dy.y
+        YStep div exch YStep div exch           % tx ty cmtx a b c d
+        7 -3 roll astore                        % { a b c d tx ty }
+    } if
+  grestore
+} bind def
+/PATusp {
+  false PATredef
+  PATDict begin
+    CColor PATsc
+  end
+} bind def
+
+% this is the pattern fill program from the Second edition Reference Manual
+% with changes to call the above pattern fill
+% left30
+11 dict begin
+/PaintType 1 def
+/PatternType 1 def
+/TilingType 1 def
+/BBox [0 0 1 1] def
+/XStep 1 def
+/YStep 1 def
+/PatWidth 1 def
+/PatHeight 1 def
+/Multi 2 def
+/PaintData [
+  { clippath } bind
+  { 32 16 true [ 32 0 0 -16 0 16 ]
+        {<c000c000300030000c000c000300030000c000c000300030
+        000c000c00030003c000c000300030000c000c0003000300
+        00c000c000300030000c000c00030003>}
+     imagemask } bind
+] def
+/PaintProc {
+        pop
+        exec fill
+} def
+currentdict
+end
+/P1 exch def
+
+% horizontal sawtooth lines
+11 dict begin
+/PaintType 1 def
+/PatternType 1 def
+/TilingType 1 def
+/BBox [0 0 1 1] def
+/XStep 1 def
+/YStep 1 def
+/PatWidth 1 def
+/PatHeight 1 def
+/Multi 2 def
+/PaintData [
+  { clippath } bind
+  { 32 16 true [ 32 0 0 -16 0 16 ]
+        {<000000000000000000000000000000000000000000000000
+        000000000100010002800280044004400820082010101010
+        20082008400440048002800200010001>}
+     imagemask } bind
+] def
+/PaintProc {
+        pop
+        exec fill
+} def
+currentdict
+end
+/P21 exch def
+1.1111 1.1111 scale %restore scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+%%EndProlog
+
+$F2psBegin
+10 setmiterlimit
+n 0 792 m 0 0 l 612 0 l 612 792 l cp clip
+ 0.06000 0.06000 sc
+/Courier ff 195.00 scf sf
+4457 3343 m
+gs 1 -1 sc (LST) col-1 sh gr
+/Courier ff 195.00 scf sf
+669 3772 m
+gs 1 -1 sc (File) col-1 sh gr
+/Courier ff 195.00 scf sf
+2006 3594 m
+gs 1 -1 sc (Copy) col-1 sh gr
+/Courier ff 195.00 scf sf
+2006 3772 m
+gs 1 -1 sc (Segments) col-1 sh gr
+/Courier ff 195.00 scf sf
+3343 3566 m
+gs 1 -1 sc (Insert) col-1 sh gr
+/Courier ff 195.00 scf sf
+3343 3744 m
+gs 1 -1 sc (Segments) col-1 sh gr
+/Courier ff 195.00 scf sf
+4680 3594 m
+gs 1 -1 sc (Physical) col-1 sh gr
+/Courier ff 195.00 scf sf
+4680 3772 m
+gs 1 -1 sc (Storage) col-1 sh gr
+7.500 slw
+% Polyline
+ [15 50.0] 50.0 sd
+n 446 0 m 1560 0 l 1560 223 l 446 223 l cp gs col-1 s gr  [] 0 sd
+% Polyline
+ [15 50.0] 50.0 sd
+n 446 446 m 1560 446 l 1560 669 l 446 669 l cp gs col-1 s gr  [] 0 sd
+% Polyline
+ [15 50.0] 50.0 sd
+n 446 891 m 1560 891 l 1560 1114 l 446 1114 l cp gs col-1 s gr  [] 0 sd
+% Polyline
+ [15 50.0] 50.0 sd
+n 446 1337 m 1560 1337 l 1560 1560 l 446 1560 l cp gs col-1 s gr  [] 0 sd
+% Polyline
+ [15 50.0] 50.0 sd
+n 446 1783 m 1560 1783 l 1560 2006 l 446 2006 l cp gs col-1 s gr  [] 0 sd
+% Polyline
+n 446 1783 m 1560 1783 l 1560 2006 l 446 2006 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 29.73 118.87] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 446 1337 m 1560 1337 l 1560 1560 l 446 1560 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 29.73 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 446 891 m 1560 891 l 1560 1114 l 446 1114 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 29.73 59.40] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 446 446 m 1560 446 l 1560 669 l 446 669 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 29.73 29.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 446 0 m 1560 0 l 1560 223 l 446 223 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 29.73 0.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 446 2229 m 1560 2229 l 1560 2451 l 446 2451 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 29.73 148.60] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1783 0 m 2897 0 l 2897 223 l 1783 223 l cp gs col-1 s gr 
+% Polyline
+n 1783 446 m 2897 446 l 2897 669 l 1783 669 l cp gs col-1 s gr 
+% Polyline
+n 1783 891 m 2897 891 l 2897 1114 l 1783 1114 l cp gs col-1 s gr 
+% Polyline
+n 1783 1337 m 2897 1337 l 2897 1560 l 1783 1560 l cp gs col-1 s gr 
+% Polyline
+n 1783 1783 m 2897 1783 l 2897 2006 l 1783 2006 l cp gs col-1 s gr 
+% Polyline
+n 1783 2229 m 2897 2229 l 2897 2451 l 1783 2451 l cp gs col-1 s gr 
+% Polyline
+n 3120 0 m 4234 0 l 4234 223 l 3120 223 l cp gs col-1 s gr 
+% Polyline
+n 3120 446 m 4234 446 l 4234 669 l 3120 669 l cp gs col-1 s gr 
+% Polyline
+n 3120 891 m 4234 891 l 4234 1114 l 3120 1114 l cp gs col-1 s gr 
+% Polyline
+n 3120 1337 m 4234 1337 l 4234 1560 l 3120 1560 l cp gs col-1 s gr 
+% Polyline
+n 3120 1783 m 4234 1783 l 4234 2006 l 3120 2006 l cp gs col-1 s gr 
+% Polyline
+n 3120 2229 m 4234 2229 l 4234 2451 l 3120 2451 l cp gs col-1 s gr 
+% Polyline
+n 1894 0 m 2897 0 l 2897 223 l 1894 223 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 126.27 0.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3120 0 m 3231 0 l 3231 223 l 3120 223 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 208.00 0.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1894 446 m 2117 446 l 2117 669 l 1894 669 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 126.27 29.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2228 446 m 2340 446 l 2340 669 l 2228 669 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 148.53 29.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2563 446 m 2897 446 l 2897 669 l 2563 669 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 170.87 29.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3120 446 m 3231 446 l 3231 669 l 3120 669 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 208.00 29.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3454 446 m 3565 446 l 3565 669 l 3454 669 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 230.27 29.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3677 446 m 3900 446 l 3900 669 l 3677 669 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 245.13 29.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1783 891 m 2117 891 l 2117 1114 l 1783 1114 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 118.87 59.40] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2228 891 m 2340 891 l 2340 1114 l 2228 1114 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 148.53 59.40] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2563 891 m 2674 891 l 2674 1114 l 2563 1114 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 170.87 59.40] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2785 891 m 2897 891 l 2897 1114 l 2785 1114 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 185.67 59.40] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3454 891 m 3565 891 l 3565 1114 l 3454 1114 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 230.27 59.40] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3677 891 m 3900 891 l 3900 1114 l 3677 1114 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 245.13 59.40] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4011 891 m 4123 891 l 4123 1114 l 4011 1114 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 267.40 59.40] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2451 1337 m 2563 1337 l 2563 1337 l 2451 1337 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 163.40 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2006 1337 m 2117 1337 l 2117 1560 l 2006 1560 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 133.73 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2228 1337 m 2340 1337 l 2340 1560 l 2228 1560 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 148.53 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1783 1337 m 1894 1337 l 1894 1560 l 1783 1560 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 118.87 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2563 1337 m 2674 1337 l 2674 1560 l 2563 1560 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 170.87 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2117 1337 m 2228 1337 l 2228 1560 l 2117 1560 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 141.13 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2340 1337 m 2563 1337 l 2563 1560 l 2340 1560 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 156.00 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2006 1783 m 2117 1783 l 2117 2006 l 2006 2006 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 133.73 118.87] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2228 1783 m 2340 1783 l 2340 2006 l 2228 2006 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 148.53 118.87] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2117 1783 m 2228 1783 l 2228 2006 l 2117 2006 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 141.13 118.87] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2340 1783 m 2563 1783 l 2563 2006 l 2340 2006 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 156.00 118.87] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3900 1783 m 4234 1783 l 4234 2006 l 3900 2006 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 260.00 118.87] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3120 1783 m 3343 1783 l 3343 2006 l 3120 2006 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 208.00 118.87] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4011 1337 m 4234 1337 l 4234 1560 l 4011 1560 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 267.40 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1783 2229 m 1894 2229 l 1894 2451 l 1783 2451 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 118.87 148.60] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2117 2229 m 2228 2229 l 2228 2451 l 2117 2451 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 141.13 148.60] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2340 2451 m 2563 2451 l 2563 2229 l 2340 2229 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 156.00 148.60] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2674 2229 m 2897 2229 l 2897 2451 l 2674 2451 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 178.27 148.60] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3231 2229 m 3454 2229 l 3454 2451 l 3231 2451 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 215.40 148.60] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3565 2229 m 3677 2229 l 3677 2451 l 3565 2451 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 237.67 148.60] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3900 2229 m 4011 2229 l 4011 2451 l 3900 2451 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 260.00 148.60] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4457 2229 m 4902 2229 l 4902 2451 l 4457 2451 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 297.13 148.60] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4457 1560 m 4680 1560 l 4680 1337 l 4457 1337 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 297.13 89.13] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4457 1114 m 4902 1114 l 4902 891 l 4457 891 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 297.13 59.40] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4457 669 m 4902 669 l 4902 446 l 4457 446 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 297.13 29.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4457 0 m 4568 0 l 4568 223 l 4457 223 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 297.13 0.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 446 2674 m 1560 2674 l 1560 2897 l 446 2897 l cp gs col-1 s gr 
+% Polyline
+n 446 2674 m 1560 2674 l 1560 2897 l 446 2897 l cp gs col7 1.00 shd ef gr gs col-1 s gr 
+% Polyline
+n 446 2674 m 1560 2674 l 1560 2897 l 446 2897 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 29.73 178.27] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1783 2674 m 2897 2674 l 2897 2897 l 1783 2897 l cp gs col-1 s gr 
+% Polyline
+n 3120 2674 m 4234 2674 l 4234 2897 l 3120 2897 l cp gs col-1 s gr 
+% Polyline
+n 3120 2674 m 4234 2674 l 4234 2897 l 3120 2897 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 208.00 178.27] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4457 2674 m 5571 2674 l 5571 2897 l 4457 2897 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 297.13 178.27] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 444 3118 m 1558 3118 l 1558 3341 l 444 3341 l cp gs col-1 s gr 
+% Polyline
+n 444 3118 m 1558 3118 l 1558 3341 l 444 3341 l cp gs col7 1.00 shd ef gr gs col-1 s gr 
+% Polyline
+n 1781 3118 m 2895 3118 l 2895 3341 l 1781 3341 l cp gs col-1 s gr 
+% Polyline
+n 444 3118 m 1558 3118 l 1558 3341 l 444 3341 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 29.60 207.87] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1783 3120 m 1894 3120 l 1894 3343 l 1783 3343 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 118.87 208.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1894 3120 m 2006 3120 l 2006 3343 l 1894 3343 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 126.27 208.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2006 3120 m 2117 3120 l 2117 3343 l 2006 3343 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 133.73 208.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2117 3120 m 2228 3120 l 2228 3343 l 2117 3343 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 141.13 208.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2340 3120 m 2563 3120 l 2563 3343 l 2340 3343 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 156.00 208.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3565 3120 m 3677 3120 l 3677 3343 l 3565 3343 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 237.67 208.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2563 3120 m 2674 3120 l 2674 3343 l 2563 3343 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 170.87 208.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4011 3120 m 4234 3120 l 4234 3343 l 4011 3343 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 267.40 208.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 4457 3120 m 4791 3120 l 4791 3343 l 4457 3343 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 297.13 208.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3118 3118 m 4232 3118 l 4232 3341 l 3118 3341 l cp gs col-1 s gr 
+% Polyline
+n 4457 1783 m 5014 1783 l 5014 2006 l 4457 2006 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 297.13 118.87] PATmp PATsp ef gr PATusp gs col-1 s gr 
+/Times-Roman ff 195.00 scf sf
+0 2841 m
+gs 1 -1 sc (F7 = ) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+0 2396 m
+gs 1 -1 sc (F6 =) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+0 1950 m
+gs 1 -1 sc (F5 =) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+0 1059 m
+gs 1 -1 sc (F3 =) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+0 613 m
+gs 1 -1 sc (F2 =) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+0 167 m
+gs 1 -1 sc (F1 =) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+0 3287 m
+gs 1 -1 sc (F8 =) col-1 sh gr
+/Courier ff 195.00 scf sf
+446 223 m
+gs 1 -1 sc (DISULPHIDE) col-1 sh gr
+/Courier ff 195.00 scf sf
+446 669 m
+gs 1 -1 sc (BISULPHIDE) col-1 sh gr
+/Courier ff 195.00 scf sf
+446 1114 m
+gs 1 -1 sc (DISELENIDE) col-1 sh gr
+/Courier ff 195.00 scf sf
+446 1560 m
+gs 1 -1 sc (DISULPHINE) col-1 sh gr
+/Courier ff 195.00 scf sf
+446 2006 m
+gs 1 -1 sc (ESSELENIAN) col-1 sh gr
+/Courier ff 195.00 scf sf
+446 2451 m
+gs 1 -1 sc (DISULPHONE) col-1 sh gr
+/Courier ff 195.00 scf sf
+1894 223 m
+gs 1 -1 sc (ISULPHIDE) col-1 sh gr
+/Courier ff 195.00 scf sf
+3120 223 m
+gs 1 -1 sc (D) col-1 sh gr
+/Courier ff 195.00 scf sf
+1894 669 m
+gs 1 -1 sc (IS) col-1 sh gr
+/Courier ff 195.00 scf sf
+2228 669 m
+gs 1 -1 sc (L) col-1 sh gr
+/Courier ff 195.00 scf sf
+2563 669 m
+gs 1 -1 sc (IDE) col-1 sh gr
+/Courier ff 195.00 scf sf
+3120 669 m
+gs 1 -1 sc (B) col-1 sh gr
+/Courier ff 195.00 scf sf
+3454 669 m
+gs 1 -1 sc (U) col-1 sh gr
+/Courier ff 195.00 scf sf
+3677 669 m
+gs 1 -1 sc (PH) col-1 sh gr
+/Courier ff 195.00 scf sf
+3454 1114 m
+gs 1 -1 sc (E EN D) col-1 sh gr
+/Courier ff 195.00 scf sf
+1783 1114 m
+gs 1 -1 sc (DIS L  I E) col-1 sh gr
+/Courier ff 195.00 scf sf
+3120 2006 m
+gs 1 -1 sc (ES) col-1 sh gr
+/Courier ff 195.00 scf sf
+3900 2006 m
+gs 1 -1 sc (IAN) col-1 sh gr
+/Courier ff 195.00 scf sf
+2006 2006 m
+gs 1 -1 sc (SELEN) col-1 sh gr
+/Courier ff 195.00 scf sf
+1783 1560 m
+gs 1 -1 sc (DISULPHI) col-1 sh gr
+/Courier ff 195.00 scf sf
+4011 1560 m
+gs 1 -1 sc (NE) col-1 sh gr
+/Courier ff 195.00 scf sf
+1783 2451 m
+gs 1 -1 sc (D  U PH NE) col-1 sh gr
+/Courier ff 195.00 scf sf
+3120 2451 m
+gs 1 -1 sc ( IS U  O) col-1 sh gr
+/Courier ff 195.00 scf sf
+446 2897 m
+gs 1 -1 sc (TROEZENIAN) col-1 sh gr
+/Courier ff 195.00 scf sf
+3120 2897 m
+gs 1 -1 sc (TROEZENIAN) col-1 sh gr
+/Courier ff 195.00 scf sf
+444 3313 m
+gs 1 -1 sc (ESSELENIST) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+1616 3287 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+1616 2841 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+1616 2396 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+1616 1950 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+1616 1504 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+1616 1059 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+1616 613 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+1616 167 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+2953 3287 m
+gs 1 -1 sc (+) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+2953 2396 m
+gs 1 -1 sc (+) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+2953 1950 m
+gs 1 -1 sc (+) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+2953 1504 m
+gs 1 -1 sc (+) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+2953 1059 m
+gs 1 -1 sc (+) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+2953 613 m
+gs 1 -1 sc (+) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+2953 167 m
+gs 1 -1 sc (+) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+2953 2841 m
+gs 1 -1 sc (+) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+0 1504 m
+gs 1 -1 sc (F4 =) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+4290 3287 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+4290 2841 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+4290 2368 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+4290 1950 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+4290 1476 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+4290 1059 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+4290 613 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 195.00 scf sf
+4290 167 m
+gs 1 -1 sc (=) col-1 sh gr
+/Courier ff 195.00 scf sf
+1783 3343 m
+gs 1 -1 sc (ESSE ENI        L   ST) col-1 sh gr
+/Courier ff 195.00 scf sf
+4457 223 m
+gs 1 -1 sc (D) col-1 sh gr
+/Courier ff 195.00 scf sf
+4457 669 m
+gs 1 -1 sc (BUPH) col-1 sh gr
+/Courier ff 195.00 scf sf
+4457 1114 m
+gs 1 -1 sc (EEND) col-1 sh gr
+/Courier ff 195.00 scf sf
+4457 1560 m
+gs 1 -1 sc (NE) col-1 sh gr
+/Courier ff 195.00 scf sf
+4457 2006 m
+gs 1 -1 sc (ESIAN) col-1 sh gr
+/Courier ff 195.00 scf sf
+4457 2451 m
+gs 1 -1 sc (ISUO) col-1 sh gr
+/Courier ff 195.00 scf sf
+4457 2897 m
+gs 1 -1 sc (TROEZENIAN) col-1 sh gr
+/Courier ff 195.00 scf sf
+669 3594 m
+gs 1 -1 sc (Actual ) col-1 sh gr
+$F2psEnd
+rs
+end
diff --git a/xdelta1/doc/old/dcc99/figs/onestep.fig b/xdelta1/doc/old/dcc99/figs/onestep.fig
new file mode 100755
index 0000000..48c1a5b
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/onestep.fig
@@ -0,0 +1,256 @@
+#FIG 3.1
+Portrait
+Center
+Inches
+1200 2
+6 0 0 5571 3900
+6 669 3454 5571 3816
+4 0 -1 0 0 12 13 0.0000 4 111 780 669 3594 Actual \001
+4 0 -1 0 0 12 13 0.0000 4 111 446 669 3772 File\001
+4 0 -1 0 0 12 13 0.0000 4 139 446 2006 3594 Copy\001
+4 0 -1 0 0 12 13 0.0000 4 139 891 2006 3772 Segments\001
+4 0 -1 0 0 12 13 0.0000 4 106 669 3343 3566 Insert\001
+4 0 -1 0 0 12 13 0.0000 4 139 891 3343 3744 Segments\001
+4 0 -1 0 0 12 13 0.0000 4 144 891 4680 3594 Physical\001
+4 0 -1 0 0 12 13 0.0000 4 139 780 4680 3772 Storage\001
+-6
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         446 0 1560 0 1560 223 446 223 446 0
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         446 446 1560 446 1560 669 446 669 446 446
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         446 891 1560 891 1560 1114 446 1114 446 891
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         446 1337 1560 1337 1560 1560 446 1560 446 1337
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         446 1783 1560 1783 1560 2006 446 2006 446 1783
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         446 1783 1560 1783 1560 2006 446 2006 446 1783
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         446 1337 1560 1337 1560 1560 446 1560 446 1337
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         446 891 1560 891 1560 1114 446 1114 446 891
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         446 446 1560 446 1560 669 446 669 446 446
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         446 0 1560 0 1560 223 446 223 446 0
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         446 2229 1560 2229 1560 2451 446 2451 446 2229
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1783 0 2897 0 2897 223 1783 223 1783 0
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1783 446 2897 446 2897 669 1783 669 1783 446
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1783 891 2897 891 2897 1114 1783 1114 1783 891
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1783 1337 2897 1337 2897 1560 1783 1560 1783 1337
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1783 1783 2897 1783 2897 2006 1783 2006 1783 1783
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1783 2229 2897 2229 2897 2451 1783 2451 1783 2229
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         3120 0 4234 0 4234 223 3120 223 3120 0
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         3120 446 4234 446 4234 669 3120 669 3120 446
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         3120 891 4234 891 4234 1114 3120 1114 3120 891
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         3120 1337 4234 1337 4234 1560 3120 1560 3120 1337
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         3120 1783 4234 1783 4234 2006 3120 2006 3120 1783
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         3120 2229 4234 2229 4234 2451 3120 2451 3120 2229
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1894 0 2897 0 2897 223 1894 223 1894 0
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3120 0 3231 0 3231 223 3120 223 3120 0
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1894 446 2117 446 2117 669 1894 669 1894 446
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2228 446 2340 446 2340 669 2228 669 2228 446
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2563 446 2897 446 2897 669 2563 669 2563 446
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3120 446 3231 446 3231 669 3120 669 3120 446
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3454 446 3565 446 3565 669 3454 669 3454 446
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3677 446 3900 446 3900 669 3677 669 3677 446
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1783 891 2117 891 2117 1114 1783 1114 1783 891
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2228 891 2340 891 2340 1114 2228 1114 2228 891
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2563 891 2674 891 2674 1114 2563 1114 2563 891
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2785 891 2897 891 2897 1114 2785 1114 2785 891
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3454 891 3565 891 3565 1114 3454 1114 3454 891
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3677 891 3900 891 3900 1114 3677 1114 3677 891
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4011 891 4123 891 4123 1114 4011 1114 4011 891
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2451 1337 2563 1337 2563 1337 2451 1337 2451 1337
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2006 1337 2117 1337 2117 1560 2006 1560 2006 1337
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2228 1337 2340 1337 2340 1560 2228 1560 2228 1337
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1783 1337 1894 1337 1894 1560 1783 1560 1783 1337
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2563 1337 2674 1337 2674 1560 2563 1560 2563 1337
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2117 1337 2228 1337 2228 1560 2117 1560 2117 1337
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2340 1337 2563 1337 2563 1560 2340 1560 2340 1337
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2006 1783 2117 1783 2117 2006 2006 2006 2006 1783
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2228 1783 2340 1783 2340 2006 2228 2006 2228 1783
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2117 1783 2228 1783 2228 2006 2117 2006 2117 1783
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2340 1783 2563 1783 2563 2006 2340 2006 2340 1783
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3900 1783 4234 1783 4234 2006 3900 2006 3900 1783
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3120 1783 3343 1783 3343 2006 3120 2006 3120 1783
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4011 1337 4234 1337 4234 1560 4011 1560 4011 1337
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1783 2229 1894 2229 1894 2451 1783 2451 1783 2229
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2117 2229 2228 2229 2228 2451 2117 2451 2117 2229
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2340 2451 2563 2451 2563 2229 2340 2229 2340 2451
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2674 2229 2897 2229 2897 2451 2674 2451 2674 2229
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3231 2229 3454 2229 3454 2451 3231 2451 3231 2229
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3565 2229 3677 2229 3677 2451 3565 2451 3565 2229
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3900 2229 4011 2229 4011 2451 3900 2451 3900 2229
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4457 2229 4902 2229 4902 2451 4457 2451 4457 2229
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4457 1560 4680 1560 4680 1337 4457 1337 4457 1560
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4457 1114 4902 1114 4902 891 4457 891 4457 1114
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4457 669 4902 669 4902 446 4457 446 4457 669
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4457 0 4568 0 4568 223 4457 223 4457 0
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         446 2674 1560 2674 1560 2897 446 2897 446 2674
+2 2 0 1 -1 7 0 0 20 0.000 0 0 -1 0 0 5
+         446 2674 1560 2674 1560 2897 446 2897 446 2674
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         446 2674 1560 2674 1560 2897 446 2897 446 2674
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1783 2674 2897 2674 2897 2897 1783 2897 1783 2674
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         3120 2674 4234 2674 4234 2897 3120 2897 3120 2674
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3120 2674 4234 2674 4234 2897 3120 2897 3120 2674
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4457 2674 5571 2674 5571 2897 4457 2897 4457 2674
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         444 3118 1558 3118 1558 3341 444 3341 444 3118
+2 2 0 1 -1 7 0 0 20 0.000 0 0 -1 0 0 5
+         444 3118 1558 3118 1558 3341 444 3341 444 3118
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1781 3118 2895 3118 2895 3341 1781 3341 1781 3118
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         444 3118 1558 3118 1558 3341 444 3341 444 3118
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1783 3120 1894 3120 1894 3343 1783 3343 1783 3120
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1894 3120 2006 3120 2006 3343 1894 3343 1894 3120
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2006 3120 2117 3120 2117 3343 2006 3343 2006 3120
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2117 3120 2228 3120 2228 3343 2117 3343 2117 3120
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2340 3120 2563 3120 2563 3343 2340 3343 2340 3120
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3565 3120 3677 3120 3677 3343 3565 3343 3565 3120
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2563 3120 2674 3120 2674 3343 2563 3343 2563 3120
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4011 3120 4234 3120 4234 3343 4011 3343 4011 3120
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4457 3120 4791 3120 4791 3343 4457 3343 4457 3120
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         3118 3118 4232 3118 4232 3341 3118 3341 3118 3118
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4457 1783 5014 1783 5014 2006 4457 2006 4457 1783
+4 0 -1 0 0 0 13 0.0000 0 128 384 0 2841 F7 = \001
+4 0 -1 0 0 0 13 0.0000 0 128 340 0 2396 F6 =\001
+4 0 -1 0 0 0 13 0.0000 0 128 340 0 1950 F5 =\001
+4 0 -1 0 0 0 13 0.0000 0 128 340 0 1059 F3 =\001
+4 0 -1 0 0 0 13 0.0000 0 128 340 0 613 F2 =\001
+4 0 -1 0 0 0 13 0.0000 0 128 340 0 167 F1 =\001
+4 0 -1 0 0 0 13 0.0000 0 128 340 0 3287 F8 =\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 446 223 DISULPHIDE\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 446 669 BISULPHIDE\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 446 1114 DISELENIDE\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 446 1560 DISULPHINE\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 446 2006 ESSELENIAN\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 446 2451 DISULPHONE\001
+4 0 -1 0 0 5 13 0.0000 0 106 1003 1894 223 ISULPHIDE\001
+4 0 -1 0 0 5 13 0.0000 0 106 111 3120 223 D\001
+4 0 -1 0 0 5 13 0.0000 0 106 223 1894 669 IS\001
+4 0 -1 0 0 5 13 0.0000 0 106 111 2228 669 L\001
+4 0 -1 0 0 5 13 0.0000 0 106 334 2563 669 IDE\001
+4 0 -1 0 0 5 13 0.0000 0 106 111 3120 669 B\001
+4 0 -1 0 0 5 13 0.0000 0 106 111 3454 669 U\001
+4 0 -1 0 0 5 13 0.0000 0 106 223 3677 669 PH\001
+4 0 -1 0 0 5 13 0.0000 0 106 669 3454 1114 E EN D\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 1783 1114 DIS L  I E\001
+4 0 -1 0 0 5 13 0.0000 0 106 223 3120 2006 ES\001
+4 0 -1 0 0 5 13 0.0000 0 106 334 3900 2006 IAN\001
+4 0 -1 0 0 5 13 0.0000 0 106 557 2006 2006 SELEN\001
+4 0 -1 0 0 5 13 0.0000 0 106 891 1783 1560 DISULPHI\001
+4 0 -1 0 0 5 13 0.0000 0 106 223 4011 1560 NE\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 1783 2451 D  U PH NE\001
+4 0 -1 0 0 5 13 0.0000 0 106 891 3120 2451  IS U  O\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 446 2897 TROEZENIAN\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 3120 2897 TROEZENIAN\001
+4 0 -1 0 0 12 13 0.0000 4 106 1114 444 3313 ESSELENIST\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 1616 3287 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 1616 2841 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 1616 2396 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 1616 1950 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 1616 1504 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 1616 1059 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 1616 613 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 1616 167 =\001
+4 0 -1 0 0 0 13 0.0000 0 89 106 2953 3287 +\001
+4 0 -1 0 0 0 13 0.0000 0 89 106 2953 2396 +\001
+4 0 -1 0 0 0 13 0.0000 0 89 106 2953 1950 +\001
+4 0 -1 0 0 0 13 0.0000 0 89 106 2953 1504 +\001
+4 0 -1 0 0 0 13 0.0000 0 89 106 2953 1059 +\001
+4 0 -1 0 0 0 13 0.0000 0 89 106 2953 613 +\001
+4 0 -1 0 0 0 13 0.0000 0 89 106 2953 167 +\001
+4 0 -1 0 0 0 13 0.0000 0 89 106 2953 2841 +\001
+4 0 -1 0 0 0 13 0.0000 0 128 340 0 1504 F4 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 4290 3287 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 4290 2841 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 4290 2368 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 4290 1950 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 4290 1476 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 4290 1059 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 4290 613 =\001
+4 0 -1 0 0 0 13 0.0000 0 50 106 4290 167 =\001
+4 0 -1 0 0 5 13 0.0000 0 106 2451 1783 3343 ESSE ENI        L   ST\001
+4 0 -1 0 0 5 13 0.0000 0 106 111 4457 223 D\001
+4 0 -1 0 0 5 13 0.0000 0 106 446 4457 669 BUPH\001
+4 0 -1 0 0 5 13 0.0000 0 106 446 4457 1114 EEND\001
+4 0 -1 0 0 5 13 0.0000 0 106 223 4457 1560 NE\001
+4 0 -1 0 0 5 13 0.0000 0 106 557 4457 2006 ESIAN\001
+4 0 -1 0 0 5 13 0.0000 0 106 446 4457 2451 ISUO\001
+4 0 -1 0 0 5 13 0.0000 0 106 1114 4457 2897 TROEZENIAN\001
+4 0 -1 0 0 5 13 0.0000 0 106 334 4457 3343 LST\001
+-6
diff --git a/xdelta1/doc/old/dcc99/figs/onestep.fig.normalsize b/xdelta1/doc/old/dcc99/figs/onestep.fig.normalsize
new file mode 100755
index 0000000..75d6712
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/onestep.fig.normalsize
@@ -0,0 +1,254 @@
+#FIG 3.1
+Landscape
+Center
+Inches
+1200 2
+6 2100 9900 15300 10875
+4 0 -1 0 0 12 34 0.0000 4 300 2100 2100 10275 Actual \001
+4 0 -1 0 0 12 34 0.0000 4 300 1200 2100 10755 File\001
+4 0 -1 0 0 12 34 0.0000 4 375 1200 5700 10275 Copy\001
+4 0 -1 0 0 12 34 0.0000 4 375 2400 5700 10755 Segments\001
+4 0 -1 0 0 12 34 0.0000 4 285 1800 9300 10200 Insert\001
+4 0 -1 0 0 12 34 0.0000 4 375 2400 9300 10680 Segments\001
+4 0 -1 0 0 12 34 0.0000 4 390 2400 12900 10275 Physical\001
+4 0 -1 0 0 12 34 0.0000 4 375 2100 12900 10755 Storage\001
+-6
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 600 4500 600 4500 1200 1500 1200 1500 600
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 1800 4500 1800 4500 2400 1500 2400 1500 1800
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 3000 4500 3000 4500 3600 1500 3600 1500 3000
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 4200 4500 4200 4500 4800 1500 4800 1500 4200
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         1500 5400 4500 5400 4500 6000 1500 6000 1500 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 5400 4500 5400 4500 6000 1500 6000 1500 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 4200 4500 4200 4500 4800 1500 4800 1500 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 3000 4500 3000 4500 3600 1500 3600 1500 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 1800 4500 1800 4500 2400 1500 2400 1500 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 600 4500 600 4500 1200 1500 1200 1500 600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 6600 4500 6600 4500 7200 1500 7200 1500 6600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 600 8100 600 8100 1200 5100 1200 5100 600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 1800 8100 1800 8100 2400 5100 2400 5100 1800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 3000 8100 3000 8100 3600 5100 3600 5100 3000
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 4200 8100 4200 8100 4800 5100 4800 5100 4200
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 5400 8100 5400 8100 6000 5100 6000 5100 5400
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 6600 8100 6600 8100 7200 5100 7200 5100 6600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 600 11700 600 11700 1200 8700 1200 8700 600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 1800 11700 1800 11700 2400 8700 2400 8700 1800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 3000 11700 3000 11700 3600 8700 3600 8700 3000
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 4200 11700 4200 11700 4800 8700 4800 8700 4200
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 5400 11700 5400 11700 6000 8700 6000 8700 5400
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 6600 11700 6600 11700 7200 8700 7200 8700 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5400 600 8100 600 8100 1200 5400 1200 5400 600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 600 9000 600 9000 1200 8700 1200 8700 600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5400 1800 6000 1800 6000 2400 5400 2400 5400 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 1800 6600 1800 6600 2400 6300 2400 6300 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7200 1800 8100 1800 8100 2400 7200 2400 7200 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 1800 9000 1800 9000 2400 8700 2400 8700 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9600 1800 9900 1800 9900 2400 9600 2400 9600 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10200 1800 10800 1800 10800 2400 10200 2400 10200 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5100 3000 6000 3000 6000 3600 5100 3600 5100 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 3000 6600 3000 6600 3600 6300 3600 6300 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7200 3000 7500 3000 7500 3600 7200 3600 7200 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7800 3000 8100 3000 8100 3600 7800 3600 7800 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9600 3000 9900 3000 9900 3600 9600 3600 9600 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10200 3000 10800 3000 10800 3600 10200 3600 10200 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11100 3000 11400 3000 11400 3600 11100 3600 11100 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6900 4200 7200 4200 7200 4200 6900 4200 6900 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5700 4200 6000 4200 6000 4800 5700 4800 5700 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 4200 6600 4200 6600 4800 6300 4800 6300 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5100 4200 5400 4200 5400 4800 5100 4800 5100 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7200 4200 7500 4200 7500 4800 7200 4800 7200 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6000 4200 6300 4200 6300 4800 6000 4800 6000 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6600 4200 7200 4200 7200 4800 6600 4800 6600 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5700 5400 6000 5400 6000 6000 5700 6000 5700 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 5400 6600 5400 6600 6000 6300 6000 6300 5400
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6000 5400 6300 5400 6300 6000 6000 6000 6000 5400
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6600 5400 7200 5400 7200 6000 6600 6000 6600 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10800 5400 11700 5400 11700 6000 10800 6000 10800 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 5400 9300 5400 9300 6000 8700 6000 8700 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11100 4200 11700 4200 11700 4800 11100 4800 11100 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5100 6600 5400 6600 5400 7200 5100 7200 5100 6600
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6000 6600 6300 6600 6300 7200 6000 7200 6000 6600
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6600 7200 7200 7200 7200 6600 6600 6600 6600 7200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         7500 6600 8100 6600 8100 7200 7500 7200 7500 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9000 6600 9600 6600 9600 7200 9000 7200 9000 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9900 6600 10200 6600 10200 7200 9900 7200 9900 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10800 6600 11100 6600 11100 7200 10800 7200 10800 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 6600 13500 6600 13500 7200 12300 7200 12300 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 4800 12900 4800 12900 4200 12300 4200 12300 4800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 3600 13500 3600 13500 3000 12300 3000 12300 3600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 2400 13500 2400 13500 1800 12300 1800 12300 2400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 600 12600 600 12600 1200 12300 1200 12300 600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1500 7800 4500 7800 4500 8400 1500 8400 1500 7800
+2 2 0 1 -1 7 0 0 20 0.000 0 0 -1 0 0 5
+         1500 7800 4500 7800 4500 8400 1500 8400 1500 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1500 7800 4500 7800 4500 8400 1500 8400 1500 7800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5100 7800 8100 7800 8100 8400 5100 8400 5100 7800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8700 7800 11700 7800 11700 8400 8700 8400 8700 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 7800 11700 7800 11700 8400 8700 8400 8700 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 7800 15300 7800 15300 8400 12300 8400 12300 7800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1496 8996 4496 8996 4496 9596 1496 9596 1496 8996
+2 2 0 1 -1 7 0 0 20 0.000 0 0 -1 0 0 5
+         1496 8996 4496 8996 4496 9596 1496 9596 1496 8996
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         5096 8996 8096 8996 8096 9596 5096 9596 5096 8996
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1496 8996 4496 8996 4496 9596 1496 9596 1496 8996
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5100 9000 5400 9000 5400 9600 5100 9600 5100 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5400 9000 5700 9000 5700 9600 5400 9600 5400 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5700 9000 6000 9000 6000 9600 5700 9600 5700 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6000 9000 6300 9000 6300 9600 6000 9600 6000 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6600 9000 7200 9000 7200 9600 6600 9600 6600 9000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9900 9000 10200 9000 10200 9600 9900 9600 9900 9000
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         7200 9000 7500 9000 7500 9600 7200 9600 7200 9000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11100 9000 11700 9000 11700 9600 11100 9600 11100 9000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 9000 13200 9000 13200 9600 12300 9600 12300 9000
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         8696 8996 11696 8996 11696 9596 8696 9596 8696 8996
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         12300 5400 13800 5400 13800 6000 12300 6000 12300 5400
+4 0 -1 0 0 0 34 0.0000 0 345 1035 300 8250 F7 = \001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 7050 F6 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 5850 F5 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 3450 F3 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 2250 F2 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 1050 F1 =\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 9450 F8 =\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 1200 DISULPHIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 2400 BISULPHIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 3600 DISELENIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 4800 DISULPHINE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 6000 ESSELENIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 7200 DISULPHONE\001
+4 0 -1 0 0 5 34 0.0000 0 285 2700 5400 1200 ISULPHIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 8700 1200 D\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 5400 2400 IS\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 6300 2400 L\001
+4 0 -1 0 0 5 34 0.0000 0 285 900 7200 2400 IDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 8700 2400 B\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 9600 2400 U\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 10200 2400 PH\001
+4 0 -1 0 0 5 34 0.0000 0 285 1800 9600 3600 E EN D\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 5100 3600 DIS L  I E\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 8700 6000 ES\001
+4 0 -1 0 0 5 34 0.0000 0 285 900 10800 6000 IAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 1500 5700 6000 SELEN\001
+4 0 -1 0 0 5 34 0.0000 0 285 2400 5100 4800 DISULPHI\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 11100 4800 NE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 5100 7200 D  U PH NE\001
+4 0 -1 0 0 5 34 0.0000 0 285 2400 8700 7200  IS U  O\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 1500 8400 TROEZENIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 8700 8400 TROEZENIAN\001
+4 0 -1 0 0 12 34 0.0000 4 285 3000 1496 9521 ESSELENIST\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 9450 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 8250 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 7050 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 5850 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 4650 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 3450 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 2250 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 4650 1050 =\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 9450 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 7050 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 5850 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 4650 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 3450 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 2250 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 1050 +\001
+4 0 -1 0 0 0 34 0.0000 0 240 285 8250 8250 +\001
+4 0 -1 0 0 0 34 0.0000 0 345 915 300 4650 F4 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 9450 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 8250 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 6975 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 5850 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 4575 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 3450 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 2250 =\001
+4 0 -1 0 0 0 34 0.0000 0 135 285 11850 1050 =\001
+4 0 -1 0 0 5 34 0.0000 0 285 6600 5100 9600 ESSE ENI        L   ST\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 12300 1200 D\001
+4 0 -1 0 0 5 34 0.0000 0 285 1200 12300 2400 BUPH\001
+4 0 -1 0 0 5 34 0.0000 0 285 1200 12300 3600 EEND\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 12300 4800 NE\001
+4 0 -1 0 0 5 34 0.0000 0 285 1500 12300 6000 ESIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 1200 12300 7200 ISUO\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 12300 8400 TROEZENIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 900 12300 9600 LST\001
diff --git a/xdelta1/doc/old/dcc99/figs/rcs.eps b/xdelta1/doc/old/dcc99/figs/rcs.eps
new file mode 100755
index 0000000..4a07e10
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/rcs.eps
@@ -0,0 +1,180 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: rcs.fig
+%%Creator: fig2dev Version 3.1 Patchlevel 2
+%%CreationDate: Mon May  4 03:13:08 1998
+%%For: jmacd@icw.EECS.Berkeley.EDU (Josh MacDonald,,,,ARN)
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 121 162
+%%Pages: 0
+%%BeginSetup
+%%IncludeFeature: *PageSize Letter
+%%EndSetup
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+-31.0 178.0 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+ /DrawEllipse {
+        /endangle exch def
+        /startangle exch def
+        /yrad exch def
+        /xrad exch def
+        /y exch def
+        /x exch def
+        /savematrix mtrx currentmatrix def
+        x y tr xrad yrad sc 0 0 1 startangle endangle arc
+        closepath
+        savematrix setmatrix
+        } def
+
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+%%EndProlog
+
+$F2psBegin
+10 setmiterlimit
+n 0 792 m 0 0 l 612 0 l 612 792 l cp clip
+ 0.06000 0.06000 sc
+7.500 slw
+% Ellipse
+n 742 2767 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+
+% Ellipse
+n 764 418 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+
+% Ellipse
+n 1942 1582 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+
+% Ellipse
+n 1950 360 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+
+% Ellipse
+n 742 1567 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+
+% Polyline
+gs  clippath
+780 2628 m 750 2748 l 720 2628 l 720 2790 l 780 2790 l  cp clip
+n 750 2775 m 750 1650 l gs col7 0.00 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 780 2628 m 750 2748 l 720 2628 l 750 2628 l 780 2628 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+780 1428 m 750 1548 l 720 1428 l 720 1590 l 780 1590 l  cp clip
+n 750 1575 m 750 450 l gs col7 0.00 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 780 1428 m 750 1548 l 720 1428 l 750 1428 l 780 1428 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1920 522 m 1950 402 l 1980 522 l 1980 360 l 1920 360 l  cp clip
+n 1950 1500 m 1950 375 l gs col7 0.00 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 1920 522 m 1950 402 l 1980 522 l 1950 522 l 1920 522 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1765 1703 m 1870 1639 l 1807 1745 l 1922 1631 l 1879 1588 l  cp clip
+n 765 2745 m 1890 1620 l gs col7 0.00 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 1765 1703 m 1870 1639 l 1807 1745 l 1786 1724 l 1765 1703 l  cp gs 0.00 setgray ef gr  col-1 s
+/Times-Roman ff 180.00 scf sf
+825 2925 m
+gs 1 -1 sc (1.1) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+2025 1575 m
+gs 1 -1 sc (1.1.1.1) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+2025 375 m
+gs 1 -1 sc (1.1.1.2) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+825 375 m
+gs 1 -1 sc (1.3) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+825 1575 m
+gs 1 -1 sc (1.2) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+525 2100 m
+gs 1 -1 sc (d1) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+1500 2325 m
+gs 1 -1 sc (d2) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+525 975 m
+gs 1 -1 sc (d3) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+2025 975 m
+gs 1 -1 sc (d4) col-1 sh gr
+$F2psEnd
+rs
diff --git a/xdelta1/doc/old/dcc99/figs/rcs.fig b/xdelta1/doc/old/dcc99/figs/rcs.fig
new file mode 100755
index 0000000..94004af
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/rcs.fig
@@ -0,0 +1,31 @@
+#FIG 3.1
+Portrait
+Center
+Inches
+1200 2
+1 4 0 1 -1 7 0 0 0 0.000 1 0.0000 742 2767 54 54 705 2730 780 2805
+1 4 0 1 -1 7 0 0 0 0.000 1 0.0000 764 418 54 54 727 381 802 456
+1 4 0 1 -1 7 0 0 0 0.000 1 0.0000 1942 1582 54 54 1905 1545 1980 1620
+1 4 0 1 -1 7 0 0 0 0.000 1 0.0000 1950 360 54 54 1913 323 1988 398
+1 4 0 1 -1 7 0 0 0 0.000 1 0.0000 742 1567 54 54 705 1530 780 1605
+2 1 0 1 -1 7 0 0 0 0.000 0 0 -1 0 1 2
+        1 1 1.00 60.00 120.00
+         750 2775 750 1650
+2 1 0 1 -1 7 0 0 0 0.000 0 0 -1 0 1 2
+        1 1 1.00 60.00 120.00
+         750 1575 750 450
+2 1 0 1 -1 7 0 0 0 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         1950 1500 1950 375
+2 1 0 1 -1 7 0 0 0 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         765 2745 1890 1620
+4 0 -1 0 0 0 12 0.0000 4 135 225 825 2925 1.1\001
+4 0 -1 0 0 0 12 0.0000 4 135 495 2025 1575 1.1.1.1\001
+4 0 -1 0 0 0 12 0.0000 4 135 495 2025 375 1.1.1.2\001
+4 0 -1 0 0 0 12 0.0000 4 135 225 825 375 1.3\001
+4 0 -1 0 0 0 12 0.0000 4 135 225 825 1575 1.2\001
+4 0 -1 0 0 0 12 0.0000 4 135 180 525 2100 d1\001
+4 0 -1 0 0 0 12 0.0000 4 135 180 1500 2325 d2\001
+4 0 -1 0 0 0 12 0.0000 4 135 180 525 975 d3\001
+4 0 -1 0 0 0 12 0.0000 4 135 180 2025 975 d4\001
diff --git a/xdelta1/doc/old/dcc99/figs/sizes.eps b/xdelta1/doc/old/dcc99/figs/sizes.eps
new file mode 100755
index 0000000..b1183e1
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/sizes.eps
@@ -0,0 +1,707 @@
+%!PS-Adobe-3.0 EPSF-3.0
+%%Creator: MATLAB, The Mathworks, Inc.
+%%Title: ../figs/sizes.eps
+%%CreationDate: 11/14/98  04:51:39
+%%DocumentNeededFonts: Helvetica
+%%DocumentProcessColors: Cyan Magenta Yellow Black
+%%LanguageLevel: 2
+%%Pages: 1
+%%BoundingBox:    65   196   560   616
+%%EndComments
+
+%%BeginProlog
+
+% MathWorks dictionary
+/MathWorks 150 dict begin
+
+% definition operators
+/bdef {bind def} bind def
+/ldef {load def} bind def
+/xdef {exch def} bdef
+/xstore {exch store} bdef
+
+% operator abbreviations
+/c  /clip ldef
+/cc /concat ldef
+/cp /closepath ldef
+/gr /grestore ldef
+/gs /gsave ldef
+/mt /moveto ldef
+/np /newpath ldef
+/cm /currentmatrix ldef
+/sm /setmatrix ldef
+/rc {rectclip} bdef
+/rf {rectfill} bdef
+/rm /rmoveto ldef
+/rl /rlineto ldef
+/s /show ldef
+/sc {setcmykcolor} bdef
+/sr /setrgbcolor ldef
+/sg /setgray ldef
+/w /setlinewidth ldef
+/j /setlinejoin ldef
+/cap /setlinecap ldef
+
+% page state control
+/pgsv () def
+/bpage {/pgsv save def} bdef
+/epage {pgsv restore} bdef
+/bplot /gsave ldef
+/eplot {stroke grestore} bdef
+
+% orientation switch
+/portraitMode   0 def
+/landscapeMode  1 def
+
+% coordinate system mappings
+/dpi2point 0 def
+
+% font control
+/FontSize 0 def
+/FMS {
+        /FontSize xstore                %save size off stack
+        findfont
+        [FontSize 0 0 FontSize neg 0 0]
+        makefont
+        setfont
+        }bdef
+
+/reencode {
+exch dup where
+{pop load} {pop StandardEncoding} ifelse
+exch
+dup 3 1 roll
+findfont dup length dict begin
+  { 1 index /FID ne {def}{pop pop} ifelse } forall
+  /Encoding exch def
+  currentdict
+end
+definefont pop
+} bdef
+
+/isroman {
+findfont /CharStrings get
+/Agrave known
+} bdef
+
+/FMSR {
+3 1 roll 1 index
+dup isroman
+{reencode} {pop pop} ifelse
+exch FMS
+} bdef
+
+/csm {
+        1 dpi2point div -1 dpi2point div scale
+        neg translate
+        landscapeMode eq {90 rotate} if
+        } bdef
+
+% line types: solid, dotted, dashed, dotdash
+/SO { [] 0 setdash } bdef
+/DO { [.5 dpi2point mul 4 dpi2point mul] 0 setdash } bdef
+/DA { [6 dpi2point mul] 0 setdash } bdef
+/DD { [.5 dpi2point mul 4 dpi2point mul 6 dpi2point mul 4 dpi2point mul] 0 setdash } bdef
+
+% macros for lines and objects
+/L {
+        lineto
+        stroke
+        } bdef
+/MP {
+        3 1 roll moveto
+        1 sub {rlineto} repeat
+        } bdef
+/AP {
+        {rlineto} repeat
+        } bdef
+/PP {
+        closepath eofill
+        } bdef
+/DP {
+        closepath stroke
+        } bdef
+/MR {
+        4 -2 roll moveto
+        dup  0 exch rlineto
+        exch 0 rlineto
+        neg  0 exch rlineto
+        closepath
+        } bdef
+/FR {
+        MR stroke
+        } bdef
+/PR {
+        MR fill
+        } bdef
+/L1i {
+        { currentfile picstr readhexstring pop } image
+        } bdef
+
+/tMatrix matrix def
+/MakeOval {
+        newpath
+        tMatrix currentmatrix pop
+        translate scale
+        0 0 1 0 360 arc
+        tMatrix setmatrix
+        } bdef
+/FO {
+        MakeOval
+        stroke
+        } bdef
+/PO {
+        MakeOval
+        fill
+        } bdef
+
+/PD {
+        currentlinecap 1 setlinecap 3 1 roll 2 copy moveto lineto stroke setlinecap
+        } bdef
+
+/FA {
+        newpath
+        tMatrix currentmatrix pop
+        translate scale
+        0 0 1 5 -2 roll arc
+        tMatrix setmatrix
+        stroke
+        } bdef
+/PA {
+        newpath
+        tMatrix currentmatrix pop
+        translate 0 0 moveto scale
+        0 0 1 5 -2 roll arc
+        closepath
+        tMatrix setmatrix
+        fill
+        } bdef
+
+
+/FAn {
+        newpath
+        tMatrix currentmatrix pop
+        translate scale
+        0 0 1 5 -2 roll arcn
+        tMatrix setmatrix
+        stroke
+        } bdef
+/PAn {
+        newpath
+        tMatrix currentmatrix pop
+        translate 0 0 moveto scale
+        0 0 1 5 -2 roll arcn
+        closepath
+        tMatrix setmatrix
+        fill
+        } bdef
+
+
+
+currentdict end def
+%%EndProlog
+
+%%BeginSetup
+MathWorks begin
+
+0 cap
+
+end
+%%EndSetup
+
+%%Page: 1 1
+%%BeginPageSetup
+%%PageBoundingBox:    65   196   560   616
+MathWorks begin
+bpage
+%%EndPageSetup
+
+%%BeginObject: graph1 1
+bplot
+
+/dpi2point 12 def
+portraitMode 0216 7344 csm
+
+  566   -48  5940  5037 rc
+88 dict begin %Colortable dictionary
+/c0 { 0 0 0 sr} bdef
+/c1 { 1 1 1 sr} bdef
+/c2 { 1 0 0 sr} bdef
+/c3 { 0 1 0 sr} bdef
+/c4 { 0 0 1 sr} bdef
+/c5 { 1 1 0 sr} bdef
+/c6 { 1 0 1 sr} bdef
+/c7 { 0 1 1 sr} bdef
+1 j
+1 sg
+   0    0 6916 5185 rf
+6 w
+0 4225 5358 0 0 -4225 899 4613 4 MP
+PP
+-5358 0 0 4225 5358 0 0 -4225 899 4613 5 MP stroke
+DO
+4 w
+SO
+6 w
+0 sg
+ 899 4613 mt 6257 4613 L
+ 899  388 mt 6257  388 L
+ 899 4613 mt  899  388 L
+6257 4613 mt 6257  388 L
+ 899 4613 mt 6257 4613 L
+ 899 4613 mt  899  388 L
+ 899 4613 mt  899 4559 L
+ 899  388 mt  899  442 L
+%%IncludeResource: font Helvetica
+/Helvetica /ISOLatin1Encoding 120 FMSR
+
+ 866 4759 mt 
+(0) s
+1569 4613 mt 1569 4559 L
+1569  388 mt 1569  442 L
+1403 4759 mt 
+(50000) s
+2239 4613 mt 2239 4559 L
+2239  388 mt 2239  442 L
+2039 4759 mt 
+(100000) s
+2908 4613 mt 2908 4559 L
+2908  388 mt 2908  442 L
+2708 4759 mt 
+(150000) s
+3578 4613 mt 3578 4559 L
+3578  388 mt 3578  442 L
+3378 4759 mt 
+(200000) s
+4248 4613 mt 4248 4559 L
+4248  388 mt 4248  442 L
+4048 4759 mt 
+(250000) s
+4918 4613 mt 4918 4559 L
+4918  388 mt 4918  442 L
+4718 4759 mt 
+(300000) s
+5587 4613 mt 5587 4559 L
+5587  388 mt 5587  442 L
+5387 4759 mt 
+(350000) s
+6257 4613 mt 6257 4559 L
+6257  388 mt 6257  442 L
+6057 4759 mt 
+(400000) s
+ 899 4613 mt  953 4613 L
+6257 4613 mt 6203 4613 L
+ 798 4657 mt 
+(0) s
+ 899 4144 mt  953 4144 L
+6257 4144 mt 6203 4144 L
+ 798 4188 mt 
+(2) s
+ 899 3674 mt  953 3674 L
+6257 3674 mt 6203 3674 L
+ 798 3718 mt 
+(4) s
+ 899 3205 mt  953 3205 L
+6257 3205 mt 6203 3205 L
+ 798 3249 mt 
+(6) s
+ 899 2735 mt  953 2735 L
+6257 2735 mt 6203 2735 L
+ 798 2779 mt 
+(8) s
+ 899 2266 mt  953 2266 L
+6257 2266 mt 6203 2266 L
+ 731 2310 mt 
+(10) s
+ 899 1796 mt  953 1796 L
+6257 1796 mt 6203 1796 L
+ 731 1840 mt 
+(12) s
+ 899 1327 mt  953 1327 L
+6257 1327 mt 6203 1327 L
+ 731 1371 mt 
+(14) s
+ 899  857 mt  953  857 L
+6257  857 mt 6203  857 L
+ 731  901 mt 
+(16) s
+ 899  388 mt  953  388 L
+6257  388 mt 6203  388 L
+ 731  432 mt 
+(18) s
+ 899 4613 mt 6257 4613 L
+ 899  388 mt 6257  388 L
+ 899 4613 mt  899  388 L
+6257 4613 mt 6257  388 L
+gs 899 388 5359 4226 rc
+/c8 { 1.000000 0.000000 0.000000 sr} bdef
+c8
+0 701 939 3735 2 MP stroke
+94 0 892 3735 2 MP stroke
+94 0 892 4436 2 MP stroke
+0 520 1073 3899 2 MP stroke
+94 0 1026 3899 2 MP stroke
+94 0 1026 4419 2 MP stroke
+0 565 1207 3863 2 MP stroke
+94 0 1160 3863 2 MP stroke
+94 0 1160 4428 2 MP stroke
+0 524 1341 3912 2 MP stroke
+94 0 1294 3912 2 MP stroke
+94 0 1294 4436 2 MP stroke
+0 537 1475 3911 2 MP stroke
+94 0 1428 3911 2 MP stroke
+94 0 1428 4448 2 MP stroke
+0 531 1609 3932 2 MP stroke
+94 0 1562 3932 2 MP stroke
+94 0 1562 4463 2 MP stroke
+0 429 1743 4033 2 MP stroke
+94 0 1696 4033 2 MP stroke
+94 0 1696 4462 2 MP stroke
+0 469 1877 3999 2 MP stroke
+94 0 1830 3999 2 MP stroke
+94 0 1830 4468 2 MP stroke
+0 475 2011 3947 2 MP stroke
+94 0 1964 3947 2 MP stroke
+94 0 1964 4422 2 MP stroke
+0 537 2145 3952 2 MP stroke
+94 0 2098 3952 2 MP stroke
+94 0 2098 4489 2 MP stroke
+0 643 2279 3785 2 MP stroke
+94 0 2232 3785 2 MP stroke
+94 0 2232 4428 2 MP stroke
+0 289 2413 4149 2 MP stroke
+94 0 2366 4149 2 MP stroke
+94 0 2366 4438 2 MP stroke
+0 398 2547 4055 2 MP stroke
+93 0 2500 4055 2 MP stroke
+93 0 2500 4453 2 MP stroke
+0 117 2681 4306 2 MP stroke
+93 0 2634 4306 2 MP stroke
+93 0 2634 4423 2 MP stroke
+0 787 2814 3762 2 MP stroke
+93 0 2768 3762 2 MP stroke
+93 0 2768 4549 2 MP stroke
+0 1316 2948 3182 2 MP stroke
+93 0 2902 3182 2 MP stroke
+93 0 2902 4498 2 MP stroke
+0 992 3082 3621 2 MP stroke
+93 0 3036 3621 2 MP stroke
+93 0 3036 4613 2 MP stroke
+0 678 3216 3863 2 MP stroke
+94 0 3169 3863 2 MP stroke
+94 0 3169 4541 2 MP stroke
+0 766 3350 3847 2 MP stroke
+94 0 3303 3847 2 MP stroke
+94 0 3303 4613 2 MP stroke
+0 101 3484 4280 2 MP stroke
+94 0 3437 4280 2 MP stroke
+94 0 3437 4381 2 MP stroke
+0 2112 3618 2501 2 MP stroke
+94 0 3571 2501 2 MP stroke
+94 0 3571 4613 2 MP stroke
+0 260 3752 4096 2 MP stroke
+94 0 3705 4096 2 MP stroke
+94 0 3705 4356 2 MP stroke
+0 4112 4020 501 2 MP stroke
+94 0 3973 501 2 MP stroke
+94 0 3973 4613 2 MP stroke
+0 887 4154 3567 2 MP stroke
+94 0 4107 3567 2 MP stroke
+94 0 4107 4454 2 MP stroke
+0 311 4288 4104 2 MP stroke
+94 0 4241 4104 2 MP stroke
+94 0 4241 4415 2 MP stroke
+0 1338 4422 3219 2 MP stroke
+94 0 4375 3219 2 MP stroke
+94 0 4375 4557 2 MP stroke
+0 1935 5226 2678 2 MP stroke
+93 0 5179 2678 2 MP stroke
+93 0 5179 4613 2 MP stroke
+0 343 5360 4087 2 MP stroke
+93 0 5313 4087 2 MP stroke
+93 0 5313 4430 2 MP stroke
+0 118 5627 4495 2 MP stroke
+93 0 5581 4495 2 MP stroke
+93 0 5581 4613 2 MP stroke
+
+gr 
+c8
+  36   36  939 4085 FO
+  36   36 1073 4159 FO
+  36   36 1207 4145 FO
+  36   36 1341 4174 FO
+  36   36 1475 4179 FO
+  36   36 1609 4197 FO
+  36   36 1743 4248 FO
+  36   36 1877 4234 FO
+  36   36 2011 4184 FO
+  36   36 2145 4221 FO
+  36   36 2279 4106 FO
+  36   36 2413 4294 FO
+  36   36 2547 4254 FO
+  36   36 2681 4364 FO
+  36   36 2814 4155 FO
+  36   36 2948 3840 FO
+  36   36 3082 4117 FO
+  36   36 3216 4202 FO
+  36   36 3350 4230 FO
+  36   36 3484 4331 FO
+  36   36 3618 3822 FO
+  36   36 3752 4226 FO
+  36   36 4020 3285 FO
+  36   36 4154 4011 FO
+  36   36 4288 4259 FO
+  36   36 4422 3888 FO
+  36   36 5226 3645 FO
+  36   36 5360 4258 FO
+  36   36 5627 4554 FO
+gs 899 388 5359 4226 rc
+/c9 { 0.000000 0.000000 1.000000 sr} bdef
+c9
+0 1803 966 2652 2 MP stroke
+94 0 919 2652 2 MP stroke
+94 0 919 4455 2 MP stroke
+0 1317 1100 3068 2 MP stroke
+94 0 1053 3068 2 MP stroke
+94 0 1053 4385 2 MP stroke
+0 1366 1234 3010 2 MP stroke
+94 0 1187 3010 2 MP stroke
+94 0 1187 4376 2 MP stroke
+0 1304 1368 3094 2 MP stroke
+94 0 1321 3094 2 MP stroke
+94 0 1321 4398 2 MP stroke
+0 1078 1502 3280 2 MP stroke
+94 0 1455 3280 2 MP stroke
+94 0 1455 4358 2 MP stroke
+0 1155 1636 3247 2 MP stroke
+94 0 1589 3247 2 MP stroke
+94 0 1589 4402 2 MP stroke
+0 913 1770 3473 2 MP stroke
+94 0 1723 3473 2 MP stroke
+94 0 1723 4386 2 MP stroke
+0 868 1904 3503 2 MP stroke
+94 0 1857 3503 2 MP stroke
+94 0 1857 4371 2 MP stroke
+0 972 2038 3322 2 MP stroke
+93 0 1991 3322 2 MP stroke
+93 0 1991 4294 2 MP stroke
+0 950 2172 3448 2 MP stroke
+93 0 2125 3448 2 MP stroke
+93 0 2125 4398 2 MP stroke
+0 955 2305 3287 2 MP stroke
+93 0 2259 3287 2 MP stroke
+93 0 2259 4242 2 MP stroke
+0 922 2439 3553 2 MP stroke
+93 0 2393 3553 2 MP stroke
+93 0 2393 4475 2 MP stroke
+0 946 2573 3449 2 MP stroke
+94 0 2526 3449 2 MP stroke
+94 0 2526 4395 2 MP stroke
+0 356 2707 4083 2 MP stroke
+94 0 2660 4083 2 MP stroke
+94 0 2660 4439 2 MP stroke
+0 1027 2841 3442 2 MP stroke
+94 0 2794 3442 2 MP stroke
+94 0 2794 4469 2 MP stroke
+0 940 2975 3239 2 MP stroke
+94 0 2928 3239 2 MP stroke
+94 0 2928 4179 2 MP stroke
+0 923 3109 3690 2 MP stroke
+94 0 3062 3690 2 MP stroke
+94 0 3062 4613 2 MP stroke
+0 1293 3243 3297 2 MP stroke
+94 0 3196 3297 2 MP stroke
+94 0 3196 4590 2 MP stroke
+0 686 3377 3927 2 MP stroke
+94 0 3330 3927 2 MP stroke
+94 0 3330 4613 2 MP stroke
+0 383 3511 4010 2 MP stroke
+94 0 3464 4010 2 MP stroke
+94 0 3464 4393 2 MP stroke
+0 1395 3645 3036 2 MP stroke
+94 0 3598 3036 2 MP stroke
+94 0 3598 4431 2 MP stroke
+0 157 3779 4122 2 MP stroke
+94 0 3732 4122 2 MP stroke
+94 0 3732 4279 2 MP stroke
+0 881 4047 3563 2 MP stroke
+94 0 4000 3563 2 MP stroke
+94 0 4000 4444 2 MP stroke
+0 1226 4181 3089 2 MP stroke
+94 0 4134 3089 2 MP stroke
+94 0 4134 4315 2 MP stroke
+0 254 4315 4090 2 MP stroke
+94 0 4268 4090 2 MP stroke
+94 0 4268 4344 2 MP stroke
+0 489 4449 3828 2 MP stroke
+94 0 4402 3828 2 MP stroke
+94 0 4402 4317 2 MP stroke
+0 1007 5252 3606 2 MP stroke
+94 0 5205 3606 2 MP stroke
+94 0 5205 4613 2 MP stroke
+0 216 5386 4142 2 MP stroke
+94 0 5339 4142 2 MP stroke
+94 0 5339 4358 2 MP stroke
+0 86 5654 4527 2 MP stroke
+94 0 5607 4527 2 MP stroke
+94 0 5607 4613 2 MP stroke
+
+gr 
+c9
+0 j
+0 -58 -58 0 0 58 58 0 937 3525 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1071 3698 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1205 3664 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1339 3717 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1473 3790 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1607 3796 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1741 3901 5 MP
+DP
+0 -58 -58 0 0 58 58 0 1875 3908 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2009 3779 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2143 3894 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2276 3736 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2410 3985 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2544 3893 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2678 4232 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2812 3927 5 MP
+DP
+0 -58 -58 0 0 58 58 0 2946 3680 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3080 4122 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3214 3915 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3348 4241 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3482 4172 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3616 3704 5 MP
+DP
+0 -58 -58 0 0 58 58 0 3750 4172 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4018 3974 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4152 3673 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4286 4188 5 MP
+DP
+0 -58 -58 0 0 58 58 0 4420 4043 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5223 4081 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5357 4221 5 MP
+DP
+0 -58 -58 0 0 58 58 0 5625 4541 5 MP
+DP
+gs 899 388 5359 4226 rc
+
+gr 
+0 sg
+ 677 2927 mt  -90 rotate
+(Delta Size Ratio) s
+90 rotate
+3066 4901 mt 
+(To File Size \(bytes\)) s
+gs 899 388 5359 4226 rc
+c8
+267 296 134 613 804 -243 134 -371 134 248 134 726 268 -941 134 404 
+134 -509 134 101 134 28 134 85 134 277 134 -315 133 -209 134 110 
+134 -40 134 188 134 -115 134 37 134 -50 134 -14 134 51 134 18 
+134 5 134 29 134 -14 134 74 939 4085 29 MP stroke
+c9
+268 320 134 140 803 38 134 -145 134 515 134 -301 268 -198 134 468 
+134 -468 134 -69 134 326 134 -207 134 442 134 -247 134 -305 134 339 
+134 -92 134 249 133 -158 134 115 134 -129 134 7 134 105 134 6 
+134 73 134 53 134 -34 134 173 966 3554 29 MP stroke
+
+gr 
+c9
+1 sg
+0 710 2338 0 0 -710 3781 1202 4 MP
+PP
+-2338 0 0 710 2338 0 0 -710 3781 1202 5 MP stroke
+DO
+4 w
+SO
+6 w
+0 sg
+3781 1202 mt 6119 1202 L
+3781  492 mt 6119  492 L
+3781 1202 mt 3781  492 L
+6119 1202 mt 6119  492 L
+3781 1202 mt 6119 1202 L
+3781 1202 mt 3781  492 L
+3781 1202 mt 6119 1202 L
+3781  492 mt 6119  492 L
+3781 1202 mt 3781  492 L
+6119 1202 mt 6119  492 L
+4584  678 mt 
+(Vdelta standard deviation) s
+gs 3781 492 2339 711 rc
+c8
+429 0 3888 634 2 MP stroke
+
+gr 
+c8
+0 sg
+4584  820 mt 
+(Vdelta mean              ) s
+gs 3781 492 2339 711 rc
+
+gr 
+c8
+  36   36 3888  776 FO
+  36   36 4317  776 FO
+gs 3781 492 2339 711 rc
+
+gr 
+0 sg
+4584  962 mt 
+(Xdelta standard deviation) s
+gs 3781 492 2339 711 rc
+c9
+429 0 3888 918 2 MP stroke
+
+gr 
+c9
+0 sg
+4584 1104 mt 
+(Xdelta mean              ) s
+gs 3781 492 2339 711 rc
+
+gr 
+0 -58 -58 0 0 58 58 0 3859 1031 5 MP
+c9
+DP
+0 -58 -58 0 0 58 58 0 4288 1031 5 MP
+DP
+gs 3781 492 2339 711 rc
+
+gr 
+
+end
+
+eplot
+%%EndObject graph 1
+
+epage
+end
+
+showpage
+
+%%Trailer
+%%EOF
diff --git a/xdelta1/doc/old/dcc99/figs/strings.eps b/xdelta1/doc/old/dcc99/figs/strings.eps
new file mode 100755
index 0000000..ef2c00a
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/strings.eps
@@ -0,0 +1,194 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: strings.fig.normalsize
+%%Creator: fig2dev Version 3.1 Patchlevel 2
+%%CreationDate: Sun Nov  8 04:04:15 1998
+%%For: jmacd@axis.hip.berkeley.edu (Josh)
+%%Orientation: Portrait
+%%BoundingBox: 0 0 161 153
+%%Pages: 0
+%%BeginSetup
+%%IncludeFeature: *PageSize Letter
+%%EndSetup
+%Magnification: 1.00
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+0.0 155.0 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+%%EndProlog
+
+$F2psBegin
+10 setmiterlimit
+n 0 792 m 0 0 l 612 0 l 612 792 l cp clip
+ 0.06000 0.06000 sc
+/Times-Roman ff 135.00 scf sf
+1579 1135 m
+gs 1 -1 sc (DISULPHONE) col-1 sh gr
+7.500 slw
+% Polyline
+gs  clippath
+326 1339 m 262 1233 l 368 1297 l 254 1182 l 211 1225 l  cp clip
+n 479 1450 m 243 1214 l gs col-1 s gr gr
+
+% arrowhead
+n 326 1339 m 262 1233 l 368 1297 l 347 1318 l 326 1339 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1690 1768 m 1795 1704 l 1732 1810 l 1847 1696 l 1804 1653 l  cp clip
+n 1579 1921 m 1815 1685 l gs col-1 s gr gr
+
+% arrowhead
+n 1690 1768 m 1795 1704 l 1732 1810 l 1711 1789 l 1690 1768 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+354 746 m 459 682 l 396 788 l 511 674 l 468 631 l  cp clip
+n 243 899 m 479 663 l gs col-1 s gr gr
+
+% arrowhead
+n 354 746 m 459 682 l 396 788 l 375 767 l 354 746 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1741 1339 m 1677 1233 l 1783 1297 l 1669 1182 l 1626 1225 l  cp clip
+n 1894 1450 m 1658 1214 l gs col-1 s gr gr
+
+% arrowhead
+n 1741 1339 m 1677 1233 l 1783 1297 l 1762 1318 l 1741 1339 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+606 339 m 636 219 l 666 339 l 666 177 l 606 177 l  cp clip
+n 636 428 m 636 192 l gs col-1 s gr gr
+
+% arrowhead
+n 606 339 m 636 219 l 666 339 l 636 339 l 606 339 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1078 2275 m 1014 2169 l 1120 2233 l 1006 2118 l 963 2161 l  cp clip
+n 1231 2386 m 995 2150 l gs col-1 s gr gr
+
+% arrowhead
+n 1078 2275 m 1014 2169 l 1120 2233 l 1099 2254 l 1078 2275 l  cp gs 0.00 setgray ef gr  col-1 s
+/Times-Roman ff 135.00 scf sf
+15 1131 m
+gs 1 -1 sc (5.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1410 1123 m
+gs 1 -1 sc (6.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+381 1607 m
+gs 1 -1 sc (3.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1725 1607 m
+gs 1 -1 sc (4.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+715 2067 m
+gs 1 -1 sc (2.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1033 2542 m
+gs 1 -1 sc (1.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+420 585 m
+gs 1 -1 sc (7.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+388 109 m
+gs 1 -1 sc (8.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+557 113 m
+gs 1 -1 sc (ESSELENIST) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+557 1607 m
+gs 1 -1 sc (DISELENIDE) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+872 2078 m
+gs 1 -1 sc (BISULPHIDE) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1186 2550 m
+gs 1 -1 sc (DISULPHIDE) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+164 1135 m
+gs 1 -1 sc (ESSELENIAN) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1894 1607 m
+gs 1 -1 sc (DISULPHINE) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+557 585 m
+gs 1 -1 sc (TROEZENIAN) col-1 sh gr
+% Polyline
+gs  clippath
+719 1810 m 655 1704 l 761 1768 l 647 1653 l 604 1696 l  cp clip
+n 872 1921 m 636 1685 l gs col-1 s gr gr
+
+% arrowhead
+n 719 1810 m 655 1704 l 761 1768 l 740 1789 l 719 1810 l  cp gs 0.00 setgray ef gr  col-1 s
+$F2psEnd
+rs
diff --git a/xdelta1/doc/old/dcc99/figs/strings.fig b/xdelta1/doc/old/dcc99/figs/strings.fig
new file mode 100755
index 0000000..f8c8fb0
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/strings.fig
@@ -0,0 +1,36 @@
+#FIG 3.1
+Portrait
+Center
+Inches
+1200 2
+6 0 0 2658 2700
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        0 0 1.00 60.00 120.00
+         1088 2533 837 2281
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         753 2030 502 1779
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         335 1528 84 1277
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         1507 2030 1758 1779
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         84 942 335 691
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         1842 1528 1591 1277
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         502 440 502 188
+4 0 -1 0 0 0 9 0.0000 0 96 791 419 105 ESSELENIST\001
+4 0 -1 0 0 0 9 0.0000 0 96 804 419 1695 DISELENIDE\001
+4 0 -1 0 0 0 9 0.0000 0 96 804 753 2198 BISULPHIDE\001
+4 0 -1 0 0 0 9 0.0000 0 96 812 1088 2700 DISULPHIDE\001
+4 0 -1 0 0 0 9 0.0000 0 96 833 0 1193 ESSELENIAN\001
+4 0 -1 0 0 0 9 0.0000 0 96 812 1842 1695 DISULPHINE\001
+4 0 -1 0 0 0 9 0.0000 0 96 875 419 607 TROEZENIAN\001
+4 0 -1 0 0 0 9 0.0000 0 96 866 1507 1193 DISULPHONE\001
+-6
diff --git a/xdelta1/doc/old/dcc99/figs/strings.fig.normalsize b/xdelta1/doc/old/dcc99/figs/strings.fig.normalsize
new file mode 100755
index 0000000..175f721
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/strings.fig.normalsize
@@ -0,0 +1,42 @@
+#FIG 3.1
+Portrait
+Center
+Inches
+1200 2
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         872 1921 636 1685
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         479 1450 243 1214
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         1579 1921 1815 1685
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         243 899 479 663
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         1894 1450 1658 1214
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         636 428 636 192
+2 1 0 1 -1 7 0 0 -1 0.000 0 0 -1 1 0 2
+        1 1 1.00 60.00 120.00
+         1231 2386 995 2150
+4 0 -1 0 0 0 9 0.0000 0 90 94 15 1131 5.\001
+4 0 -1 0 0 0 9 0.0000 0 90 94 1410 1123 6.\001
+4 0 -1 0 0 0 9 0.0000 0 90 94 381 1607 3.\001
+4 0 -1 0 0 0 9 0.0000 0 90 94 1725 1607 4.\001
+4 0 -1 0 0 0 9 0.0000 0 90 94 715 2067 2.\001
+4 0 -1 0 0 0 9 0.0000 0 90 94 1033 2542 1.\001
+4 0 -1 0 0 0 9 0.0000 0 90 94 420 585 7.\001
+4 0 -1 0 0 0 9 0.0000 0 90 94 388 109 8.\001
+4 0 -1 0 0 0 9 0.0000 0 90 743 557 113 ESSELENIST\001
+4 0 -1 0 0 0 9 0.0000 0 90 755 557 1607 DISELENIDE\001
+4 0 -1 0 0 0 9 0.0000 0 90 755 872 2078 BISULPHIDE\001
+4 0 -1 0 0 0 9 0.0000 0 90 762 1186 2550 DISULPHIDE\001
+4 0 -1 0 0 0 9 0.0000 0 90 782 164 1135 ESSELENIAN\001
+4 0 -1 0 0 0 9 0.0000 0 90 762 1894 1607 DISULPHINE\001
+4 0 -1 0 0 0 9 0.0000 0 90 821 557 585 TROEZENIAN\001
+4 0 -1 0 0 0 9 0.0000 0 90 814 1579 1135 DISULPHONE\001
diff --git a/xdelta1/doc/old/dcc99/figs/strings.fig.normalsize.eps b/xdelta1/doc/old/dcc99/figs/strings.fig.normalsize.eps
new file mode 100755
index 0000000..dcd9f79
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/strings.fig.normalsize.eps
@@ -0,0 +1,194 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: strings.fig.normalsize
+%%Creator: fig2dev Version 3.1 Patchlevel 2
+%%CreationDate: Sun Nov  8 04:02:56 1998
+%%For: jmacd@axis.hip.berkeley.edu (Josh)
+%%Orientation: Portrait
+%%BoundingBox: 0 0 161 153
+%%Pages: 0
+%%BeginSetup
+%%IncludeFeature: *PageSize Letter
+%%EndSetup
+%Magnification: 1.00
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+0.0 155.0 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+%%EndProlog
+
+$F2psBegin
+10 setmiterlimit
+n 0 792 m 0 0 l 612 0 l 612 792 l cp clip
+ 0.06000 0.06000 sc
+/Times-Roman ff 135.00 scf sf
+388 109 m
+gs 1 -1 sc (8.) col-1 sh gr
+7.500 slw
+% Polyline
+gs  clippath
+719 1810 m 655 1704 l 761 1768 l 647 1653 l 604 1696 l  cp clip
+n 872 1921 m 636 1685 l gs col-1 s gr gr
+
+% arrowhead
+n 719 1810 m 655 1704 l 761 1768 l 740 1789 l 719 1810 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+326 1339 m 262 1233 l 368 1297 l 254 1182 l 211 1225 l  cp clip
+n 479 1450 m 243 1214 l gs col-1 s gr gr
+
+% arrowhead
+n 326 1339 m 262 1233 l 368 1297 l 347 1318 l 326 1339 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1690 1768 m 1795 1704 l 1732 1810 l 1847 1696 l 1804 1653 l  cp clip
+n 1579 1921 m 1815 1685 l gs col-1 s gr gr
+
+% arrowhead
+n 1690 1768 m 1795 1704 l 1732 1810 l 1711 1789 l 1690 1768 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+354 746 m 459 682 l 396 788 l 511 674 l 468 631 l  cp clip
+n 243 899 m 479 663 l gs col-1 s gr gr
+
+% arrowhead
+n 354 746 m 459 682 l 396 788 l 375 767 l 354 746 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1741 1339 m 1677 1233 l 1783 1297 l 1669 1182 l 1626 1225 l  cp clip
+n 1894 1450 m 1658 1214 l gs col-1 s gr gr
+
+% arrowhead
+n 1741 1339 m 1677 1233 l 1783 1297 l 1762 1318 l 1741 1339 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+606 339 m 636 219 l 666 339 l 666 177 l 606 177 l  cp clip
+n 636 428 m 636 192 l gs col-1 s gr gr
+
+% arrowhead
+n 606 339 m 636 219 l 666 339 l 636 339 l 606 339 l  cp gs 0.00 setgray ef gr  col-1 s
+/Times-Roman ff 135.00 scf sf
+557 113 m
+gs 1 -1 sc (ESSELENIST) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+557 1607 m
+gs 1 -1 sc (DISELENIDE) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+872 2078 m
+gs 1 -1 sc (BISULPHIDE) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1186 2550 m
+gs 1 -1 sc (DISULPHIDE) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+164 1135 m
+gs 1 -1 sc (ESSELENIAN) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1894 1607 m
+gs 1 -1 sc (DISULPHINE) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+557 585 m
+gs 1 -1 sc (TROEZENIAN) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1579 1135 m
+gs 1 -1 sc (DISULPHONE) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+15 1131 m
+gs 1 -1 sc (5.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1410 1123 m
+gs 1 -1 sc (6.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+381 1607 m
+gs 1 -1 sc (3.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1725 1607 m
+gs 1 -1 sc (4.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+715 2067 m
+gs 1 -1 sc (2.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+1033 2542 m
+gs 1 -1 sc (1.) col-1 sh gr
+/Times-Roman ff 135.00 scf sf
+420 585 m
+gs 1 -1 sc (7.) col-1 sh gr
+% Polyline
+gs  clippath
+1033 2282 m 969 2176 l 1075 2240 l 961 2125 l 918 2168 l  cp clip
+n 1186 2393 m 950 2157 l gs col-1 s gr gr
+
+% arrowhead
+n 1033 2282 m 969 2176 l 1075 2240 l  col-1 s
+$F2psEnd
+rs
diff --git a/xdelta1/doc/old/dcc99/figs/xdarchive.eps b/xdelta1/doc/old/dcc99/figs/xdarchive.eps
new file mode 100755
index 0000000..5d70278
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/xdarchive.eps
@@ -0,0 +1,808 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: xdarchive.fig
+%%Creator: fig2dev Version 3.1 Patchlevel 2
+%%CreationDate: Sat Nov  7 02:45:24 1998
+%%For: jmacd@axis.hip.berkeley.edu (Josh)
+%%Orientation: Portrait
+%%BoundingBox: 0 0 285 182
+%%Pages: 0
+%%BeginSetup
+%%IncludeFeature: *PageSize Letter
+%%EndSetup
+%Magnification: 1.00
+%%EndComments
+/MyAppDict 100 dict dup begin def
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+0.0 184.0 translate
+1 -1 scale
+.9 .9 scale % to make patterns same scale as in xfig
+
+% This junk string is used by the show operators
+/PATsstr 1 string def
+/PATawidthshow {        % cx cy cchar rx ry string
+  % Loop over each character in the string
+  {  % cx cy cchar rx ry char
+    % Show the character
+    dup                         % cx cy cchar rx ry char char
+    PATsstr dup 0 4 -1 roll put % cx cy cchar rx ry char (char)
+    false charpath              % cx cy cchar rx ry char
+    /clip load PATdraw
+    % Move past the character (charpath modified the
+    % current point)
+    currentpoint                        % cx cy cchar rx ry char x y
+    newpath
+    moveto                      % cx cy cchar rx ry char
+    % Reposition by cx,cy if the character in the string is cchar
+    3 index eq {                        % cx cy cchar rx ry
+      4 index 4 index rmoveto
+    } if
+    % Reposition all characters by rx ry
+    2 copy rmoveto              % cx cy cchar rx ry
+  } forall
+  pop pop pop pop pop           % -
+  currentpoint
+  newpath
+  moveto
+} bind def
+/PATcg {
+  7 dict dup begin
+    /lw currentlinewidth def
+    /lc currentlinecap def
+    /lj currentlinejoin def
+    /ml currentmiterlimit def
+    /ds [ currentdash ] def
+    /cc [ currentrgbcolor ] def
+    /cm matrix currentmatrix def
+  end
+} bind def
+% PATdraw - calculates the boundaries of the object and
+% fills it with the current pattern
+/PATdraw {                      % proc
+  save exch
+    PATpcalc                    % proc nw nh px py
+    5 -1 roll exec              % nw nh px py
+    newpath
+    PATfill                     % -
+  restore
+} bind def
+% PATfill - performs the tiling for the shape
+/PATfill { % nw nh px py PATfill -
+  PATDict /CurrentPattern get dup begin
+    setfont
+    % Set the coordinate system to Pattern Space
+    PatternGState PATsg
+    % Set the color for uncolored pattezns
+    PaintType 2 eq { PATDict /PColor get PATsc } if
+    % Create the string for showing
+    3 index string              % nw nh px py str
+    % Loop for each of the pattern sources
+    0 1 Multi 1 sub {           % nw nh px py str source
+        % Move to the starting location
+        3 index 3 index         % nw nh px py str source px py
+        moveto                  % nw nh px py str source
+        % For multiple sources, set the appropriate color
+        Multi 1 ne { dup PC exch get PATsc } if
+        % Set the appropriate string for the source
+        0 1 7 index 1 sub { 2 index exch 2 index put } for pop
+        % Loop over the number of vertical cells
+        3 index                 % nw nh px py str nh
+        {                       % nw nh px py str
+          currentpoint          % nw nh px py str cx cy
+          2 index show          % nw nh px py str cx cy
+          YStep add moveto      % nw nh px py str
+        } repeat                % nw nh px py str
+    } for
+    5 { pop } repeat
+  end
+} bind def
+
+% PATkshow - kshow with the current pattezn
+/PATkshow {                     % proc string
+  exch bind                     % string proc
+  1 index 0 get                 % string proc char
+  % Loop over all but the last character in the string
+  0 1 4 index length 2 sub {
+                                % string proc char idx
+    % Find the n+1th character in the string
+    3 index exch 1 add get      % string proe char char+1
+    exch 2 copy                 % strinq proc char+1 char char+1 char
+    % Now show the nth character
+    PATsstr dup 0 4 -1 roll put % string proc chr+1 chr chr+1 (chr)
+    false charpath              % string proc char+1 char char+1
+    /clip load PATdraw
+    % Move past the character (charpath modified the current point)
+    currentpoint newpath moveto
+    % Execute the user proc (should consume char and char+1)
+    mark 3 1 roll               % string proc char+1 mark char char+1
+    4 index exec                % string proc char+1 mark...
+    cleartomark                 % string proc char+1
+  } for
+  % Now display the last character
+  PATsstr dup 0 4 -1 roll put   % string proc (char+1)
+  false charpath                % string proc
+  /clip load PATdraw
+  neewath
+  pop pop                       % -
+} bind def
+% PATmp - the makepattern equivalent
+/PATmp {                        % patdict patmtx PATmp patinstance
+  exch dup length 7 add         % We will add 6 new entries plus 1 FID
+  dict copy                     % Create a new dictionary
+  begin
+    % Matrix to install when painting the pattern
+    TilingType PATtcalc
+    /PatternGState PATcg def
+    PatternGState /cm 3 -1 roll put
+    % Check for multi pattern sources (Level 1 fast color patterns)
+    currentdict /Multi known not { /Multi 1 def } if
+    % Font dictionary definitions
+    /FontType 3 def
+    % Create a dummy encoding vector
+    /Encoding 256 array def
+    3 string 0 1 255 {
+      Encoding exch dup 3 index cvs cvn put } for pop
+    /FontMatrix matrix def
+    /FontBBox BBox def
+    /BuildChar {
+        mark 3 1 roll           % mark dict char
+        exch begin
+        Multi 1 ne {PaintData exch get}{pop} ifelse  % mark [paintdata]
+          PaintType 2 eq Multi 1 ne or
+          { XStep 0 FontBBox aload pop setcachedevice }
+          { XStep 0 setcharwidth } ifelse
+          currentdict           % mark [paintdata] dict
+          /PaintProc load       % mark [paintdata] dict paintproc
+        end
+        gsave
+          false PATredef exec true PATredef
+        grestore
+        cleartomark             % -
+    } bind def
+    currentdict
+  end                           % newdict
+  /foo exch                     % /foo newlict
+  definefont                    % newfont
+} bind def
+% PATpcalc - calculates the starting point and width/height
+% of the tile fill for the shape
+/PATpcalc {     % - PATpcalc nw nh px py
+  PATDict /CurrentPattern get begin
+    gsave
+        % Set up the coordinate system to Pattern Space
+        % and lock down pattern
+        PatternGState /cm get setmatrix
+        BBox aload pop pop pop translate
+        % Determine the bounding box of the shape
+        pathbbox                        % llx lly urx ury
+    grestore
+    % Determine (nw, nh) the # of cells to paint width and height
+    PatHeight div ceiling               % llx lly urx qh
+    4 1 roll                            % qh llx lly urx
+    PatWidth div ceiling                % qh llx lly qw
+    4 1 roll                            % qw qh llx lly
+    PatHeight div floor                 % qw qh llx ph
+    4 1 roll                            % ph qw qh llx
+    PatWidth div floor                  % ph qw qh pw
+    4 1 roll                            % pw ph qw qh
+    2 index sub cvi abs                 % pw ph qs qh-ph
+    exch 3 index sub cvi abs exch       % pw ph nw=qw-pw nh=qh-ph
+    % Determine the starting point of the pattern fill
+    %(px, py)
+    4 2 roll                            % nw nh pw ph
+    PatHeight mul                       % nw nh pw py
+    exch                                % nw nh py pw
+    PatWidth mul exch                   % nw nh px py
+  end
+} bind def
+
+% Save the original routines so that we can use them later on
+/oldfill        /fill load def
+/oldeofill      /eofill load def
+/oldstroke      /stroke load def
+/oldshow        /show load def
+/oldashow       /ashow load def
+/oldwidthshow   /widthshow load def
+/oldawidthshow  /awidthshow load def
+/oldkshow       /kshow load def
+
+% These defs are necessary so that subsequent procs don't bind in
+% the originals
+/fill      { oldfill } bind def
+/eofill    { oldeofill } bind def
+/stroke    { oldstroke } bind def
+/show      { oldshow } bind def
+/ashow     { oldashow } bind def
+/widthshow { oldwidthshow } bind def
+/awidthshow { oldawidthshow } bind def
+/kshow     { oldkshow } bind def
+/PATredef {
+  MyAppDict begin
+    {
+    /fill { /clip load PATdraw newpath } bind def
+    /eofill { /eoclip load PATdraw newpath } bind def
+    /stroke { PATstroke } bind def
+    /show { 0 0 null 0 0 6 -1 roll PATawidthshow } bind def
+    /ashow { 0 0 null 6 3 roll PATawidthshow }
+    bind def
+    /widthshow { 0 0 3 -1 roll PATawidthshow }
+    bind def
+    /awidthshow { PATawidthshow } bind def
+    /kshow { PATkshow } bind def
+  } {
+    /fill   { oldfill } bind def
+    /eofill { oldeofill } bind def
+    /stroke { oldstroke } bind def
+    /show   { oldshow } bind def
+    /ashow  { oldashow } bind def
+    /widthshow { oldwidthshow } bind def
+    /awidthshow { oldawidthshow } bind def
+    /kshow  { oldkshow } bind def
+    } ifelse
+  end
+} bind def
+false PATredef
+% Conditionally define setcmykcolor if not available
+/setcmykcolor where { pop } {
+  /setcmykcolor {
+    1 sub 4 1 roll
+    3 {
+        3 index add neg dup 0 lt { pop 0 } if 3 1 roll
+    } repeat
+    setrgbcolor - pop
+  } bind def
+} ifelse
+/PATsc {                % colorarray
+  aload length          % c1 ... cn length
+    dup 1 eq { pop setgray } { 3 eq { setrgbcolor } { setcmykcolor
+  } ifelse } ifelse
+} bind def
+/PATsg {                % dict
+  begin
+    lw setlinewidth
+    lc setlinecap
+    lj setlinejoin
+    ml setmiterlimit
+    ds aload pop setdash
+    cc aload pop setrgbcolor
+    cm setmatrix
+  end
+} bind def
+
+/PATDict 3 dict def
+/PATsp {
+  true PATredef
+  PATDict begin
+    /CurrentPattern exch def
+    % If it's an uncolored pattern, save the color
+    CurrentPattern /PaintType get 2 eq {
+      /PColor exch def
+    } if
+    /CColor [ currentrgbcolor ] def
+  end
+} bind def
+% PATstroke - stroke with the current pattern
+/PATstroke {
+  countdictstack
+  save
+  mark
+  {
+    currentpoint strokepath moveto
+    PATpcalc                            % proc nw nh px py
+    clip newpath PATfill
+    } stopped {
+        (*** PATstroke Warning: Path is too complex, stroking
+          with gray) =
+    cleartomark
+    restore
+    countdictstack exch sub dup 0 gt
+        { { end } repeat } { pop } ifelse
+    gsave 0.5 setgray oldstroke grestore
+  } { pop restore pop } ifelse
+  newpath
+} bind def
+/PATtcalc {             % modmtx tilingtype PATtcalc tilematrix
+  % Note: tiling types 2 and 3 are not supported
+  gsave
+    exch concat                                 % tilingtype
+    matrix currentmatrix exch                   % cmtx tilingtype
+    % Tiling type 1 and 3: constant spacing
+    2 ne {
+        % Distort the pattern so that it occupies
+        % an integral number of device pixels
+        dup 4 get exch dup 5 get exch           % tx ty cmtx
+        XStep 0 dtransform
+        round exch round exch                   % tx ty cmtx dx.x dx.y
+        XStep div exch XStep div exch           % tx ty cmtx a b
+        0 YStep dtransform
+        round exch round exch                   % tx ty cmtx a b dy.x dy.y
+        YStep div exch YStep div exch           % tx ty cmtx a b c d
+        7 -3 roll astore                        % { a b c d tx ty }
+    } if
+  grestore
+} bind def
+/PATusp {
+  false PATredef
+  PATDict begin
+    CColor PATsc
+  end
+} bind def
+
+% this is the pattern fill program from the Second edition Reference Manual
+% with changes to call the above pattern fill
+% left30
+11 dict begin
+/PaintType 1 def
+/PatternType 1 def
+/TilingType 1 def
+/BBox [0 0 1 1] def
+/XStep 1 def
+/YStep 1 def
+/PatWidth 1 def
+/PatHeight 1 def
+/Multi 2 def
+/PaintData [
+  { clippath } bind
+  { 32 16 true [ 32 0 0 -16 0 16 ]
+        {<c000c000300030000c000c000300030000c000c000300030
+        000c000c00030003c000c000300030000c000c0003000300
+        00c000c000300030000c000c00030003>}
+     imagemask } bind
+] def
+/PaintProc {
+        pop
+        exec fill
+} def
+currentdict
+end
+/P1 exch def
+
+% horizontal sawtooth lines
+11 dict begin
+/PaintType 1 def
+/PatternType 1 def
+/TilingType 1 def
+/BBox [0 0 1 1] def
+/XStep 1 def
+/YStep 1 def
+/PatWidth 1 def
+/PatHeight 1 def
+/Multi 2 def
+/PaintData [
+  { clippath } bind
+  { 32 16 true [ 32 0 0 -16 0 16 ]
+        {<000000000000000000000000000000000000000000000000
+        000000000100010002800280044004400820082010101010
+        20082008400440048002800200010001>}
+     imagemask } bind
+] def
+/PaintProc {
+        pop
+        exec fill
+} def
+currentdict
+end
+/P21 exch def
+1.1111 1.1111 scale %restore scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+%%EndProlog
+
+$F2psBegin
+10 setmiterlimit
+n 0 792 m 0 0 l 612 0 l 612 792 l cp clip
+ 0.06000 0.06000 sc
+/Courier ff 165.00 scf sf
+3921 3035 m
+gs 1 -1 sc (Storage) col-1 sh gr
+7.500 slw
+% Polyline
+ [15 50.0] 50.0 sd
+n 101 461 m 1105 461 l 1105 662 l 101 662 l cp gs col-1 s gr  [] 0 sd
+% Polyline
+ [15 50.0] 50.0 sd
+n 101 863 m 1105 863 l 1105 1064 l 101 1064 l cp gs col-1 s gr  [] 0 sd
+% Polyline
+ [15 50.0] 50.0 sd
+n 101 1265 m 1105 1265 l 1105 1466 l 101 1466 l cp gs col-1 s gr  [] 0 sd
+% Polyline
+ [15 50.0] 50.0 sd
+n 101 1668 m 1105 1668 l 1105 1869 l 101 1869 l cp gs col-1 s gr  [] 0 sd
+% Polyline
+n 101 2472 m 1105 2472 l 1105 2673 l 101 2673 l cp gs col-1 s gr 
+% Polyline
+n 101 1668 m 1105 1668 l 1105 1869 l 101 1869 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 6.73 111.20] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 101 1265 m 1105 1265 l 1105 1466 l 101 1466 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 6.73 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 101 863 m 1105 863 l 1105 1064 l 101 1064 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 6.73 57.53] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 101 461 m 1105 461 l 1105 662 l 101 662 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 6.73 30.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 101 59 m 1105 59 l 1105 260 l 101 260 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 6.73 3.93] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 101 2472 m 1105 2472 l 1105 2673 l 101 2673 l cp gs col7 1.00 shd ef gr gs col-1 s gr 
+% Polyline
+n 101 2472 m 1105 2472 l 1105 2673 l 101 2673 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 6.73 164.80] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 101 2070 m 1105 2070 l 1105 2271 l 101 2271 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 6.73 138.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1306 59 m 2312 59 l 2312 260 l 1306 260 l cp gs col-1 s gr 
+% Polyline
+n 1306 461 m 2312 461 l 2312 662 l 1306 662 l cp gs col-1 s gr 
+% Polyline
+n 1306 863 m 2312 863 l 2312 1064 l 1306 1064 l cp gs col-1 s gr 
+% Polyline
+n 1306 1265 m 2312 1265 l 2312 1466 l 1306 1466 l cp gs col-1 s gr 
+% Polyline
+n 1306 1668 m 2312 1668 l 2312 1869 l 1306 1869 l cp gs col-1 s gr 
+% Polyline
+n 1306 2070 m 2312 2070 l 2312 2271 l 1306 2271 l cp gs col-1 s gr 
+% Polyline
+n 1306 2472 m 2312 2472 l 2312 2673 l 1306 2673 l cp gs col-1 s gr 
+% Polyline
+n 2513 59 m 3518 59 l 3518 260 l 2513 260 l cp gs col-1 s gr 
+% Polyline
+n 2513 461 m 3518 461 l 3518 662 l 2513 662 l cp gs col-1 s gr 
+% Polyline
+n 2513 863 m 3518 863 l 3518 1064 l 2513 1064 l cp gs col-1 s gr 
+% Polyline
+n 2513 1265 m 3518 1265 l 3518 1466 l 2513 1466 l cp gs col-1 s gr 
+% Polyline
+n 2513 1668 m 3518 1668 l 3518 1869 l 2513 1869 l cp gs col-1 s gr 
+% Polyline
+n 2513 2070 m 3518 2070 l 3518 2271 l 2513 2271 l cp gs col-1 s gr 
+% Polyline
+n 2513 2472 m 3518 2472 l 3518 2673 l 2513 2673 l cp gs col-1 s gr 
+% Polyline
+n 1408 59 m 2312 59 l 2312 260 l 1408 260 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 93.87 3.93] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2513 59 m 2614 59 l 2614 260 l 2513 260 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 167.53 3.93] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1408 461 m 1609 461 l 1609 662 l 1408 662 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 93.87 30.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1709 461 m 1810 461 l 1810 662 l 1709 662 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 113.93 30.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2011 461 m 2312 461 l 2312 662 l 2011 662 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 134.07 30.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2513 461 m 2614 461 l 2614 662 l 2513 662 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 167.53 30.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2815 461 m 2915 461 l 2915 662 l 2815 662 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 187.67 30.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3016 461 m 3218 461 l 3218 662 l 3016 662 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 201.07 30.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1306 863 m 1609 863 l 1609 1064 l 1306 1064 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 87.07 57.53] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1709 863 m 1810 863 l 1810 1064 l 1709 1064 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 113.93 57.53] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2011 863 m 2111 863 l 2111 1064 l 2011 1064 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 134.07 57.53] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2212 863 m 2312 863 l 2312 1064 l 2212 1064 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 147.47 57.53] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2815 863 m 2915 863 l 2915 1064 l 2815 1064 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 187.67 57.53] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3016 863 m 3218 863 l 3218 1064 l 3016 1064 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 201.07 57.53] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3317 863 m 3419 863 l 3419 1064 l 3317 1064 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 221.13 57.53] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1910 1265 m 2011 1265 l 2011 1265 l 1910 1265 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 127.33 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2513 2472 m 3518 2472 l 3518 2673 l 2513 2673 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 167.53 164.80] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1507 1265 m 1609 1265 l 1609 1466 l 1507 1466 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 100.47 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1709 1265 m 1810 1265 l 1810 1466 l 1709 1466 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 113.93 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1306 1265 m 1408 1265 l 1408 1466 l 1306 1466 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 87.07 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2011 1265 m 2111 1265 l 2111 1466 l 2011 1466 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 134.07 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1609 1265 m 1709 1265 l 1709 1466 l 1609 1466 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 107.27 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1810 1265 m 2011 1265 l 2011 1466 l 1810 1466 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 120.67 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1507 1668 m 1609 1668 l 1609 1869 l 1507 1869 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 100.47 111.20] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1709 1668 m 1810 1668 l 1810 1869 l 1709 1869 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 113.93 111.20] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1609 1668 m 1709 1668 l 1709 1869 l 1609 1869 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 107.27 111.20] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1810 1668 m 2011 1668 l 2011 1869 l 1810 1869 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 120.67 111.20] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3218 1668 m 3518 1668 l 3518 1869 l 3218 1869 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 214.53 111.20] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2513 1668 m 2714 1668 l 2714 1869 l 2513 1869 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 167.53 111.20] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3317 1265 m 3518 1265 l 3518 1466 l 3317 1466 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 221.13 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1306 2070 m 1408 2070 l 1408 2271 l 1306 2271 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 87.07 138.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1609 2070 m 1709 2070 l 1709 2271 l 1609 2271 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 107.27 138.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 1810 2271 m 2011 2271 l 2011 2070 l 1810 2070 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 120.67 138.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2111 2070 m 2312 2070 l 2312 2271 l 2111 2271 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P21 [16 0 0 -8 140.73 138.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2614 2070 m 2815 2070 l 2815 2271 l 2614 2271 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 174.27 138.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 2915 2070 m 3016 2070 l 3016 2271 l 2915 2271 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 194.33 138.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3218 2070 m 3317 2070 l 3317 2271 l 3218 2271 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 214.53 138.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3720 2472 m 4725 2472 l 4725 2673 l 3720 2673 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 248.00 164.80] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3720 2070 m 4122 2070 l 4122 2271 l 3720 2271 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 248.00 138.00] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3720 1869 m 4122 1869 l 4122 1668 l 3720 1668 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 248.00 111.20] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3720 1466 m 3921 1466 l 3921 1265 l 3720 1265 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 248.00 84.33] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3720 1064 m 4122 1064 l 4122 863 l 3720 863 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 248.00 57.53] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3720 662 m 4122 662 l 4122 461 l 3720 461 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 248.00 30.73] PATmp PATsp ef gr PATusp gs col-1 s gr 
+% Polyline
+n 3720 59 m 3820 59 l 3820 260 l 3720 260 l cp gs /PC [[1.00 1.00 1.00] [0.00 0.00 0.00]] def
+15.00 15.00 sc P1 [16 0 0 -8 248.00 3.93] PATmp PATsp ef gr PATusp gs col-1 s gr 
+/Times-Roman ff 60.00 scf sf
+1207 2170 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+1207 1768 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+1207 1366 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+1207 964 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+1207 562 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+1207 160 m
+gs 1 -1 sc (=) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+0 160 m
+gs 1 -1 sc (F0) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+0 562 m
+gs 1 -1 sc (F1) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+0 964 m
+gs 1 -1 sc (F2) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+0 1366 m
+gs 1 -1 sc (F4) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+0 1768 m
+gs 1 -1 sc (F5) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+0 2170 m
+gs 1 -1 sc (F6) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+0 2572 m
+gs 1 -1 sc (F7) col-1 sh gr
+/Times-Roman ff 60.00 scf sf
+1207 2572 m
+gs 1 -1 sc (=) col-1 sh gr
+/Courier ff 165.00 scf sf
+101 260 m
+gs 1 -1 sc (DISULPHIDE) col-1 sh gr
+/Courier ff 165.00 scf sf
+101 662 m
+gs 1 -1 sc (BISULPHIDE) col-1 sh gr
+/Courier ff 165.00 scf sf
+101 1064 m
+gs 1 -1 sc (DISELENIDE) col-1 sh gr
+/Courier ff 165.00 scf sf
+101 1466 m
+gs 1 -1 sc (DISULPHINE) col-1 sh gr
+/Courier ff 165.00 scf sf
+101 1869 m
+gs 1 -1 sc (ESSELENIAN) col-1 sh gr
+/Courier ff 165.00 scf sf
+101 2271 m
+gs 1 -1 sc (DISULPHONE) col-1 sh gr
+/Courier ff 165.00 scf sf
+101 2673 m
+gs 1 -1 sc (TROEZENIAN) col-1 sh gr
+/Courier ff 165.00 scf sf
+1408 260 m
+gs 1 -1 sc (ISULPHIDE) col-1 sh gr
+/Courier ff 165.00 scf sf
+2513 260 m
+gs 1 -1 sc (D) col-1 sh gr
+/Courier ff 165.00 scf sf
+1408 662 m
+gs 1 -1 sc (IS) col-1 sh gr
+/Courier ff 165.00 scf sf
+1709 662 m
+gs 1 -1 sc (L) col-1 sh gr
+/Courier ff 165.00 scf sf
+2011 662 m
+gs 1 -1 sc (IDE) col-1 sh gr
+/Courier ff 165.00 scf sf
+2513 662 m
+gs 1 -1 sc (B) col-1 sh gr
+/Courier ff 165.00 scf sf
+2815 662 m
+gs 1 -1 sc (U) col-1 sh gr
+/Courier ff 165.00 scf sf
+3016 662 m
+gs 1 -1 sc (PH) col-1 sh gr
+/Courier ff 165.00 scf sf
+2815 1064 m
+gs 1 -1 sc (E EN D) col-1 sh gr
+/Courier ff 165.00 scf sf
+1306 1064 m
+gs 1 -1 sc (DIS L  I E) col-1 sh gr
+/Courier ff 165.00 scf sf
+2513 2673 m
+gs 1 -1 sc (TROEZENIAN) col-1 sh gr
+/Courier ff 165.00 scf sf
+2513 1869 m
+gs 1 -1 sc (ES) col-1 sh gr
+/Courier ff 165.00 scf sf
+3218 1869 m
+gs 1 -1 sc (IAN) col-1 sh gr
+/Courier ff 165.00 scf sf
+1507 1869 m
+gs 1 -1 sc (SELEN) col-1 sh gr
+/Courier ff 165.00 scf sf
+1306 1466 m
+gs 1 -1 sc (DISULPHI) col-1 sh gr
+/Courier ff 165.00 scf sf
+3317 1466 m
+gs 1 -1 sc (NE) col-1 sh gr
+/Courier ff 165.00 scf sf
+1306 2271 m
+gs 1 -1 sc (D  U PH NE) col-1 sh gr
+/Courier ff 165.00 scf sf
+2513 2271 m
+gs 1 -1 sc ( IS U  O) col-1 sh gr
+/Courier ff 165.00 scf sf
+302 2874 m
+gs 1 -1 sc (Actual ) col-1 sh gr
+/Courier ff 165.00 scf sf
+302 3035 m
+gs 1 -1 sc (File) col-1 sh gr
+/Courier ff 165.00 scf sf
+1507 2874 m
+gs 1 -1 sc (Copy) col-1 sh gr
+/Courier ff 165.00 scf sf
+1507 3035 m
+gs 1 -1 sc (Segments) col-1 sh gr
+/Courier ff 165.00 scf sf
+2714 2849 m
+gs 1 -1 sc (Insert) col-1 sh gr
+/Courier ff 165.00 scf sf
+2714 3010 m
+gs 1 -1 sc (Segments) col-1 sh gr
+/Courier ff 165.00 scf sf
+3921 2874 m
+gs 1 -1 sc (Physical) col-1 sh gr
+% Polyline
+ [15 50.0] 50.0 sd
+n 101 59 m 1105 59 l 1105 260 l 101 260 l cp gs col-1 s gr  [] 0 sd
+$F2psEnd
+rs
+end
diff --git a/xdelta1/doc/old/dcc99/figs/xdarchive.fig b/xdelta1/doc/old/dcc99/figs/xdarchive.fig
new file mode 100755
index 0000000..238b675
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/xdarchive.fig
@@ -0,0 +1,198 @@
+#FIG 3.1
+Portrait
+Center
+Inches
+1200 2
+6 0 59 4725 3075
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         101 59 1105 59 1105 260 101 260 101 59
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         101 461 1105 461 1105 662 101 662 101 461
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         101 863 1105 863 1105 1064 101 1064 101 863
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         101 1265 1105 1265 1105 1466 101 1466 101 1265
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         101 1668 1105 1668 1105 1869 101 1869 101 1668
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         101 2472 1105 2472 1105 2673 101 2673 101 2472
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         101 1668 1105 1668 1105 1869 101 1869 101 1668
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         101 1265 1105 1265 1105 1466 101 1466 101 1265
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         101 863 1105 863 1105 1064 101 1064 101 863
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         101 461 1105 461 1105 662 101 662 101 461
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         101 59 1105 59 1105 260 101 260 101 59
+2 2 0 1 -1 7 0 0 20 0.000 0 0 -1 0 0 5
+         101 2472 1105 2472 1105 2673 101 2673 101 2472
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         101 2472 1105 2472 1105 2673 101 2673 101 2472
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         101 2070 1105 2070 1105 2271 101 2271 101 2070
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1306 59 2312 59 2312 260 1306 260 1306 59
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1306 461 2312 461 2312 662 1306 662 1306 461
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1306 863 2312 863 2312 1064 1306 1064 1306 863
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1306 1265 2312 1265 2312 1466 1306 1466 1306 1265
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1306 1668 2312 1668 2312 1869 1306 1869 1306 1668
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1306 2070 2312 2070 2312 2271 1306 2271 1306 2070
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         1306 2472 2312 2472 2312 2673 1306 2673 1306 2472
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2513 59 3518 59 3518 260 2513 260 2513 59
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2513 461 3518 461 3518 662 2513 662 2513 461
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2513 863 3518 863 3518 1064 2513 1064 2513 863
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2513 1265 3518 1265 3518 1466 2513 1466 2513 1265
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2513 1668 3518 1668 3518 1869 2513 1869 2513 1668
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2513 2070 3518 2070 3518 2271 2513 2271 2513 2070
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         2513 2472 3518 2472 3518 2673 2513 2673 2513 2472
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1408 59 2312 59 2312 260 1408 260 1408 59
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2513 59 2614 59 2614 260 2513 260 2513 59
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1408 461 1609 461 1609 662 1408 662 1408 461
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1709 461 1810 461 1810 662 1709 662 1709 461
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2011 461 2312 461 2312 662 2011 662 2011 461
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2513 461 2614 461 2614 662 2513 662 2513 461
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2815 461 2915 461 2915 662 2815 662 2815 461
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3016 461 3218 461 3218 662 3016 662 3016 461
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1306 863 1609 863 1609 1064 1306 1064 1306 863
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1709 863 1810 863 1810 1064 1709 1064 1709 863
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2011 863 2111 863 2111 1064 2011 1064 2011 863
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2212 863 2312 863 2312 1064 2212 1064 2212 863
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2815 863 2915 863 2915 1064 2815 1064 2815 863
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3016 863 3218 863 3218 1064 3016 1064 3016 863
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3317 863 3419 863 3419 1064 3317 1064 3317 863
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1910 1265 2011 1265 2011 1265 1910 1265 1910 1265
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2513 2472 3518 2472 3518 2673 2513 2673 2513 2472
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1507 1265 1609 1265 1609 1466 1507 1466 1507 1265
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1709 1265 1810 1265 1810 1466 1709 1466 1709 1265
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1306 1265 1408 1265 1408 1466 1306 1466 1306 1265
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2011 1265 2111 1265 2111 1466 2011 1466 2011 1265
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1609 1265 1709 1265 1709 1466 1609 1466 1609 1265
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1810 1265 2011 1265 2011 1466 1810 1466 1810 1265
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1507 1668 1609 1668 1609 1869 1507 1869 1507 1668
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         1709 1668 1810 1668 1810 1869 1709 1869 1709 1668
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1609 1668 1709 1668 1709 1869 1609 1869 1609 1668
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1810 1668 2011 1668 2011 1869 1810 1869 1810 1668
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3218 1668 3518 1668 3518 1869 3218 1869 3218 1668
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2513 1668 2714 1668 2714 1869 2513 1869 2513 1668
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3317 1265 3518 1265 3518 1466 3317 1466 3317 1265
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1306 2070 1408 2070 1408 2271 1306 2271 1306 2070
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1609 2070 1709 2070 1709 2271 1609 2271 1609 2070
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         1810 2271 2011 2271 2011 2070 1810 2070 1810 2271
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         2111 2070 2312 2070 2312 2271 2111 2271 2111 2070
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2614 2070 2815 2070 2815 2271 2614 2271 2614 2070
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         2915 2070 3016 2070 3016 2271 2915 2271 2915 2070
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3218 2070 3317 2070 3317 2271 3218 2271 3218 2070
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3720 2472 4725 2472 4725 2673 3720 2673 3720 2472
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3720 2070 4122 2070 4122 2271 3720 2271 3720 2070
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3720 1869 4122 1869 4122 1668 3720 1668 3720 1869
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3720 1466 3921 1466 3921 1265 3720 1265 3720 1466
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3720 1064 4122 1064 4122 863 3720 863 3720 1064
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3720 662 4122 662 4122 461 3720 461 3720 662
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         3720 59 3820 59 3820 260 3720 260 3720 59
+4 0 -1 0 0 0 4 0.0000 4 15 36 1207 2170 =\001
+4 0 -1 0 0 0 4 0.0000 4 15 36 1207 1768 =\001
+4 0 -1 0 0 0 4 0.0000 4 15 36 1207 1366 =\001
+4 0 -1 0 0 0 4 0.0000 4 15 36 1207 964 =\001
+4 0 -1 0 0 0 4 0.0000 4 15 36 1207 562 =\001
+4 0 -1 0 0 0 4 0.0000 4 15 36 1207 160 =\001
+4 0 -1 0 0 0 4 0.0000 4 46 65 0 160 F0\001
+4 0 -1 0 0 0 4 0.0000 4 46 65 0 562 F1\001
+4 0 -1 0 0 0 4 0.0000 4 46 65 0 964 F2\001
+4 0 -1 0 0 0 4 0.0000 4 46 65 0 1366 F4\001
+4 0 -1 0 0 0 4 0.0000 4 46 65 0 1768 F5\001
+4 0 -1 0 0 0 4 0.0000 4 46 65 0 2170 F6\001
+4 0 -1 0 0 0 4 0.0000 4 46 65 0 2572 F7\001
+4 0 -1 0 0 0 4 0.0000 4 15 36 1207 2572 =\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 101 260 DISULPHIDE\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 101 662 BISULPHIDE\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 101 1064 DISELENIDE\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 101 1466 DISULPHINE\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 101 1869 ESSELENIAN\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 101 2271 DISULPHONE\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 101 2673 TROEZENIAN\001
+4 0 -1 0 0 5 11 0.0000 0 95 905 1408 260 ISULPHIDE\001
+4 0 -1 0 0 5 11 0.0000 0 95 101 2513 260 D\001
+4 0 -1 0 0 5 11 0.0000 0 95 201 1408 662 IS\001
+4 0 -1 0 0 5 11 0.0000 0 95 101 1709 662 L\001
+4 0 -1 0 0 5 11 0.0000 0 95 302 2011 662 IDE\001
+4 0 -1 0 0 5 11 0.0000 0 95 101 2513 662 B\001
+4 0 -1 0 0 5 11 0.0000 0 95 101 2815 662 U\001
+4 0 -1 0 0 5 11 0.0000 0 95 201 3016 662 PH\001
+4 0 -1 0 0 5 11 0.0000 0 95 603 2815 1064 E EN D\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 1306 1064 DIS L  I E\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 2513 2673 TROEZENIAN\001
+4 0 -1 0 0 5 11 0.0000 0 95 201 2513 1869 ES\001
+4 0 -1 0 0 5 11 0.0000 0 95 302 3218 1869 IAN\001
+4 0 -1 0 0 5 11 0.0000 0 95 503 1507 1869 SELEN\001
+4 0 -1 0 0 5 11 0.0000 0 95 804 1306 1466 DISULPHI\001
+4 0 -1 0 0 5 11 0.0000 0 95 201 3317 1466 NE\001
+4 0 -1 0 0 5 11 0.0000 0 95 1005 1306 2271 D  U PH NE\001
+4 0 -1 0 0 5 11 0.0000 0 95 804 2513 2271  IS U  O\001
+4 0 -1 0 0 12 11 0.0000 4 101 704 302 2874 Actual \001
+4 0 -1 0 0 12 11 0.0000 4 101 402 302 3035 File\001
+4 0 -1 0 0 12 11 0.0000 4 125 402 1507 2874 Copy\001
+4 0 -1 0 0 12 11 0.0000 4 125 804 1507 3035 Segments\001
+4 0 -1 0 0 12 11 0.0000 4 95 603 2714 2849 Insert\001
+4 0 -1 0 0 12 11 0.0000 4 125 804 2714 3010 Segments\001
+4 0 -1 0 0 12 11 0.0000 4 131 804 3921 2874 Physical\001
+4 0 -1 0 0 12 11 0.0000 4 125 704 3921 3035 Storage\001
+-6
diff --git a/xdelta1/doc/old/dcc99/figs/xdarchive.fig.normalsize b/xdelta1/doc/old/dcc99/figs/xdarchive.fig.normalsize
new file mode 100755
index 0000000..2a97991
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/xdarchive.fig.normalsize
@@ -0,0 +1,196 @@
+#FIG 3.1
+Landscape
+Center
+Inches
+1200 2
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         600 600 3600 600 3600 1200 600 1200 600 600
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         600 1800 3600 1800 3600 2400 600 2400 600 1800
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         600 3000 3600 3000 3600 3600 600 3600 600 3000
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         600 4200 3600 4200 3600 4800 600 4800 600 4200
+2 2 2 1 -1 7 0 0 -1 3.000 0 0 -1 0 0 5
+         600 5400 3600 5400 3600 6000 600 6000 600 5400
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         600 7800 3600 7800 3600 8400 600 8400 600 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         600 5400 3600 5400 3600 6000 600 6000 600 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         600 4200 3600 4200 3600 4800 600 4800 600 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         600 3000 3600 3000 3600 3600 600 3600 600 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         600 1800 3600 1800 3600 2400 600 2400 600 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         600 600 3600 600 3600 1200 600 1200 600 600
+2 2 0 1 -1 7 0 0 20 0.000 0 0 -1 0 0 5
+         600 7800 3600 7800 3600 8400 600 8400 600 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         600 7800 3600 7800 3600 8400 600 8400 600 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         600 6600 3600 6600 3600 7200 600 7200 600 6600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         4200 600 7200 600 7200 1200 4200 1200 4200 600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         4200 1800 7200 1800 7200 2400 4200 2400 4200 1800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         4200 3000 7200 3000 7200 3600 4200 3600 4200 3000
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         4200 4200 7200 4200 7200 4800 4200 4800 4200 4200
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         4200 5400 7200 5400 7200 6000 4200 6000 4200 5400
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         4200 6600 7200 6600 7200 7200 4200 7200 4200 6600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         4200 7800 7200 7800 7200 8400 4200 8400 4200 7800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         7800 600 10800 600 10800 1200 7800 1200 7800 600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         7800 1800 10800 1800 10800 2400 7800 2400 7800 1800
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         7800 3000 10800 3000 10800 3600 7800 3600 7800 3000
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         7800 4200 10800 4200 10800 4800 7800 4800 7800 4200
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         7800 5400 10800 5400 10800 6000 7800 6000 7800 5400
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         7800 6600 10800 6600 10800 7200 7800 7200 7800 6600
+2 2 0 1 -1 7 0 0 -1 0.000 0 0 -1 0 0 5
+         7800 7800 10800 7800 10800 8400 7800 8400 7800 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4500 600 7200 600 7200 1200 4500 1200 4500 600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7800 600 8100 600 8100 1200 7800 1200 7800 600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4500 1800 5100 1800 5100 2400 4500 2400 4500 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5400 1800 5700 1800 5700 2400 5400 2400 5400 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 1800 7200 1800 7200 2400 6300 2400 6300 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7800 1800 8100 1800 8100 2400 7800 2400 7800 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 1800 9000 1800 9000 2400 8700 2400 8700 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9300 1800 9900 1800 9900 2400 9300 2400 9300 1800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4200 3000 5100 3000 5100 3600 4200 3600 4200 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5400 3000 5700 3000 5700 3600 5400 3600 5400 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 3000 6600 3000 6600 3600 6300 3600 6300 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6900 3000 7200 3000 7200 3600 6900 3600 6900 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8700 3000 9000 3000 9000 3600 8700 3600 8700 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9300 3000 9900 3000 9900 3600 9300 3600 9300 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10200 3000 10500 3000 10500 3600 10200 3600 10200 3000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6000 4200 6300 4200 6300 4200 6000 4200 6000 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7800 7800 10800 7800 10800 8400 7800 8400 7800 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4800 4200 5100 4200 5100 4800 4800 4800 4800 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5400 4200 5700 4200 5700 4800 5400 4800 5400 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         4200 4200 4500 4200 4500 4800 4200 4800 4200 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         6300 4200 6600 4200 6600 4800 6300 4800 6300 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5100 4200 5400 4200 5400 4800 5100 4800 5100 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5700 4200 6300 4200 6300 4800 5700 4800 5700 4200
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         4800 5400 5100 5400 5100 6000 4800 6000 4800 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         5400 5400 5700 5400 5700 6000 5400 6000 5400 5400
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5100 5400 5400 5400 5400 6000 5100 6000 5100 5400
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5700 5400 6300 5400 6300 6000 5700 6000 5700 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9900 5400 10800 5400 10800 6000 9900 6000 9900 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         7800 5400 8400 5400 8400 6000 7800 6000 7800 5400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         10200 4200 10800 4200 10800 4800 10200 4800 10200 4200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         4200 6600 4500 6600 4500 7200 4200 7200 4200 6600
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5100 6600 5400 6600 5400 7200 5100 7200 5100 6600
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         5700 7200 6300 7200 6300 6600 5700 6600 5700 7200
+2 2 0 1 -1 7 0 0 61 0.000 0 0 -1 0 0 5
+         6600 6600 7200 6600 7200 7200 6600 7200 6600 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         8100 6600 8700 6600 8700 7200 8100 7200 8100 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9000 6600 9300 6600 9300 7200 9000 7200 9000 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         9900 6600 10200 6600 10200 7200 9900 7200 9900 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11400 7800 14400 7800 14400 8400 11400 8400 11400 7800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11400 6600 12600 6600 12600 7200 11400 7200 11400 6600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11400 6000 12600 6000 12600 5400 11400 5400 11400 6000
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11400 4800 12000 4800 12000 4200 11400 4200 11400 4800
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11400 3600 12600 3600 12600 3000 11400 3000 11400 3600
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11400 2400 12600 2400 12600 1800 11400 1800 11400 2400
+2 2 0 1 -1 7 0 0 41 0.000 0 0 -1 0 0 5
+         11400 600 11700 600 11700 1200 11400 1200 11400 600
+4 0 -1 0 0 0 12 0.0000 4 45 105 3900 6900 =\001
+4 0 -1 0 0 0 12 0.0000 4 45 105 3900 5700 =\001
+4 0 -1 0 0 0 12 0.0000 4 45 105 3900 4500 =\001
+4 0 -1 0 0 0 12 0.0000 4 45 105 3900 3300 =\001
+4 0 -1 0 0 0 12 0.0000 4 45 105 3900 2100 =\001
+4 0 -1 0 0 0 12 0.0000 4 45 105 3900 900 =\001
+4 0 -1 0 0 0 12 0.0000 4 135 195 300 900 F0\001
+4 0 -1 0 0 0 12 0.0000 4 135 195 300 2100 F1\001
+4 0 -1 0 0 0 12 0.0000 4 135 195 300 3300 F2\001
+4 0 -1 0 0 0 12 0.0000 4 135 195 300 4500 F4\001
+4 0 -1 0 0 0 12 0.0000 4 135 195 300 5700 F5\001
+4 0 -1 0 0 0 12 0.0000 4 135 195 300 6900 F6\001
+4 0 -1 0 0 0 12 0.0000 4 135 195 300 8100 F7\001
+4 0 -1 0 0 0 12 0.0000 4 45 105 3900 8100 =\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 600 1200 DISULPHIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 600 2400 BISULPHIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 600 3600 DISELENIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 600 4800 DISULPHINE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 600 6000 ESSELENIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 600 7200 DISULPHONE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 600 8400 TROEZENIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 2700 4500 1200 ISULPHIDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 7800 1200 D\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 4500 2400 IS\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 5400 2400 L\001
+4 0 -1 0 0 5 34 0.0000 0 285 900 6300 2400 IDE\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 7800 2400 B\001
+4 0 -1 0 0 5 34 0.0000 0 285 300 8700 2400 U\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 9300 2400 PH\001
+4 0 -1 0 0 5 34 0.0000 0 285 1800 8700 3600 E EN D\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 4200 3600 DIS L  I E\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 7800 8400 TROEZENIAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 7800 6000 ES\001
+4 0 -1 0 0 5 34 0.0000 0 285 900 9900 6000 IAN\001
+4 0 -1 0 0 5 34 0.0000 0 285 1500 4800 6000 SELEN\001
+4 0 -1 0 0 5 34 0.0000 0 285 2400 4200 4800 DISULPHI\001
+4 0 -1 0 0 5 34 0.0000 0 285 600 10200 4800 NE\001
+4 0 -1 0 0 5 34 0.0000 0 285 3000 4200 7200 D  U PH NE\001
+4 0 -1 0 0 5 34 0.0000 0 285 2400 7800 7200  IS U  O\001
+4 0 -1 0 0 12 34 0.0000 4 300 2100 1200 9000 Actual \001
+4 0 -1 0 0 12 34 0.0000 4 300 1200 1200 9480 File\001
+4 0 -1 0 0 12 34 0.0000 4 375 1200 4800 9000 Copy\001
+4 0 -1 0 0 12 34 0.0000 4 375 2400 4800 9480 Segments\001
+4 0 -1 0 0 12 34 0.0000 4 285 1800 8400 8925 Insert\001
+4 0 -1 0 0 12 34 0.0000 4 375 2400 8400 9405 Segments\001
+4 0 -1 0 0 12 34 0.0000 4 390 2400 12000 9000 Physical\001
+4 0 -1 0 0 12 34 0.0000 4 375 2100 12000 9480 Storage\001
diff --git a/xdelta1/doc/old/dcc99/figs/xdelta.eps b/xdelta1/doc/old/dcc99/figs/xdelta.eps
new file mode 100755
index 0000000..7950f15
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/xdelta.eps
@@ -0,0 +1,200 @@
+%!PS-Adobe-2.0 EPSF-2.0
+%%Title: xdelta.fig
+%%Creator: fig2dev Version 3.1 Patchlevel 2
+%%CreationDate: Mon May  4 03:46:54 1998
+%%For: jmacd@icw.EECS.Berkeley.EDU (Josh MacDonald,,,,ARN)
+%Magnification: 1.00
+%%Orientation: Portrait
+%%BoundingBox: 0 0 302 29
+%%Pages: 0
+%%BeginSetup
+%%IncludeFeature: *PageSize Letter
+%%EndSetup
+%%EndComments
+/$F2psDict 200 dict def
+$F2psDict begin
+$F2psDict /mtrx matrix put
+/col-1 {0 setgray} bind def
+/col0 {0.000 0.000 0.000 srgb} bind def
+/col1 {0.000 0.000 1.000 srgb} bind def
+/col2 {0.000 1.000 0.000 srgb} bind def
+/col3 {0.000 1.000 1.000 srgb} bind def
+/col4 {1.000 0.000 0.000 srgb} bind def
+/col5 {1.000 0.000 1.000 srgb} bind def
+/col6 {1.000 1.000 0.000 srgb} bind def
+/col7 {1.000 1.000 1.000 srgb} bind def
+/col8 {0.000 0.000 0.560 srgb} bind def
+/col9 {0.000 0.000 0.690 srgb} bind def
+/col10 {0.000 0.000 0.820 srgb} bind def
+/col11 {0.530 0.810 1.000 srgb} bind def
+/col12 {0.000 0.560 0.000 srgb} bind def
+/col13 {0.000 0.690 0.000 srgb} bind def
+/col14 {0.000 0.820 0.000 srgb} bind def
+/col15 {0.000 0.560 0.560 srgb} bind def
+/col16 {0.000 0.690 0.690 srgb} bind def
+/col17 {0.000 0.820 0.820 srgb} bind def
+/col18 {0.560 0.000 0.000 srgb} bind def
+/col19 {0.690 0.000 0.000 srgb} bind def
+/col20 {0.820 0.000 0.000 srgb} bind def
+/col21 {0.560 0.000 0.560 srgb} bind def
+/col22 {0.690 0.000 0.690 srgb} bind def
+/col23 {0.820 0.000 0.820 srgb} bind def
+/col24 {0.500 0.190 0.000 srgb} bind def
+/col25 {0.630 0.250 0.000 srgb} bind def
+/col26 {0.750 0.380 0.000 srgb} bind def
+/col27 {1.000 0.500 0.500 srgb} bind def
+/col28 {1.000 0.630 0.630 srgb} bind def
+/col29 {1.000 0.750 0.750 srgb} bind def
+/col30 {1.000 0.880 0.880 srgb} bind def
+/col31 {1.000 0.840 0.000 srgb} bind def
+
+end
+save
+-8.0 39.0 translate
+1 -1 scale
+
+/cp {closepath} bind def
+/ef {eofill} bind def
+/gr {grestore} bind def
+/gs {gsave} bind def
+/sa {save} bind def
+/rs {restore} bind def
+/l {lineto} bind def
+/m {moveto} bind def
+/rm {rmoveto} bind def
+/n {newpath} bind def
+/s {stroke} bind def
+/sh {show} bind def
+/slc {setlinecap} bind def
+/slj {setlinejoin} bind def
+/slw {setlinewidth} bind def
+/srgb {setrgbcolor} bind def
+/rot {rotate} bind def
+/sc {scale} bind def
+/sd {setdash} bind def
+/ff {findfont} bind def
+/sf {setfont} bind def
+/scf {scalefont} bind def
+/sw {stringwidth} bind def
+/tr {translate} bind def
+/tnt {dup dup currentrgbcolor
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add
+  4 -2 roll dup 1 exch sub 3 -1 roll mul add srgb}
+  bind def
+/shd {dup dup currentrgbcolor 4 -2 roll mul 4 -2 roll mul
+  4 -2 roll mul srgb} bind def
+ /DrawEllipse {
+        /endangle exch def
+        /startangle exch def
+        /yrad exch def
+        /xrad exch def
+        /y exch def
+        /x exch def
+        /savematrix mtrx currentmatrix def
+        x y tr xrad yrad sc 0 0 1 startangle endangle arc
+        closepath
+        savematrix setmatrix
+        } def
+
+/$F2psBegin {$F2psDict begin /$F2psEnteredState save def} def
+/$F2psEnd {$F2psEnteredState restore end} def
+%%EndProlog
+
+$F2psBegin
+10 setmiterlimit
+n 0 792 m 0 0 l 612 0 l 612 792 l cp clip
+ 0.06000 0.06000 sc
+7.500 slw
+% Rotated Ellipse
+gs
+265 433 tr
+-90.000 rot
+n 0 0 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+gr
+
+% Rotated Ellipse
+gs
+1432 435 tr
+-90.000 rot
+n 0 0 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+gr
+
+% Rotated Ellipse
+gs
+2632 435 tr
+-90.000 rot
+n 0 0 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+gr
+
+% Rotated Ellipse
+gs
+3832 427 tr
+-90.000 rot
+n 0 0 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+gr
+
+% Rotated Ellipse
+gs
+5039 428 tr
+-90.000 rot
+n 0 0 54 54 0 360 DrawEllipse gs col7 0.00 shd ef gr gs col-1 s gr
+gr
+
+% Polyline
+gs  clippath
+4825 390 m 4945 420 l 4825 450 l 4987 450 l 4987 390 l  cp clip
+n 4972 420 m 3847 420 l gs col7 0.00 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 4825 390 m 4945 420 l 4825 450 l 4825 420 l 4825 390 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+3625 390 m 3745 420 l 3625 450 l 3787 450 l 3787 390 l  cp clip
+n 3772 420 m 2647 420 l gs col7 0.00 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 3625 390 m 3745 420 l 3625 450 l 3625 420 l 3625 390 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+2425 390 m 2545 420 l 2425 450 l 2587 450 l 2587 390 l  cp clip
+n 2572 420 m 1447 420 l gs col7 0.00 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 2425 390 m 2545 420 l 2425 450 l 2425 420 l 2425 390 l  cp gs 0.00 setgray ef gr  col-1 s
+% Polyline
+gs  clippath
+1225 390 m 1345 420 l 1225 450 l 1387 450 l 1387 390 l  cp clip
+n 1372 420 m 247 420 l gs col7 0.00 shd ef gr gs col-1 s gr gr
+
+% arrowhead
+n 1225 390 m 1345 420 l 1225 450 l 1225 420 l 1225 390 l  cp gs 0.00 setgray ef gr  col-1 s
+/Times-Roman ff 180.00 scf sf
+1957 615 m
+gs 1 -1 sc (d3) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+750 607 m
+gs 1 -1 sc (d4) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+3157 607 m
+gs 1 -1 sc (d2) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+4349 608 m
+gs 1 -1 sc (d1) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+2527 277 m
+gs 1 -1 sc (1.2) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+1200 286 m
+gs 1 -1 sc (1.1.1.2) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+135 285 m
+gs 1 -1 sc (1.3) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+3599 285 m
+gs 1 -1 sc (1.1.1.1) col-1 sh gr
+/Times-Roman ff 180.00 scf sf
+4934 293 m
+gs 1 -1 sc (1.1) col-1 sh gr
+$F2psEnd
+rs
diff --git a/xdelta1/doc/old/dcc99/figs/xdelta.fig b/xdelta1/doc/old/dcc99/figs/xdelta.fig
new file mode 100755
index 0000000..7562273
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/figs/xdelta.fig
@@ -0,0 +1,33 @@
+#FIG 3.1
+Landscape
+Center
+Inches
+1200 2
+6 135 142 5159 615
+1 4 0 1 -1 7 0 0 0 0.000 1 1.5708 265 433 54 54 228 470 303 395
+1 4 0 1 -1 7 0 0 0 0.000 1 1.5708 1432 435 54 54 1395 472 1470 397
+1 4 0 1 -1 7 0 0 0 0.000 1 1.5708 2632 435 54 54 2595 472 2670 397
+1 4 0 1 -1 7 0 0 0 0.000 1 1.5708 3832 427 54 54 3795 464 3870 389
+1 4 0 1 -1 7 0 0 0 0.000 1 1.5708 5039 428 54 54 5002 465 5077 390
+2 1 0 1 -1 7 0 0 0 0.000 0 0 -1 0 1 2
+        1 1 1.00 60.00 120.00
+         4972 420 3847 420
+2 1 0 1 -1 7 0 0 0 0.000 0 0 -1 0 1 2
+        1 1 1.00 60.00 120.00
+         3772 420 2647 420
+2 1 0 1 -1 7 0 0 0 0.000 0 0 -1 0 1 2
+        1 1 1.00 60.00 120.00
+         2572 420 1447 420
+2 1 0 1 -1 7 0 0 0 0.000 0 0 -1 0 1 2
+        1 1 1.00 60.00 120.00
+         1372 420 247 420
+4 0 -1 0 0 0 12 0.0000 4 135 180 1957 615 d3\001
+4 0 -1 0 0 0 12 0.0000 4 135 180 750 607 d4\001
+4 0 -1 0 0 0 12 0.0000 4 135 180 3157 607 d2\001
+4 0 -1 0 0 0 12 0.0000 4 135 180 4349 608 d1\001
+4 0 -1 0 0 0 12 0.0000 4 135 225 2527 277 1.2\001
+4 0 -1 0 0 0 12 0.0000 4 135 495 1200 286 1.1.1.2\001
+4 0 -1 0 0 0 12 0.0000 4 135 225 135 285 1.3\001
+4 0 -1 0 0 0 12 0.0000 4 135 495 3599 285 1.1.1.1\001
+4 0 -1 0 0 0 12 0.0000 4 135 225 4934 293 1.1\001
+-6
diff --git a/xdelta1/doc/old/dcc99/lcs.c b/xdelta1/doc/old/dcc99/lcs.c
new file mode 100755
index 0000000..438a78f
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/lcs.c
@@ -0,0 +1,159 @@
+/* * Last edited: Jun  9 11:06 1997 (jjh) */
+/* computes the length of the longest common subsequence of two files, 
+   byte by byte. Outputs the length of the two files, the length
+   of the LCS, and the fragmentation of both files.
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <malloc.h>
+
+#define EXIT_FAILURE 1
+#define EXIT_SUCCESS 0
+
+main(int argc, char *argv[])
+{
+  FILE *file1, *file2;
+  struct stat file1_stat, file2_stat;
+  off_t j, file1_size, file2_size;
+  off_t file1_fragmentation, file2_fragmentation;
+  int fileswitched; /* indicates whether the order of files was changed.*/
+
+  unsigned char *file1_data;
+  off_t *LCS;
+  off_t oldbest;
+  register off_t newbest;
+  register int ci;
+
+  if (argc != 3) 
+    {
+      fprintf(stderr, "%s file1 file2\n", argv[0]);
+      fprintf(stderr, "outputs on stdout the lengths of file1 and file2, \n");
+      fprintf(stderr, "followed by the length of the ");
+      fprintf(stderr, "longest common subsequence of file1 and file2,\n");
+      fprintf(stderr, "followed by the fragmentation (number of segments)\n");
+      fprintf(stderr,
+              "induced by the longest common subsequence on both files.\n");
+      exit(EXIT_FAILURE);
+    }
+  else if ((file1 = fopen(argv[1],"r")) == NULL) 
+    {
+      fprintf(stderr, "Can't open %s\n", argv[1]);
+      exit(EXIT_FAILURE);
+    }
+  else if ((file2 = fopen(argv[2],"r")) == NULL) 
+    {
+      fprintf(stderr,"Can't open %s\n",argv[2]);
+      exit(EXIT_FAILURE);
+    }
+
+  fstat(fileno(file1),&file1_stat);
+  fstat(fileno(file2),&file2_stat);
+  file1_size=file1_stat.st_size;
+  file2_size=file2_stat.st_size;
+
+  if (file1_stat.st_size > file2_stat.st_size) 
+    {
+      /* swap file to save space--size of file1 determines the space */
+      FILE *filetmp;
+      off_t filetmp_size;
+      filetmp = file1; file1 = file2; file2 = filetmp;
+      filetmp_size = file1_size; file1_size = file2_size; 
+      file2_size = filetmp_size;
+      fileswitched = 1;
+    } 
+  else
+    {
+      fileswitched = 0;
+    }
+
+  if ((NULL == (LCS = (off_t *)malloc((unsigned)((file1_size + 1) *
+                                                 sizeof(off_t))))))
+    {
+      fprintf(stderr,"Can't allocate enough space (%d bytes needed)\n",
+              (file1_size + 1)*sizeof(off_t));
+      exit(EXIT_FAILURE);
+    }
+  else if (NULL == (file1_data=(unsigned char *)malloc((unsigned)file1_size)))
+    {
+      fprintf(stderr,"Can't allocate enough space to load file.\n");
+      exit(EXIT_FAILURE);
+    }
+  else if (fread(file1_data, 1, file1_size, file1) != file1_size) 
+    {
+      fprintf(stderr, "File reading failed\n");
+      exit(EXIT_FAILURE);
+    }
+
+  /* here starts the LCS algorithm */
+    
+
+  /* Initialize the array for computing the length */
+  for (j = 0; j <= file1_size; j++) LCS[j] = 0;
+  file1_fragmentation = file2_fragmentation = 1;
+  oldbest = 1;  /* sentinel to control counting of fragmentation */
+
+# ifdef DEBUG
+  printf("     ");
+  for (j = 0; j <= file1_size; j++)  printf("%3c", file1_data[j]);
+  printf("  segments\n  ");
+  for (j = 0; j <= file1_size; j++) printf("%3d", LCS[j]);
+  putchar('\n');
+# endif    
+    
+  while ((ci = getc(file2)) != EOF) 
+    {
+      register off_t *jptr;
+      register unsigned char *current, *stop;
+
+      newbest = 0;
+      jptr = LCS;
+#     ifdef DEBUG
+      printf("%c %3d",ci,newbest);
+#     endif
+      for (current = file1_data, stop = file1_data + file1_size;
+           current < stop;
+           current++)
+        {
+          register off_t extendlength;
+          extendlength = *jptr + (ci ==  *current);
+          *jptr = newbest; /* write best value from last iter. */
+          if (newbest < extendlength) newbest = extendlength;
+          jptr++;
+          if (newbest < *jptr) newbest = *jptr;
+#         ifdef DEBUG
+          printf("%3d", newbest);
+#         endif
+        }
+            
+      /* update fragmentation of file2 */
+      if (((*jptr == newbest) && (oldbest<*jptr)) ||
+          ((*jptr < newbest) && (oldbest == *jptr)))
+        file2_fragmentation++;
+
+      oldbest = *jptr;
+      *jptr = newbest;
+#     ifdef DEBUG
+      printf("   %3d\n", file2_fragmentation);
+#     endif
+    }
+
+  /* determine fragmentation of file1*/
+  for (j = 1;j<file1_size;j++)
+    {
+      if (((LCS[j] == LCS[j + 1]) && (LCS[j - 1] != LCS[j])) ||
+          ((LCS[j] != LCS[j + 1]) && (LCS[j - 1] == LCS[j])))
+        file1_fragmentation++;
+    }
+
+  if (!fileswitched) 
+    printf("%d %d %d %d %d\n", file1_size, file2_size,
+           newbest, file1_fragmentation, file2_fragmentation); 
+  else
+    printf("%d %d %d %d %d\n", file2_size, file1_size,
+           newbest, file2_fragmentation, file1_fragmentation); 
+
+  exit(EXIT_SUCCESS);
+}
diff --git a/xdelta1/doc/old/dcc99/llncs.cls b/xdelta1/doc/old/dcc99/llncs.cls
new file mode 100755
index 0000000..9a8d63b
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/llncs.cls
@@ -0,0 +1,1004 @@
+% LLNCS DOCUMENT CLASS -- version 2.3
+% for LaTeX2e
+%
+\NeedsTeXFormat{LaTeX2e}[1995/12/01]
+\ProvidesClass{llncs}[1998/03/25 v2.3
+^^JLaTeX document class for Lecture Notes in Computer Science]
+% Options
+\let\if@envcntreset\iffalse
+\DeclareOption{envcountreset}{\let\if@envcntreset\iftrue}
+\DeclareOption{citeauthoryear}{\let\citeauthoryear=Y}
+\DeclareOption{oribibl}{\let\oribibl=Y}
+\let\if@envcntsame\iffalse
+\DeclareOption{envcountsame}{\let\if@envcntsame\iftrue}
+\let\if@envcntsect\iffalse
+\DeclareOption{envcountsect}{\let\if@envcntsect\iftrue}
+\let\if@runhead\iffalse
+\DeclareOption{runningheads}{\let\if@runhead\iftrue}
+
+\let\if@openbib\iffalse
+\DeclareOption{openbib}{\let\if@openbib\iftrue}
+
+\DeclareOption*{\PassOptionsToClass{\CurrentOption}{article}}
+
+\ProcessOptions
+
+\LoadClass[twoside]{article}
+\RequirePackage{multicol} % needed for the list of participants, index
+
+\setlength{\textwidth}{12.2cm}
+\setlength{\textheight}{19.3cm}
+
+\renewcommand\small{%
+   \@setfontsize\small\@ixpt{11}%
+   \abovedisplayskip 8.5\p@ \@plus3\p@ \@minus4\p@
+   \abovedisplayshortskip \z@ \@plus2\p@
+   \belowdisplayshortskip 4\p@ \@plus2\p@ \@minus2\p@
+   \def\@listi{\leftmargin\leftmargini
+               \parsep 0\p@ \@plus1\p@ \@minus\p@
+               \topsep 8\p@ \@plus2\p@ \@minus4\p@
+               \itemsep0\p@}%
+   \belowdisplayskip \abovedisplayskip
+}
+
+\frenchspacing
+\widowpenalty=10000
+\clubpenalty=10000
+
+\setlength\oddsidemargin   {63\p@}
+\setlength\evensidemargin  {63\p@}
+\setlength\marginparwidth  {90\p@}
+
+\setlength\headsep   {16\p@}
+
+\setlength\footnotesep{7.7\p@}
+\setlength\textfloatsep{8mm\@plus 2\p@ \@minus 4\p@}
+\setlength\intextsep   {8mm\@plus 2\p@ \@minus 2\p@}
+
+
+%% JOSH SAYS
+\setlength{\oddsidemargin}{0in}
+\setlength{\evensidemargin}{0in}
+\setlength{\headsep}{0pt}
+\setlength{\topmargin}{0in}
+\setlength{\textheight}{8.75in}
+\setlength{\textwidth}{6.5in}
+\setlength{\parindent}{1em}
+\setlength{\parskip}{0.5ex}
+%% END JOSH SAYS
+
+\setcounter{secnumdepth}{2}
+
+\newcounter {chapter}
+\renewcommand\thechapter      {\@arabic\c@chapter}
+
+\newif\if@mainmatter \@mainmattertrue
+\newcommand\frontmatter{\cleardoublepage
+            \@mainmatterfalse\pagenumbering{Roman}}
+\newcommand\mainmatter{\cleardoublepage
+       \@mainmattertrue\pagenumbering{arabic}}
+\newcommand\backmatter{\if@openright\cleardoublepage\else\clearpage\fi
+      \@mainmatterfalse}
+
+\renewcommand\part{\cleardoublepage
+                 \thispagestyle{empty}%
+                 \if@twocolumn
+                     \onecolumn
+                     \@tempswatrue
+                   \else
+                     \@tempswafalse
+                 \fi
+                 \null\vfil
+                 \secdef\@part\@spart}
+
+\def\@part[#1]#2{%
+    \ifnum \c@secnumdepth >-2\relax
+      \refstepcounter{part}%
+      \addcontentsline{toc}{part}{\thepart\hspace{1em}#1}%
+    \else
+      \addcontentsline{toc}{part}{#1}%
+    \fi
+    \markboth{}{}%
+    {\centering
+     \interlinepenalty \@M
+     \normalfont
+     \ifnum \c@secnumdepth >-2\relax
+       \huge\bfseries \partname~\thepart
+       \par
+       \vskip 20\p@
+     \fi
+     \Huge \bfseries #2\par}%
+    \@endpart}
+\def\@spart#1{%
+    {\centering
+     \interlinepenalty \@M
+     \normalfont
+     \Huge \bfseries #1\par}%
+    \@endpart}
+\def\@endpart{\vfil\newpage
+              \if@twoside
+                \null
+                \thispagestyle{empty}%
+                \newpage
+              \fi
+              \if@tempswa
+                \twocolumn
+              \fi}
+
+\newcommand\chapter{\clearpage
+                    \thispagestyle{empty}%
+                    \global\@topnum\z@
+                    \@afterindentfalse
+                    \secdef\@chapter\@schapter}
+\def\@chapter[#1]#2{\ifnum \c@secnumdepth >\m@ne
+                       \if@mainmatter
+                         \refstepcounter{chapter}%
+                         \typeout{\@chapapp\space\thechapter.}%
+                         \addcontentsline{toc}{chapter}%
+                                  {\protect\numberline{\thechapter}#1}%
+                       \else
+                         \addcontentsline{toc}{chapter}{#1}%
+                       \fi
+                    \else
+                      \addcontentsline{toc}{chapter}{#1}%
+                    \fi
+                    \chaptermark{#1}%
+                    \addtocontents{lof}{\protect\addvspace{10\p@}}%
+                    \addtocontents{lot}{\protect\addvspace{10\p@}}%
+                    \if@twocolumn
+                      \@topnewpage[\@makechapterhead{#2}]%
+                    \else
+                      \@makechapterhead{#2}%
+                      \@afterheading
+                    \fi}
+\def\@makechapterhead#1{%
+% \vspace*{50\p@}%
+  {\centering
+    \ifnum \c@secnumdepth >\m@ne
+      \if@mainmatter
+        \large\bfseries \@chapapp{} \thechapter
+        \par\nobreak
+        \vskip 20\p@
+      \fi
+    \fi
+    \interlinepenalty\@M
+    \Large \bfseries #1\par\nobreak
+    \vskip 40\p@
+  }}
+\def\@schapter#1{\if@twocolumn
+                   \@topnewpage[\@makeschapterhead{#1}]%
+                 \else
+                   \@makeschapterhead{#1}%
+                   \@afterheading
+                 \fi}
+\def\@makeschapterhead#1{%
+% \vspace*{50\p@}%
+  {\centering
+    \normalfont
+    \interlinepenalty\@M
+    \Large \bfseries  #1\par\nobreak
+    \vskip 40\p@
+  }}
+
+\renewcommand\section{\@startsection{section}{1}{\z@}%
+                       {-18\p@ \@plus -4\p@ \@minus -4\p@}%
+                       {12\p@ \@plus 4\p@ \@minus 4\p@}%
+                       {\normalfont\large\bfseries\boldmath
+                        \rightskip=\z@ \@plus 8em\pretolerance=10000 }}
+\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
+                       {-18\p@ \@plus -4\p@ \@minus -4\p@}%
+                       {8\p@ \@plus 4\p@ \@minus 4\p@}%
+                       {\normalfont\normalsize\bfseries\boldmath
+                        \rightskip=\z@ \@plus 8em\pretolerance=10000 }}
+\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
+                       {-18\p@ \@plus -4\p@ \@minus -4\p@}%
+                       {-0.5em \@plus -0.22em \@minus -0.1em}%
+                       {\normalfont\normalsize\bfseries\boldmath}}
+\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
+                       {-12\p@ \@plus -4\p@ \@minus -4\p@}%
+                       {-0.5em \@plus -0.22em \@minus -0.1em}%
+                       {\normalfont\normalsize\itshape}}
+\renewcommand\subparagraph[1]{\typeout{LLNCS warning: You should not use
+                  \string\subparagraph\space with this class}\vskip0.5cm
+You should not use \verb|\subparagraph| with this class.\vskip0.5cm}
+
+\DeclareMathSymbol{\Gamma}{\mathalpha}{letters}{"00}
+\DeclareMathSymbol{\Delta}{\mathalpha}{letters}{"01}
+\DeclareMathSymbol{\Theta}{\mathalpha}{letters}{"02}
+\DeclareMathSymbol{\Lambda}{\mathalpha}{letters}{"03}
+\DeclareMathSymbol{\Xi}{\mathalpha}{letters}{"04}
+\DeclareMathSymbol{\Pi}{\mathalpha}{letters}{"05}
+\DeclareMathSymbol{\Sigma}{\mathalpha}{letters}{"06}
+\DeclareMathSymbol{\Upsilon}{\mathalpha}{letters}{"07}
+\DeclareMathSymbol{\Phi}{\mathalpha}{letters}{"08}
+\DeclareMathSymbol{\Psi}{\mathalpha}{letters}{"09}
+\DeclareMathSymbol{\Omega}{\mathalpha}{letters}{"0A}
+
+\let\footnotesize\small
+
+\def\vec#1{\mathchoice{\mbox{\boldmath$\displaystyle#1$}}
+{\mbox{\boldmath$\textstyle#1$}}
+{\mbox{\boldmath$\scriptstyle#1$}}
+{\mbox{\boldmath$\scriptscriptstyle#1$}}}
+
+\def\squareforqed{\hbox{\rlap{$\sqcap$}$\sqcup$}}
+\def\qed{\ifmmode\squareforqed\else{\unskip\nobreak\hfil
+\penalty50\hskip1em\null\nobreak\hfil\squareforqed
+\parfillskip=0pt\finalhyphendemerits=0\endgraf}\fi}
+
+\def\getsto{\mathrel{\mathchoice {\vcenter{\offinterlineskip
+\halign{\hfil
+$\displaystyle##$\hfil\cr\gets\cr\to\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\textstyle##$\hfil\cr\gets
+\cr\to\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\scriptstyle##$\hfil\cr\gets
+\cr\to\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\scriptscriptstyle##$\hfil\cr
+\gets\cr\to\cr}}}}}
+\def\lid{\mathrel{\mathchoice {\vcenter{\offinterlineskip\halign{\hfil
+$\displaystyle##$\hfil\cr<\cr\noalign{\vskip1.2pt}=\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\textstyle##$\hfil\cr<\cr
+\noalign{\vskip1.2pt}=\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\scriptstyle##$\hfil\cr<\cr
+\noalign{\vskip1pt}=\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\scriptscriptstyle##$\hfil\cr
+<\cr
+\noalign{\vskip0.9pt}=\cr}}}}}
+\def\gid{\mathrel{\mathchoice {\vcenter{\offinterlineskip\halign{\hfil
+$\displaystyle##$\hfil\cr>\cr\noalign{\vskip1.2pt}=\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\textstyle##$\hfil\cr>\cr
+\noalign{\vskip1.2pt}=\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\scriptstyle##$\hfil\cr>\cr
+\noalign{\vskip1pt}=\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\scriptscriptstyle##$\hfil\cr
+>\cr
+\noalign{\vskip0.9pt}=\cr}}}}}
+\def\grole{\mathrel{\mathchoice {\vcenter{\offinterlineskip
+\halign{\hfil
+$\displaystyle##$\hfil\cr>\cr\noalign{\vskip-1pt}<\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\textstyle##$\hfil\cr
+>\cr\noalign{\vskip-1pt}<\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\scriptstyle##$\hfil\cr
+>\cr\noalign{\vskip-0.8pt}<\cr}}}
+{\vcenter{\offinterlineskip\halign{\hfil$\scriptscriptstyle##$\hfil\cr
+>\cr\noalign{\vskip-0.3pt}<\cr}}}}}
+\def\bbbr{{\rm I\!R}} %reelle Zahlen
+\def\bbbm{{\rm I\!M}}
+\def\bbbn{{\rm I\!N}} %natuerliche Zahlen
+\def\bbbf{{\rm I\!F}}
+\def\bbbh{{\rm I\!H}}
+\def\bbbk{{\rm I\!K}}
+\def\bbbp{{\rm I\!P}}
+\def\bbbone{{\mathchoice {\rm 1\mskip-4mu l} {\rm 1\mskip-4mu l}
+{\rm 1\mskip-4.5mu l} {\rm 1\mskip-5mu l}}}
+\def\bbbc{{\mathchoice {\setbox0=\hbox{$\displaystyle\rm C$}\hbox{\hbox
+to0pt{\kern0.4\wd0\vrule height0.9\ht0\hss}\box0}}
+{\setbox0=\hbox{$\textstyle\rm C$}\hbox{\hbox
+to0pt{\kern0.4\wd0\vrule height0.9\ht0\hss}\box0}}
+{\setbox0=\hbox{$\scriptstyle\rm C$}\hbox{\hbox
+to0pt{\kern0.4\wd0\vrule height0.9\ht0\hss}\box0}}
+{\setbox0=\hbox{$\scriptscriptstyle\rm C$}\hbox{\hbox
+to0pt{\kern0.4\wd0\vrule height0.9\ht0\hss}\box0}}}}
+\def\bbbq{{\mathchoice {\setbox0=\hbox{$\displaystyle\rm
+Q$}\hbox{\raise
+0.15\ht0\hbox to0pt{\kern0.4\wd0\vrule height0.8\ht0\hss}\box0}}
+{\setbox0=\hbox{$\textstyle\rm Q$}\hbox{\raise
+0.15\ht0\hbox to0pt{\kern0.4\wd0\vrule height0.8\ht0\hss}\box0}}
+{\setbox0=\hbox{$\scriptstyle\rm Q$}\hbox{\raise
+0.15\ht0\hbox to0pt{\kern0.4\wd0\vrule height0.7\ht0\hss}\box0}}
+{\setbox0=\hbox{$\scriptscriptstyle\rm Q$}\hbox{\raise
+0.15\ht0\hbox to0pt{\kern0.4\wd0\vrule height0.7\ht0\hss}\box0}}}}
+\def\bbbt{{\mathchoice {\setbox0=\hbox{$\displaystyle\rm
+T$}\hbox{\hbox to0pt{\kern0.3\wd0\vrule height0.9\ht0\hss}\box0}}
+{\setbox0=\hbox{$\textstyle\rm T$}\hbox{\hbox
+to0pt{\kern0.3\wd0\vrule height0.9\ht0\hss}\box0}}
+{\setbox0=\hbox{$\scriptstyle\rm T$}\hbox{\hbox
+to0pt{\kern0.3\wd0\vrule height0.9\ht0\hss}\box0}}
+{\setbox0=\hbox{$\scriptscriptstyle\rm T$}\hbox{\hbox
+to0pt{\kern0.3\wd0\vrule height0.9\ht0\hss}\box0}}}}
+\def\bbbs{{\mathchoice
+{\setbox0=\hbox{$\displaystyle     \rm S$}\hbox{\raise0.5\ht0\hbox
+to0pt{\kern0.35\wd0\vrule height0.45\ht0\hss}\hbox
+to0pt{\kern0.55\wd0\vrule height0.5\ht0\hss}\box0}}
+{\setbox0=\hbox{$\textstyle        \rm S$}\hbox{\raise0.5\ht0\hbox
+to0pt{\kern0.35\wd0\vrule height0.45\ht0\hss}\hbox
+to0pt{\kern0.55\wd0\vrule height0.5\ht0\hss}\box0}}
+{\setbox0=\hbox{$\scriptstyle      \rm S$}\hbox{\raise0.5\ht0\hbox
+to0pt{\kern0.35\wd0\vrule height0.45\ht0\hss}\raise0.05\ht0\hbox
+to0pt{\kern0.5\wd0\vrule height0.45\ht0\hss}\box0}}
+{\setbox0=\hbox{$\scriptscriptstyle\rm S$}\hbox{\raise0.5\ht0\hbox
+to0pt{\kern0.4\wd0\vrule height0.45\ht0\hss}\raise0.05\ht0\hbox
+to0pt{\kern0.55\wd0\vrule height0.45\ht0\hss}\box0}}}}
+\def\bbbz{{\mathchoice {\hbox{$\mathsf\textstyle Z\kern-0.4em Z$}}
+{\hbox{$\mathsf\textstyle Z\kern-0.4em Z$}}
+{\hbox{$\mathsf\scriptstyle Z\kern-0.3em Z$}}
+{\hbox{$\mathsf\scriptscriptstyle Z\kern-0.2em Z$}}}}
+
+\let\ts\,
+
+\setlength\leftmargini  {17\p@}
+\setlength\leftmargin    {\leftmargini}
+\setlength\leftmarginii  {\leftmargini}
+\setlength\leftmarginiii {\leftmargini}
+\setlength\leftmarginiv  {\leftmargini}
+\setlength  \labelsep  {.5em}
+\setlength  \labelwidth{\leftmargini}
+\addtolength\labelwidth{-\labelsep}
+
+\def\@listI{\leftmargin\leftmargini
+            \parsep 0\p@ \@plus1\p@ \@minus\p@
+            \topsep 8\p@ \@plus2\p@ \@minus4\p@
+            \itemsep0\p@}
+\let\@listi\@listI
+\@listi
+\def\@listii {\leftmargin\leftmarginii
+              \labelwidth\leftmarginii
+              \advance\labelwidth-\labelsep
+              \topsep    0\p@ \@plus2\p@ \@minus\p@}
+\def\@listiii{\leftmargin\leftmarginiii
+              \labelwidth\leftmarginiii
+              \advance\labelwidth-\labelsep
+              \topsep    0\p@ \@plus\p@\@minus\p@
+              \parsep    \z@
+              \partopsep \p@ \@plus\z@ \@minus\p@}
+
+\renewcommand\labelitemi{\normalfont\bfseries --}
+\renewcommand\labelitemii{$\m@th\bullet$}
+
+\setlength\arraycolsep{1.4\p@}
+\setlength\tabcolsep{1.4\p@}
+
+\def\tableofcontents{\chapter*{\contentsname\@mkboth{{\contentsname}}%
+                                                    {{\contentsname}}}
+ \def\authcount##1{\setcounter{auco}{##1}\setcounter{@auth}{1}}
+ \def\lastand{\ifnum\value{auco}=2\relax
+                 \unskip{} \andname\
+              \else
+                 \unskip \lastandname\
+              \fi}%
+ \def\and{\stepcounter{@auth}\relax
+          \ifnum\value{@auth}=\value{auco}%
+             \lastand
+          \else
+             \unskip,
+          \fi}%
+ \@starttoc{toc}\if@restonecol\twocolumn\fi}
+
+\def\l@part#1#2{\addpenalty{\@secpenalty}%
+   \addvspace{2em plus\p@}%  % space above part line
+   \begingroup
+     \parindent \z@
+     \rightskip \z@ plus 5em
+     \hrule\vskip5pt
+     \bfseries\boldmath   % set line in boldface
+     \leavevmode          % TeX command to enter horizontal mode.
+     #1\par
+     \vskip5pt
+     \hrule
+     \vskip1pt
+     \nobreak             % Never break after part entry
+   \endgroup}
+
+\def\@dotsep{2}
+
+\def\hyperhrefextend{\ifx\hyper@anchor\@undefined\else
+{chapter.\thechapter}\fi}
+
+\def\addnumcontentsmark#1#2#3{%
+\addtocontents{#1}{\protect\contentsline{#2}{\protect\numberline
+                     {\thechapter}#3}{\thepage}\hyperhrefextend}}
+\def\addcontentsmark#1#2#3{%
+\addtocontents{#1}{\protect\contentsline{#2}{#3}{\thepage}\hyperhrefextend}}
+\def\addcontentsmarkwop#1#2#3{%
+\addtocontents{#1}{\protect\contentsline{#2}{#3}{0}\hyperhrefextend}}
+
+\def\@adcmk[#1]{\ifcase #1 \or
+\def\@gtempa{\addnumcontentsmark}%
+  \or    \def\@gtempa{\addcontentsmark}%
+  \or    \def\@gtempa{\addcontentsmarkwop}%
+  \fi\@gtempa{toc}{chapter}}
+\def\addtocmark{\@ifnextchar[{\@adcmk}{\@adcmk[3]}}
+
+\def\l@chapter#1#2{\addpenalty{-\@highpenalty}
+ \vskip 1.0em plus 1pt \@tempdima 1.5em \begingroup
+ \parindent \z@ \rightskip \@pnumwidth
+ \parfillskip -\@pnumwidth
+ \leavevmode \advance\leftskip\@tempdima \hskip -\leftskip
+ {\large\bfseries\boldmath#1}\ifx0#2\hfil\null
+ \else
+      \nobreak
+      \leaders\hbox{$\m@th \mkern \@dotsep mu.\mkern
+      \@dotsep mu$}\hfill
+      \nobreak\hbox to\@pnumwidth{\hss #2}%
+ \fi\par
+ \penalty\@highpenalty \endgroup}
+
+\def\l@title#1#2{\addpenalty{-\@highpenalty}
+ \addvspace{8pt plus 1pt}
+ \@tempdima \z@
+ \begingroup
+ \parindent \z@ \rightskip \@tocrmarg
+ \parfillskip -\@tocrmarg
+ \leavevmode \advance\leftskip\@tempdima \hskip -\leftskip
+ #1\nobreak
+ \leaders\hbox{$\m@th \mkern \@dotsep mu.\mkern
+ \@dotsep mu$}\hfill
+ \nobreak\hbox to\@pnumwidth{\hss #2}\par
+ \penalty\@highpenalty \endgroup}
+
+\setcounter{tocdepth}{0}
+\newdimen\tocchpnum
+\newdimen\tocsecnum
+\newdimen\tocsectotal
+\newdimen\tocsubsecnum
+\newdimen\tocsubsectotal
+\newdimen\tocsubsubsecnum
+\newdimen\tocsubsubsectotal
+\newdimen\tocparanum
+\newdimen\tocparatotal
+\newdimen\tocsubparanum
+\tocchpnum=\z@            % no chapter numbers
+\tocsecnum=15\p@          % section 88. plus 2.222pt
+\tocsubsecnum=23\p@       % subsection 88.8 plus 2.222pt
+\tocsubsubsecnum=27\p@    % subsubsection 88.8.8 plus 1.444pt
+\tocparanum=35\p@         % paragraph 88.8.8.8 plus 1.666pt
+\tocsubparanum=43\p@      % subparagraph 88.8.8.8.8 plus 1.888pt
+\def\calctocindent{%
+\tocsectotal=\tocchpnum
+\advance\tocsectotal by\tocsecnum
+\tocsubsectotal=\tocsectotal
+\advance\tocsubsectotal by\tocsubsecnum
+\tocsubsubsectotal=\tocsubsectotal
+\advance\tocsubsubsectotal by\tocsubsubsecnum
+\tocparatotal=\tocsubsubsectotal
+\advance\tocparatotal by\tocparanum}
+\calctocindent
+
+\def\l@section{\@dottedtocline{1}{\tocchpnum}{\tocsecnum}}
+\def\l@subsection{\@dottedtocline{2}{\tocsectotal}{\tocsubsecnum}}
+\def\l@subsubsection{\@dottedtocline{3}{\tocsubsectotal}{\tocsubsubsecnum}}
+\def\l@paragraph{\@dottedtocline{4}{\tocsubsubsectotal}{\tocparanum}}
+\def\l@subparagraph{\@dottedtocline{5}{\tocparatotal}{\tocsubparanum}}
+
+\def\listoffigures{\@restonecolfalse\if@twocolumn\@restonecoltrue\onecolumn
+ \fi\section*{\listfigurename\@mkboth{{\listfigurename}}{{\listfigurename}}}
+ \@starttoc{lof}\if@restonecol\twocolumn\fi}
+\def\l@figure{\@dottedtocline{1}{0em}{1.5em}}
+
+\def\listoftables{\@restonecolfalse\if@twocolumn\@restonecoltrue\onecolumn
+ \fi\section*{\listtablename\@mkboth{{\listtablename}}{{\listtablename}}}
+ \@starttoc{lot}\if@restonecol\twocolumn\fi}
+\let\l@table\l@figure
+
+\renewcommand\listoffigures{%
+    \section*{\listfigurename
+      \@mkboth{\listfigurename}{\listfigurename}}%
+    \@starttoc{lof}%
+    }
+
+\renewcommand\listoftables{%
+    \section*{\listtablename
+      \@mkboth{\listtablename}{\listtablename}}%
+    \@starttoc{lot}%
+    }
+
+\ifx\oribibl\undefined
+\ifx\citeauthoryear\undefined
+\renewenvironment{thebibliography}[1]
+     {\section*{\refname}
+      \def\@biblabel##1{##1.}
+      \small
+      \list{\@biblabel{\@arabic\c@enumiv}}%
+           {\settowidth\labelwidth{\@biblabel{#1}}%
+            \leftmargin\labelwidth
+            \advance\leftmargin\labelsep
+            \if@openbib
+              \advance\leftmargin\bibindent
+              \itemindent -\bibindent
+              \listparindent \itemindent
+              \parsep \z@
+            \fi
+            \usecounter{enumiv}%
+            \let\p@enumiv\@empty
+            \renewcommand\theenumiv{\@arabic\c@enumiv}}%
+      \if@openbib
+        \renewcommand\newblock{\par}%
+      \else
+        \renewcommand\newblock{\hskip .11em \@plus.33em \@minus.07em}%
+      \fi
+      \sloppy\clubpenalty4000\widowpenalty4000%
+      \sfcode`\.=\@m}
+     {\def\@noitemerr
+       {\@latex@warning{Empty `thebibliography' environment}}%
+      \endlist}
+\def\@lbibitem[#1]#2{\item[{[#1]}\hfill]\if@filesw
+     {\let\protect\noexpand\immediate
+     \write\@auxout{\string\bibcite{#2}{#1}}}\fi\ignorespaces}
+\newcount\@tempcntc
+\def\@citex[#1]#2{\if@filesw\immediate\write\@auxout{\string\citation{#2}}\fi
+  \@tempcnta\z@\@tempcntb\m@ne\def\@citea{}\@cite{\@for\@citeb:=#2\do
+    {\@ifundefined
+       {b@\@citeb}{\@citeo\@tempcntb\m@ne\@citea\def\@citea{,}{\bfseries
+        ?}\@warning
+       {Citation `\@citeb' on page \thepage \space undefined}}%
+    {\setbox\z@\hbox{\global\@tempcntc0\csname b@\@citeb\endcsname\relax}%
+     \ifnum\@tempcntc=\z@ \@citeo\@tempcntb\m@ne
+       \@citea\def\@citea{,}\hbox{\csname b@\@citeb\endcsname}%
+     \else
+      \advance\@tempcntb\@ne
+      \ifnum\@tempcntb=\@tempcntc
+      \else\advance\@tempcntb\m@ne\@citeo
+      \@tempcnta\@tempcntc\@tempcntb\@tempcntc\fi\fi}}\@citeo}{#1}}
+\def\@citeo{\ifnum\@tempcnta>\@tempcntb\else
+               \@citea\def\@citea{,\,\hskip\z@skip}%
+               \ifnum\@tempcnta=\@tempcntb\the\@tempcnta\else
+               {\advance\@tempcnta\@ne\ifnum\@tempcnta=\@tempcntb \else
+                \def\@citea{--}\fi
+      \advance\@tempcnta\m@ne\the\@tempcnta\@citea\the\@tempcntb}\fi\fi}
+\else
+\renewenvironment{thebibliography}[1]
+     {\section*{\refname}
+      \small
+      \list{}%
+           {\settowidth\labelwidth{}%
+            \leftmargin\parindent
+            \itemindent=-\parindent
+            \labelsep=\z@
+            \if@openbib
+              \advance\leftmargin\bibindent
+              \itemindent -\bibindent
+              \listparindent \itemindent
+              \parsep \z@
+            \fi
+            \usecounter{enumiv}%
+            \let\p@enumiv\@empty
+            \renewcommand\theenumiv{}}%
+      \if@openbib
+        \renewcommand\newblock{\par}%
+      \else
+        \renewcommand\newblock{\hskip .11em \@plus.33em \@minus.07em}%
+      \fi
+      \sloppy\clubpenalty4000\widowpenalty4000%
+      \sfcode`\.=\@m}
+     {\def\@noitemerr
+       {\@latex@warning{Empty `thebibliography' environment}}%
+      \endlist}
+      \def\@cite#1{#1}%
+      \def\@lbibitem[#1]#2{\item[]\if@filesw
+        {\def\protect##1{\string ##1\space}\immediate
+      \write\@auxout{\string\bibcite{#2}{#1}}}\fi\ignorespaces}
+   \fi
+\else
+\@cons\@openbib@code{\noexpand\small}
+\fi
+
+\def\idxquad{\hskip 10\p@}% space that divides entry from number
+
+\def\@idxitem{\par\hangindent 10\p@}
+
+\def\subitem{\par\setbox0=\hbox{--\enspace}% second order
+                \noindent\hangindent\wd0\box0}% index entry
+
+\def\subsubitem{\par\setbox0=\hbox{--\,--\enspace}% third
+                \noindent\hangindent\wd0\box0}% order index entry
+
+\def\indexspace{\par \vskip 10\p@ plus5\p@ minus3\p@\relax}
+
+\renewenvironment{theindex}
+               {\@mkboth{\indexname}{\indexname}%
+                \thispagestyle{empty}\parindent\z@
+                \parskip\z@ \@plus .3\p@\relax
+                \let\item\par
+                \def\,{\relax\ifmmode\mskip\thinmuskip
+                             \else\hskip0.2em\ignorespaces\fi}%
+                \normalfont\small
+                \begin{multicols}{2}[\@makeschapterhead{\indexname}]%
+                }
+                {\end{multicols}}
+
+\renewcommand\footnoterule{%
+  \kern-3\p@
+  \hrule\@width 2truecm
+  \kern2.6\p@}
+\long\def\@makefntext#1{%
+    \parindent 1em%
+    \leftskip 1em%
+    \noindent
+    \llap{\hb@xt@1em{\hss\@makefnmark\ }}\ignorespaces#1}
+
+\long\def\@makecaption#1#2{%
+  \vskip\abovecaptionskip
+  \sbox\@tempboxa{{\bfseries #1.} #2}%
+  \ifdim \wd\@tempboxa >\hsize
+    {\bfseries #1.} #2\par
+  \else
+    \global \@minipagefalse
+    \hb@xt@\hsize{\hfil\box\@tempboxa\hfil}%
+  \fi
+  \vskip\belowcaptionskip}
+
+\def\fps@figure{htbp}
+\def\fnum@figure{\figurename\thefigure}
+\def \@floatboxreset {%
+        \reset@font
+        \small
+        \@setnobreak
+        \@setminipage
+}
+\def\fps@table{htbp}
+\def\fnum@table{\tablename\thetable}
+\renewenvironment{table}
+               {\setlength\abovecaptionskip{0\p@}%
+                \setlength\belowcaptionskip{10\p@}%
+                \@float{table}}
+               {\end@float}
+\renewenvironment{table*}
+               {\setlength\abovecaptionskip{0\p@}%
+                \setlength\belowcaptionskip{10\p@}%
+                \@dblfloat{table}}
+               {\end@dblfloat}
+
+\long\def\@caption#1[#2]#3{\par\addcontentsline{\csname
+  ext@#1\endcsname}{#1}{\protect\numberline{\csname
+  the#1\endcsname}{\ignorespaces #2}}\begingroup
+    \@parboxrestore
+    \@makecaption{\csname fnum@#1\endcsname}{\ignorespaces #3}\par
+  \endgroup}
+
+% LaTeX does not provide a command to enter the authors institute
+% addresses. The \institute command is defined here.
+
+\newcounter{@inst}
+\newcounter{@auth}
+\newcounter{auco}
+\def\andname{and}
+\def\lastandname{\unskip, and}
+\newdimen\instindent
+\newbox\authrun
+\newtoks\authorrunning
+\newtoks\tocauthor
+\newbox\titrun
+\newtoks\titlerunning
+\newtoks\toctitle
+
+\def\clearheadinfo{\gdef\@author{No Author Given}%
+                   \gdef\@title{No Title Given}%
+                   \gdef\@subtitle{}%
+                   \gdef\@institute{No Institute Given}%
+                   \gdef\@thanks{}%
+                   \global\titlerunning={}\global\authorrunning={}%
+                   \global\toctitle={}\global\tocauthor={}}
+
+\def\institute#1{\gdef\@institute{#1}}
+
+\def\institutename{\par
+ \begingroup
+ \parskip=\z@
+ \parindent=\z@
+ \setcounter{@inst}{1}%
+ \def\and{\par\stepcounter{@inst}%
+ \noindent$^{\the@inst}$\enspace\ignorespaces}%
+ \setbox0=\vbox{\def\thanks##1{}\@institute}%
+ \ifnum\c@@inst=1\relax
+ \else
+   \setcounter{footnote}{\c@@inst}%
+   \setcounter{@inst}{1}%
+   \noindent$^{\the@inst}$\enspace
+ \fi
+ \ignorespaces
+ \@institute\par
+ \endgroup}
+
+\def\@fnsymbol#1{\ensuremath{\ifcase#1\or\star\or{\star\star}\or
+   {\star\star\star}\or \dagger\or \ddagger\or
+   \mathchar "278\or \mathchar "27B\or \|\or **\or \dagger\dagger
+   \or \ddagger\ddagger \else\@ctrerr\fi}}
+
+\def\inst#1{\unskip$^{#1}$}
+\def\fnmsep{\unskip$^,$}
+\def\email#1{{\tt#1}}
+\def\homedir{\~{ }}
+
+\def\subtitle#1{\gdef\@subtitle{#1}}
+\clearheadinfo
+
+\renewcommand\maketitle{\newpage
+  \refstepcounter{chapter}%
+  \stepcounter{section}%
+  \setcounter{section}{0}%
+  \setcounter{subsection}{0}%
+  \setcounter{figure}{0}
+  \setcounter{table}{0}
+  \setcounter{equation}{0}
+  \setcounter{footnote}{0}%
+  \begingroup
+    \parindent=\z@
+    \renewcommand\thefootnote{\@fnsymbol\c@footnote}%
+    \if@twocolumn
+      \ifnum \col@number=\@ne
+        \@maketitle
+      \else
+        \twocolumn[\@maketitle]%
+      \fi
+    \else
+      \newpage
+      \global\@topnum\z@   % Prevents figures from going at top of page.
+      \@maketitle
+    \fi
+    \thispagestyle{empty}\@thanks
+%
+    \def\\{\unskip\ \ignorespaces}\def\inst##1{\unskip{}}%
+    \def\thanks##1{\unskip{}}\def\fnmsep{\unskip}%
+    \instindent=\hsize
+    \advance\instindent by-\headlineindent
+    \if!\the\toctitle!\addcontentsline{toc}{title}{\@title}\else
+       \addcontentsline{toc}{title}{\the\toctitle}\fi
+    \if@runhead
+       \if!\the\titlerunning!\else
+         \edef\@title{\the\titlerunning}%
+       \fi
+       \global\setbox\titrun=\hbox{\small\rm\unboldmath\ignorespaces\@title}%
+       \ifdim\wd\titrun>\instindent
+          \typeout{Title too long for running head. Please supply}%
+          \typeout{a shorter form with \string\titlerunning\space prior to
+                   \string\maketitle}%
+          \global\setbox\titrun=\hbox{\small\rm
+          Title Suppressed Due to Excessive Length}%
+       \fi
+       \xdef\@title{\copy\titrun}%
+    \fi
+%
+    \if!\the\tocauthor!\relax
+      {\def\and{\noexpand\protect\noexpand\and}%
+      \protected@xdef\toc@uthor{\@author}}%
+    \else
+      \def\\{\noexpand\protect\noexpand\newline}%
+      \protected@xdef\scratch{\the\tocauthor}%
+      \protected@xdef\toc@uthor{\scratch}%
+    \fi
+    \addtocontents{toc}{{\protect\raggedright\protect\leftskip15\p@
+    \protect\rightskip\@tocrmarg
+    \protect\itshape\toc@uthor\protect\endgraf}}%
+    \if@runhead
+       \if!\the\authorrunning!
+         \value{@inst}=\value{@auth}%
+         \setcounter{@auth}{1}%
+       \else
+         \edef\@author{\the\authorrunning}%
+       \fi
+       \global\setbox\authrun=\hbox{\small\unboldmath\@author\unskip}%
+       \ifdim\wd\authrun>\instindent
+          \typeout{Names of authors too long for running head. Please supply}%
+          \typeout{a shorter form with \string\authorrunning\space prior to
+                   \string\maketitle}%
+          \global\setbox\authrun=\hbox{\small\rm
+          Authors Suppressed Due to Excessive Length}%
+       \fi
+       \xdef\@author{\copy\authrun}%
+       \markboth{\@author}{\@title}%
+     \fi
+  \endgroup
+  \setcounter{footnote}{0}%
+  \clearheadinfo}
+%
+\def\@maketitle{\newpage
+ \markboth{}{}%
+ \def\lastand{\ifnum\value{@inst}=2\relax
+                 \unskip{} \andname\
+              \else
+                 \unskip \lastandname\
+              \fi}%
+ \def\and{\stepcounter{@auth}\relax
+          \ifnum\value{@auth}=\value{@inst}%
+             \lastand
+          \else
+             \unskip,
+          \fi}%
+ \begin{center}%
+ {\Large \bfseries\boldmath
+  \pretolerance=10000
+  \@title \par}\vskip .8cm
+\if!\@subtitle!\else {\large \bfseries\boldmath
+  \vskip -.65cm
+  \pretolerance=10000
+  \@subtitle \par}\vskip .8cm\fi
+ \setbox0=\vbox{\setcounter{@auth}{1}\def\and{\stepcounter{@auth}}%
+ \def\thanks##1{}\@author}%
+ \global\value{@inst}=\value{@auth}%
+ \global\value{auco}=\value{@auth}%
+ \setcounter{@auth}{1}%
+{\lineskip .5em
+\noindent\ignorespaces
+\@author\vskip.35cm}
+ {\small\institutename}
+ \end{center}%
+ }
+
+% definition of the "\spnewtheorem" command.
+%
+% Usage:
+%
+%     \spnewtheorem{env_nam}{caption}[within]{cap_font}{body_font}
+% or  \spnewtheorem{env_nam}[numbered_like]{caption}{cap_font}{body_font}
+% or  \spnewtheorem*{env_nam}{caption}{cap_font}{body_font}
+%
+% New is "cap_font" and "body_font". It stands for
+% fontdefinition of the caption and the text itself.
+%
+% "\spnewtheorem*" gives a theorem without number.
+%
+% A defined spnewthoerem environment is used as described
+% by Lamport.
+%
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\def\@thmcountersep{}
+\def\@thmcounterend{.}
+
+\def\spnewtheorem{\@ifstar{\@sthm}{\@Sthm}}
+
+% definition of \spnewtheorem with number
+
+\def\@spnthm#1#2{%
+  \@ifnextchar[{\@spxnthm{#1}{#2}}{\@spynthm{#1}{#2}}}
+\def\@Sthm#1{\@ifnextchar[{\@spothm{#1}}{\@spnthm{#1}}}
+
+\def\@spxnthm#1#2[#3]#4#5{\expandafter\@ifdefinable\csname #1\endcsname
+   {\@definecounter{#1}\@addtoreset{#1}{#3}%
+   \expandafter\xdef\csname the#1\endcsname{\expandafter\noexpand
+     \csname the#3\endcsname \noexpand\@thmcountersep \@thmcounter{#1}}%
+   \expandafter\xdef\csname #1name\endcsname{#2}%
+   \global\@namedef{#1}{\@spthm{#1}{\csname #1name\endcsname}{#4}{#5}}%
+                              \global\@namedef{end#1}{\@endtheorem}}}
+
+\def\@spynthm#1#2#3#4{\expandafter\@ifdefinable\csname #1\endcsname
+   {\@definecounter{#1}%
+   \expandafter\xdef\csname the#1\endcsname{\@thmcounter{#1}}%
+   \expandafter\xdef\csname #1name\endcsname{#2}%
+   \global\@namedef{#1}{\@spthm{#1}{\csname #1name\endcsname}{#3}{#4}}%
+                               \global\@namedef{end#1}{\@endtheorem}}}
+
+\def\@spothm#1[#2]#3#4#5{%
+  \@ifundefined{c@#2}{\@latexerr{No theorem environment `#2' defined}\@eha}%
+  {\expandafter\@ifdefinable\csname #1\endcsname
+  {\global\@namedef{the#1}{\@nameuse{the#2}}%
+  \expandafter\xdef\csname #1name\endcsname{#3}%
+  \global\@namedef{#1}{\@spthm{#2}{\csname #1name\endcsname}{#4}{#5}}%
+  \global\@namedef{end#1}{\@endtheorem}}}}
+
+\def\@spthm#1#2#3#4{\topsep 7\p@ \@plus2\p@ \@minus4\p@
+\refstepcounter{#1}%
+\@ifnextchar[{\@spythm{#1}{#2}{#3}{#4}}{\@spxthm{#1}{#2}{#3}{#4}}}
+
+\def\@spxthm#1#2#3#4{\@spbegintheorem{#2}{\csname the#1\endcsname}{#3}{#4}%
+                    \ignorespaces}
+
+\def\@spythm#1#2#3#4[#5]{\@spopargbegintheorem{#2}{\csname
+       the#1\endcsname}{#5}{#3}{#4}\ignorespaces}
+
+\def\@spbegintheorem#1#2#3#4{\trivlist
+                 \item[\hskip\labelsep{#3#1\ #2\@thmcounterend}]#4}
+
+\def\@spopargbegintheorem#1#2#3#4#5{\trivlist
+      \item[\hskip\labelsep{#4#1\ #2}]{#4(#3)\@thmcounterend\ }#5}
+
+% definition of \spnewtheorem* without number
+
+\def\@sthm#1#2{\@Ynthm{#1}{#2}}
+
+\def\@Ynthm#1#2#3#4{\expandafter\@ifdefinable\csname #1\endcsname
+   {\global\@namedef{#1}{\@Thm{\csname #1name\endcsname}{#3}{#4}}%
+    \expandafter\xdef\csname #1name\endcsname{#2}%
+    \global\@namedef{end#1}{\@endtheorem}}}
+
+\def\@Thm#1#2#3{\topsep 7\p@ \@plus2\p@ \@minus4\p@
+\@ifnextchar[{\@Ythm{#1}{#2}{#3}}{\@Xthm{#1}{#2}{#3}}}
+
+\def\@Xthm#1#2#3{\@Begintheorem{#1}{#2}{#3}\ignorespaces}
+
+\def\@Ythm#1#2#3[#4]{\@Opargbegintheorem{#1}
+       {#4}{#2}{#3}\ignorespaces}
+
+\def\@Begintheorem#1#2#3{#3\trivlist
+                           \item[\hskip\labelsep{#2#1\@thmcounterend}]}
+
+\def\@Opargbegintheorem#1#2#3#4{#4\trivlist
+      \item[\hskip\labelsep{#3#1}]{#3(#2)\@thmcounterend\ }}
+
+\if@envcntsect
+   \def\@thmcountersep{.}
+   \spnewtheorem{theorem}{Theorem}[section]{\bfseries}{\itshape}
+\else
+   \spnewtheorem{theorem}{Theorem}{\bfseries}{\itshape}
+   \if@envcntreset
+      \@addtoreset{theorem}{section}
+   \else
+      \@addtoreset{theorem}{chapter}
+   \fi
+\fi
+
+%definition of divers theorem environments
+\spnewtheorem*{claim}{Claim}{\itshape}{\rmfamily}
+\spnewtheorem*{proof}{Proof}{\itshape}{\rmfamily}
+\if@envcntsame % alle Umgebungen wie Theorem.
+   \def\spn@wtheorem#1#2#3#4{\@spothm{#1}[theorem]{#2}{#3}{#4}}
+\else % alle Umgebungen mit eigenem Zaehler
+   \if@envcntsect % mit section numeriert
+      \def\spn@wtheorem#1#2#3#4{\@spxnthm{#1}{#2}[section]{#3}{#4}}
+   \else % nicht mit section numeriert
+      \if@envcntreset
+         \def\spn@wtheorem#1#2#3#4{\@spynthm{#1}{#2}{#3}{#4}
+                                   \@addtoreset{#1}{section}}
+      \else
+         \let\spn@wtheorem=\@spynthm
+      \fi
+   \fi
+\fi
+\spn@wtheorem{case}{Case}{\itshape}{\rmfamily}
+\spn@wtheorem{conjecture}{Conjecture}{\itshape}{\rmfamily}
+\spn@wtheorem{corollary}{Corollary}{\bfseries}{\itshape}
+\spn@wtheorem{definition}{Definition}{\bfseries}{\itshape}
+\spn@wtheorem{example}{Example}{\itshape}{\rmfamily}
+\spn@wtheorem{exercise}{Exercise}{\itshape}{\rmfamily}
+\spn@wtheorem{lemma}{Lemma}{\bfseries}{\itshape}
+\spn@wtheorem{note}{Note}{\itshape}{\rmfamily}
+\spn@wtheorem{problem}{Problem}{\itshape}{\rmfamily}
+\spn@wtheorem{property}{Property}{\itshape}{\rmfamily}
+\spn@wtheorem{proposition}{Proposition}{\bfseries}{\itshape}
+\spn@wtheorem{question}{Question}{\itshape}{\rmfamily}
+\spn@wtheorem{solution}{Solution}{\itshape}{\rmfamily}
+\spn@wtheorem{remark}{Remark}{\itshape}{\rmfamily}
+
+\def\@takefromreset#1#2{%
+    \def\@tempa{#1}%
+    \let\@tempd\@elt
+    \def\@elt##1{%
+        \def\@tempb{##1}%
+        \ifx\@tempa\@tempb\else
+            \@addtoreset{##1}{#2}%
+        \fi}%
+    \expandafter\expandafter\let\expandafter\@tempc\csname cl@#2\endcsname
+    \expandafter\def\csname cl@#2\endcsname{}%
+    \@tempc
+    \let\@elt\@tempd}
+
+\def\theopargself{\def\@spopargbegintheorem##1##2##3##4##5{\trivlist
+      \item[\hskip\labelsep{##4##1\ ##2}]{##4##3\@thmcounterend\ }##5}
+                  \def\@Opargbegintheorem##1##2##3##4{##4\trivlist
+      \item[\hskip\labelsep{##3##1}]{##3##2\@thmcounterend\ }}
+      }
+
+\renewenvironment{abstract}{%
+      \list{}{\advance\topsep by0.35cm\relax\small
+      \leftmargin=1cm
+      \labelwidth=\z@
+      \listparindent=\z@
+      \itemindent\listparindent
+      \rightmargin\leftmargin}\item[\hskip\labelsep
+                                    \bfseries\abstractname]}
+    {\endlist}
+\renewcommand{\abstractname}{Abstract.}
+\renewcommand{\contentsname}{Table of Contents}
+\renewcommand{\figurename}{Fig.\thinspace}
+\renewcommand{\tablename}{Table~}
+
+\newdimen\headlineindent             % dimension for space between
+\headlineindent=1.166cm              % number and text of headings.
+
+\def\ps@headings{\let\@mkboth\@gobbletwo
+   \let\@oddfoot\@empty\let\@evenfoot\@empty
+   \def\@evenhead{\normalfont\small\rlap{\thepage}\hspace{\headlineindent}%
+                  \leftmark\hfil}
+   \def\@oddhead{\normalfont\small\hfil\rightmark\hspace{\headlineindent}%
+                 \llap{\thepage}}
+   \def\chaptermark##1{}%
+   \def\sectionmark##1{}%
+   \def\subsectionmark##1{}}
+
+\if@runhead\ps@headings\else
+\ps@empty\fi
+
+\setlength\arraycolsep{1.4\p@}
+\setlength\tabcolsep{1.4\p@}
+
+\endinput
diff --git a/xdelta1/doc/old/dcc99/mkex.c b/xdelta1/doc/old/dcc99/mkex.c
new file mode 100755
index 0000000..5daf003
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/mkex.c
@@ -0,0 +1,118 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <glib.h>
+#include <ctype.h>
+
+#define LEN 10
+#define COUNT 7
+#define THRESH 5
+
+char example[LEN+1][COUNT];
+int example_no;
+
+char* words[1<<20];
+int word_no;
+
+int frag_count = 2;
+
+int main()
+{
+  int i, j, k;
+  char * buf = g_new0 (char,2048);
+
+  example_no = 1;
+  g_assert (strlen ("difference") == LEN);
+  memcpy (example[0], "difference", LEN);
+
+  while (fgets (buf, 2048, stdin))
+    {
+      if (strlen(buf) < (LEN+1))
+        continue;
+
+      buf[LEN] = 0;
+
+      for (i = 0; i < LEN; i += 1)
+        buf[i] = tolower(buf[i]);
+
+      words[word_no++] = g_strdup (buf);
+    }
+
+  for (i = 0; i < word_no; i += 1)
+    {
+      for (j = 0; j < word_no; j += 1)
+        {
+          char* w1 = words[i];
+          char* w2 = words[j];
+          int in_match = TRUE, m = 0, f = 0;
+
+          if (i == j)
+            continue;
+
+          if (w1[0] == w2[0])
+            continue;
+
+          for (k = 0; k < LEN; k += 1)
+            {
+              if (w1[k] == w2[k])
+                {
+                  if (! in_match)
+                    f += 1;
+
+                  m += 1;
+                  in_match = TRUE;
+                }
+              else
+                in_match = FALSE;
+            }
+
+          if (f == frag_count && m > THRESH && m < LEN)
+            {
+              if (frag_count == 3)
+                frag_count = 1;
+              else
+                frag_count += 1;
+
+              printf ("%s %s\n", w1, w2);
+            }
+        }
+    }
+
+#if 0
+  for (i = 0; example_no < COUNT; i = (i + 1) % word_no)
+    {
+      int k = 0, m = 0, f = 0;
+      int in_match = TRUE;
+      char* w;
+
+      w = example[i];
+
+      if (buf[0] == w[0])
+        continue;
+
+      for (; k < LEN; k += 1)
+        {
+          if (buf[k] == w[k])
+            {
+              if (! in_match)
+                f += 1;
+
+              m += 1;
+              in_match = TRUE;
+            }
+          else
+            in_match = FALSE;
+        }
+
+      if (m > 2)
+        printf ("m is %d\n", m);
+
+      if (m >= THRESH && m < LEN && f == frag_count)
+        {
+          printf ("frag_count was: %d\n", frag_count);
+          frag_count = 1 + (frag_count + 1) % 2;
+          printf ("frag_count now: %d\n\n", frag_count);
+        }
+    }
+#endif
+  exit (0);
+}
diff --git a/xdelta1/doc/old/dcc99/mkex2.c b/xdelta1/doc/old/dcc99/mkex2.c
new file mode 100755
index 0000000..d48d196
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/mkex2.c
@@ -0,0 +1,242 @@
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <glib.h>
+#include <ctype.h>
+
+GHashTable* node_table;
+GStringChunk* chunk;
+
+typedef struct _Node Node;
+typedef struct _IntPair IntPair;
+typedef struct _Edge Edge;
+
+struct _IntPair {
+  int d1;
+  int d2;
+};
+
+struct _Node {
+  int mark[3];
+  int finish;
+  char *name;
+  Edge *edges;
+};
+
+struct _Edge {
+  char* pict;
+  int   frags;
+  int   copy;
+  Node* node;
+  Edge* next;
+};
+
+Node* get_node (char* name)
+{
+  Node* n = g_hash_table_lookup (node_table, name);
+
+  if (n)
+    return n;
+
+  n = g_new0 (Node, 1);
+  n->name = name;
+
+  g_hash_table_insert (node_table, name, n);
+
+  return n;
+}
+
+void connect (Node* n1, Node* n2)
+{
+  Edge* nedge = g_new0 (Edge, 1);
+
+  nedge->node = n1;
+  nedge->next = n2->edges;
+  n2->edges = nedge;
+
+  nedge = g_new0 (Edge, 1);
+
+  nedge->node = n2;
+  nedge->next = n1->edges;
+  n1->edges = nedge;
+}
+
+int global_count = 0;
+int global_e_count = 0;
+int global_depth = 0;
+int global_fragments = 0;
+int global_longest = 0;
+int global_longest2 = 0;
+
+void
+count_fragments (Node* n1, Node* n2, Edge* e)
+{
+  int i, l = strlen (n1->name);
+  int in_match = TRUE;
+  int m = 0, f = 0;
+  char buf1[16];
+
+  memset (buf1, ' ', l);
+
+  buf1[l] = 0;
+
+  for (i = 0; i < l; i += 1)
+    {
+      if (n1->name[i] == n2->name[i])
+        {
+          if (! in_match)
+            {
+              global_fragments += 1;
+              f += 1;
+            }
+
+          in_match = TRUE;
+          m += 1;
+          buf1[i] = 'x';
+        }
+      else
+        in_match = FALSE;
+    }
+
+  e->pict = g_strdup (buf1);
+  e->copy = m;
+  e->frags = f;
+}
+
+int
+dfs (Node* n, gint phase, gint print, gint depth)
+{
+  int d1 = 0, d2 = 0, c;
+  Edge* e;
+
+  global_depth = MAX(depth, global_depth);
+
+  if (n->mark[phase])
+    {
+      return 1;
+    }
+
+  n->mark[phase] = TRUE;
+
+  for (e = n->edges; e; e = e->next)
+    {
+      int od1;
+
+      global_e_count += 1;
+
+      count_fragments (n, e->node, e);
+
+      c = dfs (e->node, phase, print, depth + 1);
+
+      od1 = d1;
+      d1 = MAX (d1, c);
+
+      if (d1 == od1)
+        {
+          d2 = MAX (d2, c);
+        }
+      else
+        d2 = od1;
+    }
+
+  global_count += 1;
+
+  if (print)
+    {
+      g_print ("%s ->\n", n->name);
+
+      for (e = n->edges; e; e = e->next)
+        g_print ("  %s %s %d %d\n", e->node->name, e->pict, e->copy, e->frags);
+
+      g_print ("\n\n");
+    }
+
+  if (! print && depth == 0 && d1 + d2 == 8)
+    {
+      g_print ("found a graph of size nodes=%d, edges=%d, depth=%d, frags=%d:\n", global_count, global_e_count, d1+d2, global_fragments);
+
+      dfs (n, 1, TRUE, 0);
+
+      g_print ("\n");
+      g_print ("\n");
+    }
+
+  return d1 + 1;
+}
+
+void
+find (gpointer  key,
+      gpointer  value,
+      gpointer  user_data)
+{
+  Node* n = value;
+
+  global_fragments = 0;
+  global_count = 0;
+  global_e_count = 0;
+  global_depth = 0;
+
+  dfs (n, 0, FALSE, 0);
+
+  global_e_count /= 2;
+
+  if (global_count == 0)
+    return;
+
+  /*g_assert (global_count != global_e_count);*/
+
+  if (FALSE && global_depth > 7)
+    {
+      g_print ("found a graph of size nodes=%d, edges=%d, depth=%d, %d:\n", global_count, global_e_count, global_depth, global_fragments);
+
+      dfs (n, 1, TRUE, 0);
+
+      g_print ("\n");
+      g_print ("\n");
+    }
+}
+
+int main()
+{
+  char from_buf[2048];
+  char to_buf[2048];
+
+  node_table = g_hash_table_new (g_direct_hash, g_direct_equal);
+  chunk = g_string_chunk_new (1024);
+
+  while (scanf ("%s %s", from_buf, to_buf) == 2)
+    {
+      Node* nfrom;
+      Node* nto;
+      Edge* e;
+
+      char* from = g_string_chunk_insert_const (chunk, from_buf);
+      char* to = g_string_chunk_insert_const (chunk, to_buf);
+
+      nfrom = get_node (from);
+      nto = get_node (to);
+
+      if (! nfrom->edges)
+        {
+          connect (nfrom, nto);
+          continue;
+        }
+
+      for (e = nfrom->edges; e; e = e->next)
+        {
+          if (e->node == nto)
+            {
+              break;
+            }
+
+          if (e->next == NULL)
+            {
+              connect (nfrom, nto);
+            }
+        }
+    }
+
+  g_hash_table_foreach (node_table, find, NULL);
+
+  exit (1);
+}
diff --git a/xdelta1/doc/old/dcc99/vdelta b/xdelta1/doc/old/dcc99/vdelta
new file mode 100755
index 0000000..82f8246
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/vdelta
diff --git a/xdelta1/doc/old/dcc99/vupdate b/xdelta1/doc/old/dcc99/vupdate
new file mode 100755
index 0000000..6b5009d
--- /dev/null
+++ b/xdelta1/doc/old/dcc99/vupdate
diff --git a/xdelta1/doc/old/xdelta.gif b/xdelta1/doc/old/xdelta.gif
new file mode 100755
index 0000000..4eb1c74
--- /dev/null
+++ b/xdelta1/doc/old/xdelta.gif
diff --git a/xdelta1/doc/old/xdelta.html b/xdelta1/doc/old/xdelta.html
new file mode 100755
index 0000000..919752a
--- /dev/null
+++ b/xdelta1/doc/old/xdelta.html
@@ -0,0 +1,183 @@
+<html> <head>
+<title>Xdelta</title>
+</head>
+
+<body bgcolor="#ffffff" text="#000000">
+<center><img src="xdelta.gif" alt="Xdelta"></center>
+
+<center><h1>News</h1></center>
+
+Version 1.1 has been released, see the <A
+HREF="ftp://ftp.xcf.berkeley.edu/pub/xdelta/NEWS">NEWS</A>.
+<P>
+
+As of version 1.0.5, Xdelta supports Windows.  A pre-built version is
+available <A
+HREF="ftp://ftp.xcf.berkeley.edu/pub/xdelta/xdelta-1.0.5.win32.zip">
+here.</A>. <P>
+
+You can see a draft of a paper describing Xdelta <A
+HREF="ftp://ftp.xcf.berkeley.edu/pub/xdelta/xdelta.ps"> here</A>.
+
+<center><h1>About</h1></center>
+
+Xdelta is a binary delta generator library.  It was begun in February
+1997 as an experiment with the intent of replacing RCS in a future
+version of <A HREF="http://www.xcf.berkeley.edu/~jmacd/prcs.html">PRCS</A>.
+The 0.x series of releases were the resulting, experimental code base.
+Several algorithms were experimented with; the final algorithm
+resembles the Rsync algorithm (due to Andrew Tridgell and Paul
+Mackerras), though implementation and interface considerations leave
+the two programs quite distinct.  Xdelta uses a fast, linear algorithm
+and performs well on both binary and text files.
+<P>
+
+Xdelta is a library interface and application program designed to
+compute changes between files.  These changes (deltas) are similar to
+the output of the "diff" program in that they may be used to store and
+transmit only the changes between files.  However, unlike diff, the
+output of Xdelta is not expressed in a human-readable format and
+cannot be reversed.  Xdelta can also also apply these deltas to a copy
+of the original file(s).  Xdelta also includes a simple implementation
+of the Rsync algorithm and several advanced features for implementing
+RCS-like file-archival with.
+<P>
+
+Version 1.0, released on October 3, 1998, is greatly refined: It is
+smaller, optimized, and has a clean interface.  This version is a
+complete rewrite, and uses less than 50% of the memory require by the
+0.x series, even greater reductions are seen in the application for
+compressed files.  Files are now stream-processed when possible, and
+paged when seeking is required.  The application now features a
+--maxmem option to set the size of the internal buffers.  No files are
+ever completely read into memory.  In addition, many features in the
+0.x series have been removed, leaving only the delta and patch
+functions.  The GDBM-archive support code has been reimplemented in
+the new version of PRCS.
+<P>
+
+A file archival system has been built upon Xdelta.  The 0.x series of
+releases included a prototype of this system, which has since been
+greatly improved.  The original system used GDBM to store deltas.
+GDBM was abandoned because it typically requires 5-10 times as much
+space as actual data contained in its database, rendering all
+advantages of delta-compression lost.  The file archival system does
+not use branches to store deltas according to their logical ancestry,
+instead it uses a linear delta encoding and past deltas are included
+as inputs to future delta computation.  Though this may sound bad at
+first, it actually works because past deltas contain the missing
+branch's data.  Conceptually, imagine computing a (reverse) delta
+between the previous head (a literal file) and the new file plus the
+old deltas (the entire archive).  Computing a delta between the a file
+and the entire archive relieves the branching requirement.  This
+process is described in more detail in this <A href="prcs2.ps">paper</A>.
+It has many improvements over RCS, aside from the fact that RCS was
+simply not designed to be used as a library.  These are:
+<P>
+
+<ul>
+<li>
+The ability to easily discard old versions in date order, regardless
+of ancestry.
+</li>
+<li>
+The ability to retrieve all versions in time proportional to their age,
+not ancestry.
+</li>
+<li>
+Using a new file format allows individual deltas to be compressed as they age,
+the entire archive need not be compressed at once.
+</li>
+<li>
+Higher level applications (such as PRCS) are free from the hidden
+performance implications of version-number allocation, since these tools
+do not, in general, have enough information to make a good decision.
+</li>
+</ul>
+<P>
+
+The 0.x series had a <A HREF="http://www.gimp.org">GIMP</A> plugin
+that stores multiple versions of an image in any Gimp-supported image
+format.  This plugin has not been ported to version 1.0, since 1.0
+removed the GDBM archival features.  Interested parties may contact me
+for help updating this plugin.
+
+<P>
+<center><h1>Simple Command-Line Use</h1></center>
+
+To generate a delta between files <em>FROM</em> and <em>TO</em> and
+write the delta to the file named <em>OUT</em>, run the command:
+<P>
+
+$ xdelta delta [options] FROM TO OUT
+<P>
+
+If you supply no options, the internals of OUT are compressed using
+zlib's default compression.  You do not need to post-compress its
+output!  The compression level can be set with the arguments -0
+through -9, with 0 indicating no compression.  To apply the previously
+generated delta with a copy of <em>FROM</em> and <em>OUT</em>:
+<P>
+
+$ xdelta patch [options] OUT FROM TO.RECONSTRUCTED
+<P>
+
+This will produce the file <em>TO.RECONSTRUCTED</em>.  If this command
+succeeds then you can be confident that Xdelta produced an exact copy
+of the original file because it verifies the MD5 checksum of its
+output.  You can list information about a delta with the command:
+<P>
+
+$ xdelta info OUT
+<P>
+
+Sample output:
+<P>
+
+xdelta: version 1.1.0 found patch version 1.1 in out (compressed) <br>
+xdelta: generated with a gzipped FROM file <br>
+xdelta: generated with a gzipped TO file <br>
+xdelta: output name:   xdelta-1.0.1.tar.gz <br>
+xdelta: output length: 798720 <br>
+xdelta: output md5:    c33f043e276ff3986dbab99f14213c44 <br>
+xdelta: patch from segments: 2 <br>
+xdelta: MD5                              Length Copies  Used    Seq?    Name <br>
+xdelta: 11b99054e237b611db7d2ee7b090b4a4 16309  736     16309   yes     (patch data) <br>
+xdelta: 641b34f2630d66a346cee9893cfc01a6 788480 1550    782411  no      xdelta-1.0.0.tar.gz <br>
+
+<center><h1>Downloading</h1></center>
+
+Xdelta is available <A
+HREF="ftp://ftp.xcf.berkeley.edu/pub/xdelta">here</A>.  The Xdelta
+library is very portable.  Xdelta depends on <A HREF="ftp://ftp.cdrom.com/pub/infozip/zlib">Zlib 1.1.x</A>
+and <A HREF="ftp://ftp.gtk.org/pub/gtk/v1.1">GLIB 1.3.0</A>.
+<P>
+
+The latest version of Xdelta is version
+<!-- $Format: "$ReleaseVersion$." $ -->
+1.1.2.
+see the <A HREF="ftp://ftp.xcf.berkeley.edu/pub/xdelta/NEWS">NEWS</A>.  <P>
+<P>
+
+Thanks to <A HREF="mailto:aklikins@eos.ncsu.edu">Adrian Likins</A> for the artwork.
+
+<P>
+
+<hr>
+<center>
+This page has been accessed
+<IMG
+SRC="/cgi-bin/Count.cgi?ft=0|frgb=0;0;0|tr=0|trgb=0;0;0|wxh=15;20|md=7|dd=B|st=1|sh=1|df=xdelta.dat"
+ALT="a whole bunch of">
+times.
+<!-- since August 16, 1998-->
+<hr>
+<!-- hhmts start -->
+Last modified: Wed Apr  7 00:36:07 PDT 1999
+<!-- hhmts end --><br>
+<a href="http://www.xcf.berkeley.edu/~jmacd/">Josh MacDonald</a> /
+<i><a
+HREF="mailto:jmacd@cs.berkeley.edu">jmacd@cs.berkeley.edu</a></i>
+</center>
+<img align=right src="gbg.gif" alt="">
+</body> </html>
diff --git a/xdelta1/doc/xdelta.1 b/xdelta1/doc/xdelta.1
new file mode 100755
index 0000000..ec6a6d0
--- /dev/null
+++ b/xdelta1/doc/xdelta.1
@@ -0,0 +1,201 @@
+.ds p \&\s-1Xdelta\s0
+.if n .ds - \%--
+.if t .ds - \(em
+.if !\n(.g \{\
+.       if !\w|\*(lq| \{\
+.               ds lq ``
+.               if \w'\(lq' .ds lq "\(lq
+.       \}
+.       if !\w|\*(rq| \{\
+.               ds rq ''
+.               if \w'\(rq' .ds rq "\(rq
+.       \}
+.\}
+.de PE
+.sp \\n()Pu
+.ne 2
+.nf
+.IP
+..
+.de EP
+.fi
+.PP
+.sp \\n()Pu
+..
+.TH Xdelta 1
+.SH NAME
+xdelta \- Invoke Xdelta
+.SH SYNOPSIS
+.B xdelta
+.I subcommand
+[
+.IR option ".\|.\|.
+] [
+.IR operand .\|.\|.
+]
+.SH DESCRIPTION
+Xdelta provides the ability to generate deltas between a pair of files
+and later apply those deltas.  It operates similar to the
+.B diff
+and
+.B patch
+commands, but works on binary files and does not produce a human
+readable output.
+.PP
+
+Xdelta has three subcommands, delta, patch, and info.  Delta accepts
+two file versions and produces a delta, while patch accepts the
+original file version and delta and produces the second version.  The
+info command prints useful information about a delta.  Each subcommand
+will be detailed seperately.
+
+.SS Gzip processing
+Attempting to compute a delta between compressed input files usually
+results in poor compression.  This is because small differences
+between the original contents causes changes in the compression of
+whole blocks of data.  To simplify things, Xdelta implements a special
+case for
+.IR gzip (1)
+compressed files.  If any version input to the delta command is
+recognized as having gzip compression, it will be automatically
+decompressed into a temporary location prior to comparison.  This
+temporary location is either the value of the
+.IR TMPDIR
+environment variable, if set, otherwise "/tmp".
+
+The Xdelta patch header contains a flag indicating that the
+reconstructed version should be recompressed after applying the
+patch.  In general, this allows Xdelta to operate transparently on
+gzip compressed inputs.
+
+There is one potential problem when automatically processing gzip
+compressed files, which is that the recompressed content does not
+always match byte-for-byte with the original compressed content.  The
+uncompressed content still matches, but if there is an external
+integrity check such as cryptographic signature verification, it may
+fail.  To prevent this from happening, the --pristine option disables
+automatic gzip processing.
+
+.SS MD5 integrity check
+By default, Xdelta always verifies the MD5 checksum of the files it
+reconstructs.  This prevents you from supplying an incorrect input
+during patch, which would result in corrupt output.  Because of this
+feature, you can feel confident that patch has produced valid results.
+The --noverify option disables MD5 verification, but this is only
+recommended for performance testing.
+
+.SS Compressed patch format
+Xdelta uses a fairly simple encoding for its delta, then applies zlib
+compression to the result.  You should not have to post-compress an
+Xdelta delta.
+
+.SS Delta
+The delta subcommand has the following synopsis:
+
+.B xdelta
+.I delta
+[
+.IR option ".\|.\|.
+]
+.IR fromfile
+.IR tofile
+.IR patchout
+
+Computes a delta from
+.IR fromfile
+to
+.IR tofile
+and writes it to
+.IR patchout
+
+.SS Patch
+The patch subcommand has the following synopsis:
+
+.B xdelta
+.I patch
+[
+.IR option ".\|.\|.
+]
+.IR patchin
+[
+.IR fromfile
+[
+.IR tofile
+]]
+
+Applies
+.IR patchin
+to
+.IR fromfile
+and produces a reconstructed version of
+.IR tofile.
+
+If fromfile was omitted, Xdelta attempts to use the original fromfile
+name, which is stored in the delta.  The from file must be identical
+to the one used to create the delta.  If its length or MD5 checksum
+differs, patch will abort with an error message.
+
+If tofile was omitted, Xdelta attempts to use the original tofile
+name, which is also stored in the delta.  If the original tofile name
+already exists, a unique filename extension will be added to avoid
+destroying any existing data.
+
+.SS Info
+The info subcommand has the following synopsis:
+
+.B xdelta
+.I info
+.IR patchinfo
+
+Prints information about
+.IR patchinfo
+and the version it reconstructs, including file names, lengths, and
+MD5 checksums.
+
+.SS Options
+
+.IP -0..9
+Set the zlib compression level.  Zero indicates no compression.  Nine
+indicates maximum compression.
+
+.IP "-h, --help"
+Print a short help message and exit.
+
+.IP "-q, --quiet"
+Quiet.  Surpresses several warning messages.
+
+.IP "-v, --version"
+Print the Xdelta version number and exit.
+
+.IP "-V, --verbose"
+Verbose.  Prints a bit of extra information.
+
+.IP "-n, --noverify"
+No verify.  Turns off MD5 checksum verification of the input and
+output files.
+
+.IP "-m=SIZE, --maxmem=SIZE"
+Set an upper bound on the size of an in-memory page cache.  For
+example, --maxmem=32M will use a 32 megabyte page cache.
+
+.IP "-s=BLOCK_SIZE"
+Set the block size, unless it was hard coded (20% speed improvement).
+Should be a power of 2.
+
+.IP "-p, --pristine"
+Disable the automatic decompression of gzipped inputs, to prevent
+unexpected differences in the re-compressed content.
+
+.SH RETURN VALUES
+The delta command exits with status 0 to indicate that no differences
+were found, with status 1 to indicate that some differences were
+found, and with status 2 to indicate an error of some kind.  The patch
+and info commands exit with status 0 on success and 2 on failure.
+
+.SH IDENTIFICATION
+Author: Joshua P. MacDonald, jmacd@cs.berkeley.edu
+.br
+.\" $Format: "Manual Page Revision: $Revision$; Release Date: $ProjectDate$."$
+Manual Page Revision: 1.5; Release Date: Fri, 29 Jun 2001 06:01:08 -0700.
+.br
+Copyright \(co 1997, 1998, 1999, 2000, 2001
diff --git a/xdelta1/doc/xdelta.cat b/xdelta1/doc/xdelta.cat
new file mode 100755
index 0000000..7bc1ed6
--- /dev/null
+++ b/xdelta1/doc/xdelta.cat
@@ -0,0 +1,138 @@
+Xdelta(1)                                               Xdelta(1)
+
+NAME
+       xdelta - Invoke Xdelta
+
+SYNOPSIS
+       xdelta subcommand [ option...  ] [ operand...  ]
+
+DESCRIPTION
+
+       Xdelta provides the ability to generate deltas between a pair
+       of files and later apply those deltas.  It operates similar to
+       the diff and patch commands, but works on binary files and does
+       not produce a human readable output.
+
+       Xdelta has three subcommands, delta, patch, and info.  Delta
+       accepts two file versions and produces a delta, while patch
+       accepts the original file version and delta and produces the
+       second version.  The info command prints useful information
+       about a delta.  Each subcommand will be detailed seperately.
+
+   Gzip processing
+
+       Attempting to compute a delta between compressed input files
+       usually results in poor compression.  This is because small
+       differences between the original contents causes changes in the
+       compression of whole blocks of data.  To simplify things,
+       Xdelta implements a special case for gzip(1) compressed files.
+       If any version input to the delta command is recognized as
+       having gzip compression, it will be automatically decompressed
+       into a temporary location prior to comparison.  This temporary
+       location is either the value of the TMPDIR environment
+       variable, if set, otherwise "/tmp".
+
+       The Xdelta patch header contains a flag indicating that the
+       reconstructed version should be recompressed after applying
+       the patch.  In general, this allows Xdelta to operate
+       transparently on gzip compressed inputs.
+
+       There is one potential problem when automatically processing
+       gzip compressed files, which is that the recompressed content
+       does not always match byte-for-byte with the original
+       compressed content.  The uncompressed content still matches,
+       but if there is an external integrity check such as
+       cryptographic signature verification, it may fail.  To prevent
+       this from happening, the --pristine option disables automatic
+       gzip processing.
+
+   MD5 integrity check
+
+       By default, Xdelta always verifies the MD5 checksum of the
+       files it reconstructs.  This prevents you from supplying an
+       incorrect input during patch, which would result in corrupt
+       output.  Because of this feature, you can feel confident that
+       patch has produced valid results.  The --noverify option
+       disables MD5 verification, but this is only recommended for
+       performance testing.
+
+   Compressed patch format
+
+       Xdelta uses a fairly simple encoding for its delta, then
+       applies zlib compression to the result.  You should not have to
+       post-compress an Xdelta delta.
+
+   Delta
+
+       The delta subcommand has the following synopsis:
+
+       xdelta delta [ option...  ] fromfile tofile patchout
+
+       Computes a delta from fromfile to tofile and writes it to patchout
+
+   Patch
+
+       The patch subcommand has the following synopsis:
+
+       xdelta patch [ option...  ] patchin [ fromfile [ tofile ]]
+
+       Applies patchin to fromfile and produces a reconstructed
+       version of tofile.
+
+       If fromfile was omitted, Xdelta attempts to use the original
+       fromfile name, which is stored in the delta.  The from file
+       must be identical to the one used to create the delta.  If its
+       length or MD5 checksum differs, patch will abort with an error
+       message.
+
+       If tofile was omitted, Xdelta attempts to use the original
+       tofile name, which is also stored in the delta.  If the
+       original tofile name already exists, a unique filename
+       extension will be added to avoid destroying any existing data.
+
+   Info
+       The info subcommand has the following synopsis:
+
+       xdelta info patchinfo
+
+       Prints information about patchinfo and the version it
+       reconstructs, including file names, lengths, and MD5 checksums.
+
+   Options
+       -0..9  Set  the  zlib compression level.  Zero indicates no
+              compression.  Nine indicates maximum compression.
+
+       -h, --help
+              Print a short help message and exit.
+
+       -q, --quiet
+              Quiet.  Surpresses several warning messages.
+
+       -v, --version
+              Print the Xdelta version number and exit.
+
+       -V, --verbose
+              Verbose.  Prints a bit of extra information.
+
+       -n, --noverify
+              No verify.  Turns off MD5 checksum verification of the
+              input and output files.
+
+       -m=SIZE, --maxmem=SIZE
+              Set an upper bound on the size of an in-memory page
+              cache. For example, --maxmem=32M will use a 32 megabyte
+              page cache.
+
+       -s=BLOCK_SIZE
+              Set the block size, unless it was hard coded (20% speed
+              improvement).  Should be a power of 2.
+
+       -p, --pristine
+              Disable  the  automatic  decompression of gzipped
+              inputs,  to prevent unexpected differences in the
+              re-compressed content.
+
+IDENTIFICATION
+       Author: Joshua P. MacDonald, jmacd@cs.berkeley.edu
+       Manual Page Revision: 1.2; Release Date: Mon, 11 Jun 2001 03:39:53 -0700.
+       Copyright © 1997, 1998, 1999, 2000, 2001