| /third_party/boost/libs/graph/example/ |
| D | family_tree.cpp | 40 graph_traits< adjacency_list<> >::adjacency_iterator ai, a_end; in main() local
47 boost::tie(ai, a_end) = adjacent_vertices(*i, g); in main()
48 if (ai == a_end) in main()
52 for (; ai != a_end; ++ai) in main()
55 if (boost::next(ai) != a_end) in main()
|
| D | iteration_macros.cpp | 47 graph_traits< adjacency_list<> >::adjacency_iterator ai, a_end; in main() local
|
| /third_party/boost/boost/graph/ |
| D | push_relabel_max_flow.hpp | 181 out_edge_iterator a_iter, a_end; in push_relabel() local
182 for (boost::tie(a_iter, a_end) = out_edges(src, g); a_iter != a_end; in push_relabel()
195 for (boost::tie(a_iter, a_end) = out_edges(src, g); in push_relabel()
196 a_iter != a_end; ++a_iter) in push_relabel()
275 out_edge_iterator ai, a_end; in global_distance_update() local
276 for (boost::tie(ai, a_end) = out_edges(u, g); ai != a_end; ++ai) in global_distance_update()
391 out_edge_iterator ai, a_end, min_edge_iter; in relabel_distance() local
392 for (boost::tie(ai, a_end) = out_edges(u, g); ai != a_end; ++ai) in relabel_distance()
485 out_edge_iterator ai, a_end; in convert_preflow_to_flow() local
499 for (boost::tie(ai, a_end) = out_edges(*u_iter, g); ai != a_end; in convert_preflow_to_flow()
[all …]
|
| D | graph_stats.hpp | 83 a_iterator_type a_iter, a_end; in dup_edge_dist() local
84 for (boost::tie(a_iter, a_end) = adjacent_vertices(v, g); in dup_edge_dist()
85 a_iter != a_end; ++a_iter) in dup_edge_dist()
|
| /third_party/ffmpeg/libavcodec/mips/ |
| D | celp_math_mips.c | 64 const float* a_end = a + length; in ff_dot_productf_mips() local
79 : [a_end]"r"(a_end), [length] "r" (length) in ff_dot_productf_mips()
|
| D | acelp_vectors_mips.c | 65 const float *a_end = in_a + length; in ff_weighted_vector_sumf_mips() local
92 [length] "r" (length), [a_end]"r"(a_end) in ff_weighted_vector_sumf_mips()
|
| /third_party/boost/libs/algorithm/test/ |
| D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro
28 #define b_e(v) a_begin(v),a_end(v)
55 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered()
56 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered()
61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered()
63 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered()
83 …strictlyIncreasingValues), boost::end(strictlyIncreasingValues), less) == a_end(strictlyIncreasing… in test_ordered()
|
| D | clamp_test.cpp | 167 #define a_end(v) (v + elementsof (v)) macro
169 #define b_e(v) a_begin(v),a_end(v)
178 std::copy ( a_begin(inputs), a_end(inputs), std::back_inserter ( in_v )); in test_int_range()
180 ba::clamp_range ( a_begin(inputs), a_end(inputs), std::back_inserter ( results ), -1, 10 ); in test_int_range()
187 …ba::clamp_range ( a_begin(inputs), a_end(inputs), std::back_inserter ( results ), 10, -1, intGreat… in test_int_range()
|
| /third_party/ntfs-3g/ntfsprogs/ |
| D | cluster.c | 93 LCN a_end = a_begin + runs[j].length - 1; in cluster_find() local
106 if ((a_begin > c_end) || (a_end < c_begin)) in cluster_find()
|
| /third_party/ltp/include/ |
| D | tst_fuzzy_sync.h | 111 struct timespec a_end; member
515 pair->a_end, pair->a_start); in tst_fzsync_pair_update()
519 pair->a_end, pair->b_end); in tst_fzsync_pair_update()
760 tst_fzsync_time(&pair->a_end); in tst_fzsync_end_race_a()
|
| /third_party/mesa3d/src/freedreno/ir3/ |
| D | ir3_merge_regs.c | 155 unsigned a_end = a_start + reg_size(a->reg); in can_skip_interference() local
159 if (a_end <= b_start || b_end <= a_start) in can_skip_interference()
170 if (!((a_start <= b_start && a_end >= b_end) || in can_skip_interference()
171 (b_start <= a_start && b_end >= a_end))) in can_skip_interference()
178 unsigned end = MIN2(a_end, b_end); in can_skip_interference()
|
| /third_party/boost/libs/math/tools/ |
| D | hypergeometric_1F1_map_neg_b_fwd_recurrence.cpp | 49 test_type a_start, a_end; in main() local
54 std::cin >> a_start >> a_end; in main()
65 for (test_type a = a_start; a < a_end; a_start < 0 ? a /= a_mult : a *= a_mult) in main()
|
| /third_party/gettext/libtextstyle/gnulib-local/lib/libcroco/ |
| D | cr-tknzr.c | 226 guchar ** a_end,
231 guchar ** a_end,
274 guchar ** a_end, in cr_tknzr_parse_w() argument
283 && a_start && a_end, in cr_tknzr_parse_w()
289 *a_end = NULL; in cr_tknzr_parse_w()
302 *a_end = *a_start; in cr_tknzr_parse_w()
320 RECORD_CUR_BYTE_ADDR (a_this, a_end); in cr_tknzr_parse_w()
348 guchar ** a_end, in cr_tknzr_parse_nl() argument
356 && a_start && a_end, CR_BAD_PARAM_ERROR); in cr_tknzr_parse_nl()
371 RECORD_CUR_BYTE_ADDR (a_this, a_end); in cr_tknzr_parse_nl()
[all …]
|
| /third_party/boost/boost/random/ |
| D | discrete_distribution.hpp | 597 a_end = above_average.end() in init() local
599 while(b_iter != b_end && a_iter != a_end) { in init()
613 for(; a_iter != a_end; ++a_iter) { in init()
|
| /third_party/flutter/skia/third_party/externals/angle2/src/tests/test_expectations/ |
| D | GPUTestExpectationsParser.cpp | 183 inline bool DoLowerCaseEqualsASCII(Iter a_begin, Iter a_end, const char *b) in DoLowerCaseEqualsASCII() argument
185 for (Iter it = a_begin; it != a_end; ++it, ++b) in DoLowerCaseEqualsASCII()
|
| /third_party/boost/tools/inspect/ |
| D | link_check.cpp | 146 string::const_iterator a_end( contents.end() ); in inspect() local
154 while( boost::regex_search( a_start, a_end, a_what, html_bookmark_regex, a_flags) ) in inspect()
|
| /third_party/skia/third_party/externals/angle2/src/tests/test_expectations/ |
| D | GPUTestExpectationsParser.cpp | 229 inline bool DoLowerCaseEqualsASCII(Iter a_begin, Iter a_end, const char *b) in DoLowerCaseEqualsASCII() argument
231 for (Iter it = a_begin; it != a_end; ++it, ++b) in DoLowerCaseEqualsASCII()
|
| /third_party/gn/src/gn/ |
| D | command_format.cc | 592 int a_end = FindLowestSuffixComment(a); in ShouldAddBlankLineInBetween() local
596 return (b_range.begin().line_number() > a_end + 1) || in ShouldAddBlankLineInBetween()
|
| /third_party/python/Objects/ |
| D | longobject.c | 4709 digit *a_digit, *b_digit, *c_digit, *d_digit, *a_end, *b_end; in _PyLong_GCD() local
4829 a_end = a->ob_digit + size_a; in _PyLong_GCD()
4847 while (a_digit < a_end) { in _PyLong_GCD()
|