Searched refs:_Value (Results 1 - 11 of 11) sorted by relevance

/external/clang/test/SemaCXX/
H A Dlibstdcxx_map_base_hack.cpp10 template<typename _Key, typename _Value, typename _Ex, bool __unique,
/external/stlport/stlport/stl/
H A D_unordered_set.h34 template <class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn,hash<_Value>),
35 _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to<_Value>),
36 _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Value>) >
39 : public __stlport_class<unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> >
42 typedef unordered_set<_Value, _HashFcn, _EqualKey, _Alloc> _Self;
44 typedef _STLP_PRIV _UnorderedSetTraitsT<_Value> _UnorderedSetTraits;
46 typedef hashtable<_Value, _Value, _HashFcn,
47 _UnorderedSetTraits, _STLP_PRIV _Identity<_Value>, _EqualKe
[all...]
H A D_hash_set.h42 template <class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn,hash<_Value>),
43 _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to<_Value>),
44 _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Value>) >
47 : public __stlport_class<hash_set<_Value, _HashFcn, _EqualKey, _Alloc> >
50 typedef hash_set<_Value, _HashFcn, _EqualKey, _Alloc> _Self;
52 typedef _STLP_PRIV _HashSetTraitsT<_Value> _HashSetTraits;
54 typedef hashtable<_Value, _Value, _HashFcn,
55 _HashSetTraits, _STLP_PRIV _Identity<_Value>, _EqualKe
[all...]
H A D_tree.h104 template <class _Value>
106 _Value _M_value_field;
145 template <class _Value, class _Traits>
147 typedef _Value value_type;
150 typedef _Rb_tree_iterator<_Value, _Traits> _Self;
152 typedef _Rb_tree_node<_Value>* _Link_type;
155 typedef _Rb_tree_iterator<_Value, _NonConstTraits> iterator;
157 typedef _Rb_tree_iterator<_Value, _ConstTraits> const_iterator;
206 template <class _Value, class _Traits>
207 struct __type_traits<_STLP_PRIV _Rb_tree_iterator<_Value, _Trait
[all...]
H A D_tree.c45 # define __iterator__ _Rb_tree_iterator<_Value, _STLP_HEADER_TYPENAME _Traits::_NonConstTraits>
49 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc>::iterator
50 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc>::size_type
319 class _Value, class _KeyOfValue, class _Traits, class _Alloc> variable
320 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>& variable
321 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::operator=( variable
322 const _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>& __x) {
348 class _Value, class _KeyOfValue, class _Traits, class _Alloc> variable
350 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent, variable
351 const _Value
385 class _Value, class _KeyOfValue, class _Traits, class _Alloc> variable
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) { variable
403 class _Value, class _KeyOfValue, class _Traits, class _Alloc> variable
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { variable
430 class _Value, class _KeyOfValue, class _Traits, class _Alloc> variable
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, variable
537 class _Value, class _KeyOfValue, class _Traits, class _Alloc> variable
539 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(iterator __position, variable
622 class _Value, class _KeyOfValue, class _Traits, class _Alloc> variable
624 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_copy(_Rb_tree_node_base* __x, variable
653 class _Value, class _KeyOfValue, class _Traits, class _Alloc> variable
655 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>::_M_erase(_Rb_tree_node_base *__x) { variable
681 class _Value, class _KeyOfValue, class _Traits, class _Alloc> variable
682 bool _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc>::__rb_verify() const { variable
[all...]
H A D_alloc.h471 template <class _Value, class _Tp, class _MaybeReboundAlloc>
476 typedef _STLP_alloc_proxy<_Value, _Tp, _MaybeReboundAlloc> _Self;
478 _Value _M_data;
480 _STLP_alloc_proxy (const _MaybeReboundAlloc& __a, _Value __p) :
H A D_algobase.h99 template <class _ForwardIter1, class _ForwardIter2, class _Value>
100 inline void __iter_swap_aux_aux(_ForwardIter1& __i1, _ForwardIter2& __i2, _Value *) {
101 _Value tmp = *__i1;
/external/llvm/unittests/ADT/
H A DilistTest.cpp23 Node(int _Value) : Value(_Value) {} argument
/external/stlport/stlport/stl/debug/
H A D_tree.h73 #define _STLP_NON_DBG_TREE _STLP_PRIV _STLP_NON_DBG_NAME(Rb_tree) <_Key, _STLP_PRIV _DbgCompare<_Key, _Compare>, _Value, _KeyOfValue, _Traits, _Alloc>
78 class _Value, class _KeyOfValue, class _Traits, class _Alloc >
79 inline _Value*
81 { return (_Value*)0; }
83 class _Value, class _KeyOfValue, class _Traits, class _Alloc >
91 class _Value, class _KeyOfValue, class _Traits,
92 _STLP_DFL_TMPL_PARAM(_Alloc, allocator<_Value>) >
95 typedef _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc> _Self;
/external/llvm/include/llvm/MC/
H A DMCAssembler.h249 MCAlignFragment(unsigned _Alignment, int64_t _Value, unsigned _ValueSize, argument
252 Value(_Value),ValueSize(_ValueSize),
291 MCFillFragment(int64_t _Value, unsigned _ValueSize, uint64_t _Size, argument
294 Value(_Value), ValueSize(_ValueSize), Size(_Size) {
326 MCOrgFragment(const MCExpr &_Offset, int8_t _Value, MCSectionData *SD = 0) argument
328 Offset(&_Offset), Value(_Value) {}
H A DMCExpr.h115 explicit MCConstantExpr(int64_t _Value) argument
116 : MCExpr(MCExpr::Constant), Value(_Value) {}

Completed in 223 milliseconds