OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:randomaccessiterator1
(Results
1 - 7
of
7
) sorted by null
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
find_selectors.h
57
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
60
operator()(
RandomAccessIterator1
i1, RandomAccessIterator2 i2, Pred pred)
69
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
71
std::pair<
RandomAccessIterator1
, RandomAccessIterator2>
72
sequential_algorithm(
RandomAccessIterator1
begin1,
73
RandomAccessIterator1
end1,
87
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
90
operator()(
RandomAccessIterator1
i1, RandomAccessIterator2 i2, Pred pred)
102
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
104
std::pair<
RandomAccessIterator1
, RandomAccessIterator2
[
all
...]
merge.h
53
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
57
merge_advance_usual(
RandomAccessIterator1
& begin1,
58
RandomAccessIterator1
end1,
102
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
106
merge_advance_movc(
RandomAccessIterator1
& begin1,
107
RandomAccessIterator1
end1,
114
typedef typename std::iterator_traits<
RandomAccessIterator1
>::value_type
125
RandomAccessIterator1
next1 = begin1 + 1;
170
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
174
merge_advance(
RandomAccessIterator1
& begin1, RandomAccessIterator1 end1
[
all
...]
find.h
55
template<typename
RandomAccessIterator1
,
59
inline std::pair<
RandomAccessIterator1
, RandomAccessIterator2>
60
find_template(
RandomAccessIterator1
begin1,
RandomAccessIterator1
end1,
92
template<typename
RandomAccessIterator1
,
96
std::pair<
RandomAccessIterator1
, RandomAccessIterator2>
97
find_template(
RandomAccessIterator1
begin1,
98
RandomAccessIterator1
end1,
106
typedef std::iterator_traits<
RandomAccessIterator1
> traits_type;
130
RandomAccessIterator1
i1 = begin1 + start
[
all
...]
algobase.h
77
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
79
pair<
RandomAccessIterator1
, RandomAccessIterator2>
80
mismatch_switch(
RandomAccessIterator1
begin1,
RandomAccessIterator1
end1,
86
RandomAccessIterator1
res =
190
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
193
lexicographical_compare_switch(
RandomAccessIterator1
begin1,
194
RandomAccessIterator1
end1,
202
typedef iterator_traits<
RandomAccessIterator1
> traits1_type;
214
typedef pair<
RandomAccessIterator1
, RandomAccessIterator2
[
all
...]
algo.h
399
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
402
set_union_switch(
RandomAccessIterator1
begin1,
RandomAccessIterator1
end1,
501
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
504
set_intersection_switch(
RandomAccessIterator1
begin1,
505
RandomAccessIterator1
end1,
614
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
617
set_symmetric_difference_switch(
RandomAccessIterator1
begin1,
618
RandomAccessIterator1
end1,
[
all
...]
multiway_merge.h
302
RandomAccessIterator1
;
303
typedef typename std::iterator_traits<
RandomAccessIterator1
>::value_type
313
iterator<
RandomAccessIterator1
, Comparator>
365
((
RandomAccessIterator1
)seq0 - seqs_begin[0].first) +
366
((
RandomAccessIterator1
)seq1 - seqs_begin[1].first) +
367
((
RandomAccessIterator1
)seq2 - seqs_begin[2].first)
420
RandomAccessIterator1
;
421
typedef typename std::iterator_traits<
RandomAccessIterator1
>::value_type
424
iterator<
RandomAccessIterator1
, Comparator>
544
RandomAccessIterator1
;
[
all
...]
numeric
184
template<typename
RandomAccessIterator1
, typename RandomAccessIterator2,
187
inner_product_switch(
RandomAccessIterator1
first1,
188
RandomAccessIterator1
last1,
205
inner_product_selector<
RandomAccessIterator1
,
Completed in 2214 milliseconds