| |
| |
| |
|
Page: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
Comments:
<0> Cquence no, but you can feel free to ask your next question
<1> no, is that like Con-Air?
<2> but if I take those two vectors of ascending random numbers as representing timings of pulses on a timescale from 0 to max time, then you can compute correlation betwean the pulse vectors and you get similarity
<3> that ****ing comma....
<3> aarrrgh
<1> so, you figured out your cross correlation question?
<2> yea kinda did
<3> there was a ****ing comma after the last parameter
<4> rdragon: I have placed anything it needs in order to compile with the Borland C++ 5.5 Free compiles but all i get is a .i file for return... i mean i'm really new to C++ but should i be getting a .exe file? (if i run compiler manually i do get a .exe file)
<0> *shrug* your compiler is ancient I think
<2> they are similar, the Fourier Transform is faster if you want correlation at all the different "slidings" comparing one function over time to the other
<0> i suggest using something 21st centure
<0> century
<2> but since I only need correlation at lag zero im good with the stats formulation
<4> rdragon: what difference does it makes? since i only need it for stupid small basic programs..
<2> that probably mean **** all if you dont know correlation very well
<0> Cquence - becuase you're not using a standard C++ compiler.
<4> rdragon: what am i using then?
<0> a piece of trash
<4> rdragon: If i wanned to do everything perfect i would be to my nix box using me gcc compiler instaid... i'm stuck in this lame M$ OS
<0> so?
<0> MS offers VS2005 Express for free
<0> and it's far far superior to that borland stuff
<4> how about telling me what that .i file i am getting..
<0> I have no idea what a .i file is
<0> probably a borland thing
<2> I wonder when the academic alliance gets VS2005 for free
<4> rdragon: ok thanks dude! any links for the VS2k5 ?
<0> microsoft.com - it's easy to find
<4> rdragon: ts ts ts ... shall i use www infrond?
<4> lol
<0> if you'd like
<4> LOL
<4> anyway thanks man!
<0> *nod*
<4> !google VS2005 Express
<5> hey guys, stupid question for you
<0> stupid answer, then
<5> ain.cpp:72: error: 'struct std::pair<const char* const, Node*>' has no member named 'nextTable'
<0> indeed
<5> how do i get the Node inside the stl pair?
<0> std::pair has a first and second member
<0> corresponding to the first/second element of the paid
<0> pair
<5> hmm I'm trying to find it on the sgi website... so all i do is pairVar.second ?
<0> yes
<0> that'll give you a Node*, in your case
<5> great thank you
<4> rdragon: is this the one you suggested me? http://msdn.microsoft.com/vstudio/express/visualc/download/
<4> ?
<5> okay second stupid question if you can bare with me... from the stl hash_map page, there is a function called find as follows " iterator find(const key_type& k) " how do I know if anythign was found? I check for NULL but the compiler complains
<6> stl hash_map?
<5> yes
<5> it says it can't convert hashtable iterator to bool
<5> if ( iter = currHashTable->find(word) ) {
<3> char* str = new char[256]; sscanf(buf,"%s"str); <-------- is this good?
<3> it gives an unhandled exception reading 8000 bytes after str
<7> ..., you can't red anything bigger then 255 chars using that MrMuscolo
<3> i'm not trying to
<3> but i have no idea why it ends up reading 8000 bytes after the str's address
<3> and the string is null terminated
<0> bahhhh crap... another head hunter found me and is trying to shove a bunch of stuff down my throat :/
<8> 9"?
<9> rdragon: Need a stick to beat back the job offers, huh?
<0> yeah, this one at least
<8> you know what you should do?
<8> show them your REAL resume
<0> haha
<10> If people see Ashe's real resume they'll wash their hands in a sterliser
<0> *shrug* my resume is honest
<8> mine is too
<8> ... most of it
<5> quick question guys. Easy i'm sure...
<5> I don't want to type (hash_map<const char*, Node *, hash<const char*>, eqstr> *) everywhere I do a cast/create a variable
<0> i'm afraid of stating that I know or have done something, and then getting caught not being able to talk about it - credibility = all gone
<5> is there a way i can use #define or #typedef? i tried but gave me errors
<0> it's not #typedef
<0> #stuff is for the preprocessor
<0> typedef is a keyword
<0> typedef blah<blah1, blah2> CrapType;
<5> yes sorry, i tried typdef...
<8> that'd be a huge lie, rdragon
<0> CrapType my_crap;
<8> small lies are okay
<0> EwIck- yeah I guess
<0> EwIck- where did you work again?
<0> in canada?
<8> qc city
<0> ah
<0> got a job description here for an opening in vancouver
<0> not sure i'm thrilled about living in CA
<0> .ca, rather
<8> gotta love snow.
<5> typedef (hash_map<const char*, Node *, hash<const char*>, eqstr> *) HashMap;
<5> main.cpp:26: error: expected `)' before '*' token
<0> don't surround it with ()
<0> you don't type (int) x; do you?
<5> no, sorry, that was from a cast
<5> ok i'll try it, thanks rdragon
<8> can't you catch exception types in a row?
<0> in a row?
<8> like try { ... } catch(E) {...} catch(...){...}
<0> yes
<8> I want to catch some exception "E" and all other exceptions
<8> hmm
<0> as long as it's thrown within the try{} heh
<8> of course.
<8> it's not doing it in some code at work and everyone's all "huh..."
<0> what kind of exception is it?
<8> can't even tell
<0> or you mean the catch(...) isn't catching it?
<8> yeah
<0> maybe it's a hardware exception?
<0> those aren't necessarily caught
<8> it's in a 3dsmax plugin, and the entry function has a try{} surrounding all of its code, and it's not catching it (max is)
<8> could it be because of a signal handler or something?
<11> Has anyone constructed a node tree using stl containers containing pointers to nodes?
<11> if so, how is memory management best handled?
<12> <set> is a tree
<11> are sets ordered?
<11> The container itself can be chosen at a later date... the important part is memory managment.
<12> Yes, they're basically a binary tree
<12> http://www.sgi.com/tech/stl/set.html
<12> Set is a Sorted ***ociative Container that stores objects of type Key.
<11> Well, the tree I will end up with only has one restraint in that each child may only have one parent
<11> so, the children being represented as a subtree is fine... but keep in mind I am storing pointers because I need polymorphism
<11> a vector may work fine, I have no intention of removing children once they are there
<11> so, each node would have a vector of pointers to other nodes, and a single parent pointer
<11> actually, I may not need the parent pointer...
<11> because the tree will be constructed, destroyed, and utilized sequentially
<11> but it would be nice to make the code excpetion safe... and thats not easy with all them pointers flying around
<2> polymorphism through references
<11> well, I don't know how to get it without references
<11> is it even possible?
<0> polymorphism works through pointers or references
<0> references don't control lifetime, though, so that doesn't do much for exception safety
<0> smart pointers help, though
<11> hmm, yes... now that I don't need a pointer to the parent, I think a reference count smart pointer would work
<0> boost::shared_ptr
<0> boost::weak_ptr for a non-owning smart pointer, too
<11> kewl
<2> yes
<2> finally
<2> my simulation is FINALLY doing it like I want
<0> great ;)
<2> now I need to make a visualiser for those stupid people to like my presentation
<5> I declared a char s[256]; and then do a cin >> s; But it only reads the first word, how do i read the entire sentance someone types on the command line?
<12> getline
<5> okay, i thought that was a C function, thanks JBlitzen
<12> yw
Return to
#c++
or
Go to some related
logs:
kurdscript
#slice
#asm
#chatzone
#AllNiteCafe
#linux
#linuxhelp
pastebin oxpass.com members
#AllNiteCafe
difference between Eclipse and MyEclipse
|
|