| /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
| multiseq_selection.h | 285 _SeqNumber __source = __pq.top().second;
288 __a[__source]
289 = std::min(__a[__source] + __n + 1, __ns[__source]);
290 __b[__source] += __n + 1;
292 if (__b[__source] < __ns[__source])
294 std::make_pair(__S(__source)[__b[__source]], __source));
[all...] |
| losertree.h | 63 /** @brief __index of the __source __sequence. */
129 * @param __source __index of the __source __sequence
134 __insert_start(const _Tp& __key, int __source, bool __sup)
136 unsigned int __pos = _M_k + __source;
149 _M_losers[__pos]._M_source = __source;
230 int __source = _M_losers[0]._M_source; local
231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0;
236 || _M_losers[__pos]._M_source < __source))
240 && _M_losers[__pos]._M_source < __source))))
332 int __source = _M_losers[0]._M_source; local
460 int __source = _M_losers[0]._M_source; local
542 int __source = _M_losers[0]._M_source; local
708 int __source = _M_losers[0]._M_source; local
803 int __source = _M_losers[0]._M_source; local
951 int __source = _M_losers[0]._M_source; local
1044 int __source = _M_losers[0]._M_source; local
[all...] |
| multiway_merge.h | 531 _SeqNumber __source; local
536 __source = __lt.__get_min_source();
538 *(__target++) = *(__seqs_begin[__source].first++);
541 if (__seqs_begin[__source].first == __seqs_begin[__source].second)
544 // Replace from same __source.
545 __lt.__delete_min_insert(*__seqs_begin[__source].first, false);
609 _SeqNumber __source; local
619 __source = __lt.__get_min_source();
622 _GLIBCXX_PARALLEL_ASSERT(0 <= __source && __source < __k)
[all...] |
| random_shuffle.h | 58 /** @brief Begin iterator of the __source. */
83 _DRandomShufflingGlobalData(_RAIter& __source)
84 : _M_source(__source) { }
202 _RAIter __source = __sd->_M_source; local
213 _ValueType(*(__source + __i + __start));
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
| multiseq_selection.h | 285 _SeqNumber __source = __pq.top().second;
288 __a[__source]
289 = std::min(__a[__source] + __n + 1, __ns[__source]);
290 __b[__source] += __n + 1;
292 if (__b[__source] < __ns[__source])
294 std::make_pair(__S(__source)[__b[__source]], __source));
[all...] |
| losertree.h | 63 /** @brief __index of the __source __sequence. */
129 * @param __source __index of the __source __sequence
134 __insert_start(const _Tp& __key, int __source, bool __sup)
136 unsigned int __pos = _M_k + __source;
149 _M_losers[__pos]._M_source = __source;
230 int __source = _M_losers[0]._M_source; local
231 for (unsigned int __pos = (_M_k + __source) / 2; __pos > 0;
236 || _M_losers[__pos]._M_source < __source))
240 && _M_losers[__pos]._M_source < __source))))
332 int __source = _M_losers[0]._M_source; local
460 int __source = _M_losers[0]._M_source; local
542 int __source = _M_losers[0]._M_source; local
708 int __source = _M_losers[0]._M_source; local
803 int __source = _M_losers[0]._M_source; local
951 int __source = _M_losers[0]._M_source; local
1044 int __source = _M_losers[0]._M_source; local
[all...] |
| multiway_merge.h | 531 _SeqNumber __source; local
536 __source = __lt.__get_min_source();
538 *(__target++) = *(__seqs_begin[__source].first++);
541 if (__seqs_begin[__source].first == __seqs_begin[__source].second)
544 // Replace from same __source.
545 __lt.__delete_min_insert(*__seqs_begin[__source].first, false);
609 _SeqNumber __source; local
619 __source = __lt.__get_min_source();
622 _GLIBCXX_PARALLEL_ASSERT(0 <= __source && __source < __k)
[all...] |
| random_shuffle.h | 58 /** @brief Begin iterator of the __source. */
83 _DRandomShufflingGlobalData(_RAIter& __source)
84 : _M_source(__source) { }
202 _RAIter __source = __sd->_M_source; local
213 _ValueType(*(__source + __i + __start));
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/experimental/bits/ |
| fs_path.h | 219 path(string_type&& __source);
223 path(_Source const& __source)
224 : _M_pathname(_S_convert(__detail::_S_range_begin(__source),
225 __detail::_S_range_end(__source)))
237 path(_Source const& __source, const locale& __loc)
238 : _M_pathname(_S_convert_loc(__detail::_S_range_begin(__source),
239 __detail::_S_range_end(__source), __loc))
255 path& operator=(string_type&& __source);
256 path& assign(string_type&& __source);
260 operator=(_Source const& __source)
[all...] |
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/experimental/bits/ |
| fs_path.h | 219 path(string_type&& __source);
223 path(_Source const& __source)
224 : _M_pathname(_S_convert(__detail::_S_range_begin(__source),
225 __detail::_S_range_end(__source)))
237 path(_Source const& __source, const locale& __loc)
238 : _M_pathname(_S_convert_loc(__detail::_S_range_begin(__source),
239 __detail::_S_range_end(__source), __loc))
255 path& operator=(string_type&& __source);
256 path& assign(string_type&& __source);
260 operator=(_Source const& __source)
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| fs_path.h | 183 __effective_range(const basic_string<_CharT, _Traits, _Alloc>& __source)
185 { return __source; }
189 __effective_range(const basic_string_view<_CharT, _Traits>& __source)
191 { return __source; }
196 __effective_range(const _Source& __source)
199 using _Iter = decltype(std::__niter_base(__source));
203 return basic_string_view<value_type>{&*__source};
209 _Source __it = __source;
324 path(string_type&& __source, format = auto_format)
325 : _M_pathname(std::move(__source))
[all...] |
| std_function.h | 134 _M_get_pointer(const _Any_data& __source) noexcept
138 const _Functor& __f = __source._M_access<_Functor>();
142 return __source._M_access<_Functor*>();
180 _M_manager(_Any_data& __dest, const _Any_data& __source,
194 __dest._M_access<_Functor*>() = _M_get_pointer(__source);
199 *const_cast<const _Functor*>(_M_get_pointer(__source)));
267 _M_manager(_Any_data& __dest, const _Any_data& __source,
278 __dest._M_access<_Functor*>() = _Base::_M_get_pointer(__source);
282 _Base::_M_manager(__dest, __source, __op);
|
| stl_multiset.h | 598 merge(multiset<_Key, _Compare1, _Alloc>& __source)
601 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
606 merge(multiset<_Key, _Compare1, _Alloc>&& __source)
607 { merge(__source); }
611 merge(set<_Key, _Compare1, _Alloc>& __source)
614 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
619 merge(set<_Key, _Compare1, _Alloc>&& __source)
620 { merge(__source); }
|
| unordered_set.h | 603 merge(unordered_set<_Value, _H2, _P2, _Alloc>& __source)
606 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
611 merge(unordered_set<_Value, _H2, _P2, _Alloc>&& __source)
612 { merge(__source); }
616 merge(unordered_multiset<_Value, _H2, _P2, _Alloc>& __source)
619 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
624 merge(unordered_multiset<_Value, _H2, _P2, _Alloc>&& __source)
625 { merge(__source); }
1453 merge(unordered_multiset<_Value, _H2, _P2, _Alloc>& __source)
1457 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
[all...] |
| unordered_map.h | 822 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>& __source)
825 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
830 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
831 { merge(__source); }
835 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
838 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
843 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
844 { merge(__source); }
1765 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
1769 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
[all...] |
| stl_multimap.h | 664 merge(multimap<_Key, _Tp, _Cmp2, _Alloc>& __source)
667 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
672 merge(multimap<_Key, _Tp, _Cmp2, _Alloc>&& __source)
673 { merge(__source); }
677 merge(map<_Key, _Tp, _Cmp2, _Alloc>& __source)
680 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
685 merge(map<_Key, _Tp, _Cmp2, _Alloc>&& __source)
686 { merge(__source); }
|
| stl_set.h | 613 merge(set<_Key, _Compare1, _Alloc>& __source)
616 _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));
621 merge(set<_Key, _Compare1, _Alloc>&& __source)
622 { merge(__source); }
626 merge(multiset<_Key, _Compare1, _Alloc>& __source)
629 _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));
634 merge(multiset<_Key, _Compare1, _Alloc>&& __source)
635 { merge(__source); }
|
| stl_map.h | 674 merge(map<_Key, _Tp, _Cmp2, _Alloc>& __source)
677 _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));
682 merge(map<_Key, _Tp, _Cmp2, _Alloc>&& __source)
683 { merge(__source); }
687 merge(multimap<_Key, _Tp, _Cmp2, _Alloc>& __source)
690 _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));
695 merge(multimap<_Key, _Tp, _Cmp2, _Alloc>&& __source)
696 { merge(__source); }
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| fs_path.h | 183 __effective_range(const basic_string<_CharT, _Traits, _Alloc>& __source)
185 { return __source; }
189 __effective_range(const basic_string_view<_CharT, _Traits>& __source)
191 { return __source; }
196 __effective_range(const _Source& __source)
199 using _Iter = decltype(std::__niter_base(__source));
203 return basic_string_view<value_type>{&*__source};
209 _Source __it = __source;
324 path(string_type&& __source, format = auto_format)
325 : _M_pathname(std::move(__source))
[all...] |
| std_function.h | 134 _M_get_pointer(const _Any_data& __source) noexcept
138 const _Functor& __f = __source._M_access<_Functor>();
142 return __source._M_access<_Functor*>();
180 _M_manager(_Any_data& __dest, const _Any_data& __source,
194 __dest._M_access<_Functor*>() = _M_get_pointer(__source);
199 *const_cast<const _Functor*>(_M_get_pointer(__source)));
267 _M_manager(_Any_data& __dest, const _Any_data& __source,
278 __dest._M_access<_Functor*>() = _Base::_M_get_pointer(__source);
282 _Base::_M_manager(__dest, __source, __op);
|
| stl_multiset.h | 598 merge(multiset<_Key, _Compare1, _Alloc>& __source)
601 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
606 merge(multiset<_Key, _Compare1, _Alloc>&& __source)
607 { merge(__source); }
611 merge(set<_Key, _Compare1, _Alloc>& __source)
614 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
619 merge(set<_Key, _Compare1, _Alloc>&& __source)
620 { merge(__source); }
|
| unordered_set.h | 598 merge(unordered_set<_Value, _H2, _P2, _Alloc>& __source)
601 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
606 merge(unordered_set<_Value, _H2, _P2, _Alloc>&& __source)
607 { merge(__source); }
611 merge(unordered_multiset<_Value, _H2, _P2, _Alloc>& __source)
614 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
619 merge(unordered_multiset<_Value, _H2, _P2, _Alloc>&& __source)
620 { merge(__source); }
1448 merge(unordered_multiset<_Value, _H2, _P2, _Alloc>& __source)
1452 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
[all...] |
| unordered_map.h | 816 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>& __source)
819 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
824 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
825 { merge(__source); }
829 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
832 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
837 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
838 { merge(__source); }
1759 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
1763 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
[all...] |
| stl_multimap.h | 664 merge(multimap<_Key, _Tp, _Cmp2, _Alloc>& __source)
667 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
672 merge(multimap<_Key, _Tp, _Cmp2, _Alloc>&& __source)
673 { merge(__source); }
677 merge(map<_Key, _Tp, _Cmp2, _Alloc>& __source)
680 _M_t._M_merge_equal(_Merge_helper::_S_get_tree(__source));
685 merge(map<_Key, _Tp, _Cmp2, _Alloc>&& __source)
686 { merge(__source); }
|
| stl_set.h | 613 merge(set<_Key, _Compare1, _Alloc>& __source)
616 _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));
621 merge(set<_Key, _Compare1, _Alloc>&& __source)
622 { merge(__source); }
626 merge(multiset<_Key, _Compare1, _Alloc>& __source)
629 _M_t._M_merge_unique(_Merge_helper::_S_get_tree(__source));
634 merge(multiset<_Key, _Compare1, _Alloc>&& __source)
635 { merge(__source); }
|
