| --- Log opened Sat Oct 10 00:00:26 2009 |
| 00:05 | < gnolam> | Namegduf: thanks for the explanation, BTW. |
| 00:06 | < Namegduf> | gnolam: No problem. |
| 00:18 | | * Vornicus is so so glad he knows regex. |
| 00:22 | <@McMartin> | 15:29 < Namegduf> Oh, right. I thought that was SOP. |
| 00:22 | <@McMartin> | Other OSes remind you after two failures to check CAPS LOCK. |
| 00:24 | <@Vornicus> | Windows and Mac last I knew had live "caps lock" notifiers. |
| 00:24 | < Namegduf> | Ah. |
| 00:24 | <@Vornicus> | THough mac's is a lot more visible than Windows', which I found often disappears too quickly. |
| 00:26 | | * McMartin hasn't checked on 7, actually |
| 00:27 | <@Vornicus> | (on mac, shell password fields have a little capslock icon in the right end of the field.) |
| 00:32 | <@McMartin> | In other news, 10.6 finally includes a feature that Windows had 10 years ago |
| 00:32 | <@McMartin> | (per-printer default settings) |
| 00:32 | <@Vornicus> | Heh |
| 00:56 | | Derakon[AFK] is now known as Derakon |
| 00:56 | | AnnoDomini [farkoff@Nightstar-219ca5c8.adsl.tpnet.pl] has quit [[NS] Quit: How desirable it is among those similar to me // A different one to be - beautiful, strong, brave! // Such individuals, in the sparrows world - not welcome… // In fact, then, a CROW theyll call me! Even if they admit I'm a white one.] |
| 02:47 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has quit [[NS] Quit: Z?] |
| 03:34 | | Attilla [The.Attilla@FBC920.482E2D.402892.A075C8] has quit [Client closed the connection] |
| 04:36 | | * Vornicus really doesn't like writing these any more. |
| 04:36 | < SmithKurosaki> | What? |
| 04:36 | <@Vornicus> | infix parsers. |
| 04:36 | < SmithKurosaki> | That sounds unpleasant |
| 04:37 | < dmlandrum> | That could be the name of a hard-bitten detective in a noir story. |
| 04:37 | <@Vornicus> | This would be the... fourth? language that I've written one in. |
| 04:37 | < SmithKurosaki> | Why? |
| 04:38 | <@McMartin> | People like being able to type "1 + 2" |
| 04:38 | < SmithKurosaki> | Ahh |
| 04:38 | < dmlandrum> | Aww, what's wrong with +(1,2)? |
| 04:39 | <@McMartin> | INFIDEL |
| 04:39 | <@McMartin> | Proper Prefix form is (+ 1 2) |
| 04:39 | < SmithKurosaki> | ( I do not yet know all the intricacies of parsing and such yet, I am planning to take the compilers course that my school has |
| 04:39 | <@Vornicus> | One for my first "serious program"; the second for a C++ class; the third for... I don't remember why...; this on, my fourth, in Javascript, for my data structures class. |
| 04:39 | < SmithKurosaki> | eww |
| 04:40 | < SmithKurosaki> | I have to write a C program that can do postfix. Amusingly, this assignment became known to me a day or two after the polish reverse sausage, which makes the assignment so much funnier] |
| 04:42 | < SmithKurosaki> | I am really going to have to work the sausage thing into my program somehow... I have to do it with a stack too |
| 04:42 | <@McMartin> | Stacks and postfix computation are very tightly bound |
| 04:43 | < SmithKurosaki> | Meaning that they fit together immensly well? |
| 04:43 | < Reivthia> | What's hard about infix? |
| 04:43 | <@Vornicus> | infix parsing is two stacks; eventually you either get everything onto one stack (converted to postfix) or end up with just one value on the operand stack. |
| 04:43 | <@Vornicus> | Reivthia: operator priority and association direction. |
| 04:44 | < SmithKurosaki> | Interetsting |
| 04:45 | < Reivthia> | Oh, operator priority. |
| 04:45 | < Reivthia> | Yeah, that'd do it |
| 04:45 | < SmithKurosaki> | Do I sense a casual dismissal? |
| 04:46 | <@Vornicus> | Last time I wrote one of these it was 200 lines of C++; before that... shit I do probably have Schlockian2 floating around, let me see... |
| 04:47 | <@Vornicus> | Actually I don't remember what the C++ number was; my Python one is 196 lines of sheer horror. |
| 04:48 | < Reivthia> | I think it would actually be okay as long as you didn't have to deal with brackets. |
| 04:48 | < Reivthia> | But, alas. |
| 04:48 | <@McMartin> | I don't think Ophis's was that bad |
| 04:49 | <@Vornicus> | Well, there's parentheses, that's not too bad though. |
| 04:51 | <@Vornicus> | real horror involves full-strength language features. |
| 04:52 | <@Vornicus> | Conditional operators will drink your milkshake. |
| 04:57 | <@Vornicus> | And /then/ there's function definition. ;_; ;_; ;_; |
| 04:58 | | SmithKurosaki [Smith@Nightstar-ab52522f.dsl.teksavvy.com] has quit [Client closed the connection] |
| 04:58 | <@McMartin> | That shouldn't be harder than block statements in any reasonable language |
| 04:59 | <@Vornicus> | Schlockian 3 was, unsurprisingly, completely unreasonable. |
| 04:59 | | SmithKurosaki [Smith@Nightstar-ab52522f.dsl.teksavvy.com] has joined #code |
| 04:59 | <@Vornicus> | its flow control system was based on the conditional operator. |
| 05:00 | | * Reivthia feats on Vorn's brain. |
| 05:01 | | * Vornicus has Combat Expertise on his brain now. |
| 05:03 | | * Reivthia subtracts Vornicus's Intelligence, adds it to his Dodge. |
| 05:03 | < SmithKurosaki> | I haven't touched python yet |
| 05:11 | <@Vornicus> | I'm trying to decide whether it's saner to go to postfix and then process the shit out of it, or run the stacks as I go. |
| 05:12 | < SmithKurosaki> | postfix |
| 05:12 | < Reivthia> | My intuitive solution is postfix, then process, but this is a 'one thing at a time' thing in my head. |
| 05:13 | < SmithKurosaki> | postfix means only 1 tack and probably easier to debug |
| 05:13 | < SmithKurosaki> | *stack |
| 05:14 | <@Vornicus> | Well, no. |
| 05:14 | <@Vornicus> | In order to get to postfix I need to use two stacks. |
| 05:14 | < SmithKurosaki> | oh? |
| 05:14 | < Reivthia> | Stack for parsing, stack that postfix works on. |
| 05:14 | < SmithKurosaki> | hmm |
| 05:15 | < SmithKurosaki> | anyways, i require this odd thing called sleep. goodnight |
| 05:15 | <@Vornicus> | Well, more like: two stacks for parsing, and then when I'm done I have the postfix stuff in one of those stacks. |
| 05:17 | <@Vornicus> | (though I have to start at the bottom!) |
| 05:19 | <@Vornicus> | nini smith |
| 05:20 | < Reivthia> | Also, Vorn! |
| 05:20 | <@Vornicus> | ? |
| 05:21 | < Reivthia> | Hurry up and get a working globe in OpenGL, with XCOM-esque map interface over top of it. |
| 05:21 | | * Reivthia whistles happily |
| 05:21 | | * Vornicus shoots Reivthia in the brains. |
| 05:22 | | * Reivthia dies horribly. |
| 05:33 | <@ToxicFrog> | At least you're protected from the Chrysalids now~ |
| 05:33 | | * McMartin hands TF a primed grenade. |
| 05:37 | | * ToxicFrog plays Catch the Cyberdisk Plasma Bolt while standing in the middle of a gas station, surrounded by his squad |
| 07:05 | | Vornicus is now known as Vornicus-Latens |
| 08:32 | | Derakon is now known as Derakon[AFK] |
| 09:16 | | Rhamphoryncus [rhamph@Nightstar-a62bd960.abhsia.telus.net] has quit [Client exited] |
| 09:17 | | You're now known as TheWatcher |
| 09:36 | | crem [moo@Nightstar-8ca3eea7.adsl.mgts.by] has joined #code |
| 09:37 | | crem_ [moo@Nightstar-8ca3eea7.adsl.mgts.by] has quit [Ping timeout: 121 seconds] |
| 11:14 | | Namegduf [namegduf@Nightstar-7ec84b32.bath.ac.uk] has quit [[NS] Quit: Heading out for my train, be back late this evening.] |
| 11:29 | | AnnoDomini [farkoff@Nightstar-417b26e3.adsl.tpnet.pl] has joined #code |
| 11:29 | | mode/#Code [+o AnnoDomini] by Reiver |
| 12:46 | | You're now known as TheWatcher[afk] |
| 13:15 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has joined #code |
| 13:25 | | GeekSoldier [Rob@Nightstar-e86e3e0d.ip.cablemo.net] has quit [[NS] Quit: Praise "BOB"!] |
| 13:29 | | Attilla [The.Attilla@FBC920.482E2D.402892.A075C8] has joined #code |
| 13:29 | | mode/#Code [+o Attilla] by Reiver |
| 16:34 | | You're now known as TheWatcher |
| 17:01 | | Derakon[AFK] is now known as Derakon |
| 17:11 | | Namegduf [namegduf@Nightstar-7ec84b32.bath.ac.uk] has joined #code |
| 18:05 | | Derakon is now known as Derakon[AFK] |
| 18:20 | | Rhamphoryncus [rhamph@Nightstar-a62bd960.abhsia.telus.net] has joined #code |
| 19:21 | | Derakon[AFK] is now known as Derakon |
| 21:56 | | Kazriko [kaz@teela.arkaic.com] has quit [Client closed the connection] |
| 22:40 | | * Vornicus-Latens discovers that his sparse matrix's cells, column headers, row headers, and king corner all look exactly alike. |
| 22:41 | < Derakon> | Attack of the sparse clones? |
| 22:41 | <@Vornicus-Latens> | Heh. |
| 22:42 | <@Vornicus-Latens> | But they all have an "up", "down", "left", and "right", the cells have an "x" and "y" and a "value", the rows have a "y", and the columns have an "x" |
| 22:45 | < gnolam> | You know what this means, right? That you have to rename 'x' and 'y' to 'A' and 'B' and "value" to "Start". |
| 22:45 | < gnolam> | All hail the Konami Matrix. |
| 22:45 | < Derakon> | We're so helpful. |
| 22:46 | | * Vornicus-Latens turns gnolam into a lunar impactor. |
| 22:49 | <@McMartin> | "king corner"? |
| 22:52 | <@Vornicus-Latens> | I couldn't think of a better name. |
| 22:52 | <@Vornicus-Latens> | It's got links to the top and bottom of the row and column headers. |
| 22:58 | <@McMartin> | Got it |
| 23:06 | | Kazriko [kaz@teela.arkaic.com] has joined #code |
| 23:07 | | mode/#Code [+o Kazriko] by Reiver |
| 23:17 | | * SmithKurosaki is confused again :( |
| 23:19 | <@Vornicus-Latens> | SmithKurosaki: My thing? |
| 23:19 | < SmithKurosaki> | yea |
| 23:21 | <@Vornicus-Latens> | I'm writing a sparse matrix; this is a 2-dimensional object made of linked lists in both directions, so that the matrix can be disturbingly large and still only take up as much room as you need to hold the ones with interesting stuff in it. |
| 23:21 | <@Vornicus-Latens> | ....that each cell takes 6 references' worth of overhead doesn't help though. |
| 23:25 | < SmithKurosaki> | Ow |
| 23:26 | <@McMartin> | Can't you do linked lists of arrays of cells? |
| 23:26 | < Derakon> | I generally use dictionaries with location tuples as the keys when I need to solve this kind of problem. |
| 23:27 | <@McMartin> | This is for a data structures class and he probably hasn't taught them how to create hashtables yet. |
| 23:27 | < Derakon> | Mm, point. |
| 23:27 | < SmithKurosaki> | I am so glad I don't have to do that yet |
| 23:28 | < Derakon> | It's important to understand how these basic datastructures are implemented. |
| 23:28 | < Derakon> | Otherwise you won't be able to recognize the difference between an efficient solution and one that works but is horribly slow. |
| 23:28 | <@Vornicus-Latens> | McM: fortunately I don't have to do that kind of optimization, but on the other hand there is a difficulty: I have to be able to iterate cleanly both across and down. |
| 23:28 | < SmithKurosaki> | (I am currently in a data structures class as well atm) |
| 23:29 | < SmithKurosaki> | But we are only playing with linked lists, stack and bin trees atm |
| 23:30 | | Vornicus-Latens is now known as Vornicus |
| 23:37 | < Derakon> | Trees are very useful things, and stacks/queues are also nice for making recursive-style algorithms without the actual recursion. |
| 23:40 | < SmithKurosaki> | yea |
| 23:41 | <@Vornicus> | especially stacks. |
| 23:41 | <@McMartin> | Just don't miss the forest for the trees |
| 23:41 | <@McMartin> | l33t st4xx0r |
| 23:41 | < SmithKurosaki> | heh |
| 23:41 | <@Vornicus> | queues are more useful when you've got a lot of things you have to deal with and you don't want to hold up other parts of your program waiting for the bit that the queue feeds. |
| 23:42 | < SmithKurosaki> | I have to use stacks to do postfix math |
| 23:54 | <@Vornicus> | That's how it's done, yes. |
| --- Log closed Sun Oct 11 00:00:40 2009 |