Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site osu-dbs.UUCP
Path: utzoo!linus!security!genrad!decvax!harpo!floyd!clyde!ihnp4!cbosgd!osu-dbs!wyant
From: wyant@osu-dbs.UUCP (Geoff Wyant)
Newsgroups: net.lang.lisp
Subject: queueing operations in pure lisp
Message-ID: <440@osu-dbs.UUCP>
Date: Sun, 18-Dec-83 15:58:51 EST
Article-I.D.: osu-dbs.440
Posted: Sun Dec 18 15:58:51 1983
Date-Received: Tue, 20-Dec-83 02:16:42 EST
Organization: Ohio State U., CIS Dept., Columbus
Lines: 2

Does anyone know of any reasonably fast queueing algorithms in pure lisp -
i.e. not using replaca, replacd, or their relatives ?