Re: hash_set: how to handle collisions?

From:

Markus Dehmann <markus.dehmann@gmail.com>

Newsgroups:

comp.lang.c++

Date:

Sat, 12 Jul 2008 10:47:53 -0700 (PDT)

Message-ID:

<c769a5be-4975-4a88-a012-9536859b119d@l42g2000hsc.googlegroups.com>

On Jul 11, 5:54 am, James Kanze <james.ka...@gmail.com> wrote:

On Jul 11, 3:20 am, Markus Dehmann <markus.dehm...@gmail.com> wrote:

  for(int i=0; i<repeat; ++i){
    MyContainer* h = new MyContainer();
    for(int j=0; j<size; ++j){
      h->add(getRand(0, 1000));
    }
    myMap.insert(h);
  }
  for(int i=0; i<repeat; ++i){
    MyContainer* h = new MyContainer();
    for(int j=0; j<size; ++j){
      h->add(getRand(2000, 3000));
    }
    MyMap::const_iterator found = myMap.find(h);
    assert(found == myMap.end()); // aborts!

I'm not sure I understand. You create a random object, and
assert that it is in the container. Why should you expect it to
be in the container?

No, I define an object that is guaranteed *not* to be in the container
and ask the container to find it. The assertion says that the object
should not be found.

Markus