00:02:54 -!- doesthiswork_ has quit (Quit: Page closed). 00:06:42 -!- ion has quit (Ping timeout: 252 seconds). 00:08:40 -!- ion has joined. 00:13:04 -!- nooodl has quit (Ping timeout: 264 seconds). 00:21:33 -!- augur has quit (Remote host closed the connection). 00:22:05 -!- augur has joined. 00:22:43 -!- ion has quit (Ping timeout: 260 seconds). 00:24:09 -!- Sprocklem has joined. 00:26:45 -!- augur has quit (Ping timeout: 248 seconds). 00:33:11 -!- doesthiswork has joined. 00:36:02 -!- bitlion_r has joined. 00:36:06 -!- ion has joined. 00:37:33 -!- Sorella` has joined. 00:38:57 -!- lambdabot has quit (Remote host closed the connection). 00:38:57 -!- Halite[tablet] has quit (Ping timeout: 250 seconds). 00:39:29 int-e: eek 00:40:27 hm int-e doesn't look overly present either. 00:40:39 -!- Halite has joined. 00:41:41 -!- int-e_ has joined. 00:43:11 -!- lambdabot has joined. 00:43:39 -!- heroux_ has joined. 00:43:50 > var$"wh"++repeat'e' 00:43:55 Not in scope: repeat'e' 00:43:58 oops 00:43:59 Perhaps you meant `repeated' (imported from Control.Lens) 00:44:03 > var$"wh"++repeat 'e' 00:44:04 wheeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee... 00:45:18 -!- FreeFull_ has joined. 00:46:03 -!- Sorella has quit (Ping timeout: 250 seconds). 00:46:05 -!- int-e has quit (Remote host closed the connection). 00:46:05 -!- contrapumpkin has joined. 00:46:06 -!- heroux has quit (Ping timeout: 250 seconds). 00:46:06 -!- copumpkin has quit (Ping timeout: 250 seconds). 00:46:08 -!- FreeFull has quit (Ping timeout: 250 seconds). 00:46:10 -!- heroux_ has changed nick to heroux. 00:47:40 -!- drlemon has quit (Read error: Connection timed out). 00:47:59 -!- Sorella` has changed nick to Sorella. 00:48:00 -!- Sorella has quit (Changing host). 00:48:00 -!- Sorella has joined. 00:49:09 -!- Sgeo has joined. 00:49:34 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds). 00:50:21 -!- Tesseract has joined. 00:50:59 @tell myname where do i find said implementation? <-- it says you have to email immibis hth 00:51:00 Consider it noted. 00:51:38 (i think i saw immibis around on the net recently too.) 00:55:16 -!- tertu has joined. 00:56:17 -!- ter2 has joined. 00:57:13 -!- ShadowNinja has quit (*.net *.split). 00:57:41 -!- tertu3 has quit (Ping timeout: 248 seconds). 00:58:18 -!- Phantom_Hoover has joined. 00:59:35 -!- tertu has quit (Ping timeout: 260 seconds). 01:06:39 -!- carado has quit (Ping timeout: 252 seconds). 01:08:21 -!- ion has quit (Ping timeout: 248 seconds). 01:12:15 -!- augur has joined. 01:12:33 -!- augur has quit (Remote host closed the connection). 01:12:41 -!- augur has joined. 01:15:13 typeof(*p) *_________p1 = (typeof(*p)*__force )ACCESS_ONCE(p); 01:15:22 http://livegrep.com/search/linux?q=\b_________[a-z] 01:16:43 -!- ion has joined. 01:17:14 jesus 01:17:42 \rainbow{LINUX} 01:18:09 want to make a distro called Jesus Rainbow Linux? 01:18:11 is "typeof(*p) *" different from "typeof(p)" given that p is a pointer 01:18:31 probably 01:18:37 great 01:19:18 -!- Lymia has joined. 01:19:50 maybe it's for discarding cv-qualifiers 01:20:01 meaning const and volatile 01:20:33 oh cool the gcc example of typeof is just an avoiding multiple evaluation thing :/ 01:21:15 " typeof (typeof (char *)[4]) y;" also 01:21:24 and what the christ is __force for 01:21:26 https://github.com/torvalds/linux/blob/v3.11/tools/perf/util/include/linux/compiler.h#L18 01:21:35 maybe it's an annotation to Sparse, like __user? 01:21:57 Bike: what 01:22:12 it is equivalent to char *y[4];, supposedly 01:23:28 docs don't mention const or volatile though 01:25:10 also if p is an array type 01:25:27 then typeof(*p)* will be a pointer and not an array, I expect 01:25:36 i don't know shit about arrays :( 01:25:41 (or C in general) 01:26:14 they say the first step to truly understanding C is understanding that arrays are just pointers, and the second step is understanding that arrays are not just pointers 01:26:46 (it's more correct to say that array types decay into pointer types in certain circumstances) 01:26:56 Almost all circumstances. 01:27:37 I think there are only two non-decay things you can do with an array. 01:27:46 sizeof 01:27:53 And & 01:27:58 * kmc nods 01:28:09 http://mauke.hopto.org/stuff/c/array-pointer.html says so. 01:28:11 and now typeof 01:28:19 and _Alignof prolly 01:28:21 :p 01:28:26 for int a[10], a and &a have the same integral value, but not so for int *a 01:29:00 I,I the first step to understanding C is understanding that functions are just pointers to functions 01:29:07 oh it's alignof(type) but _Alignas 01:29:42 shachaf: :3 01:29:57 well that's not too hard to understand 01:30:30 i like how the f in f(x) isn't a function but a function pointer 01:31:13 i like how C has function types and they're almost useless until C++11 std::function comes along 01:31:38 what can you even do with them 01:31:44 you can get a sizeof error 01:32:01 typedef void fty(int); fty *ptr = whatever 01:32:08 are they not checked? 01:32:17 could be useful for "poor man's templates" i.e. macros generating data structure code 01:32:50 like all this stuff https://github.com/CentOS/ksplice/blob/master/objcommon.h 01:36:42 -!- contrapumpkin has changed nick to copumpkin. 01:41:17 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 01:41:57 -!- ter2 has quit (Ping timeout: 248 seconds). 01:42:25 i did typedef void ty(int); int main() { ty x; } 01:42:38 and I was expecting it to complain that a function type is incomplete 01:42:41 but actually it's fine! 01:42:47 it just declares (locally) a function named x 01:42:54 you can do that without the typedef, too 01:43:01 weird old code declares printf and stuff that way 01:43:11 compilers hate this 1 weird old trick to declare printf 01:43:26 declares it with extern linkage i guess, because that's the default for functions, never mind what syntax you use 01:43:27 Note that in standard C you can only have local declarations, not local definitions of functions. 01:43:31 right 01:43:59 I knew about local function declarations but had forgotten they can look like "ordinary" decls using typedef 01:44:19 also these are the source of one of C++'s many syntactic warts 01:44:53 is Foo x(bar) a declaration of a function or a definition of a Foo object with a constructor argument? 01:46:52 i think it's the former and you have to use Foo x = Foo(bar) for the latter 01:46:53 but i forgot 01:48:04 it depends on what Foo is I think 01:48:10 maybe what bar is too 01:48:18 heh 01:48:21 like all of C++ 01:48:59 `quote 1143 01:49:00 1143) A Swede who was in #esoteric / Thought his rhymes were a little generic. / "I might use, in my prose, / ꙮs, / But my poetry's alphanumeric." 01:49:12 `quote ꙮ 01:49:14 1143) A Swede who was in #esoteric / Thought his rhymes were a little generic. / "I might use, in my prose, / ꙮs, / But my poetry's alphanumeric." 01:49:18 but ꙮ is alphanumeric!! 01:49:36 Category: Letter, Other [Lo] 01:49:36 scandal rocks the unicode poetry establishment 01:49:54 `run grep ꙮ wisdom/* 01:49:56 No output. 01:50:02 "the scoundrel doesn't even know his general categories", sources complain 01:50:06 `run grep ꙮ quotes 01:50:08 A Swede who was in #esoteric / Thought his rhymes were a little generic. / "I might use, in my prose, / ꙮs, / But my poetry's alphanumeric." 01:50:25 i am just surprised that one wasn't already added somewhere. 01:51:04 * kmc fucking off now, ttyl 01:51:13 have fucking fun 01:51:19 kmc: hm is it Other just because there is only one instance so no way to make an upper/lower case pair? 01:51:39 presumably it's lower case in principle. 01:51:49 oh wait 01:51:55 is Lo for lower. 01:52:28 then wtf does Other mean. 01:52:47 CYRILLIC LETTER MAJUSCULE MULTIOCULAR O WITH COMBINING PENIS ABOVE 01:53:32 oerjan: looks like lowercase is Ll, no 01:53:44 aha 01:54:11 so Lo is just an abbreviation for the stuff before. 01:54:25 for letter other, yeah 02:01:15 -!- SingingBoyo has quit (Ping timeout: 240 seconds). 02:11:13 * oerjan wonders what boily will say to having to get multiocular o into the pdf 02:11:31 i suspect quebecois swearing. 02:12:14 *québécois 02:15:25 I think it sends latin1 (or cp1252) if possible, but decodes as utf8 if possible <-- i assume this means it can encode it into something it decodes wrongly 02:17:30 I thought that case was handled? 02:17:43 (Sending something that can be wrongly decoded into UTF-8.) 02:17:47 Then again, maybe not. 02:18:30 hm ok 02:18:45 imo don't trust me 02:19:27 ^ord ꙮ 02:19:27 234 153 174 02:20:54 i suppose it might be rare 02:22:05 > chr <$> [234, 153, 174] 02:22:06 "\234\153\174" 02:22:12 so helpful 02:22:29 > var $ chr <$> [234, 153, 174] 02:22:30 ê® 02:22:51 ^ord ê® 02:22:51 195 170 194 174 02:23:14 `ord ê® 02:23:16 234 174 02:23:25 it just skipped 153? 02:23:39 > var "\153" 02:23:58 UM 02:24:12 > "\153" 02:24:13 "\153" 02:24:20 > var "" 02:24:21 Terminated 02:25:00 hm i suppose it's in the control code part 02:25:17 `ord ê® 02:25:18 234 153 174 02:26:03 would someone with xchat try and copy/paste that 02:34:33 -!- Sgeo_ has joined. 02:36:04 uh oh lambdabot is becoming skynet 02:36:23 wat 02:36:36 ...oh 02:36:43 lambdabot 6:24 Terminated 02:36:56 -!- Sgeo has quit (Ping timeout: 240 seconds). 02:36:56 -!- Halite has quit (Ping timeout: 240 seconds). 02:37:33 why can't we just add cencoding control codes to irc the same way mirc added color codes 02:37:52 -!- Halite has joined. 02:38:02 how would you encode the codes 02:38:27 they would be the first byte in a message. no encoding necessary. 02:38:41 same way html works kinda 02:38:55 -!- olsner has quit (Ping timeout: 272 seconds). 02:43:36 -!- olsner has joined. 02:48:24 http://theshovel.com.au/2013/12/09/man-forced-to-watch-concert-through-his-own-eyes/ 02:49:17 -!- Bike has quit (Read error: Connection reset by peer). 02:49:33 -!- Bike has joined. 02:51:53 -!- ter2 has joined. 02:54:22 “including some odd claims such as that the watch had 1080p resolution (huh? on a watch?!?)” Comments that will amuse in 15 years. http://www.techdirt.com/articles/20131207/02231325495/kickstarter-projects-getting-called-out-just-reselling-products-china.shtml 02:56:57 -!- ter2 has quit (Ping timeout: 240 seconds). 03:02:29 -!- ter2 has joined. 03:03:52 -!- Tesseract has changed nick to ShadowNinja. 03:13:40 is Lambdabot 6:24 a bible verse 03:15:05 Robot bible 03:18:35 The Good Book 3.0 03:21:22 The Fully Functional Book 03:22:07 dammit kmc you beat me to the futurama reference 03:22:12 Related? http://kingjamesprogramming.tumblr.com/ 03:22:51 :D 03:23:10 Has the Futurama theorem been used for anything outside of Futurama? 03:23:18 -!- yorick has quit (Remote host closed the connection). 03:23:26 is that the one about body switching 03:23:44 Yes 03:24:23 More generally it's about permutations that you can only do once per pair 03:24:37 Yes 03:27:47 22:14 03:27:47 The mouth of strange women is a deep and wonderful property of computation. 03:28:10 I know right 03:29:22 -!- Fiora_ has joined. 03:29:37 fiora prime, destroyer of worlds 03:29:39 -!- Fiora has quit (Disconnected by services). 03:29:45 -!- Fiora_ has changed nick to Fiora. 03:30:36 there can be only one 03:31:54 -!- tertu3 has joined. 03:33:48 -!- tertu has joined. 03:33:57 actually I'm rather fond of multiple return values 03:35:27 -!- ter2 has quit (Ping timeout: 260 seconds). 03:36:01 As in a tuple? Or as in generators? 03:36:05 -!- tertu3 has quit (Ping timeout: 248 seconds). 03:36:53 -!- ter2 has joined. 03:37:53 hey Fiora remember when i was talking about bifurcation? get a load of this http://en.wikipedia.org/wiki/File:Verhulst-Mandelbrot-Bifurcation.jpg 03:38:58 O_O 03:39:49 -!- tertu has quit (Ping timeout: 248 seconds). 03:40:13 -!- tertu has joined. 03:40:17 http://en.wikipedia.org/wiki/Mandelbrot_set#Main_cardioid_and_period_bulbs more deets 03:41:25 -!- ter2 has quit (Ping timeout: 248 seconds). 03:41:49 Why do they call them cardioids 03:41:53 When they are clearly butt shaped 03:41:58 Glutoids 03:42:28 -!- ter2 has joined. 03:42:44 man i think i need a copy of counterexamples in topology just to understand all the definitions 03:43:01 I have a great counterexample book 03:43:12 It's just a big book of 500 counterexamples in math 03:43:15 Pretty useful 03:43:29 -!- tertu3 has joined. 03:45:41 -!- tertu has quit (Ping timeout: 248 seconds). 03:46:38 -!- tertu has joined. 03:46:45 -!- ter2 has quit (Ping timeout: 248 seconds). 03:47:49 -!- tertu3 has quit (Ping timeout: 248 seconds). 03:49:29 -!- doesthiswork has quit (Read error: Connection reset by peer). 04:12:15 -!- ter2 has joined. 04:15:01 -!- tertu has quit (Ping timeout: 248 seconds). 04:33:56 -!- tertu3 has joined. 04:37:59 -!- ter2 has quit (Ping timeout: 272 seconds). 04:46:44 -!- iamcal___ has joined. 04:48:52 -!- iamcal___ has changed nick to iamcal. 04:49:00 Slereah: does it tell what they are countereamples for 04:49:18 because i think it would be more awesome if it didn't 04:49:34 just a list of numbers you should test your conjecture on 04:50:22 "14235. Good luck, champ." 04:50:24 -!- iamcal has quit (Client Quit). 04:50:46 heh 04:50:52 Nah, it's pretty specific 04:50:53 -!- iamcal has joined. 04:51:20 Like the first chapter is counterexamples of set theory 04:52:02 Then group theory, rings and fields, vector spaces, real numbers, series, real functions, integrals and so on 04:53:30 hm, i can improvise for sadly few of those 04:53:31 -1-38-38.dsl.dynamic.sonic.net] has joined #yackfest 04:53:33 oops. 04:54:24 I'm disappointed, this channel does not exist 04:54:54 Well, if you want some of the counterexamples 04:55:02 whether a barber cuts their own hair (naïve set theory), pi (all reals are algebraic), lim n->\infty x -> x^n (the limit of a series of continuous functions is continuous) 04:55:33 1) forall x exists y P(x,y) is true while exists y forall x P(x,y) is false 04:56:15 whats the P 04:56:20 2) forall x (P(x) and Q(x)) is true and forall x (P(x) and forall x Q(x)) is false 04:56:33 Some truth function 04:56:40 quantification over predicates :o 04:57:42 Slereah: no which P is a countereample 04:58:10 Let's see 04:58:13 Man it's long 04:59:31 Oh wait, there's a shorter one 05:00:02 Basically it's P(x,y) being x <= y 05:00:47 It's true that for all x, there's a y that is bigger 05:01:01 But if you switch the forall and existence, it means that there's a y bigger than all x's 05:02:12 On the other hand, it is always true that exists y forall x P(x,y) -> forall x exists y P(x,y) 05:02:17 but it doesn't work the other way around 05:02:22 -!- nisstyre has quit (Quit: Leaving). 05:33:47 Evil popup had a too-long message on the navigate away event (or whatever it's called) making it impossible to close 05:33:48 >:( 05:33:52 Had to kill Chrome 05:34:48 update on using C++ for operator overloading: this paper defines a power series class for which & is composition 05:35:30 -!- ^v has quit (Quit: http://i.imgur.com/MHuW96t.gif). 05:54:30 Are the aces high in some games due to the French Revolution? 05:56:49 I think you can toggle the zero flag in a 6502 code by: PHP PLA AND #2 sequence of instructions. Are there better ways? 06:03:41 -!- ter2 has joined. 06:05:43 -!- tertu3 has quit (Ping timeout: 240 seconds). 06:06:48 -!- Slereah has quit (Ping timeout: 265 seconds). 06:07:25 -!- Slereah has joined. 06:24:58 -!- oerjan has quit (Quit: leaving). 06:46:33 Is there a function in standard C libraries to test if a file is seekable or not? 06:47:30 (ftell(fp) < 0 && errno == EBADF)? 06:47:44 (according to the Linux man page) 06:48:05 interesting 06:48:15 "if you don't know, just try" 06:49:31 I want it to work on Windows as well as Linux (and even on FreeBSD, Mac OS X, etc); the reason I wanted to know is if you are redirecting input from a file, it can just skip over the part it isn't using instead of reading and ignoring it, which it would be if it is a pipe or a serial port or something else like that. 06:52:08 ftell and ebadf are standard c right 06:52:17 then directly invoking fseek and testing for its errno should work 06:52:31 though I question the conformance level of msvcrt... 06:52:55 oh, no badf in errno 06:56:57 zzo38: well, ISO C99 does not have a specific errno for it, but it clearly indicates that fseek can fail and return -1 on that case, so checking for fseek's result seems to be sufficient 06:57:40 if fseek failed due to other problems, then you have much more issues to worry about 07:11:56 -!- stuntaneous has joined. 07:15:04 -!- SingingBoyo has joined. 07:18:45 -!- conehead has quit (Quit: Computer has gone to sleep.). 07:20:26 -!- FreeFull_ has quit. 07:28:43 -!- pikhq has quit (Ping timeout: 260 seconds). 07:28:51 -!- pikhq has joined. 07:37:13 -!- ter2 has quit (Ping timeout: 272 seconds). 07:43:56 POSIX suggests that fseek should fail with ESPIPE if the underlying stream is pipe/FIFO/socket, and EBADF only if "The file descriptor underlying stream is not an open file descriptor"; and anyway I suppose ftell can work even when fseek doesn't. (But the strategy of just trying fseek and giving up if it returns -1 sounds reasonable.) 07:46:31 If you are only seeking forward then it can just read and ignore however many bytes it would otherwise skip, if it is unable to just skip them. 07:48:37 p.o.s.i.x. 08:24:03 http://www.cs.au.dk/~gerth/slides/cphstl06.pdf is unrelated to what I was looking for, but interesting. 08:24:17 what is it 08:24:18 The king that is allowed to move any distance (like a queen does) rather than just one, may be called by different names in different chess variants; which names do you know? I have seen "King Battler" and "Royal Queen"; I have used "Long King" in some of my own games. 08:25:00 zomg i invented the name "royal queen" more than a decade ago 08:25:23 first in hebrew and then translated to english 08:25:36 and i think it was for that piece 08:25:50 also later other pieces that gained the ability to teleport and all sorts of things 08:26:38 Yes, that is kind of clear that such name is probably for that king of piece. (However, I prefer "long king"; some others prefer "king battler") 08:26:50 What is other pieces gained the ability to teleport and what other things are they? 08:26:51 isn't "royal queen" kind of redundant? 08:27:11 kmc: well it was vaguely more like "kingly queen" in the original 08:27:16 how does one even win a game with long kings. seems like it greatly reduces the number of possible mates 08:27:18 though maybe it ought to have been a "queenly king" 08:27:24 or maybe something else, i don't remember 08:27:40 also what's with using "ly" to make adjectives what is that even for 08:28:02 quintopia: Probably if other pieces can also have more powers (and/or more pieces); or if the game has both a long king and a short king and capturing either one of them wins, then it is another way. 08:28:29 ah 08:28:34 zzo38: i mean that "royal queen" later meant a more powerful piece that was able to teleport 08:28:42 made the game very short because it was checkmate on the first move 08:30:12 O, yes, clearly... unless some restrictions are applied to such thing (some games do have such a thing) 08:30:53 like 08:31:04 if you teleport you can't caputre on that move 08:31:11 seems a reasonable restriction 08:31:23 -!- obsidianmirror has joined. 08:32:42 Yes, that is one way, it works 08:33:30 -!- obsidianmirror has quit (Remote host closed the connection). 08:35:22 -!- obsidianmirror has joined. 08:35:51 -!- obsidianmirror has quit (Client Quit). 08:37:30 -!- Slereah_ has joined. 08:41:27 -!- Slereah has quit (Ping timeout: 240 seconds). 08:48:07 -!- Sprocklem has quit (Ping timeout: 260 seconds). 09:02:06 -!- Taneb has joined. 09:14:00 -!- quintopia has quit (Remote host closed the connection). 09:15:23 -!- quintopia has joined. 09:20:45 My brother has once made up a chess variant "bland chess", while waiting in a restaurant. It is a chess game with no diagonal moves (knight moves are still allowed, though). That means pawns cannot capture, queens are same as rooks, bishops cannot move at all, and kings have orthogonal moves only. 09:21:16 That sounds bland. 09:21:28 sounds a bit useless 09:21:33 so the bishops just sit there hoping to get captured so they can get out of everyone's way 09:21:35 hilarious 09:21:55 'i'll take your queen bishop if you'll get rid of my damned bishop' 09:22:04 quintopia: one could add a rule to capture pieces of the own fraction 09:22:30 quintopia: Yes, it does work like that way (although "deals" like that aren't binding any more than they are in normal chess). 09:23:23 myname: that seems actually interesting 09:23:32 Because of the knights, the game actually works kind of OK. 09:27:40 -!- Timwi has joined. 09:27:54 I guess I managed to survive the night 09:28:13 But then later on I had another idea I made a game "unbland chess", where the pieces can each move diagonally once per game, and using cards (which isn't visible to opponent) you can replenish the power to move diagonally. 09:28:40 such a zzo38 game 09:28:55 How do the cards work? 09:30:49 The cards are four of each numbered 1 to 8. You start with two cards and can have up to three cards in your hand at once; you pick one up if you give check or capture an opponent's piece. You can play two cards, choose one to correspond to the rank and one to correspond to the file, and one of your own pieces that has already move diagonal which is standing on that cell, now regains the diagonal ability. 09:31:28 what? 09:31:37 make a website with detailed explanation 09:31:54 What happens if you already have three cards? 09:32:05 also, have you ever played knightmare chess? 09:32:05 shachaf: Then you do not pick up another card. 09:32:11 myname: http://www.chessvariants.org/index/msdisplay.php?itemid=MSunblandchess 09:32:15 Can you pick one up and then choose which to discard? 09:32:18 myname: No, I have not played knightmare chess 09:32:25 shachaf: No. 09:33:07 Do you get to pick up two if you check by taking a piece? (assuming you have only 0 or 1) 09:33:25 You can also get a card by promoting a piece. 09:33:39 What if you take a piece, check, *and* promote all in the same turn? 09:34:02 (whoo, I’ve actually done that before) 09:34:18 Can you take two cards, use them to replenish diagonal powers, and then take another card? 09:34:56 Also, can I use just one card (e.g. the 1) to diagonalize a piece on the diagonal (in this case, A1)? 09:34:57 Timwi: It wasn't clear, but now I fixed it; now it says that you can. 09:35:10 And no, you cannot use just one card to diagonalize a piece on the diagonal. 09:35:55 That's not what I asked. 09:36:04 Oh, wait, I see. 09:36:05 I also fixed it so that the 1 corresponds to *your* first rank (rather than only white), so that it is more symmetric. 09:36:14 You have to replenish diagonal powers *instead* of moving. 09:36:44 shachaf: Yes, you have to instead of moving. And, yes if you have no cards and you capture, check, and promote on one turn, you can pick up three. 09:36:46 I thought you could play it as an instant. 09:39:21 Yeah, I thought of it as an instant too 09:39:56 We should have chess in which every piece has a power and toughness 09:40:14 and you can play spells to change them, or to give them Flying or First strike 09:40:18 Yes, we could make up such chess variant like that too perhaps 09:40:30 I can’t believe I never thought of this before 09:41:08 Flying pieces is allowed to move past non-flying pieces as if those other pieces isn't in the way. 09:41:43 hmm, I thought for a moment that you were talking about Lambda: the Gathering "http://icfpc2011.blogspot.jp/2011/06/task-description-contest-starts-now.html" 09:41:46 Pieces with Trampling also damage the king even if not attacking it 09:41:58 from "diagonal power" 09:43:26 Timwi: OK. 09:43:35 @quote the.gathering 09:43:35 zzo38 says: Such as, we try to make something similar to a combination of Haskell, C, BLISS, TeX, WEB, Prolog, INTERCAL, and Magic: the Gathering; and then make it with many things omitted such as Unicode syntax, layout, do-notation, list comprehensions; and add in macros and stuff, and then make up something new...... 09:44:10 zzo38: How do you propose to combine Haskell with Magic: the Gathering? 09:46:48 shachaf: I am not quite sure, but something where effects can affect other effects (whether they are represented using monads or classes or something else) 09:47:54 These effects are effected similar to Magic: the Gathering effects, so not quite like I/O effects and those things. 09:51:49 shachaf: isn't Lambda: the Gathering almost that? 09:52:09 But zzo38 said that beforehand; I was wondering what he meant. 10:03:10 -!- SingingBoyo has quit (Ping timeout: 240 seconds). 10:11:53 Make a chess variant involving INTERCAL somehow. 10:11:55 -!- muskrat has quit (Quit: Leaving). 10:11:58 -!- zzo38 has quit (Remote host closed the connection). 10:14:19 that sounds easy. DO ABSTAIN FROM PROMOTING TO KNIGHT 10:15:36 afterall, chess is binary because it has 8 times 8 squares and intercal is binary 10:16:28 also, in chess+intercal you don't move your pieces to another square, you bring your pieces FROM another square 10:17:16 even from a computed square 10:20:12 -!- nooodl has joined. 11:11:32 Huh, weird. This four-physical-cores-but-eight-logical-processors-due-to-hyperthreading box has, according to /proc/cpuinfo, the same physical core running at two different clock rates. That doesn't sound possible. 11:12:35 maybe it was read at twwo differnt times? 11:13:07 It doesn't do frequency scaling at *that* high rate, AFAIK. 11:13:25 like just by coincidence maybe? or does it happen every time 11:13:38 Well, often enough. 11:14:36 Hrm. 11:14:41 There seems to be a pattern here. 11:16:58 The logical numbers go from 0..7, where "core id" fields go 0, 1, 2, 3, 0, 1, 2, 3; with 4 CPU-intensive parallel tasks, it seems that (in repeated samplings) if the entry for a core in the first half has the highest clock rate, the corresponding entry in the second half has the lowest, and vice versa. 11:18:05 http://sprunge.us/aaIX -- three random samples. 11:19:03 Must be some kind of a thing. 11:19:19 (With eight tasks, all 8 logical CPUs are listed as 3.3 GHz.) 11:22:01 "Is Enhanced Intel Speedstep® Technology compatible with Intel Hyper-Threading Technology? 11:22:04 Yes. The operating system sees two virtual processors. Requests to change the power state are prioritized between each virtual processor by the BIOS and the operating system; the power state will default to that of the virtual processor requesting the highest state." 11:22:14 Rather strange. 11:23:52 I guess it makes sense (fsvo), then, that for four active tasks it'd schedule them on different physical cores (but somewhat randomly on which HT half of a core), and then request the lowest speed for the "idle" half, even if (in reality) it'll still run at the higher clock rate. 11:24:05 Just makes this cpufreq indicator thing somewhat silly. 11:29:35 -!- bitlion_r has quit (Ping timeout: 260 seconds). 11:32:36 -!- int-e_ has changed nick to int-e. 11:33:34 -!- carado has joined. 11:38:18 -!- pikhq has quit (Ping timeout: 246 seconds). 11:38:48 -!- pikhq has joined. 11:42:17 -!- myndzi has quit (Ping timeout: 240 seconds). 11:42:32 @botsnack 11:42:32 :) 11:43:06 -!- myndzi has joined. 11:43:27 -!- ggherdov has quit (Ping timeout: 240 seconds). 11:55:34 -!- ggherdov has joined. 12:30:12 -!- pikhq has quit (Ping timeout: 260 seconds). 12:30:20 -!- pikhq has joined. 12:52:22 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 13:02:57 !SENT_START MR. K. N. C. N. J. AND SHOW ALL ITS U. S. AND ENDS !SENT_END 13:06:05 -!- Sgeo_ has quit (Read error: Connection reset by peer). 13:08:17 "int *p; 13:08:20 Gah, newlines. 13:09:17 "int *p; p = arr; Now we can access every element of array arr using p++ to move from one element to another. NOTE : You cannot decrement a pointer once incremented. p-- won't work." 13:09:41 (##c is commenting on some worst-C-advice-on-the-net site.) 13:14:11 Given int sum(int arr[]); and int sum(int *ptr); "one will lead to call by value and the other is used to perform call be reference". 13:14:29 It's like some sort of an attempt to be most wrong. 13:16:15 hehe. 13:16:51 arrays are pointers. except they are not. didn't we just mention this yesterday? 13:17:10 I guess it comes up again and again and again. 13:18:16 Oh, as a remedy for the p-- problem, let's all use --p. 13:21:04 "When an array is declared, compiler allocates sufficient amount of memory to contain all the elements of the array. Base address which gives location of the first element is also allocated by the compiler. -- Here variable arr will give the base address, which is a constant pointer pointing to the element, arr[0]." 13:21:27 As far as I can tell, it's (almost) describing B's arrays. 13:22:40 Bah, they are trying to sort-of explain lvalues and rvalues without even distinguishing between left-hand and right-hand sides of assignments. 13:23:31 unbelievable 13:23:41 they mention i[a] but they get p-- wrong? 13:24:13 It's quite a mashup. 13:24:22 oh it gets better. multidimensional arrays. good one. 13:25:07 Well, you know. "void type means no value. This is usually used to specify the type of functions." 13:29:04 Oh. No, the multi-dimensional array thing is probably fine. It's just that *(*(ptr + i) + j) looks entirely wrong to me. 13:29:53 Oh well. 13:29:56 Nice find :) 13:30:34 There was another similiar site the other month, and that one also used < foo.h> (with the space) for standard includes, which puzzled me then and puzzles me still. 13:30:51 It could be some sort of a CMS markup workaround thing, I guess. In theory. 13:32:38 Given the lead-in text ("Lets see how we can make a pointer point to such an array --") I was sort of expecting to find something about the admittedly gnarly-looking pointer-to-array declarators. 13:33:41 *(int[]) 13:34:02 int arr[2][3] = {{1,2,3},{4,5,6}}; int (*p)[3] = arr; int (*q)[2][3] = &arr; p[1][2] == (*q)[1][2]; /* something about this sort of stuff */ 13:35:01 int a<:??) = ??<1,2,3%>; 13:35:53 There should be some kind of a law about mixing di- and trigraphs. 13:36:13 -!- HullNb has joined. 13:37:25 "warning: trigraph ??< ignored, use -trigraphs to enable" - boring! 13:39:14 http://sprunge.us/GXCQ that one might possibly the most confusion-inducing trigraph. 13:41:15 true. 13:48:36 -!- HullNb has quit (Quit: KVIrc 4.2.0 Equilibrium http://www.kvirc.net/). 13:50:47 Once during a mathematical conversation with a student, Alexander Grothendieck was asked to consider an example of a prime number. 13:50:50 "You mean an actual prime number?" The student replied, "Yes, an actual prime." 13:50:53 Grothendieck then said, "Alright then, take 57". 13:52:05 -!- Phantom_Hoover has joined. 14:03:18 I don't get it 14:05:06 -!- tromp has joined. 14:08:25 AIUI, it's a sign of a real mathematician to not be so overly concerned about numbers. 14:11:08 -!- tromp has quit. 14:12:23 AFAIU Grothendieck in particular is famous for very deep, abstract results in mathematics, and solving even concrete problems on a slightly higher level of abstraction than most of his colleagues would consider in approaching those problems. 14:13:02 -!- boily has joined. 14:13:19 -!- metasepia has joined. 14:13:30 good unsecure morning! 14:13:46 -!- augur_ has joined. 14:14:35 -!- augur has quit (Ping timeout: 246 seconds). 14:14:52 ~metar EFHK 14:14:53 EFHK 101350Z 18014KT 3500 -SN BKN006 OVC010 00/M01 Q1024 TEMPO 2500 14:14:56 Good -SN afternoon. 14:20:33 ~metar CYUL 14:20:33 CYUL 101400Z 26015G24KT 15SM FEW035 FEW180 BKN240 M04/M10 A2988 RMK SC1AC2CI5 SC TR SLP121 14:21:30 I tried my new lockpicking kit yesterday at home. I suddenly realised I don't have no security at all... 14:21:45 Isn't it good to not have no security? 14:22:26 did you also try out your throwing rocks through windows kit 14:22:47 (Do the rocks come in a handy carrying case?) 14:23:41 they also come with reusable tape for attaching threatening messages 14:25:07 fizzie: well. I kinda overnegativised my sentence... 14:25:45 Bike: I only use organic, ISO 14001 certified window rocks, with locally produced vegan reusable tape. 14:33:30 boily: Is the tape gluten-free? 14:36:22 I ran out of gluten free tape. anyone who can lend me a llama for my next pilgrimage to the Sacred Gluten Free Tape Tibetan Kibbutz? 14:42:46 -!- mrhmouse has joined. 14:47:54 -!- heroux has quit (Ping timeout: 272 seconds). 14:54:48 -!- heroux has joined. 15:02:22 -!- yorick has joined. 15:20:55 -!- conehead has joined. 15:45:43 -!- ^v has joined. 15:49:58 -!- ^v has quit (Client Quit). 15:55:22 -!- Timwi has quit (Ping timeout: 246 seconds). 16:02:08 `unidecode ꙮ 16:02:10 [U+A66E CYRILLIC LETTER MULTIOCULAR O] 16:05:03 why. why must you all make my archival life so difficult. 16:05:37 Are you trying to typeset that in LaTeX? 16:05:51 * int-e eyes(sic!) boily suspiciously. 16:06:09 what else. 16:06:21 * boily wields his mapole. 16:07:52 * mrhmouse ducks 16:08:05 ~duck ducks 16:08:05 duck definition: any of various swimming birds (family Anatidae, the duck family) in which the neck and legs are short, the feet typically webbed, the bill often broad and flat, and the sexes usually different from each other in plumage. 16:09:57 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 16:14:22 \def\eye{\hbox to 0pt{\hss${\circ}\kern-.38em{\cdot}$\hss}}A\hbox{\eye\kern.18em\raise.32em\eye\lower.32em\eye\kern.18em\eye\kern.18em\raise.32em\eye\lower.32em\eye\kern.18em\eye}B 16:14:30 boily: it's not perfect, but it's a start ;-) 16:15:00 multiocular fungot, batman! 16:15:01 boily: there are no problems 16:15:11 fungot: of course there are problems. but there are solutions! 16:15:11 boily: what is " catamorphic"? -g ( was that a self-referential quote? 16:15:17 `? catamorphism 16:15:19 catamorphism? ¯\(°_o)/¯ 16:15:29 int-e: do you have a github account? 16:15:39 yes. 16:16:30 int-e: felgenhauer? 16:16:53 int-e. Yes. 16:17:18 ♪ you are promoted to cocoonspirator. ♪ 16:17:51 if you want to commit that over to the repo, and tag your commit with issue #3, that'd be nice :D 16:26:41 -!- FreeFull has joined. 16:27:23 hmm. let's see if my latex installation is even up to the task 16:34:55