00:00:21 I think that the IF command is not needed; the ABORT LOOP command is also not needed except mu-loops. 00:00:31 Nor is built-in addition or multiplication needed. 00:00:56 -!- zzo38 has quit (Remote host closed the connection). 00:02:41 GEB is a book I am Not Reading. 00:04:24 Phantom_Hoover: It's good, just don't trust a word of it. 00:11:38 -!- FlyingTortilla has joined. 00:12:23 car_ () ((((true, b), (true, c), (false, false)), ** ERROR: "cdr called on nil")) ; 00:12:26 this is not going well 00:16:18 elliott, what are you up to? 00:16:50 Phantom_Hoover: programming in c preprocessor 00:17:25 -!- FlyingTortilla has quit (Quit: ChatZilla 0.9.86 [Firefox 3.6.12/20101026200743]). 00:17:44 -!- FlyingTortilla has joined. 00:18:09 elliott, you are completely insane. 00:18:31 -!- FlyingTortilla has quit (Client Quit). 00:18:33 You're a danger to yourself and others. 00:20:11 Phantom_Hoover: Yes. 00:41:00 * Phantom_Hoover → sleep 00:41:04 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:59:00 -!- FireFly has quit (Quit: swatted to death). 01:10:32 gah, cpp programming is so impossible but i love it 01:16:40 pp as in preprocessor or ++? 01:21:26 * Sgeo guesses from context the former 01:21:34 Also, can't imagine elliott playing with C++ for fun 01:22:01 olsner: preprocessor 01:22:14 olsner: i've seen a functional language implemented in cpp so I KNOW it's possible to do this shit 01:22:17 -!- Decarabia has quit (Read error: Connection reset by peer). 01:22:22 (also a recursive fibonacci with BIGNUMS (yes, bignums) in the preprocessor) 01:22:25 i just have to figure out how 01:22:33 elliott: cool, but it's definitely not TC, is it? 01:23:29 olsner: it ... might be if you ignore the recursion limit 01:23:47 olsner: i mean, it has a recursive bignum fibonacci implementation. it doesn't even have *arithmetic* built in. 01:23:52 olsner: so... it's an indicator. 01:23:59 I was under the impression that cpp's evaluation order excluded arbitrary recursion regardless of limits 01:24:15 olsner: it does, but there are "workarounds" 01:24:21 basically you can get the preprocessor confused, in ways i forget how 01:24:43 olsner: see http://groups.google.com/group/comp.lang.c/msg/082ffefaaed3b450 for the recursive fibonacci bignum 01:24:57 I should go get pizza tonight 01:25:02 And then turn into a pizza 01:25:23 Also, I'm still pleasantly surprised that Windows 7 has a 16-bit color option 01:25:37 olsner: I tried to look at the source of Chaos and Order (same repository; Order is a call-by-value functional language with lambdas in cpp) but they're so impossible to read. 01:26:51 Note, BTW, that I'm not suggesting that computing Fibonacci numbers with 01:26:51 the preprocessor is advisable. 01:26:58 (that should have been in quotes) 01:28:36 it would have been so much better if he did suggest that though 01:30:11 Dammit qntm.or 01:30:12 org 01:30:40 damn, I should learn how to do this kind of PP abuse 01:34:41 ehm, wtf, sourceforge.net puts "Download <...> software for free" at the end of the title 01:35:18 olsner: just use the cvs repository 01:35:21 for chaos-pp/order-pp 01:35:35 olsner: damn though, this shit is hard 01:35:43 well, that requires *finding* the cvs repository 01:35:48 olsner: click Develop 01:35:56 olsner: I think it's impossible to do even useful lists without a ton of cpp-abusing infrastructure 01:36:49 well, it was hard to even find the project when sourceforge looks like one of those pages that take your search string and adds "Download foo for free" to it 01:37:46 -!- BeholdMyGlory has quit (Remote host closed the connection). 01:38:39 actually, the rest of sourceforge looks like one of those pages too :/ 01:39:05 olsner: sourceforge is pretty much the worst thing ever. 01:39:15 olsner: http://chaos-pp.cvs.sourceforge.net/viewvc/chaos-pp/ 01:39:19 olsner: or:3 01:39:21 *or: 01:39:24 cvs -d:pserver:anonymous@chaos-pp.cvs.sourceforge.net:/cvsroot/chaos-pp login 01:39:28 cvs -z3 -d:pserver:anonymous@chaos-pp.cvs.sourceforge.net:/cvsroot/chaos-pp co -P chaos-pp 01:39:29 cvs -z3 -d:pserver:anonymous@chaos-pp.cvs.sourceforge.net:/cvsroot/chaos-pp co -P order-pp 01:39:48 yes yes, I *know* how to find the cvs browser on sourceforge :) 01:39:50 :P 01:39:58 olsner: to be honest, if sourceforge died tomorrow the only thing that'd be missing is some downloads. 01:41:19 implying that the rest is not worth saving or that it wouldn't be lost? 01:42:22 olsner: former 01:42:40 olsner: sourceforge today is just a vaguely scummy advert for the now-proprietary and costly software that runs it 01:42:42 -!- Sasha has quit (Remote host closed the connection). 01:43:01 olsner: they try and position themselves as some sort of hub for open source software but it just isn't true; people who don't know better just sign up there for hosting 01:43:09 -!- Sasha has joined. 01:43:50 IMO they *used* to be what they were supposed to be, but it looks like something happened at some time that broke it 01:43:57 broke it pretty badly too 01:44:47 -!- GreaseMonkey has joined. 01:45:11 olsner: I dunno, the software has been proprietary $$$ since ... 2000? 2003? 01:45:29 olsner: so they're really hypocritical to start with, being basically an advert for open source software 01:45:45 olsner: also, their website has always sucked. always. 01:48:11 well, same business model as github then? I don't think they were evil at all around 2004 when I had a project on sourceforge 01:48:46 olsner: err, github don't sell their software. 01:48:57 olsner: github just sell accounts. i think you are very confused :) 01:50:50 "car(cdr(list))" = true ((c, ** ERROR: "car called on nil")) ; 01:50:52 whyyyyyyyfffffffff 01:51:04 maybe... I don't remember sourceforge selling their software back then at least 01:51:30 they had the open-source version of it on sourceforge though 01:51:42 olsner: http://en.wikipedia.org/wiki/GForge#History 01:51:47 olsner: looks like 2000, 2001 to me. 01:58:31 bah, too many files in chaos-pp can't be bothered reading them... saw one with lots of macros though :) 01:59:38 olsner: they're all macros, silly :P 01:59:40 olsner: try order-pp 01:59:44 olsner: that's a language, languages are SIMPLE! 02:00:06 also: damn cvs sucks 02:01:01 sounds like you vastly underestimate the suckage of cvs 02:01:23 olsner: damn...cvs...blowerates? 02:01:46 "blowerates"? 02:01:52 olsner: blowerates. 02:02:36 #define ORDER_PP_CONST(value) 8DEF_CONST,value, 02:02:39 NOTHING IS SIMPLE AND/OR SACRED 02:03:03 was that supposed to be (DEF_CONST? 02:03:06 olsner: no 02:03:08 olsner: it wasn't :) 02:03:13 # define ORDER_PP_8NATIVE(P,v,n,m,ps,...) (,ORDER_PP_FW(TYPE_CHECK,(,ORDER_PP_TUPLE_AT_0 ps##P,P##v,ORDER_PP_LIT_IS_0))(,P##n)(ORDER_PP_8NATIVE_,LAST,MORE)(,P##n,P##m,P##ps,P##v),P##__VA_ARGS__) 02:05:06 olsner: it would help if it was commented 02:05:29 #define ORDER_PP_FIND(_) ORDER_PP_FX(EVAL,(ORDER_PP_FIND_GT_0())) 02:05:29 #define ORDER_PP_EVAL(i) ORDER_PP_EVAL_##i 02:05:30 what 02:05:51 #define ORDER_PP_OUTPUT(s) ORDER_PP_FX(OUTPUT_EMIT_A,ORDER_PP_CM(,ORDER_PP_OUTPUT_PAIR_A (,0,)s(0,),8OUTPUT_STOP,))) 02:05:52 HOW HARD CAN IT BE 02:05:55 #define ORDER_PP_OUTPUT_F (, 02:05:56 WHAT 02:05:56 /* THIS WAS HARD TO WRITE IT SHOULD BE HARD TO READ DAMMIT */ 02:06:03 #define ORDER_PP_OUTPUT_EMIT_3(P,...) ,P##__VA_ARGS__ 02:06:04 #define ORDER_PP_OUTPUT_EMIT_4(P,...) (P##__VA_ARGS__ 02:06:04 #define ORDER_PP_OUTPUT_EMIT_5(P,...) )P##__VA_ARGS__ 02:06:08 what is this i don't even 02:06:21 #define ORDER_PP_DEF_8if(b,c,...) 8EVAL_IF,b,c,ORDER_PP_IS_TUPLE_SIZE_1(,0##__VA_ARGS__)(,ORDER_PP_REM,8do)(__VA_ARGS__), 02:06:22 fffffffffff 02:06:24 it's all the same! 02:06:41 example/bottles.c 02:06:41 oh joy 02:06:44 http://news.pinkpaper.com/NewsStory/4319/18/11/2010/countries-vote-to-accept-execution-of-gays.aspx 02:06:45 / The following chapters gradually introduce and formally define 02:06:45 / the elements of the Order language, but in this section we will 02:06:45 / take a brief informal look at a concrete example. The code 02:06:45 / snippets that we will show in this section may look ``funny'' and 02:06:45 / may be difficult to understand on first reading, but you 02:06:45 / shouldn't worry about it. You may want to read this section again 02:06:47 / after you've finished a few more chapters. 02:06:50 olsner: the examples are literate cpp. 02:07:08 olsner: 02:07:08 8cond((8greater(8N, 1), 02:07:08 8separate(8N, 8quote(bottles))) 02:07:08 (8equal(8N, 1), 02:07:09 8quote(1 bottle)) 02:07:11 (8else, 02:07:13 8quote(no more bottles))) 02:07:20 you can't make this shit up 02:08:11 all those tokens starting with digits look weird, I guess they are part of the trick 02:08:24 I hate everyone sometimes 02:08:43 olsner: no 02:08:47 olsner: they're just names to not clash 02:08:49 Sgeo: what 02:08:55 olsner: pretty sure 02:09:02 elliott, what I just linked to 02:09:16 names can't start with digits, those should just be invalid integers 02:09:23 lol @ UN 02:09:24 olsner: dude, it's cpp 02:09:28 olsner: names can start with digits. 02:09:32 olsner: you're thinking in C! 02:09:34 C is EVIL 02:09:35 cpp is the one 02:11:37 <3 C 02:11:45 indeed I am thinking in C, and I have barely scratched the surface of the beast that is CPP 02:12:07 * Sgeo suddenly wants to learn B 02:12:38 BOBOL 02:12:42 Gregor: C is not as good as cpp. 02:13:10 Gregor: After all, all your "C" programs are actually just cpp programs that require TWO ADDITIONAL STEPS to be run. 02:13:29 Gregor: Running it through the "C" compiler, and then running the resulting binary. 02:13:31 Yeah, but CPP isn't* TC**. 02:13:35 *: As far as we know. 02:13:36 Gregor: Whereas cpp programs just require cpp to run! 02:13:45 **: And depending on how pedantic you are, maybe C isn't either. 02:14:00 Gregor: Mm, I dunno man, this functional language does 99 bottles of beer, and I've seen a recursive fibonacci function that uses bignums -- in cpp -- well... 02:14:09 surely, C with infinite memory must be TC? 02:14:13 olsner: you can't have that 02:14:20 olsner: sizeof(void *) must be finite 02:14:28 olsner: admittedly, char could be a bignum 02:14:32 and thus sizeof(void *) = 1 02:14:38 olsner: but iirc there was a problem with *that* too 02:14:48 oh 02:14:50 I think we've had this discussion before 02:14:50 olsner: CHAR_BIT 02:14:54 we've had it many tmies. 02:14:57 *times. 02:15:09 olsner: but yeah, (void *) has to be n*CHAR_BIT bits for some n 02:15:16 and CHAR_BIT has to be finite, obviously 02:15:24 (because char is an integral type and infinity isn't an integer) 02:15:41 olsner: C/POSIX is PROBABLY TC because of files. 02:15:42 but who knows 02:16:17 just connect to the tape server over TCP and it's turing complete? :) 02:16:25 LOL: 02:16:26 / Undoubtedly the first thing to notice was the prefix `8'. It 02:16:26 / is a prefix of \emph{all} Order expressions and its purpose is to 02:16:26 / prevent \emph{unintended macro replacement} of Order expressions. 02:16:26 / A token that starts with a digit, like `8cond', is called a 02:16:26 / \emph{pp-number} and because it isn't an \emph{identifier} it 02:16:28 / isn't subject to macro replacement. 02:16:30 olsner: that's why 8 is used 02:16:42 The use of pp-numbers is 02:16:43 / admittedly an ugly detail, but it is absolutely necessary, 02:16:43 / because otherwise an Order expression might get macro replaced by 02:16:43 / a user or standard defined macro, like the \emph{abominable} 02:16:43 / macro `I' incredibly defined by the C standard\footnote{There 02:16:43 / aren't words strong enough that I could credibly use here to 02:16:45 / describe what I think about the quality of certain parts of the C 02:16:47 / standard \cite{c:1999}.}, 02:16:53 this is the worst thing ever :D 02:17:14 'I' is a predefined macro? wtf? 02:17:20 olsner: yes, it's i 02:17:25 as in i^2 = -1 02:18:21 Gregor: think i should troll the esolangs wiki, wrt TCness? 02:18:33 hah, there it is, #define I _Complex_I 02:18:37 elliott: Always. 02:18:41 Gregor: I'm so tempted to put up a language, Brainfalt or Brainfault or something (brainfuck + halt), defined to be the set of brainfuck programs that halt. 02:19:15 Gregor: This language is of course completely unimplementable -- well, you can't provide diagnostics on every invalid program, rather. 02:19:25 Gregor: (But you can define "loop forever" as the error reporting system.) 02:19:26 Gregor: But: 02:19:35 Gregor: I will provide a complete, error-giving interpreter in Banana Scheme. :-) 02:19:54 8fn(8N, 02:19:54 8cond((8greater(8N, 1), 02:19:54 ... 02:19:54 8quote(no more bottles)))) 02:20:02 8print(8ap(8B, 8N) (of beer on the wall,) 8space 02:20:02 8ap(8B, 8N) (of beer,) 8space 02:20:02 (take one down, pass it around,) 8space 02:20:02 8ap(8B, 8dec(8N)) (of beer on the wall.)) 02:20:06 8for_each_in_range 02:20:08 this is so beautiful 02:20:36 8for_each_in_range(foo, 1, 100) 02:20:38 8for_each_in_range(foo, 100, 1) 02:20:42 both do the right thing 02:20:45 ascending vs. descending 02:20:47 this man is so crazy 02:20:58 Invite him to #esoteric 02:21:24 no 02:21:27 that's a lame thing to do 02:23:36 int main(void) { 02:23:36 printf(AVERAGE(3, 1, 4, 1, 5, 9, 2, 6, 5) == 4 02:23:36 ? "OK.\n" 02:23:36 : "ERROR!\n"); 02:23:36 return 0; 02:23:37 } 02:23:39 Gregor: how is this even possible 02:23:42 why did nobody tell met his exists 02:23:44 *me this 02:23:53 LOL 02:23:53 LOL 02:23:54 LOL 02:23:55 Gregor: olsner: 02:23:57 / It is probably safe to say that, compared to an average function 02:23:57 / implemented using C++ template metaprogramming techniques, our 02:23:57 / macro is both simpler and more flexible. 02:24:05 This is the one thing *MORE COMPLICATED* than C++ templates. 02:25:04 well, batshit insane is what it is 02:25:14 olsner: *genius 02:25:24 same thing? :) 02:25:40 at least they're not mutually exclusive 02:25:45 I know how to convince elliott to give up on caring: I just need to have an affair with cpp 02:26:09 Sgeo: don't worry; I don't believe that you could produce a working program of any complexity in cpp 02:26:14 Sgeo: because, for instance, I can't 02:27:07 olsner: you know what would make me kill myself because life couldn't possibly get any better? 02:27:13 olsner: an implementation of m4 in cpp 02:27:24 just encode all the nasty special chars with, like, ASCII_37 and the like 02:27:29 dear god it would be beautiful 02:27:36 (or even all the chars full stop :P) 02:29:35 #define AVERAGE(...) \ 02:29:35 ((ORDER_PP(8seq_for_each_with_delimiter \ 02:29:35 (8put, \ 02:29:35 8emit(8quote(+)), \ 02:29:35 8tuple_to_seq(8quote((__VA_ARGS__)))))) / \ 02:29:35 ORDER_PP(8to_lit(8tuple_size(8quote((__VA_ARGS__)))))) 02:29:43 olsner: the craziest thing is, this is meant to be useful 02:29:46 olsner: for code generation 02:29:54 olsner: you can see above it actually *integrates* with everything else 02:30:04 oh, so it wouldn't take raw m4, but m4 encoded as a sequence of ascii_n tokens? 02:30:10 olsner: right 02:30:13 olsner: or just _n really 02:30:19 olsner: you could even have MNEMONICS 02:30:21 _lparen 02:30:23 _comma 02:30:25 etc. :P 02:30:34 olsner: interpreting m4 is obviously impossible 02:30:38 olsner: the great thing is, m4 lets you reassign quote chars 02:30:46 olsner: so this would actually have to interpret ascii values differently as it goes along 02:30:47 :D 02:30:49 and stuff 02:31:00 well, how hard can it be? 02:31:15 olsner: everything is either easy or impossible, that's my rule 02:31:36 hmm, so there's really no point in doing anything at all then? :) 02:31:38 now to read chaos, not order 02:31:44 olsner: no, easy things are good 02:32:04 olsner: lol, chaos headers use # instead of blank lines 'cuz blank lines would show up in cpp output 02:32:11 in fact, even the comment blocks are in #s 02:32:29 oh jesus @ chaos/preprocessor/list/core.h 02:32:33 # define CHAOS_PP_LIST_NIL() ... 02:32:36 can't make this shit up 02:32:50 lol for every x there's #define x_ID() x 02:32:58 # define CHAOS_PP_LIST CHAOS_PP_LIST 02:32:58 # define CHAOS_PP_LIST_ID() CHAOS_PP_LIST 02:33:05 # if CHAOS_PP_VARIADICS 02:33:06 # define CHAOS_PP_LIST_ CHAOS_PP_LAMBDA(CHAOS_PP_LIST) 02:33:06 # endif 02:33:35 # include 02:33:37 olsner: ^ 02:33:38 not joking. 02:34:02 # define CHAOS_IP_BUBBLESORT_3(_, s, pred, _p, type, first, rest, size, pd) \ 02:34:03 CHAOS_PP_IIF _(_p()(s, pred, CHAOS_PP_ITEM(type, CHAOS_PP_REM first) CHAOS_PP_COMMA() CHAOS_PP_ITEM(type, CHAOS_PP_HEAD(rest)) CHAOS_PP_EXPOSE(pd)))( \ 02:34:03 CHAOS_PP_CONS _( \ 02:34:03 CHAOS_PP_EXPR_S _(s)(CHAOS_IP_BUBBLESORT_INDIRECT _(2)( \ 02:34:03 CHAOS_PP_NEXT(s), pred, _p, type, rest, size, pd \ 02:34:04 )), \ 02:34:06 CHAOS_PP_REM first \ 02:34:08 ), \ 02:34:10 ... 02:38:07 heh, order-pp/doc/ contains a single file that starts by saying "not intended to serve as documentation" 02:38:57 * Sgeo wonders if #esoteric would ever play Diplomacy 02:43:47 olsner: :D 02:47:19 olsner: i think chaos-pp is a better source for cpp programming 02:47:23 it has docs, seemingly, of some sort. kinda 02:47:28 Positive arbitrary-precision values are represented as a sequence of base-10 digits. For example, the value +123 is represented as (1)(2)(3). Negative values are represented as a parenthesized sequence of base-10 digits. For example, the value -123 is represented as ((1)(2)(3)). 02:47:33 olsner: you can't make this shit up 02:48:37 "As such, it assumes a strictly conformant preprocessor in an effort to reduce limitations and provide motivation for vendors to fix their broken preprocessors." 02:48:54 "because of this one insane guy's insanity, we have revamped our entire c preprocessor. it is now 3x slower and standards compliant, enjoy" 02:49:11 i like how many pages are just "..." 02:49:18 A list is a data structure resembling a cons-style singly linked list. A list is either an ellipsis (...), which represents a nil list, or a binary tuple whose first element is an element in the list and whose second element is another list. For example, 02:49:19 (a, (b, (c, ...))) 02:49:19 hmm 02:49:25 that ... has to be some clever thing with varargs, i just know it 02:49:46 Remarks 02:49:47 This macro exists only for uniformity with other macros that require indirect invocation. 02:49:48 on _ID() 02:49:52 * elliott notes that that's what that's for to himself 02:50:16 olsner: wow, they even maintain C89 compatibility; there's little notes everywhere saying "C99 Specific" 02:50:22 olsner: C89 *had no variadic macros* 02:51:23 "Remarks 02:51:23 This macro effectively allows CHAOS_PP_LIST_CONS to pass through itself without becoming disabled." 02:51:55 probably everything does x##_id() everywhere :D 02:52:14 haha, it works 02:54:37 test.h:13:1: error: pasting ")" and "_id" does not give a valid preprocessing token 02:54:39 that's what she said 02:58:15 olsner: yay, I have lists working! 03:03:27 and nilp! 03:21:26 10 pages, that's how long the whole preprocessor section of the C++ standard is 03:21:50 heh 03:22:00 olsner: gah, i hate how cpp is pretty much DESIGNED to stop you doing this 03:22:15 olsner: by figuring out you're making a constructed macro call and stopping it 03:22:22 -!- augur has joined. 03:22:43 yeah, it's very much not supposed to be used for metaprogramming 03:24:15 elliott, lolwhat? 03:24:16 Why? 03:24:18 And how? 03:24:37 Sgeo: what 03:24:40 olsner: BUT I MUST 03:24:54 How is cpp designed to stop you doing it? 03:25:38 RTFGoogle 03:25:43 It's too difficult to explain :P 03:38:11 coppro: I've forgotten what C is now, it's all just cpp for me 03:49:09 erm 03:49:10 *olsner: 03:49:16 i cannot figure out how to do naturals :D 03:49:20 this is the most difficult language ever 03:50:00 didn't you just quote how chaos-pp did naturals? :) 03:58:38 * Sgeo would be more interested in how to do reals 03:58:44 Computers don't have infinite memory 03:59:35 olsner: " (The ??= token is a trigraph for #. It is used here to visually disambiguate this inclusion from a normal file inclusion because it is definitely not normal. The %: digraph can also provide such disambiguation. Neither is necessary.)" 03:59:45 olsner: also, no, i quoted how it does arbitrary-precision numerals :) and i just want peano! 03:59:53 *"(T 04:00:04 #define CHAOS_PP_ITERATION_PARAMS (1)(10)("file.h") 04:00:04 ??=include CHAOS_PP_ITERATE() 04:00:10 well, how can that be hard if you already have lists? 04:00:38 olsner: i thought i had lists, but just couldn't get map to work 04:00:41 i'm starting from the basics now 04:00:53 elliott: oh, the ??= makes that *really* clear 04:01:04 olsner: totally 04:01:15 olsner: that includes file.h 10 times btw :) 04:02:46 olsner: chaos-pp/built-docs/roman-numerals.html 04:02:48 What would happen if you didn't have the (1) 04:02:49 olsner: can't make this shit up. really can't 04:02:53 Sgeo: uh, it'd break? 04:03:08 How and why? 04:03:22 elliott: except that obviously they did make it up! 04:03:23 because it's a range? 04:03:31 stop being dense, you can't just call an interface in the wrong way like that 04:03:46 I thought it was one number 04:04:22 Wasn't (5)(4)(0) for example 540? 04:12:37 " An active argument is an argument that expands each time that it is scanned by the preprocessor. For example," 04:12:39 Sgeo: sigh 04:12:43 Sgeo: that's a separate thing. 04:12:57 I'm not paying close attention, sorry 04:13:20 olsner: " Not all useful active arguments reach a terminal state. The following code produces an infinite list:" 04:13:23 olsner: *"N 04:13:29 olsner: ok, i'm convinced; cpp is probably TC. 04:13:45 (ignoring recursion limit) 04:13:55 oh my 04:13:56 Can you eliminate the recursion limit somehow? 04:14:01 [[(Because this code is using saturation arithmetic, the value eventually will reach CHAOS_PP_LIMIT_MAG, causing an infinite list of values saturated to CHAOS_PP_LIMIT_MAG from that point on.)]] 04:14:06 could always use its arbitrary-precision stuff 04:14:10 Sgeo: no. not without modifying cpp(1) 04:15:36 olsner: built-docs/binary-literals.html 04:16:03 #define BINARY(string) BINARY_S(CHAOS_PP_STATE(), string) 04:16:03 #define BINARY_S(s, string) \ 04:16:03 CHAOS_PP_ARBITRARY_DEMOTE( \ 04:16:03 CHAOS_PP_EXPR_S(s)(CHAOS_PP_FOLD_LEFT_S( \ 04:16:03 s, OP, (CHAOS_PP_STRING) string, (0) \ 04:16:04 )) \ 04:16:06 ) \ 04:16:08 /**/ 04:16:10 #define OP(s, bit, x) \ 04:16:12 CHAOS_PP_ARBITRARY_ADD( \ 04:16:14 CHAOS_PP_ARBITRARY_MUL(x, (2)), (bit) \ 04:16:16 ) \ 04:16:18 /**/ 04:16:20 the final, clear version :P 04:16:41 "(The BYTE_ boilerplate can be pre-generated with a small program such as the following: ...)" 04:16:45 but that's what the preprocessor is for! 04:16:55 clearly we need cpppp 04:17:06 c(pp)^n 04:17:24 or cp^2n of course 04:18:02 olsner: then it goes to arbitrary bases :P 04:18:05 c(pp)^inf 04:18:17 night; i'll continue cpping tomorrow :P 04:18:20 -!- elliott has quit (Quit: Leaving). 04:20:46 -!- bsmntbombdood has quit (Ping timeout: 255 seconds). 04:24:04 -!- bsmntbombdood has joined. 04:35:05 -!- HackEgo has quit (Ping timeout: 245 seconds). 04:35:16 -!- EgoBot has quit (Ping timeout: 264 seconds). 04:35:46 -!- rodgort has quit (Ping timeout: 265 seconds). 04:36:21 -!- Gregor has quit (Ping timeout: 255 seconds). 04:40:32 -!- augur has quit (Remote host closed the connection). 04:41:40 -!- augur has joined. 04:43:20 -!- augur has quit (Remote host closed the connection). 04:49:37 what the... ls does case-insensitive sorting nowadays 04:49:40 -!- Gregor has joined. 04:49:51 * Sgeo is a geostationary platform 04:51:42 http://www.webwire.com/ViewPressRel.asp?aId=127043 04:52:35 -!- zzo38 has joined. 05:09:02 Sgeo: congratulations! 05:13:08 -!- Sasha has quit (Read error: Connection reset by peer). 05:16:34 Do you like the book "Copper, Silver, Gold: An Indestructable Metallic Alloy"? 05:16:47 -!- Sasha has joined. 05:18:58 * Sgeo hasn't heard of it until now 05:22:09 Perhaps you would prefer "Giraffes, Silver, Gold"? Or "Copper, Elephants, Gold"? Or maybe even "Copper, Silver, Baboons"? 05:23:02 Oh, you're not naming currently existant books 05:25:54