00:00:12 olsner, it is low latency stuff. Anyway wine doesn't use it. It uses alsa directly. I have hardware mixing. SB Live 5.1 00:00:57 arva c'frta deîmu xœt'yr • pala'ds fvrofvr ta'ãr 00:01:25 olsner: OSSv4. Problem solved. 00:01:32 jack replaces alsa? or goes around it somehow? 00:01:51 olsner, nop. jack uses alsa. 00:01:56 Uses ALSA. ITs for professional audio work 00:01:58 Bye. 00:02:02 olsner, but it runs daemon with realtime priority and such 00:02:22 ok, sounds fancy 00:02:27 -!- ehirdiphone has quit (Quit: Get Colloquy for iPhone! http://mobile.colloquy.info). 00:02:30 olsner, well I guess so 00:04:02 olsner, anyway, last I tried spotify didn't work well in wine at all. Hm. 00:04:16 other apps, like portal, works fine in there 00:04:29 Portal? the game? 00:04:32 yes 00:04:38 olsner, didn't like it very much though 00:05:01 olsner, I mean, sure it is innovative to a degree. But I really dislike the FPS concept 00:05:16 how does GHC implement currying? 00:05:23 does it depend on context? 00:05:35 no 00:05:41 currying always happens 00:05:47 well right, but I meant 00:05:53 -!- cpressey has joined. 00:05:55 the way it's compiled, is that always the same? 00:05:56 olsner, I much prefer the third person perspective of for example nwn 00:05:59 oh, I have no clue 00:06:24 it seems like for a typical function call GHC would avoid explicit currying. 00:06:26 my setup for flawless spotify sound: disable hardware acceleration in spotify, choose alsa driver and "hardware acceleration: Emulation" in the wine configuration 00:06:53 olsner, eh, hw acceleration in wine? don't remember that setting. What does it do 00:07:03 there is a JACK driver too in wine though, I would guess that it either works better or was what caused the problems :) 00:07:18 AnMaster: well, you disable it to make spotify work better, that's about all I know 00:07:25 olsner, it doesn't seem to be compiled here 00:07:29 that jack driver in wine 00:07:43 olsner, ah but can that be set per app? 00:07:49 CakeProphet: i am pretty sure ghc doesn't curry if it knows all arguments at the outset 00:07:57 would only make sense. 00:08:03 the wine configuration or the spotify configuration? 00:08:10 olsner, wine 00:08:33 dunno, why? 00:08:39 olsner, the applications tab seems to be just about the windows version 00:08:47 olsner, some other app needs full hw accleration iirc 00:08:57 for audio? 00:08:58 forgot which one it was 00:08:59 olsner, yes 00:09:09 olsner, would be annoying to switch all the time 00:09:24 CakeProphet: and it does lots of inlining optimization and stuff, which probably also can remove currying 00:09:47 -!- augur has quit (Ping timeout: 245 seconds). 00:10:01 oerjan, does that mean large and fast code rather than small? 00:10:44 oerjan, thus resulting in ghc being unsuitable for systems with little memory/space? 00:10:51 like embedded systems 00:11:00 ha. embedded Haskell 00:11:21 AnMaster: well laziness and lots of garbage collection would do that anyway 00:11:25 AnMaster: ok, the wine setting didn't seem to have any effect on spotify anyway 00:11:30 olsner, ah 00:11:58 hmmm... it seems like you could actually implement laziness via optimization. 00:12:07 summary: spotify works fine in wine on linux 00:12:08 like constructing for loops out of maps and such. 00:12:16 AnMaster: i don't know that much about ghc really, it probably has several parameters for what to optimize for 00:12:23 CakeProphet: implement via optimization? 00:12:46 oerjan, hm 00:13:01 oerjan, then who is our resident expert on ghc internals 00:13:02 basically optimize lazy code into its eager semantics at compile time... if possible. 00:13:02 ? 00:13:10 according coppro there is likely to be one! 00:13:30 or one of us can retrieve one quickly 00:13:34 that was the second part of the theorem 00:13:41 coppro, ah 00:13:52 coppro, I thought you said "one of us becoming one" 00:13:55 although you could also view them as two separate theorems 00:13:56 oh 00:14:03 no, I meant could fetch one and bring em here 00:14:09 coppro, oh 00:14:13 CakeProphet: I think that's what you commonly get, since laziness for iteration is such a common pattern... if you have a top-level loop that prints a list with many lazy values, you may end up with a for-loop that evalutates then prints 00:14:43 where "loop" = mapM print values or something like that 00:14:50 CakeProphet: ghc _does_ construct loops out of maps, and has a "rules" mechanism for optimizing several forms 00:14:55 -!- cheater99 has joined. 00:14:56 coppro, I don't remember much such fetching? 00:14:58 hello 00:15:02 how are you sweeties 00:15:05 as long as it can see far enough down the line of turtles 00:15:06 coppro, or any at all to tell the truth 00:15:30 AnMaster: yeah, it doesn't go on much. It was more academic to also include the fact that many of us also mingle in relatively academic circles 00:15:40 coppro, well yes 00:15:40 for instance, I could retrieve an expert in cellular metabolism quite quickly 00:15:50 coppro, and get him to join here!? 00:15:54 coppro, I'd be surprised 00:16:00 AnMaster: oh well i know _some_ random ghc internals, just not detailed enough for space vs. time optimization 00:16:08 oerjan, ah 00:16:23 AnMaster: he hangs around on EFNet and is a good friend, I'm sure I could get him to at least join and then part ;) 00:16:24 why would you want to ask an expert in cellular metabolism about ghc internals? 00:16:29 coppro, hah 00:16:34 coppro, no need to try 00:16:53 btw did I ever mention that silly warning on the warning page of my electrical piano? 00:17:08 you know the page with stuff like "do not put something with water in on top" and such 00:17:19 -!- Gracenotes has quit (Ping timeout: 252 seconds). 00:17:36 did I ever tell about the extremely silly warning there? 00:17:46 (much sillier than that about the water) 00:17:54 do not dance on top of piano? 00:17:58 oerjan, almost 00:18:07 oerjan, "do not stand or jump on the piano" 00:18:08 do not eat piano? 00:18:10 AnMaster: btw, if you're worried about code size in haskell you should be much more worried about the RTS and statically linking gmp and a bunch of other stuff into your program 00:18:46 micahjohnston, strangely enough that one was missing. Should contact them and point out that flaw 00:19:09 of course, dynamic linking gets rid of some of that, but if you're talking about embedding a single haskell program you'll still have to install that stuff :) 00:19:16 olsner, indeed. Can you get a program smaller than 40 kB? 00:19:28 wait gmp? 00:19:31 why gmp? 00:19:36 for bignums 00:19:42 haskell has them built in you know 00:19:43 olsner, oh I confused gmp and mpfr 00:19:58 mpfr is bigfloats isn't it? 00:20:14 olsner, the use case I'm thinking about is 16-bit and has no FPU 00:20:14 yeah, or gmp with an exponent per bignum 00:20:24 olsner, and after OS is loaded it has 56 kB free ram 00:20:37 clearly not fit for that 00:20:42 ehm, hmm, you'd have to *port* ghc to that first... *good* *luck* 00:20:46 olsner, :P 00:20:53 LLVM, obv 00:21:03 coppro, I would have to port llvm to it 00:21:03 i think they've added an alternative option to gmp recently, for license reasons i think 00:21:10 maybe ehc could do something though, iirc it compiles to C and has a very small RTS 00:21:25 AnMaster: Adding a new target to LLVM is pretty cool, actually 00:21:44 I wonder if it has an MMIX target 00:21:47 coppro, it involves C++ 00:21:53 or whatever it's called right now 00:21:54 coppro, I'm not amused by C++ 00:22:07 AnMaster: LLVM is good C++, and also TableGen 00:22:09 olsner, ehc? 00:22:19 coppro, tablegen? 00:22:42 AnMaster: a project-specific code generator that takes a lot of the pain out of things 00:23:00 coppro, I see. This platform is highly RISC and I need to output COFF as the binary format 00:23:06 another way to use haskell for embedded development is to use the type system to produce a type-rich DSL that just generates code for the device 00:23:06 originally designed and still primarily used for handling instruction tables for various architectures 00:23:16 olsner: i thought i read jhc is the one with small program size, if that's still developed 00:23:20 coppro, I think that is about 50 00:23:24 coppro, instructions I mean 00:23:34 oerjan: hmm, I might be confusing them 00:23:36 AnMaster: I'll see if I can find some examples 00:23:47 coppro, h8300 btw 00:23:54 coppro, if you feel up to the task ;P 00:24:02 -!- poiuy_qwert has quit (Quit: Leaving). 00:24:10 olsner: well i couldn't say ehc isn't also 00:24:10 coppro, last gcc version to support it for coff at least was gcc 3.x 00:24:11 AnMaster: indeed, JHC is the one I'm thinking of 00:24:16 olsner, jhc? 00:24:27 ah 00:24:38 LLVM supports COFF for some targets, but I'm not sure how easily portable that is 00:24:45 coppro, ah... 00:24:57 AnMaster: whole program optimizing compiler for haskell, iirc 00:25:01 coppro, also I need custom linker script. But I guess I will use the same outdated binutils 00:25:07 oerjan, doesn't ghc do that? 00:25:08 http://repetae.net/computer/jhc/ 00:25:12 oerjan, I'm extremely surprised 00:25:24 AnMaster: no ghc is mainly separate compilation 00:25:31 oerjan, wtf 00:25:42 ghc doesn't do whole-program optimizations, just cross-module optimizations 00:26:05 olsner, huh, so make the set of modules you optimise between be the whole program? 00:26:31 ghc mainly does stuff like output bytecode (or something similar) for selected functions so they can be inlined in other modules 00:26:38 ah 00:26:50 other functions will be output as machine code in the .o and can't be inlined 00:31:23 -!- clog has quit (Ping timeout: 265 seconds). 00:31:23 -!- clog has quit (ended). 00:31:27 -!- clog has joined. 00:31:27 -!- clog has joined. 00:34:32 -!- relet has quit (Quit: Leaving.). 00:41:06 -!- augur has joined. 00:44:47 -!- FireFly has joined. 00:47:11 ever been an attempt to implement monads in C? 00:47:20 probably 00:48:18 "Introducing Monads in C. Better known as Fun With Function Pointers." 00:51:52 so are arrows kind of like flowchart-monads? 00:52:08 * coppro whoosh 00:52:44 -!- Quadrescence has joined. 00:52:52 if so 00:53:03 I think you could use them with a DSP library. 00:57:42 -!- augur has quit (Ping timeout: 245 seconds). 01:09:16 -!- calamari has quit (Quit: Leaving). 01:13:16 -!- augur has joined. 01:17:31 -!- BeholdMyGlory has changed nick to Behold. 01:17:42 -!- augur has quit (Ping timeout: 245 seconds). 01:31:42 -!- zzo38 has joined. 01:32:41 -!- augur has joined. 01:44:58 AnMaster: Funny you mention it. 01:45:03 AnMaster: I was just thinking about ZEE yesterday. 01:45:28 AnMaster: I'm still stuck at the same point: I can't make progress until I have a story, I can't write a story myself because I'm not that kind of creative, and I can't find anybody to write a story for me. 01:47:35 Gregor: Did you see my story "Harper's Challenge"? It is hardly done much, and it isn't entirely my own either, it is group of people named by a pseudonym. And it has appendix. 01:48:46 zzo38: The problem with ZEE in the story department is that the nature of the game (and more to the point, the achievability of getting the requisite photos) has an enormous impact on the possible stories. 01:48:56 I keep getting great but unimplementable story ideas. 01:49:04 What does ZEE means? 01:50:28 *** INTRODUCTION *** This introduction intentionally left blank. 01:53:36 Zoom-Enhance-Extrapolate. It's an image-based maze game parodying those silly scenes from spy movies where they take an arbitrary image, zoom in on it, "enhance" it, and "extrapolate" random garbage out of it. 01:53:46 Or at least, it's supposed to be. 01:53:56 Right now it's most of an image-based maze game engine with no story :P 01:59:57 Maybe it doesn't need to have a story 02:08:58 -!- yiyus has quit (Ping timeout: 258 seconds). 02:12:53 -!- augur has quit (Ping timeout: 265 seconds). 02:13:02 -!- zzo38 has quit (Remote host closed the connection). 02:17:28 -!- yiyus has joined. 02:28:03 -!- CakeProphet has quit (Read error: Operation timed out). 02:28:17 -!- CakeProphet has joined. 02:33:02 -!- CakeProphet has quit (Ping timeout: 260 seconds). 02:44:58 -!- CakeProphet has joined. 02:49:47 -!- CakeProphet has quit (Ping timeout: 272 seconds). 02:56:18 -!- ski has joined. 03:09:03 -!- FireFly has quit (Quit: swatted to death). 03:09:04 -!- Behold has quit (Read error: Connection reset by peer). 03:13:28 -!- GreaseMonkey has joined. 03:18:25 -!- CakeProphet has joined. 03:19:57 -!- boily has joined. 03:31:07 -!- cal153 has quit (Ping timeout: 248 seconds). 03:34:18 -!- boily has quit (Quit: leaving). 03:46:40 Gregor: i've been thinking about the game too, recently, but, as you might guess depending on how well you know me, so probably not, i feel like you shouldn't use photos but render images on the fly. that would be more authentic, in any case i also have some story ideas, i would probably work on them more if this had been my idea 03:46:43 it's a great idea. 03:47:22 " I keep getting great but unimplementable story ideas." <<< okay i haven't gotten far enough to think about implementability :P 03:47:30 Rendering is actually /more/ unachievable than using photos. Well, depending on your required fidelity I suppose ... rendering sufficiently photorealistic images (even of scenes excluding humans) is ... complicated. 03:49:49 just iterate over pixels and see what's there, i don't really care how good it looks, you could just zoom if you can't make out what's happening. i don't really care about the parody aspect, so this puritanian version without actual images would probably not have humans in the story. 03:50:18 (i have ideas with humans too tho :D) 03:50:40 Not having humans is a plus. 03:50:47 For various reasons. 03:50:57 Both storywise and achievability-wise. 03:51:05 well implementabilitywise at least, and i guess also the two other reasons 03:51:09 err 03:51:09 one 03:51:10 (The story would have humans obviously, but the images are more about finding clues then catching people in the act) 03:51:26 well it could end with you catching ppl in the act maybe 03:52:30 someone holding a bloody knife with a dick in his hand 03:53:03 -!- cal153 has joined. 03:56:46 ? 03:56:58 well we can leave the blood out i guess 03:57:06 if you don't like violence 03:58:08 maybe some of the clues would involve you seeing some kind of leaf and then an expert tells you the tree only grows in a 10m x 10m area in X-town 03:58:26 -!- augur has joined. 03:59:29 in one of those shows there was a leaf somewhere and they suddenly know exactly where in us some meeting takes place or something 04:00:03 "we're in luck there are only two of this tree in the whole universe" 04:00:38 or maybe a law and order ending where the killer goes free 04:09:54 * Gregor reappears. 04:10:01 That comes down more to "achievability" :P 04:10:21 Getting a picture of somebody with a bloody knive in one hand and a severed penis in the other is tricky. 04:10:42 And rightfully so! 04:17:41 oklopol: plot twist: the expert is actually an alien. 04:17:48 and is fooling you. 04:17:54 for... uh... profit. 04:18:16 ...I'm very tired. 04:21:27 -!- oerjan has quit (Quit: ZZZZZZZZZZZZZZZZZZZZZ). 04:24:10 KERNELOOPS 04:25:18 * pikhq mutters 04:25:20 (Kernel Orangutan-oriented Programming Style) 04:25:37 Dental fillings suck. 04:25:52 evaluates to true. 04:26:03 -!- bsmntbombdood has joined. 04:26:06 I had 2 today and am getting 2 tomorrow. 04:26:11 :( 04:26:19 CakeProphet: I want FROOTLOOPS 04:26:25 And the two fillings I got today are currently sensitive as hell. 04:26:48 coppro: Wait... what is a Frootl? 04:27:08 CakeProphet: lots of sugar 04:27:39 Gregor: oh umm i was thinking he killed someone else, and then masturbated because killing people is, as we all know, pretty hot 04:27:46 so shouldn't be that hard 04:29:03 Fashionably Redundant Object Optimization Typography, for Learning Orangutan-Oriented PRogramming Style 04:29:30 well... Topology sounds more abstrackt 04:29:33 lawl. 04:30:08 A fashionably redundant object optimization topology, you say? Oh, well now I'm intruged. 04:30:21 But only if there is a paper about it. Must have an abstract. 04:30:40 topology! 04:30:41 otherwise I will lose interest and become distracted. 04:34:06 "Towards an understanding of orangutan-oriented programming through reprogrammable hydro-banana-morphisms" 04:34:20 morphisms! 04:35:13 I meed only add a few "keywords" to any phrase and it becomes academic, regardless of how ridiculous the other words sound. 04:35:56 I accept your challenge. 04:36:03 Your words are: "Getting a picture of somebody with a bloody knive in one hand and a severed penis in the other is tricky." 04:36:08 Add words to that to make it academic. 04:36:26 -!- augur has quit (Ping timeout: 265 seconds). 04:36:26 ..hahaha 04:36:55 hmmm... 04:37:07 -pretends to dissect when really he is just tired as shit- 04:40:19 Getting a picture of somebody with a blood knive in one hand and a severed penis in the other is tricky, but can be readily reduced to a problem of optical complexity theory classes. 04:41:11 -!- augur has joined. 04:42:15 or, more generally, orangutan-oriented programming with optical complexity /heuristics/. 04:42:46 ... 04:42:54 Gregor: how's that? 04:43:45 lawl X-D 04:44:56 Though, sometimes a banana-morphism is more elegant 04:51:26 -!- coppro has quit (Remote host closed the connection). 04:52:04 -!- coppro has joined. 05:04:28 -!- augur has quit (Ping timeout: 265 seconds). 05:21:39 Woo! Finished the Tower of Hanoi code 05:27:49 -!- MizardX has joined. 05:28:11 Well, almost finished 05:28:15 It's still a bit crashy 05:28:39 Well, not crashy, but once anyone's won, clicking the third column is enough for anyone to win 05:33:00 * Sgeo watches someone fail to solve Tower of Hanoi 05:33:10 He'd be on the right track if the goal was the second column and not the third :/ 05:33:16 -!- augur has joined. 05:36:03 I hate that 06:20:49 -!- augur has quit (Ping timeout: 265 seconds). 06:45:30 -!- augur has joined. 06:51:03 man, I wish the flashblock guy wasn't such a jerk 06:51:31 -!- augur has quit (Remote host closed the connection). 06:52:22 -!- augur has joined. 07:02:41 -!- tombom has joined. 07:50:26 -!- tombom has quit (Quit: Leaving). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:01:58 -!- pikhq has quit (Remote host closed the connection). 08:07:35 damn you tvtropes 08:08:05 also damn you inexplicable compulsion to find the trope that best describes my dating situation 08:14:27 ah, there we go 08:20:13 -!- GreaseMonkey has quit (Quit: I'm using NO SCRIPT WHATSOEVER - Download it at file:///dev/null). 09:03:46 -!- josh_ has joined. 09:08:55 -!- josh_ has quit (Quit: Leaving). 09:44:16 -!- MigoMipo has joined. 10:30:48 -!- FireFly has joined. 11:03:34 -!- ais523 has joined. 11:30:13 ugh the course literature for the autumn includes one by Bjarne Stroustrup. Yeargh. 11:30:35 ais523, ^ 11:30:52 is he that bad at writing books? 11:31:09 ais523, no idea. But surely you know what the topic will be of it 11:31:25 not necessarily 11:31:29 ais523, well, C++ 11:31:36 he is after all the inventor of C++... 11:31:48 yes, that doesn't mean everything he does in his entire life is C++-related 11:32:05 ais523, well there is a high probability of it being C++ 11:32:18 you mean you don't actually know what the book is about? 11:32:50 ais523, of course I do. But I meant in general, it should not have been a unlikely guess that it was about C++ for you 11:32:59 the title is "The C++ Programming Language, Special Edition" 11:33:02 *shudder* 11:33:21 I have no clue what the special edition bit is about 11:33:21 -!- oerjan has joined. 11:33:26 hi oklopol 11:33:26 err 11:33:28 oerjan, ^ 11:33:40 g'day 11:33:53 ais523: All his books -- http://www2.research.att.com/~bs/books.html [at his homepage] -- have the word "C++" in them. 11:34:00 oerjan, since when did you become holly-wood-Australian? 11:34:13 fizzie: hmm, an unfortunately narrow choice of topic 11:34:29 I suppose if you're famous for something, it's an easy topic to convince people to publish your books on 11:34:39 ais523, the same is true with the word s/ly narrow// applied 11:34:53 AnMaster: since i started making my greetings silly 11:35:01 oerjan, and when did you start with that? 11:35:13 AnMaster: why are you hanging around in #esoteric if you can't even handle C++? 11:35:14 AnMaster: a few years ago? 11:35:28 oh and an 864 page book about computer networking... 11:35:38 I can't think how anyone could write that much on computer networking 11:36:00 on the other hand I long ago concluded that in English, the writers of course literature are paid per word 11:36:00 ais523: He has a wide(r) selection of topics in the full list of publications (interviews, conference papers, journal articles). It's just books that are rather focused. 11:36:18 which is probably not the case for Swedish course literature 11:36:26 it tends to be much more concise 11:36:28 and to the point 11:36:34 than English course literature 11:36:38 I would think computer networking is an easy topic to write a lot about. There's a lot of it going on, and none of it is especially simple. 11:36:53 fizzie, hm 11:37:32 I'm not sure how to fit it in my backpack though 11:37:45 as in, I can't imagine it would fit with the other large books 11:38:27 The special edition of the C++ book is supposedly 1029 pages. 11:38:43 That's a lot of tree. 11:38:51 another title: "Data Structures and Algorithm Analysis in C++". That is like taking some of the most interesting topics of compsci (data structures and algorithm analysis) and dipping it in the tar of C++ 11:38:55 :( 11:39:57 fizzie, yet that one was about half the price of the thick networking book 11:39:59 Your C++ antipathy is borderline pathological. It's not like you'd (probably) encounter the most warped corners of the language in a data structures book. 11:40:11 fizzie, hm 11:40:43 You'd prefer MIX assembly more, right?-) 11:40:58 and huh "The essence of artificial Intelligence". I guess they want to get us interested in their master program (AI stuff). I'm going to move to another university for the master program personally 11:41:09 fizzie, yeah :) 11:41:35 fizzie, or SCIP 11:41:50 it talks about data structures unless I misremember completely 11:42:10 Not *that* much, though. 11:42:19 fizzie, "Effective C++" doesn't sound like a fun title either 11:42:36 Scary Concepts in Programming 11:43:12 CLRS ("Introduction to Algorithms") is one data structures/algorithms book that's also reasonably reasonable; the only language it contains is their own pseudo. And the book's website has the LaTeX package to typeset it, which is nice for homework exercises. 11:43:32 fizzie, heh 11:44:09 It doesn't go very deep into algorithm analysis or more esoteric data structures, but, well, it does say "introduction" right there in the title. 11:45:07 fizzie, I much more look forward to the Swedish "Datatyper och algoritmer" which is bound to be a lot more concise. (see above wrt getting paid per word) 11:46:29 I'm not sure if paid-per-word is the reason, or just difference in cultures. Certainly the same distinction is there with English vs. Finnish textbooks. Especially the mathematics one. 11:47:02 s/one/ones/ 11:47:26 fizzie, I much prefer the conciser variant, it means I save hours. 11:47:27 And I'm not sure if that's so "especial", it's just that there's very little material in Finnish on our courses. 11:47:46 fizzie, there have been about 50% so far, less during the year to come 11:49:02 You have a bit larger audience there, I guess it helps. I don't think I really have any computer-science related Finnish course literature on the bookshelf. There's some discrete maths and probabilistics, and then some electronics. 11:50:36 Oh, and a single, very narrow "C-ohjelmointikieli" (lit. "the C programming language"), though that's actually my wife's. (I haven't bothered to buy copies of all books.) 11:50:42 fizzie, I have discrete maths, C, digital logic, electronics and database in Swedish. Yeah, that is what compsci turned into here :( 11:50:49 and from what I heard, in many other places 11:51:07 fizzie, your wife does CS too? I didn't remember that 11:51:38 Yes, though with a rather different focus (usability and communications and things like that) than I. 11:51:49 fizzie, sounds like it might involve GUI 11:51:59 It often does. 11:52:05 _her_ creations are actually usable 11:52:12 It also often involves people, which is my main reason to avoid it. :p 11:52:15 * oerjan ducks 11:52:18 oerjan, hey fungot is fully usable 11:52:19 AnMaster: i just wrote? 11:52:25 perfect! 11:52:56 oerjan: It's not as funny because it's so true. 11:53:11 But yes, who can ask for more than fungot; there's even a help command. 11:53:11 fizzie: cmeme is a log bot afaik 11:53:20 huh? 11:53:24 what is cmeme? 11:53:29 A log bot, AFAIK. 11:53:32 ah 11:53:36 so likely a direct quote 11:53:42 or nearly anyway 11:53:54 fizzie, which channel is it in? 11:54:03 [2005-10-11 13:57:19] < Gs30ng> cmeme is a log bot afaik 11:54:24 It used to be here. 11:54:26 ah 11:54:58 AnMaster: cmeme has been gone for years 11:55:10 -!- atrapado has joined. 11:55:34 which is a bit of a shame because its logs were much better formatted 11:55:47 oerjan: cmeme last quit from #esoteric in 2008-11-06, that's not so many years. 11:55:50 although that also meant they loaded slow 11:56:07 fizzie: well it's about half they years i've been here 11:56:10 *the 11:56:56 There's still references in the tunes.org log-directory HEADER.html: 11:56:59 For a so-called "pretty" view of these logs, go to http://tunes.org/~coreyr/. 11:57:00 For even "prettier" (css'd, searchable, customizable, etc) logs, go to http://meme.b9.com. 11:57:15 But meme.b9.com -> ircbrowse.com, which does not exist. 11:58:00 the logs are perfectly readable 11:58:23 But not pretty. 11:58:34 The CSS thing was indeed prettier. 11:58:35 fizzie, wget | sed ? 11:58:51 You could twiddle with what it looks like and all. 11:59:04 fizzie, you could make it align nicely easily enough 11:59:06 it is pure text 11:59:14 align as in how xchat does it 11:59:56 Yes, and you could do any sort of formatting you want locally, but it was already prettified with several different styles out-of-the-box there. 12:00:09 meh, who needs out of the box? 12:00:23 People who have other stuff to fiddle with, I guess. 12:00:36 I wonder if there's a LaTeX package for proper typesetting of irclogs yet. 12:00:43 yeah people who cannot whip up a quick prettifier in brainfuck don't _deserve_ to read the logs 12:01:06 oerjan: Yeah, those people can stay in the box. 12:02:33 My #esoteric log for 2003-2008 is 46 megabytes of text; that'd make a pretty nice set of books if bound into hardcover with attractive cover art, good typography and all that fluff. 12:02:47 Then I could quit my day job, and be a door-to-door ency^H^H^H^H#esoteric salesman. 12:03:42 oerjan, shell, not bf ;P 12:03:52 slogan: it's better than fake persian rugs 12:04:01 AnMaster: YOU ARE NOT WORTHY 12:04:14 oerjan, ;P 12:12:02 -!- BeholdMyGlory has joined. 12:26:32 -!- ais523 has quit (Remote host closed the connection). 12:50:11 -!- augur has quit (Remote host closed the connection). 12:53:32 -!- oerjan has quit (Quit: Later). 13:53:23 -!- bluebooblue has joined. 13:53:37 good morning 8) 13:56:04 -!- bluebooblue has quit (Client Quit). 14:08:06 AnMaster: i've read that and i liked it even though i hate c++. but then again i like most books so i guess this is not very helpful... :D 14:11:18 books about algorithms that use an object oriented language are insane, they only have time to cover a few trivial ones because every tiny snippet takes pages and pages of code 14:11:56 (i'm not saying oo is inherently too verbose, i'm just grouping java and c++) 14:32:29 oklopol, I fully agree with you when it comes to C++ and java 14:46:50 -!- coppro has quit (Remote host closed the connection). 14:48:07 -!- augur has joined. 15:00:36 i once read this 300 or 500 or something page book about algorithms in one afternoon, because it was always 5 pages of explanation of something completely trivial, followed by the same amount of code, the algorithms could've been explained much more concisely, because it was only the level of dijkstra and quicksort, but i guess they wanted to keep the text-to-code ratio sensible and added fluff (i guess i skipped many of the proofs t 15:01:13 (...and all the code) 15:01:50 "of the proofs t" 15:01:59 damn 15:02:09 *oo) 15:02:10 :P 15:02:59 You really should configure your client properly / install a plugin so that you don't have to worry about splitting long lines manually 15:03:35 i should get nnscript or start using another client, mirc is horrible alone 15:04:02 but that's SOOOOOO much work 15:04:03 no 15:04:06 that's the OLD oklopol 15:04:10 * oklopol gets nnscript 15:05:40 hmm okay i would have to get an older mirc 15:05:55 so maybe another client, but, well, i'm not THAT NEW an oklopol. 15:06:01 so maybe tomorrow 15:06:15 windows should never steal focus 15:06:15 ever. 15:06:29 i agree 15:06:30 They should blink at me from the bottom of the screen 15:06:39 i find that really annoying too 15:06:59 well if it was once, but i mean if they just start blinking away like crazy 15:07:13 I wonder if I can change that in Gnome/Xorg/whatever 15:08:06 It depends on your WM (so not Xorg) 15:08:33 well... no blink, but simply notify. The way Ubuntu does it is very subtle. Nowhere near as obnoxious as the blinking orange in XP. 15:08:51 Dunno about other distros. Haven't used them. 15:08:52 that's the OLD oklopol 15:08:54 what? 15:08:55 you changed? 15:09:12 maybe! 15:09:15 maybe not. 15:09:31