What would a good PCL benchmark make?

[Mike Thome <mthome@VAX.BBN.COM>]

	Now that we're done washing cars...

	Which features of PCL/CLOS particularly stress the various
PCL implementations?  Do we want to measure the best-case dispatch speed
only, or should we worry about forcing cache misses in our bechmarks?
SLOT-VALUE? Accessors? with-slots?
	I've been using a small program which started its life as an
N-body program - since then its had it's math ripped out and a number
of body classes with odd behaviors added.  It does no consing once it
gets started, very little math, and lots of method calls (with 1 or 2
dispatching args).  What can I do to make it as slow as possible by
beating on pcl?

	-mik