search for: iterator_trait

..._Pr=`anonymous-namespace'::LessOpcode, _InIt=const `anonymous-namespace'::MatchEntry * ] C:\dev\MSVisualStudio\VC\include\algorithm(2480) : see reference to function template instantiation 'std::pair<_Ty1,_Ty2> std::_Equal_range<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type,_Pr>(_FwdIt,_FwdIt,const _Ty &,_Pr,_Diff *)' being compiled with [ _Ty1=const `anonymous-namespace'::MatchEntry *, _Ty2=const `anonymous-namespace'::MatchEntry *, _FwdIt=const `anonymous-namespace&...

...amespace'::LessOpcode, > _InIt=const `anonymous-namespace'::MatchEntry * > ] > C:\dev\MSVisualStudio\VC\include\algorithm(2480) : see > reference to function template instantiation 'std::pair<_Ty1,_Ty2> > std::_Equal_range<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type,_Pr>(_FwdIt,_FwdIt,const > _Ty &,_Pr,_Diff *)' being compiled > with > [ > _Ty1=const `anonymous-namespace'::MatchEntry *, > _Ty2=const `anonymous-namespace'::MatchEntry *, > _FwdIt=co...

...guidance for maximum object size is stated to be half of SIZE_MAX in C11 K.3.4/4 which is typically equivalent to PTRDIFF_MAX. - The expectation that PTRDIFF_MAX is more or less a proxy for the largest object size is not uncommon. For example, C++'s std::count doesn't return a size_t but a iterator_traits<>::difference_type which is going to be a ptrdiff_t for things like std::vector. On Fri, May 20, 2016 at 1:31 AM, John Regehr via llvm-dev < llvm-dev at lists.llvm.org> wrote: > It could be that 32-bit systems are disappearing so rapidly that nobody > cares too much about this...

It could be that 32-bit systems are disappearing so rapidly that nobody cares too much about this issue, but this blog post is still worth reading: http://trust-in-soft.com/objects-larger-than-ptrdiff_max-bytes/ John

...he standard and its future is not clear. See, e.g., http://open-std.org/jtc1/sc22/wg14/www/docs/n1969.htm . > - The expectation that PTRDIFF_MAX is more or less a proxy for the largest > object size is not uncommon. For example, C++'s std::count doesn't return > a size_t but a iterator_traits<>::difference_type which is going to be a > ptrdiff_t for things like std::vector. Bug in C++? Because max_size() of std::vector<char> has the type `size_type` and returns SIZE_MAX in practice (even on x86-64). Let's see other examples (on x86-32): - glibc's malloc is ha...

..., > > _InIt=const `anonymous-namespace'::MatchEntry * > > ] > > C:\dev\MSVisualStudio\VC\include\algorithm(2480) : see > > reference to function template instantiation 'std::pair<_Ty1,_Ty2> > > std::_Equal_range<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type,_Pr>(_FwdIt,_FwdIt,const > > _Ty &,_Pr,_Diff *)' being compiled > > with > > [ > > _Ty1=const `anonymous-namespace'::MatchEntry *, > > _Ty2=const `anonymous-namespace'::MatchEntry *,...

..._Ty=unsigned int, _Ty1=`anonymous-namespace'::TableEntry, _Ty2=unsigned int ] c:\Program Files\Microsoft Visual Studio 8\VC\include\algorithm(1397) : see reference to function template instantiation '_FwdIt std::_Lower_bound<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type>(_FwdIt,_FwdIt,const _Ty &,_Diff *)' being compiled with [ _FwdIt=const `anonymous-namespace'::TableEntry *, _Ty=unsigned int, _Iter=const `anonymous-namespace'::TableEntry *, _Diff=std...

...t document objects to much of Annex K but doesn't say anything about K.3.4/4. > > > - The expectation that PTRDIFF_MAX is more or less a proxy for the largest >> object size is not uncommon. For example, C++'s std::count doesn't >> return >> a size_t but a iterator_traits<>::difference_type which is going to be a >> ptrdiff_t for things like std::vector. >> > > Bug in C++? Because max_size() of std::vector<char> has the type > `size_type` and returns SIZE_MAX in practice (even on x86-64). > Some folks in the C++ community believ...

That source file was removed from LLVM in r232397 on March 16, 2015. It looks like lljvm hasn't been updated in a long time. LLVM's C++ APIs are not stable, so there is no expectation that a project built against LLVM's C++ API in 2015 would build or reasonably function against LLVM trunk. The project probably works against LLVM 3.6.2 which was (I believe) the last LLVM release to

...tr, - Value* const *Idx, unsigned NumIdx); - template<typename InputIterator> static const Type *getIndexedType(const Type *Ptr, InputIterator IdxBegin, @@ -508,6 +505,13 @@ typename std::iterator_traits<InputIterator>:: iterator_category()); } + + static const Type *getIndexedType(const Type *Ptr, + Value* const *Idx, unsigned NumIdx); + + static const Type *getIndexedType(const Type *Ptr, +...

...t; _Ty1=`anonymous-namespace'::TableEntry, > _Ty2=unsigned int > ] > c:\Program Files\Microsoft Visual Studio >8\VC\include\algorithm(1397) : see reference to function template >instantiation '_FwdIt >std::_Lower_bound<_FwdIt,_Ty,std::iterator_traits<_Iter>::difference_type>(_FwdIt,_FwdIt,const >_Ty &,_Diff *)' being compiled > with > [ > _FwdIt=const `anonymous-namespace'::TableEntry *, > _Ty=unsigned int, > _Iter=const `anonymous-namespace'::TableEntry...

On Jul 22, 2008, at 11:54 PM, Matthijs Kooijman wrote: > Hi Chris, > > >> I'd prefer to not turn this into a template. Why not just define a >> version that takes an array of uint64_t's or something like that? > because I want to be able to pass in iterators. I could define a > version that > takes std<uint64_t>::iterators, but next thing we know, we

Issue: STLExtras.h includes a class mapped_iterator that uses std::iterator_traits<> without including <iterator>. Fix: have STLExtras.h include Support/iterator. -- Casey Carter Casey at Carter.net ccarter at uiuc.edu AIM: cartec69 -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: patch URL: <http://lists.ll...

In case others are interested in what happened with Casey's patches, here's the digest: > Issue: STLExtras.h includes a class mapped_iterator that uses > std::iterator_traits<> without including <iterator>. > Fix: have STLExtras.h include Support/iterator. Applied. > DSGraph.h has a prototype in it with a std::string& parameter, but does > not include <string>. Applied. > The machinery around the bison call in the Makefile does not...

Hi list, I have several questions about LLVM pass. 1) Is building a custom LLVM pass out-of-source not recommended? The official document only contains instructions about in-source build (http://llvm.org/docs/WritingAnLLVMPass.html <http://llvm.org/docs/WritingAnLLVMPass.html>). 2) opt (ver >= 4) with custom pass libraries does not work as before. When I have a simple custom LLVM pass

...: Instruction(cast<FunctionType>(cast<PointerType>(Func->getType()) ->getElementType())->getReturnType(), Instruction::Call, 0, 0, InsertBefore) { init(Func, ArgBegin, ArgEnd, Name, typename std::iterator_traits<InputIterator>::iterator_category()); } init() is the function that actually does the checking of the iterators for an empty range. This required that I pull in is_base_and_derived, remove_pointer, is_same and remove_cv from Boost. boost::is_class already exists in Support/type_traits.h...

On Monday 02 July 2007 16:26, Chris Lattner wrote: > On Sun, 1 Jul 2007, Nick Lewycky wrote: > > I've been running LLVM with _GLIBCXX_DEBUG (extra checks) turned on to > > see what would happen, and it's been a complete disaster. Well, that's a bit harsh, isn't it? It's finding bugs, just like it's supposed to. :) I believe I've started to run into

I have two questions about the CRAN machines that build binary packages for Mac. When a new version of a package is released, (A) Do the downstream dependencies get re-checked? (B) Do the downstream dependencies get re-built? I have heard (but do not know for sure) that the answer to (A) is no, the downstream dependencies do not get rechecked. >From publicly available information on the