Determining if an object is in std :: set

Question

I am trying to determine if an object is contained within std::set. According to msdn (and other sources), the set :: find function should return end()if it does not find the element you requested.

However, when I implement code like the one below, it set::findreturns an unnecessary ( 0xbaadf00d).

set<Cell*> cellSet;

Cell* cell = new Cell();    

if (cellSet.find(cell) == cellSet.end())
{
    ...
}

Am I using this correctly? I work in Visual C ++ 2005.

Answer 1

Your submitted code will always execute code in if, and 0xbaadf00d - the implementation marker "one end of the past."

Answer 2

stl set count . , .

set<Cell*> cellSet;

Cell* cell = new Cell();    

if (cellSet.count(cell) == 0)
{
    ...
}

Answer 3

callSet.end() 0xbaadf00d?

VS2008, , . find , .

? () ?

Answer 4

, , , . , , , delete d.

, ++ ? . , . ( , - , , .)

Answer 5

, .

set<Cell*> cellSet;
Cell* cell = new Cell();
if (cellSet.find(cell) != cellSet.end())     // Test NOT EQUAL to end
{
     // Found item in set.
}

, Cell, Cell ( , ). ++ , , .

To actually compare objects, you need to use find_if () and pass the predicate (functor).

struct PointerCellTest
{
    Cell&  m_lhs;
    PointerCellTest(Cell* lhs): m_lhs(lhs) {}
    bool operator()(Cell* rhs)
    {
         return lhs.<PLOP> == rhs.<PLOP>
    }
};


if(find_if(cellSet.begin(),cellSet.end(),PointerCellTest(cell)) != cellSet.end())
{
     // Found item in set.
}