Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!nuchat!uhnix1!sugar!peter
From: peter@sugar.UUCP (Peter da Silva)
Newsgroups: comp.lang.c
Subject: Re: Structure constants
Message-ID: <874@sugar.UUCP>
Date: Sun, 11-Oct-87 21:40:22 EDT
Article-I.D.: sugar.874
Posted: Sun Oct 11 21:40:22 1987
Date-Received: Thu, 15-Oct-87 04:11:48 EDT
References: <843@usfvax2.UUCP> <667@its63b.ed.ac.uk> <1554@bloom-beacon.MIT.EDU>
Organization: Sugar Land UNIX - Houston, TX
Lines: 13

In article <1554@bloom-beacon.MIT.EDU>, wesommer@athena.mit.edu (William E. Sommerfeld) writes:
> Why limit anonymity to data?  If you're going to do that, why not also
> borrow a trick from Lisp, and include anonymous functions..
> 
> 	qsort(array_int, sizeof(array_int)/sizeof(int), sizeof(int),
> 	      (int (*)(int *a, int *b)) { return *a-*b; });

Beautiful. Truly beautiful. I love it. The one feature of BCPL I didn't
attempt implementing in Small-C. Doable, but a little tricky.

-- 
-- Peter da Silva  `-_-'  ...!hoptoad!academ!uhnix1!sugar!peter
-- Disclaimer: These U aren't mere opinions... these are *values*.