Searched defs:std (Results 226 - 250 of 518) sorted by relevance

1234567891011>>

/external/clang/test/SemaCXX/
H A Dvararg-non-pod.cpp94 namespace std { namespace
/external/clang/test/SemaTemplate/
H A Dinstantiate-static-var.cpp56 namespace std { namespace
H A Doverload-candidates.cpp83 namespace std { namespace
94 struct a_trait : std::false_type {};
97 typename Requires = typename std::enable_if<a_trait<T>::value>::type> // expected-warning {{C++11 extension}}
104 struct some_trait : std::false_type {};
108 struct a_pony : std::enable_if<some_trait<T>::value> {};
119 using unicorns = typename std::enable_if<some_trait<T>::value>::type; // expected-warning {{C++11 extension}}
H A Dvirtual-member-functions.cpp58 namespace std { namespace
/external/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_allocator_testlib.cc151 namespace std { namespace
157 void *operator new(size_t size, std::nothrow_t const&) ALIAS("malloc");
158 void *operator new[](size_t size, std::nothrow_t const&) ALIAS("malloc");
161 void operator delete(void *ptr, std::nothrow_t const&) ALIAS("free");
162 void operator delete[](void *ptr, std::nothrow_t const&) ALIAS("free");
/external/conscrypt/src/compat/native/
H A DUniquePtr.h22 // This is a fake declaration of std::swap to avoid including <algorithm>
23 namespace std { namespace
47 // Equivalent to C++0x's std::unique_ptr (a combination of boost::scoped_ptr
90 std::swap(mPtr, other.mPtr);
106 // Partial specialization for array types. Like std::unique_ptr, this removes
/external/icu/icu4c/source/i18n/
H A Dwintzimpl.cpp41 AnnualTimeZoneRule *std = NULL, *dst = NULL; local
43 btz->getSimpleRulesNear(uprv_getUTCtime(), initial, std, dst, status); local
45 if (std == NULL || dst == NULL) {
55 U_ASSERT(std->getRule()->getDateRuleType() == DateTimeRule::DOW);
58 bias = -1 * (std->getRawOffset()/60000);
64 standardDate.wMonth = std->getRule()->getRuleMonth() + 1;
65 standardDate.wDay = std->getRule()->getRuleWeekInMonth();
69 standardDate.wDayOfWeek = std->getRule()->getRuleDayOfWeek() - 1;
71 mil = std->getRule()->getRuleMillisInDay();
110 delete std;
[all...]
/external/libopus/src/
H A Danalysis.h55 float std[9]; member in struct:__anon24568
/external/llvm/include/llvm/ADT/
H A DArrayRef.h37 typedef std::reverse_iterator<iterator> reverse_iterator;
76 /// Construct an ArrayRef from a std::vector.
78 /*implicit*/ ArrayRef(const std::vector<T, A> &Vec) argument
87 /// Construct an ArrayRef from a std::initializer_list.
88 /*implicit*/ ArrayRef(const std::initializer_list<T> &Vec)
126 std::copy(begin(), end(), Buff);
134 return std::equal(begin(), end(), RHS.begin());
167 std::vector<T> vec() const {
168 return std::vector<T>(Data, Data+Length);
174 operator std
[all...]
H A DMapVector.h13 // a std::vector.
26 /// in a deterministic order. The values are kept in a std::vector and the
30 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
65 std::pair<KeyT, ValueT> &front() { return Vector.front(); }
66 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
67 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
68 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
76 std::pair<KeyT, unsigned> Pair = std
91 insert(const std::pair<KeyT, ValueT> &KV) argument
[all...]
H A Diterator.h36 typename DifferenceTypeT = std::ptrdiff_t, typename PointerT = T *,
39 : public std::iterator<IteratorCategoryT, T, DifferenceTypeT, PointerT,
44 std::is_base_of<std::random_access_iterator_tag, IteratorCategoryT>::value,
46 std::is_base_of<std::bidirectional_iterator_tag, IteratorCategoryT>::value,
138 typename std::iterator_traits<WrappedIteratorT>::iterator_category,
139 typename T = typename std::iterator_traits<WrappedIteratorT>::value_type,
141 typename std::iterator_traits<WrappedIteratorT>::difference_type,
144 typename WrappedTraitsT = std
156 iterator_adaptor_base( U &&u, typename std::enable_if< !std::is_base_of<typename std::remove_cv< typename std::remove_reference<U>::type>::type, DerivedT>::value, int>::type = 0) argument
[all...]
/external/stlport/src/
H A Ddll_main.cpp252 # undef std macro
254 namespace std namespace
/external/stlport/test/unit/
H A Ddeque_test.cpp14 using namespace std;
245 namespace std { namespace
H A Dmvctor_declaration_test.cpp28 using namespace std;
30 using namespace std::tr1;
39 # define __true_type std::__true_type
40 # define __false_type std::__false_type
76 namespace std { namespace
/external/webrtc/src/system_wrappers/interface/
H A Dscoped_ptr.h15 // use shared_ptr or std::auto_ptr if your needs are more complex.
31 #include <cstddef> // for std::ptrdiff_t
34 namespace std { using ::ptrdiff_t; }; namespace
119 // reset(). Use shared_array or std::vector if your needs are more complex.
152 T& operator[](std::ptrdiff_t i) const {
/external/chromium_org/third_party/mesa/src/src/gtest/include/gtest/internal/
H A Dgtest-param-util-generated.h2839 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
2841 typedef ::std::tr1::tuple<T1, T2> ParamType;
2893 << "from different generators." << std::endl;
2954 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
2956 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
3016 << "from different generators." << std::endl;
3086 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3088 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3157 << "from different generators." << std::endl;
3237 : public ParamGeneratorInterface< ::std
[all...]
/external/gtest/include/gtest/internal/
H A Dgtest-param-util-generated.h3160 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
3162 typedef ::std::tr1::tuple<T1, T2> ParamType;
3214 << "from different generators." << std::endl;
3275 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
3277 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
3337 << "from different generators." << std::endl;
3407 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3409 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3478 << "from different generators." << std::endl;
3558 : public ParamGeneratorInterface< ::std
[all...]
/external/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-param-util-generated.h2839 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
2841 typedef ::std::tr1::tuple<T1, T2> ParamType;
2893 << "from different generators." << std::endl;
2954 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
2956 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
3016 << "from different generators." << std::endl;
3086 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3088 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3157 << "from different generators." << std::endl;
3237 : public ParamGeneratorInterface< ::std
[all...]
/external/mesa3d/src/gtest/include/gtest/internal/
H A Dgtest-param-util-generated.h2839 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
2841 typedef ::std::tr1::tuple<T1, T2> ParamType;
2893 << "from different generators." << std::endl;
2954 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
2956 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
3016 << "from different generators." << std::endl;
3086 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3088 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3157 << "from different generators." << std::endl;
3237 : public ParamGeneratorInterface< ::std
[all...]
/external/protobuf/gtest/include/gtest/internal/
H A Dgtest-param-util-generated.h2820 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2> > {
2822 typedef ::std::tr1::tuple<T1, T2> ParamType;
2874 << "from different generators." << std::endl;
2935 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3> > {
2937 typedef ::std::tr1::tuple<T1, T2, T3> ParamType;
2997 << "from different generators." << std::endl;
3067 : public ParamGeneratorInterface< ::std::tr1::tuple<T1, T2, T3, T4> > {
3069 typedef ::std::tr1::tuple<T1, T2, T3, T4> ParamType;
3138 << "from different generators." << std::endl;
3218 : public ParamGeneratorInterface< ::std
[all...]
/external/llvm/include/llvm/IR/
H A DValueMap.h89 typedef std::pair<KeyT, ValueT> value_type;
136 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { argument
137 std::pair<typename MapT::iterator, bool> map_result=
138 Map.insert(std::make_pair(Wrap(KV.first), KV.second));
139 return std::make_pair(iterator(map_result.first), map_result.second);
204 typedef typename std::remove_pointer<KeyT>::type KeySansPointerT;
245 Copy.Map->insert(std::make_pair(typed_new_key, Target));
281 public std::iterator<std
[all...]
/external/chromium_org/base/synchronization/
H A Dwaitable_event_posix.cc225 cmp_fst_addr(const std::pair<WaitableEvent*, unsigned> &a, argument
226 const std::pair<WaitableEvent*, unsigned> &b) {
239 std::vector<std::pair<WaitableEvent*, size_t> > waitables;
242 waitables.push_back(std::make_pair(raw_waitables[i], i));
322 (std::pair<WaitableEvent*, size_t>* waitables,
366 for (std::list<Waiter*>::iterator
404 for (std::list<Waiter*>::iterator
/external/chromium_org/cc/base/
H A Dtiling_data_unittest.cc1041 std::vector<std::pair<int, int> > original_expected;
1052 original_expected.push_back(std::make_pair(x, y));
1061 std::vector<std::pair<int, int> > expected = original_expected;
1081 std::vector<std::pair<int, int> > expected = original_expected;
1247 std::vector<std::pair<int, int> > expected;
1252 expected.push_back(std
1371 TestSpiralIterate(int source_line_number, const TilingData& tiling_data, const gfx::Rect& consider, const gfx::Rect& ignore, const gfx::Rect& center, const std::vector<std::pair<int, int> >& expected) argument
[all...]
/external/chromium_org/chrome/browser/chromeos/policy/
H A Denterprise_install_attributes.cc25 bool ReadMapKey(const std::map<std::string, std::string>& map, argument
26 const std::string& key,
27 std::string* value) {
28 std::map<std::string, std::string>::const_iterator entry = map.find(key);
39 std::string
41 const std
356 DecodeInstallAttributes( const std::map<std::string, std::string>& attr_map) argument
[all...]
/external/chromium_org/chrome/browser/chromeos/
H A Dsession_length_limiter_unittest.cc67 const std::pair<base::TimeTicks, base::Closure>& first_task,
68 const std::pair<base::TimeTicks, base::Closure>& second_task) const;
74 std::priority_queue<std::pair<base::TimeTicks, base::Closure>,
75 std::vector<std::pair<base::TimeTicks, base::Closure> >,
142 tasks_.push(std::pair<base::TimeTicks, base::Closure>(now_ + delay, task));
180 const std::pair<base::TimeTicks, base::Closure>& first_task,
181 const std::pair<base::TimeTicks, base::Closure>& second_task) const {
179 operator ()( const std::pair<base::TimeTicks, base::Closure>& first_task, const std::pair<base::TimeTicks, base::Closure>& second_task) const argument

Completed in 2675 milliseconds

1234567891011>>