| --- Log opened Thu Dec 13 00:00:42 2007 |
| 00:01 | <@Vornicus> | Do you know how to do that? |
| 00:02 | <@C_tiger> | (Hint, it's as easy as you think) |
| 00:03 | <@Vornicus> | actually, yes, you do. it should be somewhere in your reference or in a py file you've made. |
| 00:04 | <@ilovefire> | something like, say, is_prime(a,b), b is the second imput, yes? |
| 00:04 | <@Vornicus> | yep. but, again, use longer names. |
| 00:04 | <@C_tiger> | Again, a descriptive name would do wonders for readability |
| 00:04 | <@ilovefire> | Of course, Vorn. |
| 00:04 | <@ilovefire> | I was just using an example. |
| 00:05 | | * Vornicus types too fast for C. |
| 00:05 | <@Vornicus> | ok. |
| 00:05 | <@C_tiger> | He does. |
| 00:05 | <@C_tiger> | Plus, I use bigger words :P |
| 00:08 | <@Vornicus> | Okay. Now you need to rewrite is_prime to use the known_primes you just passed in. |
| 00:09 | <@Vornicus> | I will give no hints. |
| 00:09 | | * ilovefire nods. |
| 00:09 | <@ilovefire> | I'll get on to that after supper, because the smell of bacon CALLS TO ME |
| 00:09 | <@Vornicus> | Ooh, bacon. |
| 00:09 | | * Vornicus steals some of ilf's supper. |
| 00:09 | | ilovefire is now known as ilf_bacon |
| 00:13 | | * Vornicus can't argue with bacon. |
| 00:14 | <@McMartin> | Have dir() and help() come up yet? I notice you've been discussing "the version of X that lives in Y". |
| 00:15 | <@Vornicus> | They have not. I should talk about them. |
| 00:15 | <@C_tiger> | I should go an try not to lose my shirt. |
| 00:16 | <@Vornicus> | Heh. |
| 00:18 | <@Vornicus> | I should also talk about the library (which is vast enough that I haven't used most of it) |
| 00:26 | | Vornicus is now known as Darius |
| 00:28 | <@Darius> | Hrm. Something we haven't covered, but we've used, and I htink it's important to talk about. Very brief though. |
| 00:35 | | ilf_bacon is now known as ilovefire |
| 00:35 | <@ilovefire> | bacon is delicious, Now, back to code. |
| 00:36 | <@Darius> | So you know, ilf: len(something) tells you the length of the thing you pass it. It works on strings, lists, tuples, dictionaries, sets, and some other toys that I can't think of right now. |
| 00:37 | <@Darius> | len("blarg") is 5, for instance. |
| 00:38 | <@ilovefire> | Okay. |
| 00:38 | <@ilovefire> | Now, let's see. |
| 00:39 | <@Darius> | (this isn't very important to your current thing, but I noticed I used it without talking about it, so.) |
| 00:41 | <@ilovefire> | http://rafb.net/p/UhOPIZ36.html the code, and examples of what I get when I run primes 1000, 10000, and 1000000. |
| 00:44 | <@Darius> | Okay, so far you've made it aware of the existence of known_primes... but you haven't told it to look at it. |
| 00:46 | | ilovefire [~santros_v@209.82.191.ns-11321] has quit [Ping Timeout] |
| 00:46 | | ilovefire [~santros_v@209.82.191.ns-11321] has joined #code |
| 00:47 | < ilovefire> | Okay, very sorry for all of that but my mother told me to unplug the power to the wireless and re-plug it in to see if that would make it work for her laptop. |
| 00:47 | <@Darius> | Okay, so far you've made it aware of the existence of known_primes... but you haven't told it to look at it. |
| 00:48 | < ilovefire> | Ah, okay. |
| 00:51 | | * ilovefire ponders. Feels like he needs to change something in the xrange. |
| 00:51 | <@C_tiger> | try it. |
| 00:53 | < ilovefire> | ... |
| 00:53 | < ilovefire> | Token Error: EoF in multi-line statement. |
| 00:53 | < ilovefire> | *EOF, excuse me |
| 00:53 | <@Darius> | means you forgot to close a parentheses. |
| 00:53 | <@Darius> | (or bracket or brace) |
| 00:54 | <@C_tiger> | also, to get some helpful output put a print statement inside your loop and then you can run is_prime(45, [2.3.5.7]) or is_prime(43, [2,3,5,7]) and see if it gives expected behavior. |
| 00:54 | <@Darius> | only use commas instead of periods. :) |
| 00:55 | <@Darius> | and, no more hints, C. |
| 00:55 | <@C_tiger> | That wasn't a hint perse, just a way of getting output out of a black box. |
| 00:55 | <@Darius> | We've been doing that for an age, though. |
| 00:56 | <@C_tiger> | Oh? |
| 00:56 | <@Darius> | diagnostic messages and prints. |
| 00:57 | <@McMartin> | Hum. How good is 2.5 about letting print take non-strings? |
| 00:57 | | * McMartin recalls having to put gratuitous str(x) calls in. |
| 00:57 | <@Darius> | Just fine. |
| 00:58 | < ilovefire> | Hmm, thought I'd use known_primes.pop() but you can't pop from a blank list.... |
| 01:00 | <@Darius> | Indeed not. However, it should be noted that your thing /should/ work fine from a blank list. |
| 01:01 | <@Darius> | (the current implementation works fine for n = 2, despite /not testing any numbers/) |
| 01:03 | | * ilovefire head scratches. Hmm. |
| 01:04 | < ilovefire> | Argh, okay, I'm going to take a minor break here because my mother's insisting I do several things for her real quick. Plus it might be good to thinka bout the code without sitting here staring at it like it's some sort of creepy old man with four heads and one arm |
| 01:06 | | * Darius gives ilf Darles Chickens, with 4 Ns and a silent Q. |
| 01:20 | < ilovefire> | let's see, okay, I know I need to make it pop the last number from a list. |
| 01:20 | < ilovefire> | but the list starts out blank. |
| 01:20 | < ilovefire> | perhaps if I were to start it not blank.... hmmmmmmm, no. that would not work... |
| 01:21 | < ilovefire> | or... would it, if I started small enough, assumign the list... hmm, worse that can happen is that it dosen't work, let's try. |
| 01:33 | | * Darius wonders what madness ilf is up to. |
| 01:35 | < ilovefire> | madness taht is worth nothing, because nothing I try works. |
| 01:36 | <@Darius> | Okay. |
| 01:36 | < ilovefire> | Excuse me while I do some rather immature screaming and banging on things. |
| 01:36 | <@Darius> | remind yourself what for does, and remind yourself what xrange does. |
| 01:36 | < ilovefire> | Right... |
| 01:36 | < ilovefire> | My current problem is figuring out how to make the list not empty. |
| 01:37 | <@Darius> | Why is that a problem? |
| 01:38 | < ilovefire> | Because that's what the error message says? |
| 01:39 | <@C_tiger> | Taking a break from bleeding money... If you are having problems with an empty list, remember the strategy you used when you wrote the divide program? |
| 01:39 | | mode/#code [+o ilovefire] by C_tiger |
| 01:40 | <@ilovefire> | ... err, if/elif, or, umm, the umm. argh, brain isn't thinking straight here, umm. |
| 01:40 | <@Darius> | Well, more precisely: why do you need your list to be not empty, when an empty list of things to check works /fine/ when you're doing straight numbers? |
| 01:41 | <@ilovefire> | Vorn: I'm trying to pop things from it. Maybe I should put something that, hmm. |
| 01:41 | | * ilovefire ponders. |
| 01:42 | <@Darius> | If you pop things from it, you must eventually get to a point where the list is empty anyway. |
| 01:42 | <@ilovefire> | but you can't pop from an empty list, and it won't just ignore it. |
| 01:42 | <@Darius> | Right. |
| 01:43 | <@C_tiger> | Right, but what does it mean when the list is empty? |
| 01:43 | <@ilovefire> | there's no recognized primes? |
| 01:43 | <@Darius> | There's a way to do this, using a tool I haven't showed you. |
| 01:43 | <@C_tiger> | ilf, right. |
| 01:43 | <@C_tiger> | So what does that mean? |
| 01:43 | <@ilovefire> | ... that maybe I should use list.append as well, and start off the list with the smaller primes, hmm... |
| 01:44 | <@Darius> | But I don't want to add another tool to your arsenal yet. |
| 01:44 | <@C_tiger> | Vorn, don't. |
| 01:45 | <@Darius> | So I won't. Using just the tools you have now you should be able to pullthis off. |
| 01:45 | <@C_tiger> | Ok, ilf. Just run a few iterations pencil-paper style. |
| 01:46 | <@C_tiger> | If you find yourself missing a step, then you have to figure out and where to stick that step in. |
| 01:48 | <@ilovefire> | Umm... |
| 01:48 | <@C_tiger> | And if you're really stuck with the case where k = 2, just try your strategy with something larger first. Try it with k = 10 or k = 25 perhaps. |
| 01:49 | <@Darius> | Actually, no, I am tired of letting you go down this wrong path. |
| 01:50 | <@Darius> | ILF: explain what for and xrange do. |
| 01:50 | <@C_tiger> | Awww, drat. It's actually entirely doable following this path. |
| 01:50 | <@Darius> | Yes, it is. But I haven't actually taught while yet, and I don't want to yet. |
| 01:50 | <@C_tiger> | You don't need while. |
| 01:51 | <@ilovefire> | xrange(x,y) defines a range of numbers between x and y-1. if you add a third input, it prints out all multiples of the third imput between x and y-1. And for is, umm, the start of a loop? I guess? Unless I forgot to write it down, I don't actually have it defined in my referance file... |
| 01:52 | <@Darius> | What kind of thing does xrange give? |
| 01:52 | <@ilovefire> | individual, one-line-each prints of the nubmers in the defined range. |
| 01:55 | <@Darius> | If you had to descrbe xrange's output as a /single/ thing, what is it? |
| 01:56 | <@Darius> | (there is a term for it in computer science. I don't think I've mentioned it in front of you) |
| 01:58 | <@McMartin> | ... This would be an easier question if we weren't talking about xrange, which is wacky as Hell. |
| 01:58 | <@Darius> | True. |
| 01:58 | <@McMartin> | Since I don't think "single-threaded coroutine" is the answer you're really looking for. |
| 01:59 | <@Darius> | True. |
| 02:01 | <@ilovefire> | a moment while I pull out my COmputer Science Referance Sheet and check the glossary section... (best $3.95 American I ever spent.) Err, umm, err. okay, I can't find it. To wikipedia and/or google! |
| 02:03 | <@Darius> | okay, stop. |
| 02:03 | | * ilovefire stops |
| 02:03 | <@Darius> | range and xrange are the same thing, except that xrange saves space when you do a lot of stuff. |
| 02:04 | <@Darius> | try print range(5) |
| 02:04 | <@McMartin> | ... snerk. OK, that's changed since 2.0 |
| 02:05 | | * McMartin tried printing the xrange, which used to give, essentially, a raw pointer. |
| 02:05 | <@ilovefire> | Ah. |
| 02:05 | <@ilovefire> | so, xrange gives a list? |
| 02:05 | <@Darius> | it gives almost a list. |
| 02:06 | <@McMartin> | xranges are apparently now magic, at least on this machine. |
| 02:06 | <@C_tiger> | The beauty of CS, so much is magic. |
| 02:06 | <@Darius> | it's close enough to a list that in many ways you can act like it's a list. |
| 02:06 | <@McMartin> | C: Well, by "magic" I mean "a base type". |
| 02:06 | <@ilovefire> | Okay... |
| 02:07 | <@McMartin> | They used to be <generator object@0xf00db33f> |
| 02:07 | <@Darius> | (nah, they just actually wrote __repr__) |
| 02:07 | <@Darius> | now, armed with this knowledge, what does for do? |
| 02:11 | <@ilovefire> | for, umm, umm. it starts a loop that, umm. |
| 02:12 | <@C_tiger> | Hint, read it aloud. |
| 02:12 | <@ilovefire> | it starts a loop that takes a variable? |
| 02:12 | <@C_tiger> | and... |
| 02:13 | <@ilovefire> | is finite? |
| 02:13 | <@C_tiger> | Ok, try again. What is the whole line again? |
| 02:14 | <@ilovefire> | for k in xrange(2,n):... |
| 02:15 | <@C_tiger> | Ok, so we know what xrange(2,n) does, so let's replace that part with what it does. |
| 02:15 | <@ilovefire> | for k in a list between 2 and n-1, execute the next line that has been indented four more spaces than this current line. |
| 02:16 | <@C_tiger> | So, now what do we want to do? |
| 02:17 | <@ilovefire> | Well, umm... |
| 02:17 | | * ilovefire rubs his eyes. "This'd be easier were I less tired. I need to injest mroe caffiene." |
| 02:19 | <@C_tiger> | Ok, my roommate is telling me very loudly that helping someone with python is not very social behavior when there's a poker game going on in the living room and other craziness. |
| 02:19 | <@ilovefire> | ... well, or get more sleep, but lets' be realistic. |
| 02:19 | <@Darius> | Okay. There's an important word that you just said in there. |
| 02:20 | <@ilovefire> | *ingest, more, caffeine |
| 02:20 | <@ilovefire> | Vorn: tired? |
| 02:20 | <@C_tiger> | for? |
| 02:21 | <@Darius> | no, your line: "for k in a list between 2 and n-1, execute the next line that has been indented four more spaces than this current line." |
| 02:21 | <@ilovefire> | ah. |
| 02:21 | <@C_tiger> | Ok, ilf, two questions: What happens to k every time you go through the loop? |
| 02:22 | <@C_tiger> | 2) compare what we are trying to do with what is happening here, can you see an easy swapout that turns that sentence into a sentence describing what we want to do? |
| 02:22 | <@ilovefire> | well, umm, k's basically defined as eveyr number between 2 and n-1. It checks to see if k is, umm. |
| 02:23 | <@C_tiger> | Right! k is defined as every number. |
| 02:23 | <@C_tiger> | So now what do we want to do? |
| 02:26 | <@Darius> | /each/ number, in turn, if we wish to be precise |
| 02:27 | <@ilovefire> | Well, in general, we want to make a list of primes as we run the program, so as to make it mroe efficient. |
| 02:27 | <@Darius> | Right. |
| 02:27 | <@C_tiger> | And we have a list of primes. |
| 02:27 | <@Darius> | And we've gotten far enough to give the is_prime function a list of primes. |
| 02:27 | <@C_tiger> | So what are we trying to do with this list? |
| 02:29 | <@ilovefire> | have the program check the list to determine if a number is divisible by anything on the list--if it is, it's not prime, if it isn't, it's prime, and is added to the lsit. |
| 02:29 | <@Darius> | Right. |
| 02:29 | <@C_tiger> | Ok, so what numbers are we using now to check with? |
| 02:29 | <@Darius> | So how do we check each number on the list? |
| 02:32 | <@ilovefire> | Err... |
| 02:33 | <@C_tiger> | Hint we just talked about this. |
| 02:35 | <@ilovefire> | okay, umm. |
| 02:36 | <@ilovefire> | okay, this is probably a bad time, but I have to go load the dishwasher. Maybe it'll come to be while I do so, because I'm hellaciously tired for some reason. |
| 02:43 | <@ilovefire> | we're using, umm, the result of an input into primes()? |
| 02:43 | <@ilovefire> | well, primes(x). or n in this case. |
| 02:43 | <@C_tiger> | ? |
| 02:43 | <@C_tiger> | Not quite. |
| 02:44 | <@C_tiger> | Ok, look at is_prime() |
| 02:44 | <@C_tiger> | tell me how it works. |
| 02:45 | <@ilovefire> | well, right now it dosen't. But ideally it checks the inputted number by seeing if it can evenly be divided by any number between 2 and known_primes.pop(), and if it is returns false--if it isn't, returns true. |
| 02:45 | <@ilovefire> | err, known_primes.pop()+1 |
| 02:46 | <@C_tiger> | erm... |
| 02:46 | <@C_tiger> | Ok, backtrack. |
| 02:46 | <@C_tiger> | Look at an old version of is_primes() before we put in the known_primes part. How does THAT work? |
| 02:49 | <@ilovefire> | well, it checks to see if the input k can evenly be divided by any number b between 2 and the square root of k. |
| 02:49 | <@C_tiger> | Ok, how? |
| 02:49 | <@Darius> | okay. |
| 02:49 | <@C_tiger> | line by line, please. |
| 02:52 | <@ilovefire> | by imputting a number, k, into the function is_prime(), the function generates a list of numbers, collectively labeled b, between 2 and the square root of k, plus 1. It then checks to see if any of b can evenly go into k. if it can, it returns false, stating that the number k is not prime. if it cannot, it returns true, stating taht the number k is prime. |
| 02:52 | <@C_tiger> | Not quite. |
| 02:53 | <@C_tiger> | It doesn't do all the possible values of b at once, how does it do it? |
| 02:54 | <@ToxicFrog> | (if it did all possible values of b at once I think we'd be getting into quantum computing) |
| 02:54 | <@Darius> | (which would be awesome) |
| 02:54 | <@McMartin> | (No, Quantum isn't that powerful) |
| 02:54 | <@ilovefire> | it checks the values of b one at a time. |
| 02:55 | <@McMartin> | (That's alternate universal computing) |
| 02:55 | <@C_tiger> | right. And how does it know what values of b to check? |
| 02:55 | <@Darius> | (well, true, but doesn't it kill essentially every crypto on the planet besides otp?) |
| 02:55 | <@McMartin> | (No) |
| 02:55 | <@McMartin> | (O(n^2) speedup, IIRC.) |
| 02:55 | <@Darius> | (ah, so) |
| 02:55 | <@ilovefire> | by generating a list with xrange? |
| 02:55 | <@C_tiger> | yes. |
| 02:55 | <@McMartin> | (The claims of O(1) were "if you have exponential numbers of processors" which is true for non-QP CPUs too.) |
| 02:56 | <@C_tiger> | So, it generates a list with xrange. Then it set b to the first value. Then it goes through the loop. If it manages not to exit, it sets b to the next value in the list and so on. |
| 02:57 | <@C_tiger> | does that make sense? |
| 02:57 | <@ilovefire> | Yes. |
| 02:57 | <@C_tiger> | Ok. |
| 02:58 | <@C_tiger> | Now if you wanted to change the numbers that the program used to check with, how would you do it? |
| 02:58 | <@C_tiger> | suppose you only wanted to check against the odd numbers. |
| 03:00 | <@ilovefire> | I'd change the xrange, umm... well, I know how to made it check against the even numbers, but the odds... not entirely sure of. |
| 03:00 | <@C_tiger> | Doesn't matter, you get the idea. |
| 03:00 | <@C_tiger> | What does xrange do again? |
| 03:01 | <@ilovefire> | xrange, when given two variables, makes a list of all the numbers between the first variable, and one less than the second. If given three, it makes a list of all numbers between the first variable and one less than the second that are evenly divisible by the third inputted number. |
| 03:01 | <@C_tiger> | Sorry to keep repeating the same thing over and over, it's vital you know how this works because almost programs are built around loops at some level. |
| 03:02 | <@C_tiger> | Right it makes a list. So by changing xrange, you're changing the list. And if you want to change the numbers it checks against you change the list. |
| 03:03 | | * ilovefire nods... |
| 03:04 | <@Darius> | Sign of the End Times: my ex is now running Linux. |
| 03:04 | <@ToxicFrog> | (I thought the point of QC was that it evaluates all possibilities at once, then collapses to the right one?) |
| 03:04 | <@ToxicFrog> | Yay! |
| 03:04 | <@C_tiger> | Ok. Now instead of checking against all the numbers, what numbers do we want to check against? |
| 03:07 | | Attilla [~The.Attil@194.72.70.ns-11849] has quit [Connection reset by peer] |
| 03:14 | <@Darius> | ILF: you dead? |
| 03:15 | <@ilovefire> | Vorn: In the brain. I haven't been getting enogh sleep as of late, I think. |
| 03:15 | | * ilovefire is still thinking on what the answer for this question is, though, so eventually I'll get it. |
| 03:22 | <@ilovefire> | C: all prime numbers? |
| 03:22 | <@Darius> | Yep. |
| 03:22 | <@Darius> | Now, do we have any of those floating around? |
| 03:23 | <@ilovefire> | prime numbers, 'all prime numbers'? |
| 03:23 | <@Darius> | A pile of prime numbers. |
| 03:24 | <@ilovefire> | well, can allways type one up... |
| 03:24 | <@Darius> | we don't have to |
| 03:24 | <@ilovefire> | theoretically the program can produce it, but it's not running in it's current form. |
| 03:25 | <@Darius> | Does is_prime, in its current form, know about any existing prime numbers? |
| 03:26 | <@C_tiger> | ilf, what time zone are you in? |
| 03:27 | <@ilovefire> | C: eastern standard. |
| 03:27 | <@ilovefire> | Vorn: no. |
| 03:27 | <@ToxicFrog> | It's 2228 where he is; EST. |
| 03:27 | <@Darius> | It doesn't? |
| 03:27 | <@Darius> | Then, uh... what's that thing we're giving it? |
| 03:27 | <@Darius> | you know, the one called, uh, known_primes? |
| 03:27 | <@ilovefire> | a blank list. |
| 03:27 | <@ilovefire> | that's supposed to get numbers added to it eveyr time the program runs and finds a prime number that's not on it allready. |
| 03:28 | <@Darius> | It is the first time you run is_prime, certainly. |
| 03:28 | <@C_tiger> | Ok, what did you do between 6:20 PM and 6:50? |
| 03:28 | <@Darius> | Because there aren't any primes smaller than 2. |
| 03:28 | <@ilovefire> | C: I can't remember. |
| 03:28 | | * ilovefire goes to check logs, since those are timestamped. |
| 03:29 | <@C_tiger> | Logs are good. |
| 03:29 | <@C_tiger> | But the answer is you wrote a list called known_primes. |
| 03:29 | <@ilovefire> | of course, I really should go to bed. Try and get some extra sleep... |
| 03:29 | <@ilovefire> | okay. |
| 03:30 | <@Darius> | now obviously it will be empty when you start, because there aren't any primes below 2 to check against, but this shouldn't be a problem. |
| 03:31 | <@ilovefire> | but since my script uses a pop off of the list, it dosen't work. |
| 03:31 | <@ilovefire> | Because the list starts empty. And you can't pop off of an empty list. |
| 03:31 | <@C_tiger> | Ok, ilf. |
| 03:31 | <@C_tiger> | forgot popping. |
| 03:31 | <@C_tiger> | the point is you have a list. |
| 03:32 | <@C_tiger> | Now where did we want to use the list? |
| 03:32 | <@ilovefire> | umm, in, umm... |
| 03:32 | | * ilovefire brain crash. |
| 03:33 | <@C_tiger> | 28 minutes ago. |
| 03:33 | <@ilovefire> | Guys, i'm Sorry, but my mother's telling me to shut off the comp and go to bed. |
| 03:33 | <@C_tiger> | Ok. |
| 03:33 | <@ilovefire> | And well, I sort of have to listen. Because I'm a minor. |
| 03:33 | <@ilovefire> | and all that legal stuff. |
| 03:33 | <@C_tiger> | Read through everything we've talked about today. |
| 03:34 | <@C_tiger> | Before you come back on tomorrow. |
| 03:34 | <@C_tiger> | Also, you should see someone about that short term memory loss. |
| 03:34 | | * ilovefire nods. "I won't be able to come back until late, though, so umm... maybe I should just remove this hcannel from my autojoin script so I don't autojoin so I have more time to look over becasue I do need to log on ASAP when I come home so I can see if I need to mpost in my PBP forum DnD games..." |
| 03:35 | | ilovefire [~santros_v@209.82.191.ns-11321] has quit [Quit: Shut up ya wee CROTCH-GNOME, afore I take me hammer an' wail on me jimmies!] |
| 03:38 | | NSGuest-3365 is now known as EvilDarkLord |
| 03:49 | | Chalcedon [~Chalcedon@116.93.128.ns-23287] has joined #code |
| 03:49 | | mode/#code [+o Chalcedon] by ChanServ |
| 04:24 | < Kyrre> | Is there any conversation I can break? |
| 04:41 | <@Darius> | Whut? |
| 04:47 | < Kyrre> | I broke the conversation yesterday with such stunning success I wish to inquire if you need an encore :p |
| 05:36 | | ToxicFrog [~ToxicFrog@Admin.Nightstar.Net] has quit [Operation timed out] |
| 05:37 | | ToxicFrog [~ToxicFrog@Admin.Nightstar.Net] has joined #code |
| 05:37 | | mode/#code [+o ToxicFrog] by ChanServ |
| 05:43 | | ToxicFrog [~ToxicFrog@Admin.Nightstar.Net] has quit [Operation timed out] |
| --- Log closed Thu Dec 13 05:43:29 2007 |
| --- Log opened Thu Dec 13 05:44:04 2007 |
| 05:44 | | TheWatcher[zZzZ] [~chris@Nightstar-29731.dsl.in-addr.zen.co.uk] has joined #code |
| 05:44 | | Irssi: #code: Total of 15 nicks [11 ops, 0 halfops, 1 voices, 3 normal] |
| 05:44 | | mode/#code [+o TheWatcher[zZzZ]] by ChanServ |
| 05:44 | | Irssi: Join to #code was synced in 44 secs |
| 05:53 | | Darius is now known as Vornicus |
| 06:35 | | ToxicFrog [~ToxicFrog@Admin.Nightstar.Net] has quit [Operation timed out] |
| 06:35 | | Netsplit Blargh.CA.US.Nightstar.Net <-> DeepThought.NY.US.Nightstar.Net quits: @Chalcedon, EvilDarkLord, @MyCatVerbs, @Pi-2, +KarmaBot, @C_tiger, @Reiver, @Vornicus, Kyrre, @jerith, (+1 more, use /NETSPLIT to show all of them) |
| 06:37 | | Netsplit over, joins: jerith, Reiver, MyCatVerbs, Pi-2, Vornicus, KarmaBot, Kyrre, EvilDarkLord, Chalcedon |
| 06:37 | | ServerMode/#Code [+oooooo Chalcedon Vornicus Pi-2 MyCatVerbs Reiver jerith] by Troika.TX.US.Nightstar.Net |
| 06:37 | | ServerMode/#Code [+v KarmaBot] by Troika.TX.US.Nightstar.Net |
| 06:37 | | mode/#code [+o AnnoDomini] by ChanServ |
| 06:37 | | mode/#code [+o Thaqui] by ChanServ |
| 06:37 | | mode/#code [+o TheWatcher[zZzZ]] by ChanServ |
| 06:39 | | ToxicFrog [~ToxicFrog@Admin.Nightstar.Net] has joined #code |
| 06:39 | | mode/#code [+o ToxicFrog] by ChanServ |
| 06:45 | | McMartin [~mcmartin@Nightstar-16970.dsl.pltn13.sbcglobal.net] has joined #code |
| 06:45 | | mode/#code [+o McMartin] by ChanServ |
| 06:48 | | C_tiger [~c_wyz@Nightstar-5378.nycmny.east.verizon.net] has joined #code |
| 06:48 | | C_tiger is now known as C_tiger_ |
| 07:12 | < C_tiger_> | Oh man, I was doing so well, then I got worked for my entire stack. |
| 07:12 | < C_tiger_> | I'm pretty decent at math, why do I suck so very much at poker? |
| 07:19 | <@ToxicFrog> | Because poker relies on psychology and luck. |
| 07:24 | < C_tiger_> | And I have neither. |
| 08:42 | | You're now known as TheWatcher |
| 09:13 | | Chalcedon [~Chalcedon@116.93.128.ns-23287] has quit [Quit: Gone] |
| 09:25 | | Vornicus is now known as Vornicus-Latens |
| 09:35 | | AnnoDomini [AnnoDomini@Nightstar-29104.neoplus.adsl.tpnet.pl] has quit [Ping Timeout] |
| 09:42 | | AnnoDomini [AnnoDomini@Nightstar-29646.neoplus.adsl.tpnet.pl] has joined #Code |
| 09:42 | | mode/#code [+o AnnoDomini] by ChanServ |
| 09:54 | | Thaqui [~Thaqui@Nightstar-262.dialup.xtra.co.nz] has left #code [Leaving] |
| 09:58 | | Netsplit Troika.TX.US.Nightstar.Net <-> DeepThought.NY.US.Nightstar.Net quits: @MyCatVerbs, EvilDarkLord, +KarmaBot, @McMartin, @ToxicFrog, Kyrre, C_tiger_ |
| 10:00 | | Netsplit over, joins: @MyCatVerbs, +KarmaBot, Kyrre, EvilDarkLord, @ToxicFrog, @McMartin, C_tiger_ |
| 10:00 | | mode/#code [+o jerith] by ChanServ |
| 10:00 | | mode/#code [+o Reiver] by ChanServ |
| 10:00 | | mode/#code [+o AnnoDomini] by ChanServ |
| 10:00 | | mode/#code [-o TheWatcher] by ChanServ |
| 10:00 | | mode/#code [-o Vornicus-Latens] by ChanServ |
| 10:00 | | mode/#code [-o Pi-2] by ChanServ |
| 11:51 | | Attilla [~The.Attil@194.72.70.ns-11849] has joined #code |
| 13:06 | | gnolam [lenin@Nightstar-10613.8.5.253.static.se.wasadata.net] has joined #Code |
| 13:06 | | mode/#code [+o gnolam] by ChanServ |
| 14:13 | | gnolam [lenin@Nightstar-10613.8.5.253.static.se.wasadata.net] has quit [Ping Timeout] |
| 14:13 | | gnolam [lenin@85.8.5.ns-20483] has joined #Code |
| 14:13 | | mode/#code [+o gnolam] by ChanServ |
| 14:13 | | AnnoDomini [AnnoDomini@Nightstar-29646.neoplus.adsl.tpnet.pl] has quit [Ping Timeout] |
| 14:14 | | AnnoDomini [AnnoDomini@83.21.56.ns-26805] has joined #Code |
| 14:14 | | mode/#code [+o AnnoDomini] by ChanServ |
| 14:34 | | KarmaBot [~fark.off@87.72.35.ns-26506] has quit [Quit: Socordia humanum est.] |
| 15:43 | | AnnoDomini is now known as lighter |
| 15:43 | | lighter is now known as AnnoDomini |
| 16:28 | | Serah [~Z@130.227.16.ns-12529] has joined #code |
| 16:52 | | Serah [~Z@130.227.16.ns-12529] has left #code [] |
| 17:14 | | You're now known as TheWatcher[afk] |
| 17:24 | | Forj [~Forj@116.93.128.ns-23287] has joined #code |
| 17:24 | | mode/#code [+o Forj] by ChanServ |
| 17:31 | | C_tiger_ is now known as C_tiger |
| 17:36 | | Forj [~Forj@116.93.128.ns-23287] has quit [Quit: Gone] |
| 18:34 | | You're now known as TheWatcher |
| 19:23 | | Serah [~Z@130.227.16.ns-12529] has joined #code |
| 19:24 | | Vornicus-Latens is now known as Vornicus |
| 19:27 | | Chalcedon [~Chalcedon@Nightstar-11713.ue.woosh.co.nz] has joined #code |
| 19:27 | | mode/#code [+o Chalcedon] by ChanServ |
| 23:09 | | Serah [~Z@130.227.16.ns-12529] has quit [Quit: Serah] |
| 23:17 | | You're now known as TheWatcher[T-2] |
| 23:21 | | You're now known as TheWatcher[zZzZ] |
| --- Log closed Fri Dec 14 00:00:48 2007 |