Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!rutgers!iuvax!pur-ee!j.cc.purdue.edu!h.cc.purdue.edu!s.cc.purdue.edu!rsk
From: rsk@s.cc.purdue.edu (Whitewater Wombat)
Newsgroups: news.groups,news.misc,news.software.b
Subject: Re: How long would it take to actually read all of news?
Message-ID: <923@s.cc.purdue.edu>
Date: Thu, 10-Sep-87 09:42:53 EDT
Article-I.D.: s.923
Posted: Thu Sep 10 09:42:53 1987
Date-Received: Sat, 12-Sep-87 09:07:18 EDT
References: <1475@aramis.rutgers.edu>
Reply-To: rsk@s.cc.purdue.edu.UUCP (Whitewater Wombat)
Organization: Purdue University Computing Center
Lines: 12
Summary: Rn has solved this problem in an efficient way.
Xref: mnetor news.groups:1500 news.misc:909 news.software.b:803

In article <1475@aramis.rutgers.edu> webber@aramis.rutgers.edu (Bob Webber) writes:
>Make sense?  Is there a simpler, more efficient way to put it
>together?  Would anyone be interested in seeing the result?

Actually, "rn", and possibly other news-reading programs that I'm not
as familiar with, have already attacked this problem and have made good
progress towards solving it.  The use of rn's "kill files" and 'j' and
'k' commands at the article selection level allows quick weeding of
many articles.
-- 
Rich Kulawiec, rsk@s.cc.purdue.edu, s.cc.purdue.edu!rsk
PUCC News Administrator