From -2742068326225384357 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: fc772,a175c482da34ebf8 X-Google-Attributes: gidfc772,public X-Google-Thread: f78e5,765aa557d15ef5ba X-Google-Attributes: gidf78e5,public X-Google-ArrivalTime: 2003-05-09 07:30:38 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!lnsnews.lns.cornell.edu!news.litech.org!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!news1.optus.net.au!optus!news.mel.connect.com.au!news.unimelb.edu.au!bounce-back From: allan_w@my-dejanews.com (Allan W) Newsgroups: comp.std.c++,comp.lang.c++.moderated Subject: Re: Preprocessor evolution Date: 09 May 03 14:30:18 GMT Organization: http://groups.google.com/ Lines: 24 Approved: Fergus Henderson Message-ID: <7f2735a5.0305081139.87b2afd@posting.google.com> References: <652361f.0304032218.6b7a67e4@posting.google.com> <3e8f6897.709822312@News.CIS.DFN.DE> <3e920e1f.883270640@News.CIS.DFN.DE> <3e9f0d33@andromeda.datanet.hu> NNTP-Posting-Host: mundook.cs.mu.oz.au X-Trace: ariel.ucs.unimelb.edu.au 1052490637 5063 128.250.34.60 (9 May 2003 14:30:37 GMT) X-Complaints-To: news@news.unimelb.edu.au NNTP-Posting-Date: 9 May 2003 14:30:37 GMT X-Original-Date: 9 May 2003 05:56:14 -0400 Delivered-To: std-c++@ucar.edu X-Submission-Address: c++-submit@netlab.cs.rpi.edu X-Auth: PGPMoose V1.1 PGP comp.lang.c++.moderated iQBVAwUAPrt7M0HMCo9UcraBAQHP3QH/cgf2sm1JQDWJqnFF6zWaPMkN25TRKy1R dr/yABYtzp5VwdrIvDVgIHYi8DVD5qTsd/k2IwvNnuI7bLaL+jhp5w== =vgZO X-Approved-For-Group: francis.moderator@robinton.demon.co.uk comp.lang.c++.moderated X-Scanned-By: MIMEDefang 2.28 X-Spam-Status: No, hits=-5.6 required=5.0 tests=NOSPAM_INC,REFERENCES,SPAM_PHRASE_01_02 version=2.41 X-Auth: PGPMoose V1.1 PGP comp.std.c++ iQBFAgUAPru7feEDnX0m9pzZAQHPhgF+JxnqM8mg85POmZVSXPDLxP8JOrqR9WO9 FPZbl1Dz2QEJPGXO6+g3bV32w189/tJr =wvWX Xref: archiver1.google.com comp.std.c++:19301 comp.lang.c++.moderated:65684 Mike Conley wrote > if we had a preprocessor operator split defined st > > split(index, list) returns the first index elements of list and > split(-index, list) returns the last L - index elements, where L is the > length of the list > > then we could define SUM: > > #defrec SUM(...) \ > #if empty(__VA_ARGS__) 0 \ > #else split(1, __VA_ARGS__) + SUM(split(-1, __VA_ARGS__)) \ > #endif How about #include [ Send an empty e-mail to c++-help@netlab.cs.rpi.edu for info ] [ about comp.lang.c++.moderated. First time posters: do this! ] [ comp.std.c++ is moderated. To submit articles, try just posting with ] [ your news-reader. If that fails, use mailto:std-c++@ncar.ucar.edu ] [ --- Please see the FAQ before posting. --- ] [ FAQ: http://www.jamesd.demon.co.uk/csc/faq.html ]