ATL / WTL / STL

#if _HAS_ITERATOR_DEBUGGING
       if (this->_Mycont == 0
           || _Myptr < ((_Myvec *)this->_Mycont)->_Myfirst
           || ((_Myvec *)this->_Mycont)->_Mylast <= _Myptr)
           {
           _DEBUG_ERROR("vector iterator not dereferencable");
           _SCL_SECURE_OUT_OF_RANGE;
           }
#else

...............

int main()
{
	vector<int> v(10);
	for (int i=0; i<10; ++i)
	{
		v[i] = i;
	}

	vector<int>::iterator it = v.begin();

	it += 3;
	
	// Erase the "it" before using it and use the iterator returned from erase()
	it = v.erase(it);
	
	vector<int>::iterator it0 = it + 1;
	
	cout << *it0 <<endl;

	cin.get();

	return 0;
}
</int></int></int>

Kyudos wrote:

I appreciate that maps and sorting don't go together

the fundamental property of iterators of associative containers is that they iterate through the containers in the nondescending order of keys where nondescending is defined by the comparison that was used to construct them.

Stuart Dootson wrote:

the fundamental property of iterators of associative containers is that they iterate through the containers in the nondescending order of keys where nondescending is defined by the comparison that was used to construct them.

bool OrderOnDistToRef(Info const* l, Info const* r) const { return l->DistToRef < r->DistToRef; }

std::vector<const Info*> index;
for(std::map<LONG, Info>::const_iterator i=m_PtsInfo.begin();i!=m_PtsInfo.end();++i)
{
   index.push_back(&i->second);
}
std::sort(index.begin(), index.end(), OrderOnDistToRef);

Info lookingForStruct;
lookingForStruct.DistToRef = distToRefWeAreLookingFor;
std::vector<const Info*>::const_iterator found = std::lower_bound(index.begin(), index.end(), &lookingForStruct, OrderOnDistToRef);

string s;

try
{
    s.at(s.size() - 1)
}
catch (exception& e)
{
}

template<class StringType>
typename StringType::value_type back(StringType const& s)
{
   return *s.rbegin();
}

chetanjoshi9 wrote:

THREAD_PRIORITY_HIGHEST

chetanjoshi9 wrote:

MSVBVM60