00:02:35 `quote punched myself 00:02:36 402) Look, I often walk my dog through a field with cows in it. And I punched myself in the face once. 00:02:51 Punching myself in the face is proving to be addictive help 00:03:04 have you tried turning it off and on again 00:03:33 -!- Sgeo has joined. 00:03:40 Bike, yes 00:04:31 Tanelle. with which hand do you punch yourself in the face with? 00:06:46 Is there any way to do things like 'with' with the bot? 00:06:58 I imagine I can only do lambdas, are those more limited in Idris than Haskell? 00:08:12 Ok, so oerjan is getting annoyed 00:08:38 I have a prgmr that I might be able to run the bot on 00:08:51 Melvar: is there any risk of someone taking over my system if I blindly run the bot? 00:15:37 Sgeo: Taking over, not so likely. Denial-of-service is a real possibility. You should put resource limits on it, particularly memory. On the other hand, I will make no guarantees that there are no bugs exploitable for arbitrary code execution or the like, I merely find it unlikely enough to run the bot myself. 00:16:01 I don't know how to do resource limits :/ 00:16:10 Or.. much, really 00:16:10 On the other hand, “blindly” is hard: You need to have sandbox working anyway. 00:16:23 I haven't even touched my prgmr instance since I bought it 00:22:08 boily, I used my right hand 00:22:52 Melvar: any idea why choose : (b : Bool) -> Either (so b) (so (not b)) instead of choose : (b : Bool) -> Either (so (not b)) (so b)? 00:27:38 -!- spiette has quit (Ping timeout: 265 seconds). 00:27:57 -!- itsy has quit (Read error: Connection reset by peer). 00:29:35 -!- itsy has joined. 00:33:03 time for my weekly endoubting session. 00:33:21 -!- boily has quit (Quit: POSTMODERN CHICKEN (plus I'm leaving the cuttlefish logged in for you guys tonight!)). 00:39:12 -!- tromp has joined. 00:39:24 Crud, I don't know my own password 00:40:36 Sgeo, is it "password1" 00:40:45 Probably not 00:40:56 How about "sgeoiscool" 00:41:30 How about I don't know where I put my private key 00:41:31 hunter2 00:42:15 How can I check if a private key I have is the one for a public key? 00:43:10 I'm in 00:43:20 At least, I'm in as my normal use 00:43:22 user 00:43:32 I don't know if I'll be able to access console ever 00:44:53 Melvar: should I use cabal version of Idris? 00:47:34 Sgeo: I do so, anyway. 00:51:24 Anything in particular I need to install to get the bot working? 00:55:17 I don't understand how you have it on multiple channels 00:55:22 The channel looks hardcoded 01:01:45 -!- shikhin has joined. 01:04:34 -!- Phantom__Hoover has quit (Read error: Connection reset by peer). 01:06:12 -!- Bike has quit (Quit: restartin'). 01:07:42 -!- Bike has joined. 01:09:00 -!- zzo38 has joined. 01:29:40 * Sgeo decides that if he gets the bot working, he will use prefix < 01:33:42 How can I check if a private key I have is the one for a public key? // For SSH? 01:33:57 yes 01:34:17 You can use `ssh-keygen -y` to regenerate the public key from the private key and diff the two. 01:38:02 Sgeo: You need sandbox, so install selinux-policy-sandbox I think, and it’s a list of channels that’s hardcoded, and I haven’t pushed a version with #esoteric in it. 01:38:22 ty 01:54:29 -!- nooodl has quit (Quit: Ik ga weg). 02:02:40 -!- yorick has quit (Remote host closed the connection). 02:14:59 -!- idris-ircslave has quit (Ping timeout: 240 seconds). 02:16:05 -!- Melvar has quit (Ping timeout: 252 seconds). 02:25:28 > :t (->) 02:25:29 :1:1: parse error on input `:' 02:25:33 Oh 02:28:41 :k (->) 02:28:42 * -> * -> * 02:41:41 -!- Melvar has joined. 02:43:28 -!- idris-ircslave has joined. 02:57:13 -!- SailorR has joined. 02:57:32 nuts 02:57:55 legumes 02:58:17 I kind of want to write a brainfuck interpreter but I dont know where to begin 02:58:24 I know nothing of interpreters 02:58:34 itd probably be really crappy if I tried 02:58:36 it's pretty easy. 02:58:47 just have a loop that looks at one character at a time and does something depending on what the character is. 02:59:02 hm 02:59:22 should I represent the 30 000 character bytestring as an array list of 0 bytes? 02:59:27 in java 02:59:43 whatever you want 03:00:15 I looked at some peoples code and they had parsing engines and stuff 03:00:24 and it looked really weird 03:00:26 for brainfuck? 03:00:26 I didnt understand 03:00:29 yea 03:00:30 let me get an e.g. 03:00:36 not really necessary 03:01:45 http://www.cs.princeton.edu/~ynaamad/misc/bf.htm 03:01:49 like wtf 03:02:28 that's not really a good example... 03:03:16 yea it looks pretentious 03:03:21 I cant find a 'good' example anywhere though 03:03:24 all the code is obfuscated 03:03:26 to look hard 03:03:43 that's because a brainfuck interpreter is like ten lines of code. 03:04:23 hm 03:05:20 ok im excited now 03:05:24 this is gonna be cool 03:05:44 maybe I should read about interpreters first 03:05:56 you're probably overthinking this. 03:05:59 it's really, really simple. 03:06:34 why is it so complicated for other programing langauges then? 03:06:38 just to do a really basic one 03:06:48 brainfuck has loops 03:06:50 because most programming languages are more complicated than brainfuck. 03:06:51 and I/O too 03:07:06 most languages have more complicated loops and I/O than brainfuck. 03:07:18 yea true 03:09:39 -!- metasepia has quit (Remote host closed the connection). 03:11:21 write an rpn interpretter. come back in 3min when you're done. 03:12:05 what if I wrote a brainfuck compiler instead? 03:12:12 that's even easier. 03:25:00 im not even sure I really get teh difference 03:25:01 *the 03:27:21 compiler doesnt execute just translates ? 03:27:23 and type checks? 03:27:26 -!- Sprocklem has joined. 03:32:28 translates, yes. 03:32:36 brainfuck doesn't have types really. 03:33:55 A valid brainfuck program just has to have balanced [] 03:34:18 zzo38: would it be okay to check that as the interpreter level 03:34:22 or is that a compiler thing 03:34:32 maybe I should have a seprate file that checks 03:34:37 call it compiler.java ? 03:34:40 Compiler* 03:34:49 and another one that interprets / executes? 03:35:30 SailorR: If a compiler is used, probably the compiler would check (otherwise you cannot really compile it properly). However, it can be done with only an interpreter, too. 03:36:36 the JVM is an interpreter right? 03:37:21 so to speak. 03:39:51 -!- Sorella has quit (Quit: It is tiem!). 03:57:51 I read on Wikipedia about "Advanced Chess" playing. It is involving a person who is using a computer to help to figure out what moves he should play. Players are given identical computers, but to improve, it should be specified something like: Identical computers are provided, with keyboard, mouse, printer, DVD-ROM, and serial port. Serial port is connected to a third smaller computer with the chess board placed on top and which displays time cont 03:59:01 No software is provided other than the BIOS; any other software can be loaded into RAM by the user, before the game starts. No hard drive is included. You can bring only one DVD, presumably containing the software. 03:59:09 I think this is a better way? 04:00:04 what are you a nerd 04:17:27 Why not just seal up the computer and preload the software? 04:19:59 Because each given person brings their own computer software. 04:43:56 I think it would be better to bring your own software but have the hardware to be fixed, that is set by the tournament only. 04:47:02 -!- shikhin has quit (Ping timeout: 264 seconds). 05:13:01 -!- vravn has quit (Excess Flood). 05:15:50 -!- vravn has joined. 05:19:58 -!- ^v has joined. 05:22:55 <^v> is brainfuck a good compression algorithm? 05:25:06 never. 05:25:23 even after compressed in three-bit code. 05:25:23 -!- tromp has quit (Remote host closed the connection). 05:25:32 and huffman coding (as Spoon does). 05:25:50 and run-length encoding. 05:25:56 -!- tromp has joined. 05:26:11 possibly after LZ77, but it is already a generic compression algorithm. 05:26:40 <^v> o_o 05:28:21 <^v> was thinking i could have a 4 bit sequence after every +/- bits to have length 05:30:01 -!- tromp has quit (Ping timeout: 244 seconds). 05:31:10 <^v> oh thats run length encoding >_> 05:34:35 -!- Friuum has joined. 05:38:28 -!- Friuum has left ("Textual IRC Client: www.textualapp.com"). 05:39:53 -!- realzies has quit (Ping timeout: 265 seconds). 05:48:53 I have thought to use Huffman coding that depends on what the previous command is, and combine it with run-length 05:49:43 So that "impossible" commands, as well as worthless commands such as +- -+ ][ <> >< cannot be encoded. 05:52:14 It would compress a brainfuck program better than the other codes at least, but still not best way. 06:04:29 -!- ^v has quit (Quit: Leaving). 06:16:30 I really dont understand brainfuck loops 06:16:39 in pseudocode how to implement [ ] 06:16:45 I got everything else 06:17:40 there are many strategies for implementing loops, which really depend on your implementation 06:18:05 at least you need either a recursive function or a stack, or something more obscure 06:18:29 ok I figured it was recursion maybe 06:18:46 I check if the dataPointer is == 0 , if it is then I execute the right bracket? 06:18:47 and if not 06:18:59 I call my function recrusively ? 06:19:30 -!- vravn has quit (Excess Flood). 06:20:47 whenever hit [, check if the current cell is 0, if it's 0, jump to the next matching ] (that does not involve recursion but some counting), if it's not 0, save the current position (of [) and call itself. 06:21:20 -!- vravn has joined. 06:21:22 whenever hit ], this means either i) an unbalanced loop ([[]]]] etc.) or ii) that the function is called inside some loop and the loop body is about to end 06:21:51 ah I see, thanks 06:22:33 so a good strategy is to simply return on ], and the caller (which might be itself, in the [ case) should check the current cell again to decide whether to jump to the saved position (if it's not 0) or keep going (if it's 0). 06:23:14 -!- Sprocklem has quit (Ping timeout: 244 seconds). 06:23:37 if the function returns and the next code pointer points to ], then it is an unbalanced loop and should err. 06:24:55 -!- shikhin has joined. 06:42:57 imagine 06:43:04 if someone wrote a GUI for brainfuck 06:49:07 -!- vravn has quit (Excess Flood). 06:49:50 -!- vravn has joined. 06:57:52 -!- vravn has quit (Excess Flood). 06:59:50 -!- vravn has joined. 07:00:18 -!- ski has joined. 07:10:29 -!- HackEgo has quit (Remote host closed the connection). 07:20:32 If that means a brainfuck IDE, there are several. 07:22:01 -!- FreeFull has quit. 07:31:40 http://www.theonion.com/articles/francis-ford-coppola-reveals-every-godfather-film,35423/ 07:37:26 -!- MoALTz_ has joined. 07:42:10 -!- oerjan has joined. 07:46:07 "Euclidean TSP issues are of course metric, but because of problems with floating point accuracy such instances are usually not considered in practice." hehhhhhh <-- i vaguely recall from back when i read the gödel's letter blog that these precision issues are bad enough that it's not completely known whether euclidean TSP is NP-hard when you give the cities by (x,y) coordinates instead of distances. 07:46:37 or hm maybe its' not completely known whether it's in NP. 08:04:07 awesome. 08:06:07 that wasn't floating point, but arbitrary precision, though 08:11:02 iirc the problem is that if two complicated expressions with square roots in them are very close, then it's not known a polynomial algorithm to check which is larger. 08:12:56 *polynomial time 08:23:42 not really necessary <-- if you don't do parsing then you end up with that "scan across the code every time you move across a loop" thing 08:24:05 which works, but sheesh 08:25:26 -!- ais523 has joined. 08:25:57 ais523: so, are you chaotic evil today? 08:26:29 oerjan: no 08:26:36 I'm actually relatively lawful good most of the time 08:26:54 i see. 08:27:01 at first I wasn't sure whether I was lawful, then I noticed that pretty much the entire world seemed highly chaotic 08:27:09 so my measuring stick was probably in the wrong place 08:27:29 charming 08:33:29 -!- atslash has joined. 08:55:42 -!- MoALTz_ has quit (Quit: brb). 08:55:54 -!- MoALTz has joined. 08:59:18 anyone know what I could be doing wrong with my brainfuck interpreter? 08:59:27 http://ideone.com/lQZLkk 08:59:37 I tried to put print statements inside the switch statement where the problem is 08:59:49 it compiles and runs but doesnt do what its supposed to 09:00:11 this is the main method 09:00:20 http://ideone.com/Hcxbv9 09:00:29 and I'm running the brainfuck helloworld program in a file called file.txt 09:01:53 also its java 09:09:30 what's a program that breaks? 09:10:17 well it doesnt 'break' persae it runs 09:10:26 but doesnt do any kind of interpretation I think the , statement works 09:10:40 does ,. work? 09:10:54 let me check 09:11:24 no 09:13:05 prints blanks 09:13:08 wtf ideone makes backspace work like the browser back button 09:13:17 i hate it already. 09:13:27 but.. that's what backspace should do in a browser 09:13:47 not when i am trying to edit stdin... 09:13:58 i suppose it wasn't actually an editable field. 09:14:11 yea I like pastebin better 09:14:34 SailorR: are you actually using ideone to run this? i see error messages. 09:14:43 no just javac 09:14:44 and java 09:14:47 in command line 09:17:30 SailorR: what does +++++++++++++++++++++++++++++++++. do? 09:17:45 checking 09:18:05 does nothing at all lol 09:18:09 hm 09:18:18 but I guess I wouldnt expect it to 09:18:40 well i'm just trying to see if it's just some commands which break 09:18:46 hm 09:18:54 I'll try to put print statements to see if its actually working 09:18:55 one sec 09:21:18 hmm 09:21:20 yea doesnt work 09:21:35 I went System.out.println(new String(tape)); to print out the entire tape 09:22:23 or wat 09:22:25 wait 09:22:37 yea that works 09:22:38 hm 09:22:42 the output I get tho 09:22:52 isnt human readable 09:23:07 I get bytes 09:23:21 0001 , 0002, 0003, 0004 , space , 0006 09:25:54 -!- conehead has quit (Quit: Computer has gone to sleep.). 09:27:44 your [ and ] implementations aren't right btw, but that doesn't explain why everything else breaks 09:28:33 hm 09:31:03 i'd suggest starting with printing the whole c array at the beginning of Brainfuck.code 09:31:13 to see if that's set up right 09:31:40 ok ill try that 09:33:28 well it appears that 09:33:33 it doesnt change at all 09:33:33 lol 09:33:45 I printed it each time it enters the while loop 09:34:01 um the c array isn't supposed to change. 09:34:08 oh right 09:34:12 well yeah then it works 09:34:13 lol 09:34:26 i wanted you to check if it's _initialized_ right, and passed into the Brainfuck.code correctly. 09:35:27 so my +++++++++++++++++++++++++++++++++. suggestion didn't do _anything_ at all? it's supposed to print a single "!" 09:36:12 h wait hm 09:36:15 I dont think it is 09:36:25 its 00000000000000000000 09:36:31 every entry in the c array is 0 09:36:40 even the first ones? 09:36:43 yes 09:36:53 well then you have an obvious problem :P 09:37:00 yea true lol 09:40:38 -!- prooftechnique has quit (Ping timeout: 240 seconds). 09:40:40 well I have no fucking idea 09:40:40 lol 09:41:01 and is your brainfuck program in "file.txt" as it seems to me it should? 09:41:07 yes 09:41:41 maybe theres something wrong with the way im reading characters in from that file 09:41:46 ok then i don't think i know java well enough to see what's wrong. one thing you can do is to print all of data in Interpreter before it calls Brainfuck.code 09:42:05 if that's still wrong, then at least we know it's the reading. 09:48:04 ok hm 09:48:11 INPUT and OUTPUT are flipped in the tokens. 09:48:23 "." is for input, "," is for output; not the other way around. 09:48:37 I mean, should be the other way around. 09:48:39 XD 09:49:07 good catch thx fixed that 09:49:12 i'm not sure that will help with the empty c though. 09:49:21 it appears to do something now 09:49:23 It wasn't empty for me, FWIW. 09:49:25 I just dont know what lol 09:49:46 so try +++++++++++++++++++++++++++++++++. again? 09:49:55 ok 09:50:35 There's an obvious never-terminates issue there, at least. (It's not possible for "code" to return, because of the while (true). 09:50:45 gives an array out of bounds exception lol wtf 09:50:58 SailorR: huh. 09:51:08 That would happen if charpointer >= c.length. 09:51:39 Also Token.OUTPUT does not increment charpointer in the pasted code. 09:52:08 hm indeed. 09:52:28 that would make it print unending !'s, though... 09:52:56 Fixing all the mistakes I've noticed so far makes oerjan's +++++++++++++++++++++++++++++++++. program output a single ! and terminate. 09:53:03 yay! 09:53:13 ^bf +++++++++++++++++++++++++++++++++. 09:53:13 ! 09:53:13 nice 09:53:31 actually, how does it terminate? or was that one of the things you fixed. 09:54:03 oerjan: I made it a while (charpointer < c.length) instead of while (true). (And added a default: charpointer++; case to skip past the uninitialized entries of c.) 09:54:10 SailorR: i think you should have a Token.EOF = 0 to detect program end 09:54:32 oh yea true 09:56:05 ok then i suspect programs without [] should start working 09:56:17 whats the default charpoint ++ case? 09:56:44 SailorR: same as Token.EOF, really 09:57:08 but having a token means you can quit immediately instead of looping across the rest 09:57:26 oh hm 09:57:47 well you also need a default to implement comments properly (i.e. ignoring non-commands) 09:57:49 A default case (in addition to an EOF marker) would still be in keeping with the accepted brainfuck convention of ignoring all non-command characters. 09:57:52 Right. 09:59:33 once you've got +++++++++++++++++++++++++++++++++. working, you can try ,.+>,-.<. to get a test of all the non-loop commands. 09:59:50 (Ignoring all non-commands already when reading might be a better idea, anyway.) 09:59:58 im trying to fix the part where im reading char into the arra 10:00:00 array 10:00:04 so I can automate test cases 10:00:53 Whoops, I'll have to go hold an exercise session now. 10:01:07 hold? as teacher? 10:01:56 http://amirunningxp.com/ 10:03:02 why? 10:03:45 check appears to be server-side 10:03:48 which make sense, really 10:04:02 I wonder if I can make it think that I am actually running Windows XP 10:04:04 wait, someone is writing a bf interpreter in java? 10:04:07 why??? 10:05:06 you can write a BF interp in pretty much anything 10:05:21 of course you can 10:05:42 wtf why isnt this reading my char into an array 10:05:42 but i don't see any advantage of doing so in java 10:06:01 SailorR: fizzie said the program reading was working for him... 10:06:14 hmm 10:06:57 myname: because it's what he knows? 10:07:04 you have to start somewhere. 10:07:18 just changing my user agent was enough 10:07:38 ais523: how unlawful of you. 10:07:46 * oerjan probably should stop now. 10:08:26 oerjan: hmm 10:17:17 -!- Phantom_Hoover has joined. 10:27:32 oergan thx for all your help btw 10:27:35 you too fizzle 10:27:41 the nonloop programs work now 10:27:48 just gotta figure out whats wrong with my loop :p 10:55:57 -!- Sellyme has quit (Excess Flood). 10:57:13 -!- Sellyme has joined. 10:59:18 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 10:59:36 -!- Sorella has joined. 11:09:49 -!- shikhout has joined. 11:12:50 -!- shikhin has quit (Ping timeout: 264 seconds). 11:12:51 -!- shikhout has changed nick to shikhin. 11:14:40 -!- boily has joined. 11:20:46 -!- MindlessDrone has joined. 11:21:12 oerjan: I think I'm officially called an "assistant" of some sort. 11:21:41 ah. 11:22:10 oerjan: Or come to think of it, I'm probably not officially called anything, because the course is for the old deparment our research group moved away from. In fact, I'm not entirely sure I should even be doing this. 11:22:44 good uncertain morning! 11:23:25 fizzie: happy to help! 11:23:58 boily: should we avoid checking if you're alive or dead? 11:24:11 In other news (they're not other news), offering 0.5 exam points (out of probably 36 or so) for attendance of the (weekly) exercise sessions sure gets people to come. 11:24:23 There's been like 80% attendance for all five sessions so far. 11:24:52 I'm not sure anyone's actually learning anything, but I guess they're... paying attention? Occasionally, anyway. 11:25:34 i was an assistant once, but i never paid attention enough to know if anyone learned anything. 11:25:39 fizzie: I've intentionally dropped that sort of mark before now 11:26:15 oerjan: maybe. 11:26:28 I dropped 5% of the mark on my group Masters' project for not attending a team building exercise, via the usual technique of not signing the insurance forms 11:29:01 That sounds slightly bizarre. 11:29:02 I mean, not the not going to a team building exercise, but getting credit for going. 11:30:05 ais523: you should have sued them for docking you points for something potentially dangerous hth 11:30:21 (i assume that's why you needed insurance) 11:34:11 oerjan: I think all company/school/university group trips have special insurance forms that keep track of who's going, or something 11:34:50 but refusing to fill them in is a nice universal way to get out of it 11:35:14 ah 11:42:35 I think I almost have loops working ... http://ideone.com/n8sXxU but Helloworld still gives me nonhuman readable bytes 11:45:28 If you want to do the loops with the (arguably slightly complex) recursive-call-to-code approach, it would probably be best if the ']' case were to return. 11:47:26 hmm 11:47:55 my methods void though how would I get it to return? 11:48:06 (sorry if thats a dumb question I just started learning java ) 11:48:18 just return without an argument, i think 11:48:20 I guess it doesnt have to be recursion either 11:49:05 however, i think you need datapointer and maybe charpointer to be class variables 11:49:24 otherwise returning will lose your place 11:49:33 yea I considered that ...I was reading about recursion and wondering how the local variables were stored or if they were lost 11:49:39 oerjan: No, it'd return to the place of '[' for the next loop iteration. 11:49:53 oerjan: At least that's the way I assumed for the logic to be intended to work. 11:50:18 oerjan: (Though in that case charpointer shouldn't be incremented in the case of '[' that does call code.) 11:50:27 fizzie: datapointer needs to be. charpointer might be easiest _not_ to. 11:50:35 oerjan: Er, right, that's what I meant. 11:51:19 the next error is that the [ code needs to loop until the tape is zero. 11:51:26 Possibly the most straightforward way is to just have '[' and ']' implemented in a very similar manner, in that both either just move to the next instruction or seek to the matching ']' or '[' depending on tape[datapointer]. 11:51:32 should I have a constructor then too? (otherwise I'd be using a static method to initialize the class variables) 11:52:04 SailorR: they can be static variables... 11:52:44 they could also be object variables, if you want 11:52:52 oh yea nvm 11:52:56 I think id prefer them static 11:54:17 the final error i see, which won't show up for hello world, is that your code to find the matching ] only works if there are no inner nested loops. 11:55:00 (typically with this method one uses a counter to keep track of the nesting level) 11:55:17 I see 11:55:24 this is getting pretty complicated lol 11:55:33 at least for me 11:56:40 SailorR: the loops are usually the most complicated part of implementing brainfuck 11:56:51 Some might prefer a separate class Tape { ... } that does an abstracted tape. (Then you can have a static Tape object, or pass it as a parameter to all calls of code(); either way the data pointer is then part of the tape.) 11:56:55 (A functional language programmer would of course faint dead at the sight of such a mutable tape.) 11:59:06 SailorR: one reason why compiling brainfuck is often easier than interpreting is that you can then hand off the job of matching loops properly to the language you are compiling into. 11:59:43 hm 11:59:53 so this is really some low level exercise? 12:00:00 that you dont see in ordinary programming ? 12:00:37 most ordinary programming languages have loops built in, so... 12:02:41 SailorR: well this scanning for matching ] stuff is not the way you'd implement loops when compiling/interpreting an ordinary programming language. you'd use a real parsing stage. which you can also do for brainfuck, but it's more complicated than the simplest methods. 12:04:04 like, brainfuck is so simple that parsing seems like overkill 12:04:18 hm 12:05:56 otoh parsing lets you have a more efficient implementation, because you can then make an internal representation that stores which []'s match each other 12:06:23 making it quick to jump between them. 12:08:14 -!- boily has quit (Quit: Poulet!). 12:10:49 -!- Slereah_ has quit (Read error: Connection reset by peer). 12:11:06 -!- Slereah_ has joined. 12:11:48 -!- nisstyre has quit (Quit: WeeChat 0.4.3). 12:16:14 -!- SailorR has quit (Ping timeout: 265 seconds). 12:34:44 -!- vravn has quit (*.net *.split). 12:40:37 -!- oerjan has quit (Quit: leaving). 12:57:21 -!- idris-ircslave has quit (Quit: Terminated). 12:57:46 -!- idris-ircslave has joined. 13:06:51 -!- EgoBot has joined. 13:13:22 -!- vravn has joined. 13:23:21 -!- tromp has joined. 13:24:30 -!- prooftechnique has joined. 13:24:40 -!- yorick has joined. 13:29:44 -!- realzies has joined. 13:37:06 @ping 13:37:06 pong 13:37:07 -!- tromp has quit (Remote host closed the connection). 13:37:10 :( 13:37:16 My ethernet is not working 13:37:39 -!- tromp has joined. 13:37:43 Taneb: you got a pong 13:38:07 ais523, after I unplugged my ethernet cable 13:38:27 right 13:38:38 From my end the @ping and the pong have 42 seconds between them 13:42:16 -!- tromp has quit (Ping timeout: 265 seconds). 13:44:29 -!- Bike has quit (Ping timeout: 240 seconds). 13:54:26 Taneb: that's sportive 13:55:31 Also it looks like the UK is gonna lose Eurovision again :( 13:56:23 And I have a problem class to go to 13:57:10 -!- spiette has joined. 13:58:03 I'm pretty sure Finland's going to lose too. 13:58:10 -!- atslash has quit (Quit: This computer has gone to sleep). 13:59:55 -!- Sgeo has quit (Read error: Connection reset by peer). 14:01:13 -!- sebbu2 has joined. 14:01:44 -!- sebbu has quit (Ping timeout: 252 seconds). 14:01:53 -!- sebbu2 has quit (Changing host). 14:01:53 -!- sebbu2 has joined. 14:02:28 -!- sebbu2 has changed nick to sebbu. 14:04:06 -!- nooodl has joined. 14:57:35 -!- ais523 has quit. 15:24:47 -!- atslash has joined. 15:32:32 -!- Sprocklem has joined. 15:32:42 -!- atslash has quit (Quit: This computer has gone to sleep). 15:41:27 -!- Slereah_ has quit (Read error: Connection reset by peer). 15:41:48 -!- Slereah_ has joined. 16:12:41 -!- atehwa has joined. 16:13:07 -!- FreeFull has joined. 16:18:22 -!- FreeFull has quit (Read error: Connection reset by peer). 16:21:21 -!- spiette has quit (Quit: :qa!). 16:28:20 -!- atslash has joined. 16:41:16 -!- Bike has joined. 16:57:16 -!- FreeFull has joined. 17:03:37 -!- FreeFull has quit (Ping timeout: 240 seconds). 17:09:46 -!- shikhout has joined. 17:12:50 -!- shikhin has quit (Ping timeout: 264 seconds). 17:12:51 -!- shikhout has changed nick to shikhin. 17:23:29 -!- atslash has quit (Quit: This computer has gone to sleep). 17:27:35 -!- oerjan has joined. 17:27:46 -!- FreeFull has joined. 17:30:48 helloerjan 17:32:18 -!- Bike has quit (Ping timeout: 240 seconds). 17:32:42 hitopia 17:34:57 :( 17:37:11 pura vidaneb 17:38:51 I am sad because, as my ethernet is not working, this torrent is going very very slowly 17:39:06 ah. understandable. 17:39:15 i am sad becuase bastion wouldn't install 17:44:29 I enjoyed Bastion 17:44:57 i'll figure out how to get it to work eventually 17:45:02 Share and Enjoy. 17:45:12 I hope you do, it was a fun game 17:51:38 taneb: Yeah, it was fun. 17:52:35 "It goes on until it ends," to quote Banks. 17:55:22 Another annoying thing is that the torrent seems to have downloaded episodes 2-5 while my ethernet was working but only half of episode 1 18:02:57 well then watch episode 5 first and see if you understand anything of it ;) 18:07:46 I do not think that that is the best idea, int-e 18:08:48 You can watch one half of episode 1 interlaced with one half of episode 2, because watching episode 1.5 like that will round down to episode 1 because of truncation to integers. 18:09:41 `? mad 18:09:50 now what 18:10:02 "u mad" is I think the expected response? 18:10:17 HackEgo! 18:10:19 :( 18:10:20 Gregor``: BOT SHORTAGE 18:10:22 Gregor``, :( :( 18:10:24 fungot: mad? 18:10:24 fizzie: now i say lo miss eu.dipx dipx where got always bluff me say u sleeping at which room will ask u come here and search for job right 18:10:50 fizzie: that's not what HackEgo would respond to that command, no. 18:14:06 Is there an internet search engine that takes regexps? 18:14:58 Google code search used to, but only for searching code and not the web in general. 18:15:02 And anyway it was discontinued. 18:15:15 (There was that mildly interesting writeup on how it worked behind the scenes.) 18:24:34 -!- Slereah__ has joined. 18:26:25 -!- Slereah_ has quit (Ping timeout: 240 seconds). 18:26:27 -!- MoALTz has quit (Read error: Connection reset by peer). 18:26:46 -!- atslash has joined. 18:28:03 -!- Slereah_ has joined. 18:30:40 @ping 18:30:40