Re: std::set as search tree - manipulate elements?

From:

Marcin.Barczynski@yahoo.com

Newsgroups:

comp.lang.c++.moderated

Date:

Thu, 17 Jul 2008 12:04:34 CST

Message-ID:

<fd184675-7e42-4758-aef2-48630a52ada1@27g2000hsf.googlegroups.com>

On Jul 17, 12:54 am, Rune Allnor <all...@tele.ntnu.no> wrote:

std::set<histbin> histogram;

std::set<histbin>::iterator i;
while (/* data coming in */)
{
     i=histogram.find(data);
     if (i!=histogram.end())
     {
         (*i).count+=1; // <<<<<======
     }
     else
    {
       /* insert new bin */
    }

}

The problem is the tagged line. Apparently, all elements
in std::set are declared 'const', so I am not allowed to
manipulate the elements directly. Do note that I do *not*
manipulate the histbin::bin element, which is used as the
key for sorting, and thus it ought to be safe to manipulate
the histbin::count elements.

Is there a convemient, safe way to be able to use std::set
as the search tree for this histogram?

If 'no', are there other STL containesr that can be used?

You should use std::map instead.

--
[ See http://www.gotw.ca/resources/clcm.htm for info about ]
[ comp.lang.c++.moderated. First time posters: Do this! ]