Home
last modified time | relevance | path

Searched refs:value_compare (Results 1 – 19 of 19) sorted by relevance

/external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons.alloc/
Dctor_alloc.pass.cpp26 typedef typename base::value_compare value_compare; typedef
29 test(const value_compare& comp, const test_allocator<int>& a) in test()
31 test(const value_compare& comp, const container_type& c, in test()
34 test(const value_compare& comp, container_type&& c, in test()
Dctor_comp_alloc.pass.cpp26 typedef typename base::value_compare value_compare; typedef
29 test(const value_compare& comp, const test_allocator<int>& a) in test()
31 test(const value_compare& comp, const container_type& c, in test()
34 test(const value_compare& comp, container_type&& c, in test()
Dctor_comp_cont_alloc.pass.cpp37 typedef typename base::value_compare value_compare; typedef
40 test(const value_compare& comp, const test_allocator<int>& a) in test()
42 test(const value_compare& comp, const container_type& c, in test()
45 test(const value_compare& comp, container_type&& c, in test()
Dctor_comp_rcont_alloc.pass.cpp37 typedef typename base::value_compare value_compare; typedef
40 test(const value_compare& comp, const test_allocator<int>& a) in test()
42 test(const value_compare& comp, const container_type& c, in test()
45 test(const value_compare& comp, container_type&& c, in test()
Dctor_move_alloc.pass.cpp40 typedef typename base::value_compare value_compare; typedef
43 test(const value_compare& comp, const test_allocator<int>& a) in test()
45 test(const value_compare& comp, const container_type& c, in test()
47 test(const value_compare& comp, container_type&& c, in test()
Dctor_copy_alloc.pass.cpp36 typedef typename base::value_compare value_compare; typedef
39 test(const value_compare& comp, const test_allocator<int>& a) in test()
41 test(const value_compare& comp, const container_type& c, in test()
/external/libcxx/include/
Dset30 typedef key_compare value_compare;
50 explicit set(const value_compare& comp);
51 set(const value_compare& comp, const allocator_type& a);
54 const value_compare& comp = value_compare());
56 set(InputIterator first, InputIterator last, const value_compare& comp,
66 set(initializer_list<value_type> il, const value_compare& comp = value_compare());
67 set(initializer_list<value_type> il, const value_compare& comp,
132 value_compare value_comp() const;
211 typedef key_compare value_compare;
231 explicit multiset(const value_compare& comp);
[all …]
Dqueue390 typedef _Compare value_compare;
398 value_compare comp;
404 is_nothrow_default_constructible<value_compare>::value)
414 is_nothrow_move_constructible<value_compare>::value)
426 is_nothrow_move_assignable<value_compare>::value)
431 explicit priority_queue(const value_compare& __comp)
433 priority_queue(const value_compare& __comp, const container_type& __c);
435 explicit priority_queue(const value_compare& __comp, container_type&& __c);
439 const value_compare& __comp = value_compare());
442 const value_compare& __comp, const container_type& __c);
[all …]
D__tree785 typedef _Compare value_compare;
828 __compressed_pair<size_type, value_compare> __pair3_;
868 value_compare& value_comp() _NOEXCEPT {return __pair3_.second();}
870 const value_compare& value_comp() const _NOEXCEPT
883 explicit __tree(const value_compare& __comp)
886 is_nothrow_copy_constructible<value_compare>::value);
888 __tree(const value_compare& __comp, const allocator_type& __a);
899 is_nothrow_move_constructible<value_compare>::value);
904 is_nothrow_move_assignable<value_compare>::value &&
927 __is_nothrow_swappable<value_compare>::value &&
[all …]
Dmap44 class value_compare
51 value_compare(key_compare c);
152 value_compare value_comp() const;
246 class value_compare
252 value_compare(key_compare c);
346 value_compare value_comp() const;
796 class _LIBCPP_TYPE_VIS_ONLY value_compare
803 _LIBCPP_INLINE_VISIBILITY value_compare(key_compare c) : comp(c) {}
1020 value_compare value_comp() const {return value_compare(__tree_.value_comp().key_comp());}
1536 class _LIBCPP_TYPE_VIS_ONLY value_compare
[all …]
/external/stlport/stlport/stl/
D_map.h60 class value_compare in _STLP_CREATE_ITERATOR_TRAITS()
66 value_compare(_Compare __c) : comp(__c) {} in _STLP_CREATE_ITERATOR_TRAITS()
160 value_compare value_comp() const { return value_compare(_M_t.key_comp()); } in _STLP_CREATE_ITERATOR_TRAITS()
253 class value_compare : public binary_function<value_type, value_type, bool> { in _STLP_CREATE_ITERATOR_TRAITS()
258 value_compare(_Compare __c) : comp(__c) {} in _STLP_CREATE_ITERATOR_TRAITS()
346 value_compare value_comp() const { return value_compare(_M_t.key_comp()); } in _STLP_CREATE_ITERATOR_TRAITS()
D_set.h57 typedef _Compare value_compare; in _STLP_CREATE_ITERATOR_TRAITS() typedef
148 value_compare value_comp() const { return _M_t.key_comp(); } in _STLP_CREATE_ITERATOR_TRAITS()
228 typedef _Compare value_compare; in _STLP_CREATE_ITERATOR_TRAITS() typedef
319 value_compare value_comp() const { return _M_t.key_comp(); } in _STLP_CREATE_ITERATOR_TRAITS()
/external/libcxx/test/containers/associative/set/
Dtypes.pass.cpp43 static_assert((std::is_same<std::set<int>::value_compare, std::less<int> >::value), ""); in main()
57 …static_assert((std::is_same<std::set<int, std::less<int>, min_allocator<int>>::value_compare, std:… in main()
/external/libcxx/test/containers/associative/multiset/
Dtypes.pass.cpp43 static_assert((std::is_same<std::multiset<int>::value_compare, std::less<int> >::value), ""); in main()
57 …(std::is_same<std::multiset<int, std::less<int>, min_allocator<int>>::value_compare, std::less<int… in main()
/external/chromium_org/third_party/cython/src/Cython/Includes/libcpp/
Dunordered_set.pxd60 #value_compare value_comp()
Dset.pxd60 #value_compare value_comp()
Dunordered_map.pxd62 #value_compare value_comp()
Dmap.pxd62 #value_compare value_comp()
/external/stlport/stlport/stl/pointers/
D_set.h78 typedef _Compare value_compare;
207 value_compare value_comp() const { return _M_t.key_comp(); }
326 typedef _Compare value_compare;
460 value_compare value_comp() const { return _M_t.key_comp(); }