From 7f4ecae0ffdfe06c8d30b56ce45beef45094a2b2 Mon Sep 17 00:00:00 2001 From: Stephen Adams Date: Wed, 3 Nov 1993 23:02:03 +0000 Subject: [PATCH] fixed more typos --- v7/doc/ref-manual/scheme.texinfo | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/v7/doc/ref-manual/scheme.texinfo b/v7/doc/ref-manual/scheme.texinfo index 992516cb3..efd5a0624 100644 --- a/v7/doc/ref-manual/scheme.texinfo +++ b/v7/doc/ref-manual/scheme.texinfo @@ -2,7 +2,7 @@ @iftex @finalout @end iftex -@comment $Id: scheme.texinfo,v 1.34 1993/11/03 22:57:59 adams Exp $ +@comment $Id: scheme.texinfo,v 1.35 1993/11/03 23:02:03 adams Exp $ @comment %**start of header (This is for running Texinfo on a region.) @setfilename scheme @settitle MIT Scheme Reference @@ -8739,7 +8739,7 @@ implementation supports destructive insertion and deletion operations with a good constant factor. @item -@dfn{Weight-Balanced trees} are a kind of balanced binary. The +@dfn{Weight-Balanced trees} are a kind of balanced binary trees. The implementation provides non-destructive operations. There is a comprehensive set of operations including a constant time size operation, many high-level operations such as the set operations union, -- 2.25.1