Re: std::vector - the wanders of itterators and size_t

From:

Jon Rea <jon.rea@bris.ac.uk>

Newsgroups:

comp.lang.c++

Date:

Thu, 5 Jul 2007 13:22:36 GMT

Message-ID:

<JKpJto.GuH@bath.ac.uk>

Victor Bazarov wrote:

Jon Rea wrote:

I have a class that has a private std::vector and uses it to store its
content. I want to search the data within this vector and return the
size_t index of that data.

Pseudo-code:

class Foo
{
public:
std::string name;
int otherData;
};

inline bool operator==( const Foo& f, const std::string& name )
{
return f.name.compare(name) == 0;
}

class Manager
{
public:
size_t getIDFor( const std::string& name )
{
std::vector<RotamerSet>::const_iterator findResult = std::find(
m_Data.begin(), m_Data.end(), name );
// How do I return a size_t from an itterator ?!?

if (findResult != m_Data.end()) return findResult - m_Data.begin();
else
??? // not found -- decide what to return.

return 0;
}
private:
std::vector<Foo> m_Data; // The data, the manager garantees that this
contains only ONE of each named foo
};

1) How do I return a size_t from the itterator ?!?

Since the vector::iterator (or const_iterator) is a RandomAccessIterator,
you can subtract two values (see above).

But doesn't 'findResult - m_Data.begin()' return an itterator, not size_t ??

2) Is std::find more efficient than manually itterating the vector and
performing the == test sequentially?

That's what 'find' does internally. So they should be really close as
far as performance is concerned. But (or hence) there is no clear answer
to this question. You need to profile both methods to be able to compare.

Fair enough :-)

Jon