Path: utzoo!utgpu!water!watmath!clyde!att!rutgers!umn-d-ub!umn-cs!uf!mpp
From: mpp@uf.msc.umn.edu (Mike Pritchard)
Newsgroups: comp.sources.d
Subject: Re: v04i083: 3demo program - part 1 of 4
Message-ID: <7948@umn-cs.CS.UMN.EDU>
Date: 26 Sep 88 23:38:47 GMT
References: <8809101533.AA21029@philmds.dts.philips.nl> <1020@vsi1.UUCP> <1571@ficc.uu.net> <469@snjsn1.SJ.ATE.SLB.COM> <1490@basser.oz>
Sender: news@umn-cs.CS.UMN.EDU
Reply-To: mpp@uf.msc.umn.edu (Mike Pritchard)
Organization: Minnesota Supercomputer Center, Inc.
Lines: 19

In article <1490@basser.oz> john@basser.oz (John Mackin) writes:
>
>Well, I admit I wouldn't mind being able to `k' a whole source
>in one go.  But how hard is it just to hit `n' n times?  Not very.
>
>John Mackin, Basser Department of Computer Science,
>	     University of Sydney, Sydney, Australia

Actually, for those of us reading news via NNTP, hitting 'n' can take
a while since each article must be transfered to to the machine you
are reading news from.  For a one or two part source this is not much 
of a bother, but when you get 10+ very large parts using 'n' is not the 
solution.  I usually wind up doing something like '/source name/k' from 
within rn.
It would be nice if rn coule do this for me.
-- 
Mike Pritchard
Internet: mpp@uf.msc.umn.edu  
"If at first you don't succeed, destroy all evidence that you tried."