Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!purdue!decwrl!labrea!Portia!forel!karish
From: karish@forel.stanford.edu (Chuck Karish)
Newsgroups: comp.unix.questions
Subject: Re: Computational complexity of rm & ls
Message-ID: <871@Portia.Stanford.EDU>
Date: 13 Mar 89 20:11:44 GMT
References: <9000012@m.cs.uiuc.edu> <4461@pt.cs.cmu.edu> <1541@zen.UUCP>
Sender: USENET News System <news@Portia.stanford.edu>
Reply-To: karish@forel.stanford.edu (Chuck Karish)
Organization: Mindcraft, Inc.
Lines: 18

In article <1541@zen.UUCP> frank@zen.co.uk (Frank Wales) wrote:
>In article <4461@pt.cs.cmu.edu> marcoz@MARCOZ.BOLTZ.CS.CMU.EDU (Marco Zagha) writes:
>>In article <9000012@m.cs.uiuc.edu>, wsmith@m.cs.uiuc.edu writes:
>>> [...]   "rm *" seems to be a common
>>> enough idiom that rm could be optimized to handle that case better.

>Maybe adding a '-A' (for All, harder to type than '-a') option to rm would
>be justified.

Great, another feature!  How about using an alias instead:

	alias rmall 'ls -f | xargs rm -f'

This avoids the overhead of sorting the names in the directory.
It also suppresses those annoying queries from rm.

	Chuck Karish	hplabs!hpda!mindcrf!karish	(415) 493-7277
			karish@forel.stanford.edu