Searched refs:value_type (Results 51 - 75 of 768) sorted by relevance

1234567891011>>

/external/libcxx/test/utilities/memory/allocator.traits/allocator.traits.types/
H A Dpropagate_on_container_swap.pass.cpp26 typedef T value_type; typedef in struct:A
33 typedef T value_type; typedef in struct:B
/external/chromium_org/chrome/test/mini_installer/
H A Dregistry_verifier.py25 def _ValueTypeConstant(self, value_type):
38 if value_type not in value_type_mapping:
39 raise KeyError("Unknown registry value type '%s'" % value_type)
40 return value_type_mapping[value_type]
89 data, value_type = _winreg.QueryValueEx(key_handle, value)
101 assert self._ValueTypeConstant(expected_value_type) == value_type, \
/external/libcxx/test/containers/associative/map/map.access/
H A Dsize.pass.cpp27 m.insert(M::value_type(2, 1.5));
29 m.insert(M::value_type(1, 1.5));
31 m.insert(M::value_type(3, 1.5));
45 m.insert(M::value_type(2, 1.5));
47 m.insert(M::value_type(1, 1.5));
49 m.insert(M::value_type(3, 1.5));
H A Dempty.pass.cpp27 m.insert(M::value_type(1, 1.5));
37 m.insert(M::value_type(1, 1.5));
/external/libcxx/test/containers/associative/multimap/
H A Dsize.pass.cpp27 m.insert(M::value_type(2, 1.5));
29 m.insert(M::value_type(1, 1.5));
31 m.insert(M::value_type(3, 1.5));
45 m.insert(M::value_type(2, 1.5));
47 m.insert(M::value_type(1, 1.5));
49 m.insert(M::value_type(3, 1.5));
H A Dempty.pass.cpp27 m.insert(M::value_type(1, 1.5));
37 m.insert(M::value_type(1, 1.5));
/external/libcxx/test/containers/associative/multiset/
H A Dsize.pass.cpp27 m.insert(M::value_type(2));
29 m.insert(M::value_type(1));
31 m.insert(M::value_type(2));
45 m.insert(M::value_type(2));
47 m.insert(M::value_type(1));
49 m.insert(M::value_type(2));
/external/libcxx/test/containers/associative/set/
H A Dsize.pass.cpp27 m.insert(M::value_type(2));
29 m.insert(M::value_type(1));
31 m.insert(M::value_type(3));
45 m.insert(M::value_type(2));
47 m.insert(M::value_type(1));
49 m.insert(M::value_type(3));
/external/libcxx/test/containers/
H A Dstack_allocator.h22 typedef T value_type; typedef in class:stack_allocator
23 typedef value_type* pointer;
24 typedef const value_type* const_pointer;
25 typedef value_type& reference;
26 typedef const value_type& const_reference;
41 if (n > N - (ptr_ - buf_) / sizeof(value_type)) {
/external/pdfium/core/src/fxge/agg/agg23/
H A Dagg_pixfmt_gray.h33 typedef typename color_type::value_type value_type; typedef in struct:agg::blender_gray
36 static AGG_INLINE void blend_pix(value_type* p, unsigned cv,
39 *p = (value_type)((((cv - calc_type(*p)) * alpha) + (calc_type(*p) << base_shift)) >> base_shift);
49 typedef typename color_type::value_type value_type; typedef in class:agg::pixel_formats_gray
57 static AGG_INLINE void copy_or_blend_pix(value_type* p,
70 static AGG_INLINE void copy_or_blend_pix(value_type* p,
95 value_type* p = (value_type*)m_rbu
[all...]
/external/chromium_org/third_party/libaddressinput/src/cpp/src/util/
H A Dlru_cache_using_std.h41 typedef V value_type; typedef in class:lru_cache_using_std
50 value_type,
58 value_type (*f)(const key_type&),
68 value_type operator()(const key_type& k) {
79 const value_type v=_fn(k);
116 void insert(const key_type& k,const value_type& v) {
158 value_type (*_fn)(const key_type&);
H A Dcctype_tolower_equal.cc28 : public std::binary_function<std::string::value_type,
29 std::string::value_type, bool> {
/external/eigen/Eigen/src/StlSupport/
H A DStdDeque.h38 typedef __VA_ARGS__ value_type; \
46 explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \
62 typedef T value_type; \
72 explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \
93 void resize(size_type new_size, const value_type& x)
100 void push_back(const value_type& x)
102 void push_front(const value_type& x)
105 iterator insert(const_iterator position, const value_type
[all...]
H A DStdVector.h30 typedef __VA_ARGS__ value_type; \
38 explicit vector(size_type num, const value_type& val = value_type()) : vector_base(num, val) {} \
51 typedef T value_type; \
61 explicit vector(size_type num, const value_type& val = value_type()) : vector_base(num, val) {} \
82 void resize(size_type new_size, const value_type& x)
89 void push_back(const value_type& x)
92 iterator insert(const_iterator position, const value_type& x)
94 void insert(const_iterator position, size_type new_size, const value_type
[all...]
/external/clang/include/clang/Serialization/
H A DContinuousRangeMap.h38 typedef std::pair<Int, V> value_type; typedef in class:clang::ContinuousRangeMap
39 typedef value_type &reference;
40 typedef const value_type &const_reference;
41 typedef value_type *pointer;
42 typedef const value_type *const_pointer;
45 typedef SmallVector<value_type, InitialCapacity> Representation;
64 void insert(const value_type &Val) {
73 void insertOrReplace(const value_type &Val) {
122 void insert(const value_type &Val) {
/external/libcxx/test/containers/sequences/deque/
H A Dtypes.pass.cpp18 // typedef T value_type;
46 static_assert((std::is_same<typename C::value_type, T>::value), "");
47 static_assert((std::is_same<typename C::value_type, typename Allocator::value_type>::value), "");
79 static_assert((std::is_same<C::value_type, short>::value), "");
80 static_assert((std::is_same<C::allocator_type, min_allocator<C::value_type> >::value), "");
81 static_assert((std::is_same<C::reference, C::value_type&>::value), "");
82 static_assert((std::is_same<C::const_reference, const C::value_type&>::value), "");
83 static_assert((std::is_same<C::pointer, min_pointer<C::value_type>>::value), "");
84 static_assert((std::is_same<C::const_pointer, min_pointer<const C::value_type>>
[all...]
/external/libcxx/test/support/
H A Dnasty_containers.hpp21 typedef typename nested_container::value_type value_type; typedef in class:nasty_vector
37 nasty_vector(size_type n, const value_type& value) : v_(n, value) {}
40 nasty_vector(std::initializer_list<value_type> il) : v_(il) {}
46 void assign(size_type n, const value_type& u) { v_.assign(n, u); }
48 void assign(std::initializer_list<value_type> il) { v_.assign(il); }
83 value_type* data() _NOEXCEPT { return v_.data(); }
84 const value_type* data() const _NOEXCEPT { return v_.data(); }
86 void push_back(const value_type& x) { v_.push_back(x); }
88 void push_back(value_type
142 typedef typename nested_container::value_type value_type; typedef in class:nasty_list
[all...]
/external/libcxx/test/iterators/predef.iterators/move.iterators/move.iterator/
H A Dtypes.pass.cpp22 // typedef Iter::value_type value_type;
23 // typedef value_type&& reference;
40 static_assert((std::is_same<typename R::value_type, typename T::value_type>::value), "");
42 static_assert((std::is_same<typename R::reference, typename R::value_type&&>::value), "");
/external/libcxx/test/strings/basic.string/string.ops/string.accessors/
H A Dc_str.pass.cpp24 const typename S::value_type* str = s.c_str();
28 assert(T::eq(str[s.size()], typename S::value_type()));
31 assert(T::eq(str[0], typename S::value_type()));
H A Ddata.pass.cpp24 const typename S::value_type* str = s.data();
28 assert(T::eq(str[s.size()], typename S::value_type()));
31 assert(T::eq(str[0], typename S::value_type()));
/external/libcxx/test/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/
H A Dlv_value.pass.cpp14 // requires CopyConstructible<Cont::value_type>
16 // operator=(const Cont::value_type& value);
26 typename C::value_type x1, typename C::value_type x2,
27 typename C::value_type x3, const C& c2)
39 typename C::value_type x1, typename C::value_type x2,
40 typename C::value_type x3)
/external/stlport/stlport/stl/pointers/
H A D_vector.h61 typedef _Tp value_type; typedef in class:vector
62 typedef value_type* pointer;
63 typedef const value_type* const_pointer;
64 typedef value_type* iterator;
65 typedef const value_type* const_iterator;
66 typedef value_type& reference;
67 typedef const value_type& const_reference;
73 _STLP_FORCE_ALLOCATORS(value_type, _Alloc)
74 typedef typename _Alloc_traits<value_type, _Alloc>::allocator_type allocator_type;
77 { return _STLP_CONVERT_ALLOCATOR(_M_impl.get_allocator(), value_type); }
[all...]
/external/libcxx/test/containers/associative/map/map.modifiers/
H A Dinsert_iter_cv.pass.cpp14 // iterator insert(const_iterator position, const value_type& v);
27 R r = m.insert(m.end(), M::value_type(2, 2.5));
33 r = m.insert(m.end(), M::value_type(1, 1.5));
39 r = m.insert(m.end(), M::value_type(3, 3.5));
45 r = m.insert(m.end(), M::value_type(3, 3.5));
56 R r = m.insert(m.end(), M::value_type(2, 2.5));
62 r = m.insert(m.end(), M::value_type(1, 1.5));
68 r = m.insert(m.end(), M::value_type(3, 3.5));
74 r = m.insert(m.end(), M::value_type(3, 3.5));
/external/libcxx/test/containers/associative/multimap/multimap.modifiers/
H A Dinsert_cv.pass.cpp14 // iterator insert(const value_type& v);
27 R r = m.insert(M::value_type(2, 2.5));
33 r = m.insert(M::value_type(1, 1.5));
39 r = m.insert(M::value_type(3, 3.5));
45 r = m.insert(M::value_type(3, 3.5));
56 R r = m.insert(M::value_type(2, 2.5));
62 r = m.insert(M::value_type(1, 1.5));
68 r = m.insert(M::value_type(3, 3.5));
74 r = m.insert(M::value_type(3, 3.5));
H A Dinsert_iter_cv.pass.cpp14 // iterator insert(const_iterator position, const value_type& v);
27 R r = m.insert(m.end(), M::value_type(2, 2.5));
33 r = m.insert(m.end(), M::value_type(1, 1.5));
39 r = m.insert(m.end(), M::value_type(3, 3.5));
45 r = m.insert(prev(m.end()), M::value_type(3, 4.5));
56 R r = m.insert(m.end(), M::value_type(2, 2.5));
62 r = m.insert(m.end(), M::value_type(1, 1.5));
68 r = m.insert(m.end(), M::value_type(3, 3.5));
74 r = m.insert(prev(m.end()), M::value_type(3, 4.5));

Completed in 619 milliseconds

1234567891011>>