/external/clang/test/SemaCXX/ |
H A D | warn-absolute-value.cpp | 1 // RUN: %clang_cc1 -triple i686-pc-linux-gnu -fsyntax-only -verify %s -Wabsolute-value -std=c++11 2 // RUN: %clang_cc1 -triple i686-pc-linux-gnu -fsyntax-only %s -Wabsolute-value -fdiagnostics-parseable-fixits -std=c++11 2>&1 | FileCheck %s 18 namespace std { namespace 36 (void)std::abs(x); 44 // expected-note@-2 {{use function 'std::abs' instead}} 45 // CHECK: fix-it:"{{.*}}":{[[@LINE-3]]:9-[[@LINE-3]]:14}:"std::abs" 48 // expected-note@-2 {{use function 'std::abs' instead}} 49 // CHECK: fix-it:"{{.*}}":{[[@LINE-3]]:9-[[@LINE-3]]:13}:"std::abs" 52 // expected-note@-2 {{use function 'std::abs' instead}} 53 // CHECK: fix-it:"{{.*}}":{[[@LINE-3]]:9-[[@LINE-3]]:14}:"std [all...] |
/external/clang/test/SemaTemplate/ |
H A D | resolve-single-template-id.cpp | 1 // RUN: %clang_cc1 -fsyntax-only -verify -std=c++11 %s 3 namespace std { namespace
|
/external/eigen/Eigen/src/StlSupport/ |
H A D | StdDeque.h | 18 #define EIGEN_EXPLICIT_STL_DEQUE_INSTANTIATION(...) template class std::deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> >; 25 * std::deque such that for data types with alignment issues the correct allocator 30 namespace std \ 55 // check whether we really need the std::deque specialization 56 #if !(defined(_GLIBCXX_DEQUE) && (!EIGEN_GNUC_AT_LEAST(4,1))) /* Note that before gcc-4.1 we already have: std::deque::resize(size_type,const T&). */ 58 namespace std { namespace 92 // workaround MSVC std::deque implementation 110 // workaround GCC std::deque implementation
|
H A D | StdList.h | 17 #define EIGEN_EXPLICIT_STL_LIST_INSTANTIATION(...) template class std::list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> >; 24 * std::list such that for data types with alignment issues the correct allocator 29 namespace std \ 54 // check whether we really need the std::vector specialization 55 #if !(defined(_GLIBCXX_VECTOR) && (!EIGEN_GNUC_AT_LEAST(4,1))) /* Note that before gcc-4.1 we already have: std::list::resize(size_type,const T&). */ 57 namespace std namespace 100 // workaround MSVC std::list implementation
|
H A D | StdVector.h | 18 * std::vector such that for data types with alignment issues the correct allocator 22 namespace std \ 25 class vector<__VA_ARGS__, std::allocator<__VA_ARGS__> > \ 47 namespace std { namespace 81 // workaround MSVC std::vector implementation 97 /* Note that before gcc-4.1 we already have: std::vector::resize(size_type,const T&). 104 // workaround GCC std::vector implementation
|
/external/eigen/test/eigen2/ |
H A D | sparse.h | 17 namespace std { namespace 18 using std::tr1::unordered_map; 49 std::vector<Vector2i>* zeroCoords = 0, 50 std::vector<Vector2i>* nonzeroCoords = 0) 92 std::vector<Vector2i>* zeroCoords = 0, 93 std::vector<Vector2i>* nonzeroCoords = 0) 134 std::vector<int>* zeroCoords = 0, 135 std::vector<int>* nonzeroCoords = 0)
|
/external/libcxx/src/ |
H A D | exception.cpp | 39 static std::terminate_handler __terminate_handler; 40 static std::unexpected_handler __unexpected_handler; 43 namespace std namespace 134 return "std::exception"; 147 return "std::bad_exception"; 155 // it uses to implement std::exception_ptr (which it declares as an alias of 156 // std::__exception_ptr::exception_ptr) is not directly exported to clients. So 157 // we have little choice but to hijack std::__exception_ptr::exception_ptr's 158 // (which fortunately has the same layout as our std::exception_ptr) copy 160 // stable ABI), and its rethrow_exception(std [all...] |
H A D | new.cpp | 34 static std::new_handler __new_handler; 46 operator new(std::size_t size) 48 throw(std::bad_alloc) 58 std::new_handler nh = std::get_new_handler(); 63 throw std::bad_alloc(); 73 operator new(size_t size, const std::nothrow_t&) _NOEXCEPT 94 throw(std::bad_alloc) 102 operator new[](size_t size, const std::nothrow_t&) _NOEXCEPT 129 operator delete(void* ptr, const std 150 namespace std namespace [all...] |
/external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
H A D | stable_partition.pass.cpp | 33 bool operator()(const std::pair<int,int>& p) const argument 42 typedef std::pair<int,int> P; 57 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); 71 typedef std::pair<int,int> P; 86 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first()); 99 r = std::stable_partition(Iter(array), Iter(array), odd_first()); 102 r = std::stable_partition(Iter(array), Iter(array+1), odd_first()); 106 r = std::stable_partition(Iter(array+4), Iter(array+5), odd_first()); 111 typedef std::pair<int,int> P; 126 Iter r = std [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/ |
H A D | stable_sort_comp.pass.cpp | 36 bool operator()(const std::pair<int, int>& x, const std::pair<int, int>& y) argument 44 typedef std::pair<int, int> P; 47 std::vector<P> v(N); 61 std::random_shuffle(v.begin() + i, v.begin() + i + M); 63 std::stable_sort(v.begin(), v.end(), first_only()); 64 assert(std::is_sorted(v.begin(), v.end())); 73 std::vector<std::unique_ptr<int> > v(1000); 76 std [all...] |
/external/libcxx/test/containers/ |
H A D | Emplaceable.h | 41 namespace std { namespace 45 : public std::unary_function<Emplaceable, std::size_t> 47 std::size_t operator()(const Emplaceable& x) const {return x.get();}
|
H A D | MoveOnly.h | 37 namespace std { namespace 41 : public std::unary_function<MoveOnly, std::size_t> 43 std::size_t operator()(const MoveOnly& x) const {return x.get();}
|
/external/libcxx/test/utilities/memory/allocator.traits/allocator.traits.types/ |
H A D | difference_type.pass.cpp | 46 namespace std namespace 59 static_assert((std::is_same<std::allocator_traits<A<char> >::difference_type, short>::value), ""); 60 static_assert((std::is_same<std::allocator_traits<B<char> >::difference_type, std::ptrdiff_t>::value), ""); 61 static_assert((std::is_same<std::allocator_traits<C<char> >::difference_type, signed char>::value), "");
|
H A D | size_type.pass.cpp | 45 namespace std namespace 58 static_assert((std::is_same<std::allocator_traits<A<char> >::size_type, unsigned short>::value), ""); 59 static_assert((std::is_same<std::allocator_traits<B<char> >::size_type, 60 std::make_unsigned<std::ptrdiff_t>::type>::value), ""); 61 static_assert((std::is_same<std::allocator_traits<C<char> >::size_type,
|
/external/libcxx/test/utilities/memory/pointer.traits/pointer.traits.functions/ |
H A D | pointer_to.pass.cpp | 33 static A pointer_to(typename std::conditional<std::is_void<element_type>::value, argument 42 A<int> a = std::pointer_traits<A<int> >::pointer_to(i); 46 (std::pointer_traits<A<void> >::element_type)0;
|
/external/libcxx/test/utilities/tuple/tuple.tuple/ |
H A D | MoveOnly.h | 37 namespace std { namespace 41 : public std::unary_function<MoveOnly, std::size_t> 43 std::size_t operator()(const MoveOnly& x) const {return x.get();}
|
/external/libcxx/test/utilities/utility/forward/ |
H A D | move_only.pass.cpp | 31 operator std::__rv<move_only> () {return std::__rv<move_only>(*this);} 32 move_only(std::__rv<move_only>) {} 47 test(std::move(mo));
|
H A D | move_only1.fail.cpp | 34 operator std::__rv<move_only> () {return std::__rv<move_only>(*this);} 35 move_only(std::__rv<move_only>) {}
|
H A D | move_only2.fail.cpp | 34 operator std::__rv<move_only> () {return std::__rv<move_only>(*this);} 35 move_only(std::__rv<move_only>) {}
|
H A D | move_only3.fail.cpp | 31 operator std::__rv<move_only> () {return std::__rv<move_only>(*this);} 32 move_only(std::__rv<move_only>) {} 48 test(std::move(ca));
|
H A D | move_only4.fail.cpp | 34 operator std::__rv<move_only> () {return std::__rv<move_only>(*this);} 35 move_only(std::__rv<move_only>) {}
|
/external/libcxxabi/src/ |
H A D | cxa_new_delete.cpp | 36 operator new(std::size_t size) 38 throw(std::bad_alloc) 44 while ((p = std::malloc(size)) == 0) 46 std::new_handler nh = std::get_new_handler(); 50 throw std::bad_alloc(); 59 http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2158.html 69 operator new(size_t size, const std::nothrow_t&) 96 throw(std::bad_alloc) 110 operator new[](size_t size, const std 198 namespace std namespace [all...] |
/external/llvm/include/llvm/Object/ |
H A D | Error.h | 22 const std::error_category &object_category(); 32 inline std::error_code make_error_code(object_error e) { 33 return std::error_code(static_cast<int>(e), object_category()); 40 namespace std { namespace 42 struct is_error_code_enum<llvm::object::object_error> : std::true_type {};
|
/external/llvm/tools/llvm-readobj/ |
H A D | Error.h | 20 const std::error_category &readobj_category(); 31 inline std::error_code make_error_code(readobj_error e) { 32 return std::error_code(static_cast<int>(e), readobj_category()); 37 namespace std { namespace 38 template <> struct is_error_code_enum<llvm::readobj_error> : std::true_type {};
|
/external/llvm/unittests/Support/ |
H A D | ScaledNumberTest.cpp | 23 ScaledPair(const std::pair<UIntT, int16_t> &F) : D(F.first), S(F.second) {} argument 31 bool operator==(const std::pair<UIntT, int16_t> &L, argument 36 void PrintTo(const ScaledPair<UIntT> &F, ::std::ostream *os) {
|