[Bug 2545] performance on std::map

bugzilla at busybox.net bugzilla at busybox.net
Tue Dec 24 11:11:47 UTC 2013


https://bugs.busybox.net/show_bug.cgi?id=2545

--- Comment #10 from mw3demo at gmail.com 2013-12-24 11:11:47 UTC ---
(In reply to comment #4)
> (In reply to comment #3)
> > Sorry, I didn't provide that much information in fact.
> > 
> > The elements of class std::map<port_spec, service_node> service_table are:
> > 
> > struct port_spec {
> >   int portno; /* Network byte order */
> >   std::string proto;
> > 
> >   /* Sort in the usual nmap-services order. */
> >   bool operator<(const port_spec& other) const {
> >     if (this->portno < other.portno)
> >       return true;
> >     else if (this->portno > other.portno)
> >       return false;
> >     else
> >       return this->proto < other.proto;
> 
> This sounds rather erm elaborate, but ok.
> 
> >   }
> > };
> > 
> > /* This is a servent augmented by a frequency ratio. */
> > struct service_node : public servent {
> > public:
> >   double ratio;
> > };
> > 
> > 
> > It will take up to 65536 elements.
> 
> > Does this mean this is a intrinsic performance problem to save memory? I must
> > always use the standard libstdc++?
> 
> Well, *currently*.
> As said, please provide a small, self contained testcase with real world data
> and we'll see what we can do.

Bernhard Reutner-Fischer: Ping

-- 
Configure bugmail: https://bugs.busybox.net/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are on the CC list for the bug.


More information about the uClibc-cvs mailing list