search for: _debug_lt

...<' : no operator found which takes a right-hand operand of type '`anonymous-namespace'::Relation' (or there is no acceptable conversion) c:\Program Files\Microsoft Visual Studio 8\VC\include\algorithm(1385) : see reference to function template instantiation 'bool std::_Debug_lt<`anonymous-namespace'::Relation,_Ty>(_Ty1,_Ty2,const char *)' being compiled with [ _Ty=llvm::Value *, _Ty1=`anonymous-namespace'::Relation, _Ty2=llvm::Value * ] c:\Program Files\Microsoft Visual Studio 8\VC\inclu...

...found which takes a right-hand >operand of type '`anonymous-namespace'::Relation' (or there is no >acceptable conversion) > c:\Program Files\Microsoft Visual Studio >8\VC\include\algorithm(1385) : see reference to function template >instantiation 'bool >std::_Debug_lt<`anonymous-namespace'::Relation,_Ty>(_Ty1,_Ty2,const >char *)' being compiled > with > [ > _Ty=llvm::Value *, > _Ty1=`anonymous-namespace'::Relation, > _Ty2=llvm::Value * > ] > c:\Program Files\Mi...

In the VS2005 debug std libraries, the lower_bound algorithm uses a function known as _DEBUG_LT. The problem with this is that it asserts that if a < b then !(b < a). It also asserts that the input is actually sorted by using < to compare the elements. In LLVM there are a couple of places where the lower_bound algorithm is used with a lower bound of a different type than the iterato...

On Thu, 31 May 2007, Chuck Rose III wrote: > Our project is cross platform and on Windows we use VStudio 2005. > VStudio presents a couple of issues related around it's STL > implementation and also it's non-respect for the no-return semantic of > abort(). Ok. We want the source to be portable, so it's goodness to get these fixes into the main tree. > I've fixed

Hola LLVMers, Our project is cross platform and on Windows we use VStudio 2005. VStudio presents a couple of issues related around it's STL implementation and also it's non-respect for the no-return semantic of abort(). I've fixed it locally, but I'd like to send a patch so I don't have to do this every time I update from the source repository. So.... if I'm

...= n; ++I) { if (Subtree->DominatedBy(I->Subtree)) return I; } return E; } The debug paths through VStudio's STL through the std::lower_bound function get to this template: template<class _Ty1, class _Ty2> inline bool __CLRCALL_OR_CDECL _Debug_lt(const _Ty1& _Left, const _Ty2& _Right, const wchar_t *_Where, unsigned int _Line) { // test if _Left < _Right and operator< is strict weak ordering if (!(_Left < _Right)) return (false); else if (_Right < _Left) _DEBUG_ERROR2("invalid operator<", _Where, _L...