| |
| |
| |
|
Page: 1 2 3 4 5 6 7
Comments:
<0> I have no problem with a deficit
<1> deficit of what?
<0> http://video.google.com/videoplay?docid=2402060372341641699
<2> ... Quoi? o_O
<2> Huh... Wrong window!
<3> lol
<4> 0_@
<3> gn
<4> tty
<5> ... W00t? o_O
<4> 0_.
<4> lol
<6> mwhe all
<6> **** your mothers
<6> =)))
<6> please mr. ircop dont gline me
<6> .. if you gline me i **** your mother
<7> nice work Ashe`
<5> It's easier with the clone chanops ;)
<7> maybe 2 minutes isn't long enough to lock it down
<8> I'm not idle!!!!
<8> ohgodohgodohgod
<7> wo what you up to?
<7> err, s/wo/so
<8> waiting to go home
<7> wow, and "Advanced Cl***" for users of the UnderNet and IRC
<9> hehe
<10> So does that fall under computer science, or is it more psychiatry?
<7> I'm extending our softare so that we can handle multiple versions of our index files. the different versions mainly have differing sizes of one of the types we use (more or less info)
<7> any thoughts on how best to write readers that have slightly differing types based on a "version number" in the file header
<0> Readers?
<7> or a reader
<7> currently all the struct have operator >> overloaded
<7> and they all have a "convert to internal format" overloaded
<0> Ah
<7> currently I hand off to the collection getter an instance of the type on disk, and it reads into it, then push_back() the internal format into the collection
<7> the code looks a bit ugly thought <sigh>
<7> switch (m_WordMap->our_title.m_Prefs->GetVersion())
<7> {
<7> case 16:
<7> case 17:
<7> ReadLocators(stream, locator_on_disk_v16(), *m_KeyIt, list);
<7> break;
<7> default:
<7> ReadLocators(stream, locator_on_disk_v15(), *m_KeyIt, list);
<7> I've been trying to figure out how to better handle the versions numbers to the types (....v15 and ....v16) we have thusfar
<7> that number is likely to climb
<7> no, make that certainly will climb
<0> Just out of curiosity, how much do the versions vary?
<0> Oh, just different size or something for the most part?
<7> well, this time we added two new pieces of information for indexing... sentence and paragraph numbers
<11> heh
<11> When a woman dumps a guy there's always a long story, "Well, we went to the mall, and he was mean to a puppy, and blah blah blah."
<11> When a guy dumps a woman it's always the same reason, "So, what happened?" "She went nuts."
<12> hello
<7> lo
<13> haha
<12> :)
<13> hi BogdyPtr
<12> hello
<12> i was just asking myself, it is possible to sort an array without using if or ? instructions ?
<7> use a library function
<12> no ... i want an algorithm
<14> Look up "bucket sort" on google
<7> BogdyPtr why?
<12> because a library function uses comparisons inside
<12> i want a sort without comparisons
<7> I meant why do you want this at all
<12> take it as a personal chalenge
<7> to do YOUR homework for you ? lolololololol
<13> = homework
<13> haha
<12> :D
<12> no ... i arleady know one way to do a sort like this ...
<12> actually the fastest sorting argorithm ... 2*n complexity ... but it only apply to a specific kind of arrays
<12> :D
<7> flash sort?
<7> bucket sort
<7> radix sort
<15> hello
<7> lo
<12> don't know the name
<15> Can i get access here ?
<7> access to what?
<12> the basic idea is counting the elemens using a second array and then generate the output
<15> to x
<13> permission to join granted
<16> i am guaranteed that static members of a base cl*** are initialized before the derived cl*** (wich is a global var)? [if i'm not, how to "make" this happen?]
<7> I gotta go get my daughter from swimming
<14> Your daughter is a polar bear?
<17> are you ready to rock?!?!
<7> at the rec center
<18> Pegazus: static members are initialized on startup, no particular order to my knowledge
<17> and sup
<12> in vc++ 6 there is a particular order ... as i know they are initialized in alphabetical order using cl***name::membername as a sorting key
<12> i once had an issue with that ....
<12> i don't know if the base:derived relation has any effect
<17> you should never rely on the order in which statics are created and destroyed
<17> and if you do, shame on you
<12> :)
<18> I got picked on at work today
<18> because my teammates found a goto in my code
<18> har har
<19> there are some things that damn near require goto
<17> I've yet to see any :)
<18> yeah.. when you don't have exceptions (like in C) you use goto's for error checking
<18> but in this case, it was to get out of nested loops
<19> judging from your channel list i can understand why, all high level languages
<17> ja
<17> c++ is as low as I go
<17> well, and of course html
<0> :|
<17> hola
<12> html is very high level :)
<17> I know ;)
<0> :)
<12> think this : downloading and displaying an image in a single line of code :)
<20> doit();
<21> carlo =)
<17> Magic.Wand();
<17> blah, stuck in c# mode3
<0> img_3.show("asdf/img.jpg", 200, 250, 100, 100);
<17> Magic::Wand();
<9> html is high level?
<9> what would be lower level than html?
<12> <img src="www.example.com/test.jpg"> :P
<22> how do i output a float value in 2 dec places
<22> without using iomanip
<17> haha
<22> i use visual studio
<22> as a compiler
<17> int blah = val * 100; cout << blah / 100 << . << blah % 100;
<22> i don't want to use int
<12> use Format method of CString cl*** to format the value
<17> ugh
<17> wtf, you don't want to use iomanip and you don't want to use int
<22> it is a float value
<17> MagicWand.Display2DecimalPlaces(value);
<12> try something like this sprintf( destStr, "%.2f", value );
<22> ok, i'll do tha
<22> t
<17> blah
<12> impatient: i get a compiler error when trying to use Display2DecimalPlaces method :d
<17> haha
<23> lol
<12> what version of MagicWand do you use, i have 7.4.1 build 5786 :d
<17> oh I'm using g++
<12> ahhh ...
<12> :D
<17> its a bit more current on the stl implementation
Return to
#c++
or
Go to some related
logs:
#AllNiteCafe
#chatzone
#AllNiteCafe
disable flash in firefox
usually thrown the farthest in a track and field competition
#apache
james Clavell novel recounts John Blackthorne's adventures in 16th century Japan
#AllNiteCafe
#linux
#linuxhelp
|
|