| |
| |
| |
|
Page: 1 2 3 4 5 6 7 8 9
Comments:
<0> for free
<0> but the troubles were bad enough that everyone went to infiniband
<0> but I think myrinet has their stuff fixed now
<0> lol, the sight of orange cables makes me feel ill
<1> hehe
<0> I think I'm gonna make this program generate the shell script it needs
<2> if i have like Struct[1]-> with some data and Struct[2]-> with no data and then Struct[3]-> with data how would i move it to Struct[2]?
<3> hrm, kthx^, are you using struct?
<3> i.e struct nodes { int data1; int data2; struct nodes *next; }; ?
<2> yeah structs
<2> yeah structs tho
<2> not linked lists tho*
<2> =[
<3> you should use linked lists
<3> it's not too difficult
<2> well it doesnt seem apprpriate
<2> im using select()
<3> i'm not familiar to that function.
<2> with multiple sockets and on a disconnection i clear it but then theres a gap
<2> ;//
<3> do you know how to work with linked lists?
<2> yes i use them with my hashtables
<2> if i did use linked lists how would i remove a gap still?
<3> when I want to switch information between structures I always use (double) linked structures.
<3> hrm, what's a gap?
<3> my native language is spanish :P
<4> damn! the software packages on minix 3.0 are fairly up-to-date
<2> like
<2> say struct->next has data
<4> well, some of them anyway; some are horribly outdated
<2> and struct->next->next has no data
<2> and struct->next->next-> has data
<2> the middle one would be a gap
<3> you use double links and global pointers and an ID for each structure
<2> ;/
<2> would linked lists for clients be slower than a struct per client?
<3> i.e struct nodes { int data1; struct nodes *next; struct nodes *prev; } *first = NULL *last = NULL;
<3> hrm.
<3> let me write the algorithm
<2> k
<4> man, running **** on minix inside bochs is *** slow
<3> hrm, there was a site meant to paste
<2> ;/
<2> huh
<4> http://rafb.net/paste/
<3> http://rafb.net/paste/results/AfK6mF68.html
<3> thanks Vratha
<4> np
<2> man thx cursed
<2> complex <4
<3> do you understand the alg?
<2> i understand simple linked lists
<3> well
<3> give me a second and i'll write down an example
<3> kthx^: http://rafb.net/paste/results/3NkLjG63.html
<3> it's quite simple.
<3> it's easier to work with double links.
<2> cursed why does that code have typedef struct nodes nodes;
<3> so I write "nodes" instead of "struct nodes"
<2> lmao
<2> Linked lists were developed in 1955-56, lol
<5> Why are you laughing?
<2> thats a long time ago
<5> It wouldn't surprise me if the same concept existed as a set-theoretic primitive for tuples long before that.
<2> umm ok
<5> It is an elegant recursive definition. A list consists of an element and a list of the rest of the elements.
<5> Or, of course, an empty list.
<6> or it contains a hund, but we don't like to talk about those.
<2> lol
<7> hund: that's an infinitely recursive definition
<7> well, w/o the empty list bit
<7> "a list is either nothing, or a list and an element"
<5> You can have infinite lists too.
<7> conceptually
<8> data List a = Nil | Cons a (List a)
<5> For instance a sorted list of all natural numbers.
<7> or a list of all 1s
<5> In other words all enumerable sets, or whatever they're called again.
<8> ones = Cons 1 ones
<5> That looks familiar, but I can't quite place it. ML?
<8> haskell
<8> type 'a list = Nil | Cons ('a * 'a list);; let rec ones = Cons (1, ones);; (* I think that's the OCaml version *)
<7> warning: empty statement
<9> a political speech was it?
<10> funny how the better half of CS disappears when you decide to reject the axiom of choice..
<8> oops, should be type 'a list = Nil | Cons of 'a * 'a list;;
<10> but deep down all computer scientists have always known there was no such thing as an infinite set or turing machine
<2> hahah
<10> even so, to acquiesce to the AC is to give up all hope in a truly continuous world and infinite universe..
<5> Sure you can process an infinite set, you just won't ever be done with it.
<5> For instance, you can make a random number generator that keeps going until the machine rots.
<10> but the machine, and its bits, will rot, eventually.
<5> Just like the rest of the universe.
<7> int randomnumbergenerator() { return 5; }
<7> **pseudo, of course
<5> All the other natural sciences acknowledge infinities. ;
<10> the absence of the AC is a truly free world, mysterious and beautiful, where anything can happen..
<10> but when we accept the AC, and take our precious well ordering, we are chaining our own selves..
<10> and giving up ever having the chance of getting a hot date with keira knightley
<10> :(
<10> i will not give up keira knightley. i will die before i accept the axiom of choice, and you know where you can put your precious little well ordered elements.
<10> i remember in last semester, the professor presented a proof of the validity of induction that required the well-ordered principle.. does that mean induction in general requires accepting AC?
<4> AaronWL: i already slept with her
<10> yes, according to wikipedia. if you reject the AC, induction is invalid.
<10> Vratha, last time i checked, you were trying to hook it up with some reject star wars chick
<10> and i get the distinct feeling it was _not_ natalie portman :P
<4> AaronWL: yeah, i got her too... i'm a pimp at a computer desk
<4> or ther other way around
<11> ...
<11> I keep my pimp hand strong
<11> penis pump?
<2> for when you beat it.
<12> HI
<12> so, I have something called wrist drop, or otherwise known as radial nerve palsy
<12> ot u awake?
<11> i have chronic sign language tourettes
<11> nice to meet you
<12> haha
<12> well, good thing for redundancy, I have my left hand, I seem to be sufferring the same syndrome you have ;)
<12> later
<13> ;
<2> ;
<10> aeon?
<10> aeon flux?
<10> http://adorocinema.cidadeinternet.com.br/filmes/aeon-flux/aeon-flux-poster04.jpg
<10> semi-hot, but the movie ****ed
<10> http://kensforce.com/05aeonflux02.jpg
<10> at the moment, i am much preferring keira knightley
<13> <--- Mish
<2> semi-hot?
<10> right, i noticed..
<2> omfg..
<10> kthx^, you are thinking otherwise?
<2> indeed
<14> Theron's pretty nice, to be perfectly objective
<10> i am curious in which direction.
<14> Although I am agreed in the direction of Knightley
<2> semi-hot x 100
<2> ;D
<10> she has a nice body, which is where most of her points come from, and nice skin, but without the bod her face is rather severe.. and she lacks overall charm imo
<10> keira most likely scores lower on the bod, although i am not sure, but much prettier in the face, and high charm
<10> also, keira needs minimal makeup, in _pirates_ in some shots she wasn't wearing any...
<10> bonus points for that.
<14> Yeah, that's a definite plus; excessive makeup can show up badly
<2> LMFAO
<10> maybe im especially vulnerable at the moment, but i just saw _pirates 2_ and keira is ridiculously seductive.. great directing and acting there. i seriously was practically about to confess my undying love, there in the theater
<14> I haven't seen much of Knightley, unfortunately; missed most of her movies
Return to
#c
or
Go to some related
logs:
HustlerCentral - Directories
highdefmoviepass hd rapidshare
firefox flv intercept
VioTek
#windows
#stocks
#windrop
#linuxhelp
snorting tylenols
xray-effect
|
|
