Searched defs:std (Results 101 - 125 of 431) sorted by relevance

1234567891011>>

/external/eigen/Eigen/src/StlSupport/
H A DStdDeque.h18 #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 DStdList.h17 #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 DStdVector.h18 * 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 Dsparse.h17 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/libbrillo/brillo/
H A Dvalue_conversion.h20 // 'std::string' it also provides conversion to/from std::vector<T> (which
21 // converts to Base::listValue) and std::map<std::string, T> (convertible to
46 inline bool FromValue(const base::Value& in_value, std::string* out_value) {
61 std::unique_ptr<base::ListValue>* out_value);
63 std::unique_ptr<base::DictionaryValue>* out_value);
67 std::map<std::string, T, Pred, Alloc>* out_value);
70 bool FromValue(const base::Value& in_value, std
119 ToValue(const std::vector<T, Alloc>& list) argument
128 ToValue( const std::map<std::string, T, Pred, Alloc>& dictionary) argument
[all...]
/external/libcxx/src/
H A Dexception.cpp39 static std::terminate_handler __terminate_handler;
40 static std::unexpected_handler __unexpected_handler;
43 namespace std namespace
140 return "std::exception";
153 return "std::bad_exception";
161 // it uses to implement std::exception_ptr (which it declares as an alias of
162 // std::__exception_ptr::exception_ptr) is not directly exported to clients. So
163 // we have little choice but to hijack std::__exception_ptr::exception_ptr's
164 // (which fortunately has the same layout as our std::exception_ptr) copy
166 // stable ABI), and its rethrow_exception(std
[all...]
H A Dnew.cpp34 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
164 namespace std namespace
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/
H A Dstable_partition.pass.cpp32 bool operator()(const std::pair<int,int>& p) const argument
41 typedef std::pair<int,int> P;
56 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first());
70 typedef std::pair<int,int> P;
85 Iter r = std::stable_partition(Iter(array), Iter(array+size), odd_first());
98 r = std::stable_partition(Iter(array), Iter(array), odd_first());
101 r = std::stable_partition(Iter(array), Iter(array+1), odd_first());
105 r = std::stable_partition(Iter(array+4), Iter(array+5), odd_first());
110 typedef std::pair<int,int> P;
125 Iter r = std
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/
H A Dstable_sort_comp.pass.cpp36 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/std/containers/
H A DEmplaceable.h41 namespace std { namespace
45 : public std::unary_function<Emplaceable, std::size_t>
47 std::size_t operator()(const Emplaceable& x) const {return x.get();}
/external/libcxx/test/std/containers/unord/unord.map/
H A Dcompare.pass.cpp27 namespace std namespace
39 typedef std::unordered_map<Key, int> MapT;
44 std::pair<Iter, bool> result = map.insert(std::make_pair(Key(0), 42));
/external/libcxx/test/std/language.support/support.dynamic/new.delete/new.delete.array/
H A Dsized_delete_array11.pass.cpp30 std::free(p);
33 void operator delete[](void* p, const std::nothrow_t&) throw() argument
36 std::free(p);
39 void operator delete[](void* p, std::size_t) throw()
42 std::free(p);
H A Dsized_delete_array14.pass.cpp35 std::free(p);
38 void operator delete[](void* p, const std::nothrow_t&) throw() argument
41 std::free(p);
44 void operator delete[](void* p, std::size_t) throw()
47 std::free(p);
H A Dsized_delete_array_calls_unsized_delete_array.pass.cpp27 std::free(p);
30 void operator delete[](void* p, const std::nothrow_t&) throw() argument
33 std::free(p);
H A Dsized_delete_array_fsizeddeallocation.sh.cpp43 std::free(p);
46 void operator delete[](void* p, const std::nothrow_t&) throw() argument
49 std::free(p);
52 void operator delete[](void* p, std::size_t) throw()
55 std::free(p);
/external/libcxx/test/std/utilities/memory/allocator.traits/allocator.traits.types/
H A Ddifference_type.pass.cpp46 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 Dsize_type.pass.cpp45 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/std/utilities/memory/pointer.traits/pointer.traits.functions/
H A Dpointer_to.pass.cpp33 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/std/utilities/utility/forward/
H A Dmove_only1.fail.cpp34 operator std::__rv<move_only> () {return std::__rv<move_only>(*this);}
35 move_only(std::__rv<move_only>) {}
H A Dmove_only2.fail.cpp34 operator std::__rv<move_only> () {return std::__rv<move_only>(*this);}
35 move_only(std::__rv<move_only>) {}
H A Dmove_only3.fail.cpp31 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 Dmove_only4.fail.cpp34 operator std::__rv<move_only> () {return std::__rv<move_only>(*this);}
35 move_only(std::__rv<move_only>) {}
/external/libcxx/test/support/
H A DMoveOnly.h37 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/libcxxabi/src/
H A Dcxa_new_delete.cpp36 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/tools/llvm-readobj/
H A DError.h20 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 {};

Completed in 696 milliseconds

1234567891011>>