Home
last modified time | relevance | path

Searched refs:Traits (Results 1 – 25 of 120) sorted by relevance

12345

/external/libcxx/test/libcxx/containers/unord/
Dkey_value_traits.pass.cpp21 typedef std::__hash_key_value_types<Tp> Traits; in testKeyValueTrait() typedef
22 static_assert((std::is_same<Traits::key_type, int>::value), ""); in testKeyValueTrait()
23 static_assert((std::is_same<Traits::__node_value_type, Tp>::value), ""); in testKeyValueTrait()
24 static_assert((std::is_same<Traits::__container_value_type, Tp>::value), ""); in testKeyValueTrait()
25 static_assert(Traits::__is_map == false, ""); in testKeyValueTrait()
29 typedef std::__hash_key_value_types<Tp> Traits; in testKeyValueTrait() typedef
30 static_assert((std::is_same<Traits::key_type, Tp>::value), ""); in testKeyValueTrait()
31 static_assert((std::is_same<Traits::__node_value_type, Tp>::value), ""); in testKeyValueTrait()
32 static_assert((std::is_same<Traits::__container_value_type, Tp>::value), ""); in testKeyValueTrait()
33 static_assert(Traits::__is_map == false, ""); in testKeyValueTrait()
[all …]
/external/libcxx/test/libcxx/containers/associative/
Dtree_key_value_traits.pass.cpp21 typedef std::__tree_key_value_types<Tp> Traits; in testKeyValueTrait() typedef
22 static_assert((std::is_same<Traits::key_type, int>::value), ""); in testKeyValueTrait()
23 static_assert((std::is_same<Traits::__node_value_type, Tp>::value), ""); in testKeyValueTrait()
24 static_assert((std::is_same<Traits::__container_value_type, Tp>::value), ""); in testKeyValueTrait()
25 static_assert(Traits::__is_map == false, ""); in testKeyValueTrait()
29 typedef std::__tree_key_value_types<Tp> Traits; in testKeyValueTrait() typedef
30 static_assert((std::is_same<Traits::key_type, Tp>::value), ""); in testKeyValueTrait()
31 static_assert((std::is_same<Traits::__node_value_type, Tp>::value), ""); in testKeyValueTrait()
32 static_assert((std::is_same<Traits::__container_value_type, Tp>::value), ""); in testKeyValueTrait()
33 static_assert(Traits::__is_map == false, ""); in testKeyValueTrait()
[all …]
/external/v8/include/
Dv8-util.h160 template <typename K, typename V, typename Traits>
168 size_t Size() { return Traits::Size(&impl_); }
173 bool IsWeak() { return Traits::kCallbackType != kNotWeak; }
179 return Local<V>::New(isolate_, FromVal(Traits::Get(&impl_, key)));
186 return Traits::Get(&impl_, key) != kPersistentContainerNotFound;
195 return SetReturnValueFromVal(&returnValue, Traits::Get(&impl_, key));
205 reinterpret_cast<internal::Object**>(FromVal(Traits::Get(&impl_, key))));
215 reinterpret_cast<internal::Object**>(FromVal(Traits::Get(&impl_, key))),
223 return Release(Traits::Remove(&impl_, key)).Pass();
231 typedef typename Traits::Iterator It;
[all …]
/external/skia/src/core/
DSkTTopoSort.h14 template <typename T, typename Traits = T>
17 SkASSERT(!Traits::IsTempMarked(graph[i])); in SkTTopoSort_CheckAllUnmarked()
18 SkASSERT(!Traits::WasOutput(graph[i])); in SkTTopoSort_CheckAllUnmarked()
22 template <typename T, typename Traits = T>
25 SkASSERT(!Traits::IsTempMarked(graph[i])); in SkTTopoSort_CleanExit()
26 SkASSERT(Traits::WasOutput(graph[i])); in SkTTopoSort_CleanExit()
33 template <typename T, typename Traits = T>
35 if (Traits::IsTempMarked(node)) { in SkTTopoSort_Visit()
42 if (!Traits::WasOutput(node)) { in SkTTopoSort_Visit()
45 Traits::SetTempMark(node); in SkTTopoSort_Visit()
[all …]
/external/libmojo/mojo/public/cpp/bindings/lib/
Dserialization_util.h34 typename Traits,
36 typename std::enable_if<HasIsNullMethod<Traits>::value>::type* = nullptr>
38 return Traits::IsNull(input); in CallIsNullIfExists()
42 typename Traits,
44 typename std::enable_if<!HasIsNullMethod<Traits>::value>::type* = nullptr>
61 typename Traits,
63 typename std::enable_if<HasSetToNullMethod<Traits>::value>::type* = nullptr>
65 Traits::SetToNull(output); in CallSetToNullIfExists()
69 template <typename Traits,
71 typename std::enable_if<!HasSetToNullMethod<Traits>::value>::type* =
[all …]
Dmap_serialization.h24 using Traits = MapTraits<UserType>; variable
26 decltype(Traits::GetBegin(std::declval<MaybeConstUserType&>()));
29 : input_(input), iter_(Traits::GetBegin(input_)) {} in MapReaderBase()
32 size_t GetSize() const { return Traits::GetSize(input_); } in GetSize()
48 using Traits = typename Base::Traits; variable
53 const typename Traits::Key& GetNext() { in GetNext()
54 const typename Traits::Key& key = Traits::GetKey(this->iter_); in GetNext()
55 Traits::AdvanceIterator(this->iter_); in GetNext()
65 using Traits = typename Base::Traits; variable
72 decltype(Traits::GetValue(std::declval<MaybeConstIterator&>()));
[all …]
Darray_serialization.h27 template <typename Traits,
30 HasGetBeginMethod<Traits, MaybeConstUserType>::value>
34 template <typename Traits, typename MaybeConstUserType>
35 class ArrayIterator<Traits, MaybeConstUserType, true> {
38 CallGetBeginIfExists<Traits>(std::declval<MaybeConstUserType&>()));
41 : input_(input), iter_(CallGetBeginIfExists<Traits>(input)) {} in ArrayIterator()
44 size_t GetSize() const { return Traits::GetSize(input_); } in GetSize()
47 decltype(Traits::GetValue(std::declval<IteratorType&>()));
49 auto& value = Traits::GetValue(iter_); in GetNext()
50 Traits::AdvanceIterator(iter_); in GetNext()
[all …]
Dstring_serialization.h23 using Traits = StringTraits<UserType>;
27 if (CallIsNullIfExists<Traits>(input))
30 void* custom_context = CustomContextHelper<Traits>::SetUp(input, context);
32 CallWithContext(Traits::GetSize, input, custom_context));
39 if (CallIsNullIfExists<Traits>(input)) {
44 void* custom_context = CustomContextHelper<Traits>::GetNext(context);
47 CallWithContext(Traits::GetSize, input, custom_context), buffer);
50 CallWithContext(Traits::GetData, input, custom_context),
51 CallWithContext(Traits::GetSize, input, custom_context));
55 CustomContextHelper<Traits>::TearDown(input, custom_context);
[all …]
/external/libcxx/test/std/input.output/iostream.format/quoted.manip/
Dquoted.pass.cpp23 template <class CharT, class Traits>
24 bool is_skipws ( const std::basic_istream<CharT, Traits>& is ) { in is_skipws()
28 template <class CharT, class Traits = std::char_traits<CharT>>
30 std::basic_string<CharT, Traits> str(p); in both_ways()
33 std::basic_stringstream<CharT, Traits> ss; in both_ways()
40 template <class CharT, class Traits = std::char_traits<CharT>>
42 std::basic_stringstream<CharT, Traits> ss; in round_trip()
46 std::basic_string<CharT, Traits> s; in round_trip()
53 template <class CharT, class Traits = std::char_traits<CharT>>
55 std::basic_stringstream<CharT, Traits> ss; in round_trip_ws()
[all …]
/external/libchrome/base/
Dscoped_generic.h54 template<typename T, typename Traits>
63 struct Data : public Traits {
65 Data(const T& in, const Traits& other) : Traits(other), generic(in) {} in Data()
71 typedef Traits traits_type;
85 ScopedGeneric(ScopedGeneric<T, Traits>&& rvalue) in ScopedGeneric()
94 ScopedGeneric& operator=(ScopedGeneric<T, Traits>&& rvalue) {
114 swap(static_cast<Traits&>(data_), static_cast<Traits&>(other.data_)); in swap()
140 Traits& get_traits() { return data_; } in get_traits()
141 const Traits& get_traits() const { return data_; } in get_traits()
164 template<class T, class Traits>
[all …]
Dlazy_instance.h125 template <typename Type, typename Traits = DefaultLazyInstanceTraits<Type> >
146 if (!Traits::kAllowedToAccessOnNonjoinableThread) in Pointer()
166 Traits::New(private_buf_.void_data())); in Pointer()
168 Traits::kRegisterOnExit ? OnExit : NULL); in Pointer()
201 LazyInstance<Type, Traits>* me = in OnExit()
202 reinterpret_cast<LazyInstance<Type, Traits>*>(lazy_instance); in OnExit()
203 Traits::Delete(me->instance()); in OnExit()
/external/libchrome/base/mac/
Dscoped_nsobject.h85 using Traits = internal::ScopedNSProtocolTraits<NST>;
89 NST object = Traits::InvalidValue(),
91 : ScopedTypeRef<NST, Traits>(object, policy) {}
93 explicit scoped_nsprotocol(NST object = Traits::InvalidValue())
94 : ScopedTypeRef<NST, Traits>(object, base::scoped_policy::RETAIN) {}
98 : ScopedTypeRef<NST, Traits>(that) {} in scoped_nsprotocol()
102 : ScopedTypeRef<NST, Traits>(that_as_subclass) {} in scoped_nsprotocol()
105 : ScopedTypeRef<NST, Traits>(that) {} in scoped_nsprotocol()
108 ScopedTypeRef<NST, Traits>::operator=(that);
113 void reset(NST object = Traits::InvalidValue(),
[all …]
Dscoped_typeref.h51 template<typename T, typename Traits = ScopedTypeRefTraits<T>>
57 __unsafe_unretained T object = Traits::InvalidValue(),
61 object_ = Traits::Retain(object_); in object_()
64 ScopedTypeRef(const ScopedTypeRef<T, Traits>& that) in ScopedTypeRef()
67 object_ = Traits::Retain(object_); in ScopedTypeRef()
75 object_ = Traits::Retain(object_); in ScopedTypeRef()
78 ScopedTypeRef(ScopedTypeRef<T, Traits>&& that) : object_(that.object_) { in ScopedTypeRef()
79 that.object_ = Traits::InvalidValue(); in ScopedTypeRef()
84 Traits::Release(object_); in ~ScopedTypeRef()
87 ScopedTypeRef& operator=(const ScopedTypeRef<T, Traits>& that) {
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DIntervalMap.h538 template <typename KeyT, typename ValT, unsigned N, typename Traits>
557 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) && in findFrom()
559 while (i != Size && Traits::stopLess(stop(i), x)) ++i; in findFrom()
572 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) && in safeFind()
574 while (Traits::stopLess(stop(i), x)) ++i; in safeFind()
586 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup()
601 template <typename KeyT, typename ValT, unsigned N, typename Traits>
602 unsigned LeafNode<KeyT, ValT, N, Traits>::
606 assert(!Traits::stopLess(b, a) && "Invalid interval"); in insertFrom()
609 assert((i == 0 || Traits::stopLess(stop(i - 1), a))); in insertFrom()
[all …]
/external/llvm/include/llvm/ADT/
DIntervalMap.h559 template <typename KeyT, typename ValT, unsigned N, typename Traits>
578 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) && in findFrom()
580 while (i != Size && Traits::stopLess(stop(i), x)) ++i; in findFrom()
593 assert((i == 0 || Traits::stopLess(stop(i - 1), x)) && in safeFind()
595 while (Traits::stopLess(stop(i), x)) ++i; in safeFind()
607 return Traits::startLess(x, start(i)) ? NotFound : value(i); in safeLookup()
622 template <typename KeyT, typename ValT, unsigned N, typename Traits>
623 unsigned LeafNode<KeyT, ValT, N, Traits>::
627 assert(!Traits::stopLess(b, a) && "Invalid interval"); in insertFrom()
630 assert((i == 0 || Traits::stopLess(stop(i - 1), a))); in insertFrom()
[all …]
/external/libcxx/test/std/experimental/filesystem/class.path/path.member/path.native.obs/
Dstring_alloc.pass.cpp55 using Traits = std::char_traits<CharT>; in doShortStringTest() typedef
56 using AStr = std::basic_string<CharT, Traits, MAlloc>; in doShortStringTest()
58 AStr s = p.string<CharT, Traits, MAlloc>(); in doShortStringTest()
65 using Traits = std::char_traits<CharT>; in doShortStringTest() typedef
66 using AStr = std::basic_string<CharT, Traits, MAlloc>; in doShortStringTest()
71 AStr s = p.string<CharT, Traits, MAlloc>(a); in doShortStringTest()
96 using Traits = std::char_traits<CharT>; in doLongStringTest() typedef
97 using AStr = std::basic_string<CharT, Traits, MAlloc>; in doLongStringTest()
99 AStr s = p.string<CharT, Traits, MAlloc>(); in doLongStringTest()
106 using Traits = std::char_traits<CharT>; in doLongStringTest() typedef
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h27 typedef SSAUpdaterTraits<UpdaterT> Traits; typedef
28 typedef typename Traits::BlkT BlkT;
29 typedef typename Traits::ValT ValT;
30 typedef typename Traits::PhiT PhiT;
76 ValT V = Traits::GetUndefVal(BB, Updater); in GetValue()
107 Traits::FindPredecessorBlocks(Info->BB, &Preds); in BuildBlockList()
174 for (typename Traits::BlkSucc_iterator SI = in BuildBlockList()
175 Traits::BlkSucc_begin(Info->BB), in BuildBlockList()
176 E = Traits::BlkSucc_end(Info->BB); SI != E; ++SI) { in BuildBlockList()
234 Pred->AvailableVal = Traits::GetUndefVal(Pred->BB, Updater); in FindDominators()
[all …]
/external/clang/unittests/AST/
DCommentParser.cpp42 Traits(Allocator, CommentOptions()) { in CommentParserTest()
51 CommandTraits Traits; member in clang::comments::__anonc019ce4f0111::CommentParserTest
61 Lexer L(Allocator, Diags, Traits, Begin, Source, Source + strlen(Source)); in parseString()
63 Sema S(Allocator, SourceMgr, Diags, Traits, /*PP=*/ nullptr); in parseString()
64 Parser P(L, S, Allocator, SourceMgr, Diags, Traits); in parseString()
69 FC->dump(llvm::errs(), &Traits, &SourceMgr); in parseString()
161 const CommandTraits &Traits, in HasBlockCommandAt() argument
170 StringRef ActualName = BCC->getCommandName(Traits); in HasBlockCommandAt()
183 const CommandTraits &Traits, in HasParamCommandAt() argument
195 StringRef ActualCommandName = PCC->getCommandName(Traits); in HasParamCommandAt()
[all …]
/external/eigen/Eigen/src/Core/products/
DGeneralBlockPanelKernel.h95 typedef gebp_traits<LhsScalar,RhsScalar> Traits; typedef
106 typedef typename Traits::ResScalar ResScalar;
108 kdiv = KcFactor * (Traits::mr * sizeof(LhsScalar) + Traits::nr * sizeof(RhsScalar)),
109 ksub = Traits::mr * Traits::nr * sizeof(ResScalar),
111 mr = Traits::mr,
112 nr = Traits::nr
163 typedef typename Traits::ResScalar ResScalar;
166 k_div = KcFactor * (Traits::mr * sizeof(LhsScalar) + Traits::nr * sizeof(RhsScalar)),
167 k_sub = Traits::mr * Traits::nr * sizeof(ResScalar)
211 if(remaining_l1 >= Index(Traits::nr*sizeof(RhsScalar))*k)
[all …]
DTriangularSolverMatrix.h61 typedef gebp_traits<Scalar,Scalar> Traits;
64 SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
78 …gebp_kernel<Scalar, Scalar, Index, OtherMapper, Traits::mr, Traits::nr, Conjugate, false> gebp_ker…
79 …gemm_pack_lhs<Scalar, Index, TriMapper, Traits::mr, Traits::LhsProgress, TriStorageOrder> pack_lhs;
80 gemm_pack_rhs<Scalar, Index, OtherMapper, Traits::nr, ColMajor, false, true> pack_rhs;
87 subcols = std::max<Index>((subcols/Traits::nr)*Traits::nr, Traits::nr);
212 typedef gebp_traits<Scalar,Scalar> Traits;
215 SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
229 …gebp_kernel<Scalar, Scalar, Index, LhsMapper, Traits::mr, Traits::nr, false, Conjugate> gebp_kerne…
230 gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs;
[all …]
DTriangularMatrixMatrix.h87 typedef gebp_traits<Scalar,Scalar> Traits;
89 SmallPanelWidth = 2 * EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
122 typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor> ResMapper;
147 …gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> …
148 …gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs;
149 gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr,RhsStorageOrder> pack_rhs;
219 … gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr,Traits::LhsProgress, LhsStorageOrder,false>()
237 typedef gebp_traits<Scalar,Scalar> Traits;
239 SmallPanelWidth = EIGEN_PLAIN_ENUM_MAX(Traits::mr,Traits::nr),
273 typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor> ResMapper;
[all …]
/external/libmojo/mojo/public/tools/bindings/generators/cpp_templates/
Dstruct_serialization_declaration.tmpl34 using Traits = StructTraits<{{mojom_type}}, UserType>;
38 if (CallIsNullIfExists<Traits>(input))
41 void* custom_context = CustomContextHelper<Traits>::SetUp(input, context);
45 struct, "CallWithContext(Traits::%s, input, custom_context)",
54 if (CallIsNullIfExists<Traits>(input)) {
59 void* custom_context = CustomContextHelper<Traits>::GetNext(context);
63 "CallWithContext(Traits::%s, input, custom_context)", "result",
67 CustomContextHelper<Traits>::TearDown(input, custom_context);
74 return CallSetToNullIfExists<Traits>(output);
77 return Traits::Read(data_view, output);
/external/llvm/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h38 typedef SSAUpdaterTraits<UpdaterT> Traits; typedef
39 typedef typename Traits::BlkT BlkT;
40 typedef typename Traits::ValT ValT;
41 typedef typename Traits::PhiT PhiT;
87 ValT V = Traits::GetUndefVal(BB, Updater); in GetValue()
118 Traits::FindPredecessorBlocks(Info->BB, &Preds); in BuildBlockList()
185 for (typename Traits::BlkSucc_iterator SI = in BuildBlockList()
186 Traits::BlkSucc_begin(Info->BB), in BuildBlockList()
187 E = Traits::BlkSucc_end(Info->BB); SI != E; ++SI) { in BuildBlockList()
245 Pred->AvailableVal = Traits::GetUndefVal(Pred->BB, Updater); in FindDominators()
[all …]
/external/libchrome/base/memory/
Dsingleton.h214 typename Traits = DefaultSingletonTraits<Type>,
232 if (!Traits::kAllowedToAccessOnNonjoinableThread) in get()
249 Type* newval = Traits::New(); in get()
255 if (newval != NULL && Traits::kRegisterAtExit) in get()
273 Traits::Delete(reinterpret_cast<Type*>(subtle::NoBarrier_Load(&instance_))); in OnExit()
279 template <typename Type, typename Traits, typename DifferentiatingType>
280 subtle::AtomicWord Singleton<Type, Traits, DifferentiatingType>::instance_ = 0;
/external/libcxx/test/std/experimental/filesystem/class.path/path.itr/
Diterator.pass.cpp41 using Traits = std::iterator_traits<It>; in checkIteratorConcepts() typedef
42 ASSERT_SAME_TYPE(Traits::iterator_category, std::bidirectional_iterator_tag); in checkIteratorConcepts()
43 ASSERT_SAME_TYPE(Traits::value_type, path); in checkIteratorConcepts()
44 ASSERT_SAME_TYPE(Traits::pointer, path const*); in checkIteratorConcepts()
45 ASSERT_SAME_TYPE(Traits::reference, path const&); in checkIteratorConcepts()
52 ASSERT_SAME_TYPE(Traits::reference, decltype(*it)); in checkIteratorConcepts()
53 ASSERT_SAME_TYPE(Traits::pointer, decltype(it.operator->())); in checkIteratorConcepts()

12345