| |
| |
| |
|
Page: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
Comments:
<0> It's rdragon
<1> do we now
<0> He was always a strange one
<2> well, it's been very quiet in here and I do a channel ping and get two PMs to join a channel
<2> if I find the ****er he's toast
<1> okay I'll start at the bottom of the list alphabetically
<1> vawjr, you start at the top
<1> JBlitzen, you take the middle going up
<1> ... someone else do the middle going down
<0> Yeah, that's exactly what I'm going to do
<3> Is there a noCaseCompare for std::list and std::pair together?
<2> no
<3> bah, so I have to string_lower() everything?
<2> up to you
<3> well, otherwise it won't match if different case, correct?
<3> this is for a std::list < std::pair <std::string, int> >;
<2> and you want to find something in it?
<3> yeap
<4> Why not just use the string as a key for a std::map container?
<2> that's kind of an odd container
<2> and downcase it before you make it a key
<3> clsk: I guess I could, but how much would that hurt speed?
<2> why are you using std::list?
<3> Honestly, I didn't create this particular container in the code, so I'm not sure.
<2> well, do people do a lot if inserts and deletes?
<2> but if it's widely used, you can't do a simple substitution to map
<2> too much stuff won't work
<3> possibly, at times it can process several hundred things at once
<4> It depends on the use of the container
<2> yup
<3> It's used as a queue
<4> What's wrong with std::queue?
<2> but...if you _have_ to search it, I guess that's why
<3> hmm, /me checks
<5> clsk, it doesn't exist
<2> gribouille wrong
<4> In either case a std::list wouldn't be the best option IMO.
<5> vawjr, what ?
<4> What doesn't exist gribouille?
<2> gribouille oh, that wasn't a response to clsk asking about std::queue?
<5> clsk, std::queue
<4> hm, are you sue?
<2> gribouille really? when did it get taken out of the standard?
<2> #include <queue>
<5> vawjr, never heard of a std::queue
<6> think stack, but FIFO
<4> You just did.
<2> that's not MY fault
<2> gribouille I suggest you either throw away that copy of the standard you have, or you actually READ it... refer to 23 Containers library
<5> vawjr, I thought its name was dequeue
<2> that's something else
<5> vawjr, what's the difference ?
<2> I don't teach C++
<2> look it up yourself
<4> Twister2 a stack is not FIFO.
<6> I said think stack, BUT FIFP
<6> FIFO too
<5> vawjr, I don't ask you to teach me C++.
<4> ah
<2> 23.2.3.1
<2> that's queue
<6> dequeu is a vector but has better support for inserting and removing elements form both ends
<2> 23.2.1 -- cl*** deque
<2> Twister2 not exactly
<5> cl*** template queue doesn't seem very useful
<2> it's internal storage is quite different
<7> Wow... there is a standard manual?
<2> it's a FIFO container
<7> where can i download this
<6> its not sequential in memory?
<2> XboK it's called the ISO Standard
<2> Twister2 bingo
<6> ah.
<5> it's useful only when you want to restrict the interface of a container to the set of operations supported by a queue
<2> XboK you can buy it from ANSI
<2> duh, that's generally what one does with a cl***
<2> XboK it's US$18
<7> ohh
<5> vawjr, how do you know that it's $18 ?
<2> because that's how much it cost me
<2> maybe we charge French citizens more
<5> vawjr, why did you buy it ? you don't know how to fill you hard drive ?
<2> for one, I write libraries
<4> heh
<7> it is good to have hard copy
<6> book, hd... I don't see the corelation
<2> for the standard? I don't think so
<4> What are you? fighting against the world today gribouille?
<2> it's not what I'd call casual reading
<5> clsk, no
<4> Why are you trying to contradict everyone then?
<2> at any rate, we're far afield from the orignal problem
<5> clsk, that's not what I am trying to do
<4> It definetly looks like it.
<6> oops
<2> so where's reed>"
<2> err, reed ?
<4> What did you break Twister2?
<4> He's probably researching std::queue
<6> nothing, just hit CTCP Userinfo on vawjr by accident
<4> ah
<2> hmmm, didn't I answer?
<6> yeah, I got the reply
<2> I don't even know what it is
<6> USERINFO Victor A. Wagner, Jr. --- http://rudbek.com
<2> hmmm, I should remove the ,
<6> I was after a list of channels...
<6> is VC++ include Win32API questions?
<6> err #VC++
<2> yeah
<6> sweet
<8> damn, A&M still doesn't have VS2005 for sale :(
<7> [Fri 09:59] * Now talking in #vc++
<7> [Fri 09:59] * Topic is 'Anything about VC++ (except 6.0, get rid of it, get vc++2005)'
<2> XboK most of us know
<3> vawjr: I just swapped to std::map. It serves my purpose.
<3> std::queue doesn't have an iterator
<3> afaik
<6> yes, but that infers question about the application rather than API questions
<7> err then that means win32API is still in VS2005
<2> reed we _asked_ what you needed this for and got no answer
<7> they are not throwing it
<9> does ne1 know how to add a series of numbers (referenced by a sequence of numbers) in constant time?
<2> ves3ks seems unlikely
<6> constant time is not often viable for sequences of any kind
<9> yeah.. that's what im thinking
<6> unless there is order to the numbers
<6> e.g. a pattern you can influence via an equation
<9> yes, the numbers are ordered from 0 to n-1
<6> like all sequential numbers from 0-N
<9> no, no such patter
<6> oh, that you can do then me thinks
<9> the series references arbitrary numbers
<9> and those are the numbers i need to add together
<9> not the series numbers
<6> oh
<9> but the addition would be done from left to right
<6> not likely then. :)
<9> foo(1,5)
<9> would add the numbers that are referenced by 1,2,3,4,5
<2> and what does "referenced by" mean?
<9> so 1 would be mapped to say, 6
<6> some sort of <int, int> map ?
<9> and 2 would be mapped to say, 2, some arbitrary number
<9> and 3 to 4
<9> 4 to 1 and 5 to 0
<6> actually if all values 0-n are represented I would just use a vecor.
<9> so foo(1,5) would return 6+2+4+1+0 = 13
<2> ves3ks i'ts going to be O(n)
Return to
#c++
or
Go to some related
logs:
php mkdir user register
#linux
word womp scrambler
#MissKitten
#AllNiteCafe
naked buttoks
#AllNiteCafe
#AllNiteCafe
#linuxhelp
#AllNiteCafe
|
|