--- Log opened Mon Oct 19 00:00:25 2009 |
00:01 | <@McMartin> | And this, ladies and gents, is what you get when you use hex strings to index decimally indexed files |
00:01 | <@Derakon> | I wonder what Beckha and Ofjeib mean. |
00:02 | <@McMartin> | One of those is likely "config" |
00:07 | | * Vornicus shoots stupid namespacing errors in the shit. |
00:23 | | * Vornicus eyes. Okay, now what. |
00:29 | <@Vornicus> | For some reason, c is gettng inserted left of b? |
00:33 | <@Vornicus> | ...this would be seek's fault but I can't see anything wrong with it. |
00:41 | <@Vornicus> | ....I'm a dumbass. |
00:42 | | * Vornicus has a recursive function! If this isn't what it's looking for, it goes deeper in! ...and doesn't bother to tell the child what it's looking for! |
00:44 | < SmithKurosaki> | oops |
00:58 | <@Vornicus> | So, yes. |
01:01 | | * Vornicus finally completely defeats the binary tree. |
01:03 | <@Derakon> | [Vornicus] gained 342 EXP! [Vornicus] advanced to level 8! |
01:48 | < SmithKurosaki> | Vornicus uses recursion! It's super effective |
01:49 | <@Vornicus> | Now I have to write this damn hash table. |
01:53 | <@Derakon> | Hash table...of the DAMNED! (lightning flash, thunder crash) |
02:00 | | Attilla [The.Attilla@FBC920.65CFFF.E56E70.387AF5] has quit [[NS] Quit: ] |
02:03 | | Alek is now known as Alla |
02:32 | | McMartin [mcmartin@Nightstar-cd8a4fac.pltn13.sbcglobal.net] has quit [Operation timed out] |
02:36 | | McMartin [mcmartin@Nightstar-cd8a4fac.pltn13.sbcglobal.net] has joined #Code |
02:36 | | mode/#code [+o McMartin] by Reiver |
02:50 | < SmithKurosaki> | Can anyone explain C switch statement syntax for me? |
02:51 | <@Derakon> | switch(variable) { |
02:51 | <@Derakon> | case value1: |
02:51 | <@Derakon> | action; action; break; |
02:51 | <@Derakon> | case value2: |
02:51 | <@Derakon> | action; break; |
02:51 | <@Derakon> | default: |
02:51 | < SmithKurosaki> | variable = variable to check, right? |
02:51 | <@Derakon> | action; break; |
02:51 | <@Derakon> | } |
02:51 | <@Derakon> | Yes. |
02:52 | <@Derakon> | And all of the values in the case statements must be constants. |
03:02 | < simon`> | tip: make sure all your cases end with break; -- otherwise, execution might unintentionally continue into the next case. (if you want to do that, look at duff's device.) |
03:03 | <@Derakon> | Duff's Device is bizarre |
03:05 | <@Vornicus> | Mh. Duff's device is horrible, but you do end up with situations where you do want fallthrough. |
03:06 | <@Vornicus> | though some are more simple than others: case a: case e: case i: case o: case u: vowel(); break; technically uses falltrhough. |
03:07 | < simon`> | yes, and that's pretty useful. |
03:07 | < SmithKurosaki> | So, I have a 7 things that I need to have in the switch statement. |
03:08 | < SmithKurosaki> | So, switch (variable) |
03:08 | < simon`> | SmithKurosaki, better dpaste.com it if it's more than four lines. |
03:08 | < SmithKurosaki> | case 1: variable = 1? |
03:08 | < SmithKurosaki> | I am just not sure of the syntax |
03:09 | <@Derakon> | Well, give it a shot and we'll correct if necessary. |
03:09 | < SmithKurosaki> | Then code if var = 1? |
03:09 | <@Vornicus> | Right, |
03:09 | < simon`> | switch (var) { case 1: do_something(); break; case 2: do_something_else(); break; ...; default: printf("Error!\n"); break; } |
03:09 | < SmithKurosaki> | kk |
03:10 | <@Derakon> | You can convert a switch/case statement into a chain of if/else statements without loss of generality if you don't need fallthrough. |
03:10 | < simon`> | is equivalent to: if (var == 1) { do_something(); } else if (var == 2) { do_something_else(); } else if ...; else { printf("Error!\n"); } |
03:12 | <@Derakon> | Simon types faster than I. http://paste.ubuntu.com/296500/ |
03:12 | <@McMartin> | Note that the chained if-else will be slower on many compilers; switch can frequently be compiled to a tricky form of GOTO. |
03:14 | < SmithKurosaki> | switch (trans_code) |
03:14 | < SmithKurosaki> | { |
03:14 | < SmithKurosaki> | case 1: trans_code == 1 |
03:14 | < SmithKurosaki> | new_car(); |
03:14 | < SmithKurosaki> | break; |
03:14 | < SmithKurosaki> | case 2: trans_code == 2 |
03:14 | < SmithKurosaki> | return_avail(); |
03:14 | < SmithKurosaki> | break; |
03:14 | < SmithKurosaki> | Does this look right? |
03:14 | <@Derakon> | Not quite. |
03:14 | <@Derakon> | You don't number your cases. |
03:14 | <@Derakon> | The value of foo in "case foo" is the value that you expect trans_code to have if you want to execute that case. |
03:14 | < Namegduf> | The case 'number' is the value of trans_code that makes it be selected. |
03:14 | < simon`> | SmithKurosaki, the trans_code == 1 is implicit when you do "case 1:" |
03:14 | < SmithKurosaki> | I wanted to use switch because I have 7-8 possibilities |
03:14 | < SmithKurosaki> | ok |
03:15 | < SmithKurosaki> | I just need to delete the transcode == x, yes? |
03:15 | < simon`> | yes |
03:26 | < SmithKurosaki> | ty |
03:27 | <@Vornicus> | I've got a message / so before I get through / I'll find your answering machine / and I'll sink it first. |
03:35 | < simon`> | who's Ty? |
03:35 | < simon`> | ^_^ |
03:36 | < Namegduf> | "Thank You". |
03:36 | < Namegduf> | He's a nice guy from Asia. |
03:37 | <@Derakon> | Pfft |
03:39 | < dmlandrum> | http://soundcloud.com/tomrobinson/mr-b-the-gentleman-rhymer-timothy -- I'm really sorry for something so off-topic, but this is way too good not to share. |
03:44 | | ReivLab [NSwebIRC@Nightstar-1055e8af.waikato.ac.nz] has joined #Code |
03:50 | < simon`> | hrm |
03:50 | < simon`> | any of you heard of the "top down vs. bottom up" terms with regards to designing things? |
03:51 | <@Vornicus> | Yes. |
03:52 | <@Vornicus> | Pretty much always you want to go top down. What do you want the whole application to do? Now what do you need to do to make that happen? Now what do you need to do to make those happen? |
03:54 | | Reiv [NSwebIRC@Nightstar-1055e8af.waikato.ac.nz] has joined #Code |
03:54 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has quit [[NS] Quit: Z?] |
03:55 | < simon`> | there was a guy giving a talk some months ago who used the terms with regards to describing how one covers the potential users of software, i.e., if one should design for the most general type of person first and slowly progress from there, or if each type of person should be characterised so that their needs/handicaps can be taken into account. |
03:55 | < simon`> | I had trouble figuring out which was top down and which was bottom up in this context, but it seems pretty clear to me now. |
03:55 | | ReivLab [NSwebIRC@Nightstar-1055e8af.waikato.ac.nz] has quit [Ping timeout: 121 seconds] |
03:58 | <@Vornicus> | ARG I NEED TO SHAVE |
03:58 | < simon`> | that sounded more urgent than I can imagine shaving to be. |
03:59 | < Reiv> | Depends on how bad it itches... :) |
03:59 | <@Vornicus> | It itches ;_; |
03:59 | < Reiv> | Vorn: TURN TO THE BEARD SIDE |
03:59 | < Reiv> | I've not had itching for years~ |
04:00 | <@Vornicus> | I don't want to look like my father ;_; |
04:00 | < Reiv> | Whatchoo got against your dad, boy? |
04:01 | < Reiv> | He got himself a lady, he did! He musta done something right~ |
04:01 | < Reiv> | (Actually, I can sorta sympathise. People I've never met walk up to me and go "Ah, you must be Ian's boy!".) |
04:01 | <@Vornicus> | Heh |
04:02 | < Reiv> | (This is, of course, explained by those others who walk up to me and %Bmistake me for him%B, but that's... yeah...) |
04:02 | < Namegduf> | ...%B? |
04:02 | <@Vornicus> | Reiv thinks he's on xchat. |
04:03 | < Reiv> | Reiv forgot he wasn't on CGI:IRC that uses %B as a bold character. |
04:09 | | * Reiv has Vorn grow a goatee, forces him to shave the rest. The worst of both worlds~ |
04:10 | <@Vornicus> | ;_; ;_; |
04:11 | | * Reiv also provides Vorn with a mohawk. |
04:11 | <@Vornicus> | ;__; |
04:12 | | * Reiv is also incredibly bored. >_> |
04:12 | < Reiv> | Can you tell? |
04:15 | < Reiv> | Gnah. So very want to take a crack at a basic Macro4X game. Need to learn how to write requirements/design docs first, though :/ |
04:18 | <@Vornicus> | It's not that hard. |
04:18 | <@Vornicus> | The big thing to remember is that you should aim at outline-ness. |
04:18 | < Reiv> | Yeah, but I never know how to write 'em, they always end up messy rambles |
04:20 | <@Vornicus> | Which is why you aim at an outline. |
04:29 | < simon`> | any of you know any blind programmers? |
04:30 | < Namegduf> | I think I know one who did, but I'm not sure. |
04:31 | < simon`> | I have this theory that blind programmers don't rely so much on specially made software as they rely on methods to adapt existing programs to work for them. |
04:32 | < simon`> | e.g. having speech synthesis work on their text editor, their browser and their IRC client. |
04:32 | <@Vornicus> | I know blind people. |
04:32 | < simon`> | Vornicus, I think maybe less technically inclined blind people are more likely to use larger bundles of software made for them... do you know anything about that? |
04:33 | <@Vornicus> | Nowadays if you're blind your computer probably has speech synthesis hooked into everything that makes text. |
04:33 | < simon`> | yeah, so let's hope you don't have a multi-touch screen with no audial feedback as your input device ;-P |
04:34 | <@Vornicus> | I know that the technology center at school uses that sort of thing - it doesn't care whether it's IE or Firefox, Word or OpenOffice, etc, it just goes "oh, there's text here, I can read it if you want" |
04:34 | | * simon` is writing this dumb report on "tangible user interfaces" which is basically about agreeing with certain authors. |
04:35 | < Reiv> | I knew a blind programmer, but I dunno if he's still on the network |
04:36 | < simon`> | Vornicus, cool. but I bet that's somewhat of a hack. I'm trying to use the word "para-standardisation" to mean ways that people make stuff like that possible without there being a clear agreement for windows programs to support it. |
04:36 | < Reiv> | And yeah, his speciaist software is a fullpowered screen reader app that lets him tweak it as needed. |
04:36 | <@Vornicus> | Idunno how hard it is on Windows, but on Mac, literally every text widget can be spoken. |
04:36 | < Reiv> | Pause reading, back up X /lines/, etc |
04:37 | < Reiv> | He also has it sped up to something silly like 4x normal speed. |
04:37 | < Reiv> | Called me 'River' for ages, 'cuz that's how it sounded~ |
04:37 | < simon`> | Reiv, yes, I hear that's common. |
04:37 | < Reiv> | We learned fairly quickly the correct way to give him a word was to S P E L L it so he heard the letters rather than the mangling. |
04:38 | < simon`> | oh |
04:38 | < Reiv> | "Kia ora!" "... what was that?" "Oh, sorry. k i a space o r a - a greeting in m a o r i." |
04:40 | | * Vornicus doesn't think he ever met that guy. |
04:41 | < simon`> | Reiv, interesting! |
04:41 | | * simon` has a growing interest in software for blind people. |
04:42 | < Reiv> | Key point about making software for blind people - don't Try Fancy Shit with the interface ordering. |
04:42 | | * Vornicus has never quite figured out how to design for the blind. The colorblind it's a bit easier. |
04:42 | <@Vornicus> | a lot easier. |
04:42 | <@Vornicus> | And the deaf is surprisingly simple |
04:42 | < simon`> | Reiv, I wouldn't try to design anything for blind people until I gain some first-hand knowledge. :) |
04:42 | < Reiv> | Menu on the X, Body on the Y, don't have pictures doing shit a plaintext button could do - or if there's a picture, make sure it shows up as /properly descriptive text/ |
04:42 | < simon`> | sorry, second-hand, of course. I don't plan on going blind. |
04:43 | < Reiv> | And possible most crucialy, 'have it navigatable by keyboard commands'. |
04:43 | <@Vornicus> | Yay alt text |
04:43 | <@Kazriko> | it's not hard to simulate. Blindfold. heh |
04:43 | < Reiv> | A lot of people forget that one. But the blind don't use mice. |
04:44 | < simon`> | I figure UIs for blind people could make much greater use of audial feedback than I suspect they do. |
04:44 | | * Kazriko has heard of those that are blind learning how to play Quake through alterations that give sound feedback to locations of enemies. |
04:44 | < Reiv> | ... ehn, yes and no. |
04:44 | < simon`> | Kazriko, blind quake? interesting. |
04:45 | < Reiv> | Worst thing you can do is have a program filled with Annoying Sound Effects that they can't turn off. |
04:45 | <@Kazriko> | http://www.audiogames.net/db.php?id=agripaccquake |
04:45 | <@Vornicus> | You can also do haptic stuff on tablets - little vibrations that tell you what's going on as you move your fingers. |
04:45 | < Reiv> | Remember - they're using their ears to read text. |
04:45 | < simon`> | Reiv, so it makes more sense to have a program which one can know the state of without needing feedback. |
04:45 | < Reiv> | Aye, that helps. |
04:46 | < Reiv> | And have feedback being provided by popup text (or equivalent) when needed rather than instantly assuming that 'oh, we'll make it turn red' is a good design choice. |
04:49 | <@Kazriko> | I have heard of blind computer technicians, but the one I saw the story about used a braille camera setup. He would hold the camera up to the screen then he could feel the raised bumps where the light and dark was on it. |
04:49 | <@Kazriko> | but could only look at a small section of the screen at a time. |
04:52 | < Reiv> | IIRC BlindTech did mostly webpage design and general coding - th ewebpage design always came with a 'hey, can someone tell me if this looks right?' - he knew the general shape of things in his head, but needed to doublecheck that he hadn't stuffed up and made it wonky~ |
04:52 | <@Kazriko> | http://gadgets.softpedia.com/news/Braille-Polaroid-Camera-for-the-Blind-482-01.h tml << a more portable device that does the same thing as that bulky one I saw. |
04:53 | <@Vornicus> | The woman I know who is blind uses a magnifier screen to get the letters to about 48 point and then sits about an inch away fro mteh screen. |
04:57 | < simon`> | sounds like someone who eventually became blind and hasn't replaced her methods with ones more appropriate for her set of senses. |
04:59 | <@Vornicus> | Possibly. It's tricky though with printed stuff. |
05:06 | < Reiv> | I have a great uncle who was blinded at the age of 12 on a beach. |
05:06 | < Reiv> | (WWII artillery shell exploded. Doh.) |
05:06 | < Reiv> | He uses ham radio; all old style analogue stuff |
05:07 | < Reiv> | Runs the whole thing by touch, and has idle chats with folks from, oh say, /italy/ |
05:07 | < Reiv> | (Note: He is /in NZ/) |
05:07 | <@Vornicus> | madness |
05:07 | <@Kazriko> | that's quite a distance. |
05:07 | < Reiv> | 'Other side of the planet', uh, yeah~ |
05:07 | < Reiv> | (I think we're directly opposite spain or germany, technically... so uh yes) |
05:37 | | AnnoDomini [farkoff@Nightstar-79274642.adsl.tpnet.pl] has joined #Code |
05:37 | | mode/#code [+o AnnoDomini] by Reiver |
06:16 | | Syloqs_AFH [Syloq@is.an.awesome.Network.Administrator.on.Nightstar.Net] has joined #Code |
06:16 | | Syloqs_AFH [Syloq@is.an.awesome.Network.Administrator.on.Nightstar.Net] has quit [Connection reset by peer] |
06:35 | | Rhamphoryncus [rhamph@Nightstar-a62bd960.abhsia.telus.net] has joined #Code |
06:42 | | Namegduf [namegduf@Nightstar-7ec84b32.bath.ac.uk] has quit [Ping timeout: 121 seconds] |
06:46 | | Syloqs_AFH [Syloq@is.an.awesome.Network.Administrator.on.Nightstar.Net] has joined #Code |
06:48 | | Syloqs_AFH is now known as Syloqs-AFH |
06:51 | | * Vornicus defeats the sparse matrix. It will technically need more toys but, hey, what can you do. |
06:51 | | Syloqs-AFH [Syloq@is.an.awesome.Network.Administrator.on.Nightstar.Net] has quit [Connection reset by peer] |
06:51 | <@Vornicus> | Anyway back to the hash table. |
06:52 | | Namegduf [namegduf@Nightstar-7ec84b32.bath.ac.uk] has joined #Code |
06:57 | | Alla is now known as Alek |
07:03 | | * Vornicus finds himself researching hashcodes when all you have is floats and strings. This is not going to be pleasant. |
07:10 | | Derakon is now known as Derakon[AFK] |
08:23 | | Attilla [The.Attilla@FBC920.65CFFF.E56E70.387AF5] has joined #Code |
08:23 | | mode/#code [+o Attilla] by Reiver |
08:24 | < Rhamphoryncus> | Vornicus: hmm? |
08:25 | <@Vornicus> | I'm looking for a way to /generate/ a hashcode for a string when the only number type I have is a float, with no bitwise ops at all. |
08:26 | < Rhamphoryncus> | oh. What language? |
08:26 | < Rhamphoryncus> | and how wide of a float? |
08:26 | <@Vornicus> | JS, double |
08:26 | < Rhamphoryncus> | so that's.. 53 bits? |
08:27 | <@Vornicus> | 52, technically. |
08:27 | < Rhamphoryncus> | Implicit 1 gives you another, in effect |
08:27 | <@Vornicus> | In effect, yes, but it's tricky. |
08:27 | <@Vornicus> | But there's no bitwise ops whatsoever. |
08:28 | < Rhamphoryncus> | So you have add, subtract, multiply, divide (explicit rounding..), and shift (via multiply/divide) |
08:28 | <@Vornicus> | And modulus. |
08:28 | <@Vornicus> | But no bitops. |
08:28 | < Rhamphoryncus> | no beloved XOR |
08:29 | <@Vornicus> | Yeah. md5 requires AND, OR, and ROL |
08:29 | <@Vornicus> | The only two I've actually come up with is add/mul and add, but both those have extreme weaknesses. |
08:31 | < Rhamphoryncus> | multiply+modulus only lets you do 26 bits. Sucky |
08:31 | < Rhamphoryncus> | However, this isn't a cryptographic hash, is it? |
08:31 | < Namegduf> | http://pajhome.org.uk/crypt/md5/ <-- Quick Google search turns up JS implementations of MD5, SHA1, SHA256, and similar. |
08:31 | <@Vornicus> | It's a hashtable hash. |
08:31 | < Rhamphoryncus> | For a hash table you may want a deliberately bad hash. |
08:32 | <@Vornicus> | oh my god. |
08:32 | <@Vornicus> | that's just scary. |
08:33 | | * Vornicus weeps. |
08:40 | < Rhamphoryncus> | http://bton.com/tb16/jsref/operator.html mentions bitwise OR |
08:40 | < Rhamphoryncus> | https://developer.mozilla.org/en/Core_JavaScript_1.5_Reference/Operators/Bitwise _Operators |
08:41 | <@Vornicus> | very strange - it's not mentioned at all in my other references. |
08:42 | | You're now known as TheWatcher |
08:57 | | Rhamphoryncus [rhamph@Nightstar-a62bd960.abhsia.telus.net] has quit [Client exited] |
09:11 | | Vornicus is now known as Vornicus-Latens |
10:00 | | Reiv [NSwebIRC@Nightstar-1055e8af.waikato.ac.nz] has quit [[NS] Quit: HOMETIME] |
10:22 | | AnnoDomini is now known as EngineerAnno |
10:24 | | * EngineerAnno has a diploma. :D |
10:52 | < Alek> | grads |
10:53 | < Reivthia> | Congratulations, Anno! |
10:58 | <@EngineerAnno> | Thanks. |
12:31 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has joined #Code |
13:34 | < SmithKurosaki> | ^5 |
13:35 | < simon`> | woohoo |
13:37 | < simon`> | if I have two strings and I want to find out how similar they are to one another, I know at least the Levenshtein algorithm. is there anything similar for trees? |
13:37 | < simon`> | say I've got two ASTs and I want to know how similar they are. |
13:39 | < simon`> | I guess I could figure something out. |
13:47 | < gnolam> | The Damerau-Levenshtein operations should still apply to trees, so... |
13:49 | < simon`> | ok. |
13:50 | < SmithKurosaki> | Good luck |
14:05 | < gnolam> | Blargh. Need to check out some more ACM papers. |
14:05 | < gnolam> | Looks like I'll have to drag myself to campus today anyway. :P |
14:05 | < simon`> | hehe |
14:05 | < SmithKurosaki> | :( |
14:06 | < SmithKurosaki> | I have to be on campus everyday you can do it stabby |
14:07 | < simon`> | let's say I construct an AST and I do that Damerau-Levenshtein on it. why not simply do it on the list of tokens? |
14:07 | < simon`> | s/an AST/two ASTs/ |
14:08 | < simon`> | I'm figuring the only advantage to having a tree is that you can perform optimizations on it, rewrite it to normal forms and *then* compare them, which might produce something semantically more accurate. |
16:06 | | Syloqs_AFH [Syloq@is.an.awesome.Network.Administrator.on.Nightstar.Net] has joined #Code |
16:07 | | Syloqs_AFH is now known as Syloqs-AFH |
16:58 | | Attilla [The.Attilla@FBC920.65CFFF.E56E70.387AF5] has quit [Client closed the connection] |
16:58 | | Oregano [The.Attilla@FBC920.65CFFF.E56E70.387AF5] has joined #Code |
17:01 | | Rhamphoryncus [rhamph@Nightstar-a62bd960.abhsia.telus.net] has joined #Code |
17:04 | | Oregano [The.Attilla@FBC920.65CFFF.E56E70.387AF5] has quit [[NS] Quit: ] |
17:48 | < SmithKurosaki> | Can I overload a C function? |
17:48 | <@TheWatcher> | Nope |
17:48 | < SmithKurosaki> | Damn |
17:48 | <@TheWatcher> | C doesn't do overloading |
17:49 | < SmithKurosaki> | ;.; |
17:49 | <@TheWatcher> | You need c++ for that |
17:50 | < SmithKurosaki> | I wanted to overload a function because there are like 4 functions I will have to write that just change different things within the struct, so I was hoping to use similar code to each and just have them do the slightly different things by overloading it |
18:15 | <@MyCatVerbs> | SmithKurosaki: what? If they change *different* things then why would you want them to have the *same* name? |
18:15 | < SmithKurosaki> | Ahh |
18:16 | < SmithKurosaki> | I have a bunch of structs I need to edit |
18:17 | < SmithKurosaki> | So, I sometimes have to edit one boolean and sometime I have to edit a diff one, but I am not sure if I can make them the same function or not |
18:17 | <@MyCatVerbs> | No. No. |
18:17 | < SmithKurosaki> | It was a crazy idea I have because I am having problems coming up with the guts of the program |
18:17 | <@MyCatVerbs> | No please why would you even think about TRYING to do that? |
18:17 | <@MyCatVerbs> | Function overloading in C++ is where you can have different functions with the same name, disambiguated by the types of their parameters. |
18:17 | < SmithKurosaki> | Because I am pretty noobish |
18:18 | < SmithKurosaki> | (I have used C, java, and assembler and lua) That's it |
18:18 | < SmithKurosaki> | I am throwing ideas out to see if people think it's a bad idea or not |
18:18 | <@MyCatVerbs> | Please do not ever use function overloading to make functions that do *different* things have the *same* name, or people will get *confused* and then when they find out what is really going on they will come to your house in the *night* and they will *kill* you using blunt (so that it will hurt more) battle *axes*. |
18:19 | < SmithKurosaki> | Ok, you don't need to get angry, |
18:19 | < SmithKurosaki> | I have enough angry people around me as is |
18:19 | <@MyCatVerbs> | I'm not angry. I'm just trying to discourage you very, very strongly. |
18:19 | < SmithKurosaki> | Sorry, I do have vocabulary clashes sometimes |
18:19 | <@MyCatVerbs> | Mostly for your own safety. This lesson will help prevent more people from becoming angry at you in future. ;) |
18:19 | < SmithKurosaki> | True |
18:19 | < SmithKurosaki> | I am just really twitchy atm |
18:20 | <@MyCatVerbs> | You need less coffee, more cookies. |
18:20 | <@MyCatVerbs> | Make tea instead, dunk the cookies in it. Win! |
18:20 | < SmithKurosaki> | No, I am emotionally twitchy... |
18:21 | < gnolam> | Besides that it's a bad idea, what you just described wouldn't work in C++ either. Without named parameters (e.g. foo(someParameterName = 1)), the compiler would have no way of knowing which function you meant. |
18:22 | <@MyCatVerbs> | gnolam: It could still "work" if the different overloaded functions happened to all take different argument types. |
18:23 | <@MyCatVerbs> | Though that is pretty unlikely. |
18:24 | < gnolam> | [19:17] <SmithKurosaki> So, I sometimes have to edit one boolean and sometime I have to edit a diff one, but I am not sure if I can make them the same function or not |
18:29 | <@MyCatVerbs> | He could wrap them in tiny irrelevant structs. ;) |
18:32 | | EngineerAnno [farkoff@Nightstar-79274642.adsl.tpnet.pl] has quit [Ping timeout: 121 seconds] |
18:33 | | Attilla [The.Attilla@FBC920.65CFFF.E56E70.387AF5] has joined #Code |
18:33 | | mode/#code [+o Attilla] by Reiver |
18:35 | | AnnoDomini [farkoff@Nightstar-ed36953e.adsl.tpnet.pl] has joined #Code |
18:35 | | mode/#code [+o AnnoDomini] by Reiver |
18:36 | | * gnolam hands AnnoDomini a hard hat, a wrench and a sentry gun. |
18:36 | < SmithKurosaki> | I will at least a rought idea f what I am trying todohit the pastebin so you can gt |
18:37 | <@AnnoDomini> | gnolam: Haw. |
18:37 | <@AnnoDomini> | The rush of a new title to add before my name is beginning to wear off. |
18:39 | < SmithKurosaki> | http://lua.pastey.net/126804 |
18:39 | < gnolam> | I miss being a Licensed Mad Scientist. :( |
18:40 | < SmithKurosaki> | It;s a rogram that maintains a rental car inventory |
18:40 | < gnolam> | Is that the actual code? You're missing your return types... |
18:41 | < SmithKurosaki> | It's a work in progress, its is not meant to be runnable atm |
18:41 | < SmithKurosaki> | I am working on how to design it to be runninable |
18:41 | < gnolam> | So you don't want me pointing out that your scanf() types are wrong yet, then? ;-) |
18:42 | < SmithKurosaki> | Shit |
18:43 | < SmithKurosaki> | I am working it out, and I am going to get it proofread aftr I start fixing all the stupid errors I dind |
18:43 | < SmithKurosaki> | *find, like that one |
18:44 | < gnolam> | But other than that (and the stuff that's obviously not implemented yet, like allocation/deallocation) it's not too shabby. :) |
18:44 | < SmithKurosaki> | I am not sure off the top of my head of 3waht is wrong, but I will find out soon enough |
18:44 | < SmithKurosaki> | I am trying to think if I should used a a linked list or if I should do a quweue/ array |
18:45 | < gnolam> | I have to say I prefer "literate" variables though - instead of "rent_status" for example, I'd prefer something like "rented" or, if you want to go semi-Hungarian, is_rented. Makes it immediately obvious what the different states mean. |
18:46 | < SmithKurosaki> | Yea, I am toying between the two as well |
18:46 | < SmithKurosaki> | It would make more sense |
19:19 | < gnolam> | Re: MyCatVerbs' "strong discouragement" above, I have fond memories of my Scheme professor. After telling us how he /wanted/ code to look (readable - meaningful function names, arguments and variables), his next example was a piece of code that looked something like |
19:19 | < gnolam> | (define (x y z) [unreadable operations]) |
19:19 | < gnolam> | and carried on with "And if you EVER hand in a piece of code that looks like this... <pauses, glares at the entire hall> I will HUNT YOU DOWN AND KILL YOU!" |
19:20 | < gnolam> | That guy was awesome. |
19:25 | | You're now known as TheWatcher[afk] |
19:26 | | AnnoDomini [farkoff@Nightstar-ed36953e.adsl.tpnet.pl] has quit [Ping timeout: 121 seconds] |
19:33 | | AnnoDomini [farkoff@Nightstar-01dc51b8.adsl.tpnet.pl] has joined #Code |
19:33 | | mode/#code [+o AnnoDomini] by Reiver |
19:35 | < SmithKurosaki> | Wow |
19:56 | < gnolam> | You know they all think it. He was just honest enough to say it. ;) |
20:19 | < SmithKurosaki> | Heh |
20:19 | < SmithKurosaki> | Yay I am starting to get stuck on my code! |
20:19 | < SmithKurosaki> | I am not completely sure how to traverse the lists, and I don't know if I should go the array or linked list route |
21:20 | | Derakon[work] [Derakon@Nightstar-d44d635e.ucsf.edu] has joined #Code |
21:23 | < Derakon[work]> | Whelp, memtest is running~ |
21:23 | < Derakon[work]> | Please find an error, please find an error~ |
21:35 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has quit [[NS] Quit: Restart] |
21:38 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has joined #Code |
21:46 | | You're now known as TheWatcher |
22:04 | < Derakon[work]> | Didn't find anything in the 45 minutes I had before having to hand the machine off to the SCIENTISTS, but it'll run overnight. |
22:08 | < dmlandrum> | > take scientists |
22:08 | < dmlandrum> | You can't do that. |
22:08 | < dmlandrum> | > examine scientists |
22:08 | < dmlandrum> | You find a pocket protector with a pen and a slide rule. |
22:08 | < dmlandrum> | > take slide rule |
22:08 | < dmlandrum> | Why? |
22:15 | < Derakon[work]> | Hrmph. Trying to fit four 512x600 rectangles onto a single display is...hard. |
22:16 | < Derakon[work]> | Assuming you want some gutter between them, you need either more than 2048 horizontal pixels, or more than 1200 vertical pixels. |
22:17 | < Derakon[work]> | ...oh, hey, you could rotate the display. |
22:17 | < Derakon[work]> | A 1050x1680 display might actually work. |
22:22 | | Vornicus-Latens is now known as Vornicus |
22:41 | | Vornicus [vorn@ServerAdministrator.Nightstar.Net] has quit [[NS] Quit: Leaving] |
22:45 | | Vornicus [vorn@ServerAdministrator.Nightstar.Net] has joined #Code |
22:45 | | mode/#code [+o Vornicus] by Reiver |
23:10 | | Thant [hesy@Nightstar-63cb80a6.cable.ntl.com] has joined #Code |
23:16 | < Derakon[work]> | Lacking an up-to-date screenshot of the UI, I'm using an old one to get dimensions for working out how a completely different layout would work. And man, the old version looks terrible~ |
23:16 | <@Vornicus> | Heh |
23:19 | <@MyCatVerbs> | Hello Thant. |
23:19 | < Thant> | hi! |
23:20 | | You're now known as TheWatcher[T-2] |
23:20 | < gnolam> | Thanks, ants! Thants. |
23:20 | <@ToxicFrog> | http://github.com/ToxicFrog/luapilot |
23:20 | < Thant> | D: |
23:21 | | Thant [hesy@Nightstar-63cb80a6.cable.ntl.com] has quit [[NS] Quit: ....Or have they?] |
23:22 | | * TheWatcher[T-2] puts away the large pencil he was about to point at Thant with |
23:24 | | You're now known as TheWatcher[zZzZ] |
23:24 | | * gnolam is a big fan of (the first season of) "Look Around You". |
23:24 | <@TheWatcher[zZzZ]> | Good man. |
23:24 | <@TheWatcher[zZzZ]> | (the second season is Considerably Less Awesome) |
23:27 | < gnolam> | Unfortunately, yes. The first season is so full of win it's ridiculous, but the second? Meh. |
23:32 | <@McMartin> | (Where is "thants" from?) |
23:33 | < gnolam> | Look Around You. Module 2: Water. |
23:33 | < gnolam> | http://www.youtube.com/watch?v=bCWA7uevo_Q |
23:42 | | * Derakon[work] is mildly distressed by his coworker's desire to get a 30" Apple Cinema display instead of the ($1500 cheaper) Samsung. |
23:42 | < Derakon[work]> | Which is, admittedly, also 8" smaller, but it provides the resolution we need and an easy-rotating base so we can work in landscape mode. |
23:44 | | * Vornicus has a hard time imagining working on a 30" display. So... much... real estate... |
23:46 | < Derakon[work]> | I'm seriously thinking about getting that 28" on Newegg. |
23:46 | < Derakon[work]> | It's only a bit over $300! |
--- Log closed Tue Oct 20 00:00:40 2009 |