| /third_party/boost/libs/container/test/ |
| D | flat_map_test.cpp | 147 flat_map<int, int> fmap(ordered_unique_range, int_map.begin(), int_map.end()); in flat_tree_ordered_insertion_test() local
148 if(!CheckEqualContainers(int_map, fmap)) in flat_tree_ordered_insertion_test()
151 fmap.clear(); in flat_tree_ordered_insertion_test()
152 fmap.insert(ordered_unique_range, int_map.begin(), int_map.end()); in flat_tree_ordered_insertion_test()
153 if(!CheckEqualContainers(int_map, fmap)) in flat_tree_ordered_insertion_test()
156 fmap.insert(ordered_unique_range, int_map.begin(), int_map.end()); in flat_tree_ordered_insertion_test()
159 if(!CheckEqualContainers(int_map2, fmap)) in flat_tree_ordered_insertion_test()
162 fmap.insert(ordered_unique_range, int_map2.begin(), int_map2.end()); in flat_tree_ordered_insertion_test()
165 if(!CheckEqualContainers(int_map4, fmap)) in flat_tree_ordered_insertion_test()
172 fmap.insert(ordered_unique_range, int_even_map.begin(), int_even_map.end()); in flat_tree_ordered_insertion_test()
[all …]
|
| D | map_test.cpp | 376 auto fmap = map(int_map.begin(), int_map.end()); in constructor_template_auto_deduction_test() local
377 if (!CheckEqualContainers(int_map, fmap)) in constructor_template_auto_deduction_test()
385 auto fmap = map(int_map.begin(), int_map.end(), comp_int_t()); in constructor_template_auto_deduction_test() local
386 if (!CheckEqualContainers(int_map, fmap)) in constructor_template_auto_deduction_test()
394 auto fmap = map(int_map.begin(), int_map.end(), comp_int_t(), alloc_pair_int_t()); in constructor_template_auto_deduction_test() local
395 if (!CheckEqualContainers(int_map, fmap)) in constructor_template_auto_deduction_test()
403 auto fmap = map(int_map.begin(), int_map.end(), alloc_pair_int_t()); in constructor_template_auto_deduction_test() local
404 if (!CheckEqualContainers(int_map, fmap)) in constructor_template_auto_deduction_test()
415 auto fmap = map(ordered_unique_range, int_map.begin(), int_map.end()); in constructor_template_auto_deduction_test() local
416 if(!CheckEqualContainers(int_map, fmap)) in constructor_template_auto_deduction_test()
[all …]
|
| /third_party/ffmpeg/libavfilter/ |
| D | vf_vignette.c | 70 float *fmap; member
123 av_freep(&s->fmap); in uninit()
161 float *dst = s->fmap; in update_context()
234 const float *fmap = s->fmap; in filter_frame() local
244 const float f = fmap[x]; in filter_frame()
252 fmap += fmap_linesize; in filter_frame()
260 const float *fmap = s->fmap; in filter_frame() local
276 … if (chroma) *dstp++ = av_clip_uint8(fmap[x << hsub] * (*srcp++ - 127) + 127 + dv); in filter_frame()
277 … else *dstp++ = av_clip_uint8(fmap[x ] * *srcp++ + dv); in filter_frame()
281 fmap += fmap_linesize << vsub; in filter_frame()
[all …]
|
| /third_party/bzip2/ |
| D | blocksort.c | 32 void fallbackSimpleSort ( UInt32* fmap, in fallbackSimpleSort() argument
44 tmp = fmap[i]; in fallbackSimpleSort()
46 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 ) in fallbackSimpleSort()
47 fmap[j-4] = fmap[j]; in fallbackSimpleSort()
48 fmap[j-4] = tmp; in fallbackSimpleSort()
53 tmp = fmap[i]; in fallbackSimpleSort()
55 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ ) in fallbackSimpleSort()
56 fmap[j-1] = fmap[j]; in fallbackSimpleSort()
57 fmap[j-1] = tmp; in fallbackSimpleSort()
72 fswap(fmap[yyp1], fmap[yyp2]); \
[all …]
|
| /third_party/boost/tools/boost_install/test/iostreams/bzip2-1.0.8/ |
| D | blocksort.c | 32 void fallbackSimpleSort ( UInt32* fmap, in fallbackSimpleSort() argument
44 tmp = fmap[i]; in fallbackSimpleSort()
46 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 ) in fallbackSimpleSort()
47 fmap[j-4] = fmap[j]; in fallbackSimpleSort()
48 fmap[j-4] = tmp; in fallbackSimpleSort()
53 tmp = fmap[i]; in fallbackSimpleSort()
55 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ ) in fallbackSimpleSort()
56 fmap[j-1] = fmap[j]; in fallbackSimpleSort()
57 fmap[j-1] = tmp; in fallbackSimpleSort()
72 fswap(fmap[yyp1], fmap[yyp2]); \
[all …]
|
| /third_party/boost/tools/boost_install/test/iostreams/bzip2-1.0.6/ |
| D | blocksort.c | 32 void fallbackSimpleSort ( UInt32* fmap, in fallbackSimpleSort() argument
44 tmp = fmap[i]; in fallbackSimpleSort()
46 for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 ) in fallbackSimpleSort()
47 fmap[j-4] = fmap[j]; in fallbackSimpleSort()
48 fmap[j-4] = tmp; in fallbackSimpleSort()
53 tmp = fmap[i]; in fallbackSimpleSort()
55 for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ ) in fallbackSimpleSort()
56 fmap[j-1] = fmap[j]; in fallbackSimpleSort()
57 fmap[j-1] = tmp; in fallbackSimpleSort()
72 fswap(fmap[yyp1], fmap[yyp2]); \
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | bundled_properties.cpp | 207 boost::filtered_graph< Map, boost::keep_all > fmap(map, boost::keep_all()); in test_bundled_properties() local
210 BOOST_TEST(get(get(&City::name, fmap), v) == "Troy"); in test_bundled_properties()
211 BOOST_TEST(get(get(&Highway::name, fmap), e) == "I-87"); in test_bundled_properties()
212 BOOST_TEST(get(&City::name, fmap, u) == "Albany"); in test_bundled_properties()
213 BOOST_TEST(get(&Highway::name, fmap, e) == "I-87"); in test_bundled_properties()
214 put(&City::population, fmap, v, 49169); in test_bundled_properties()
215 BOOST_TEST(get(&City::population, fmap)[v] == 49169); in test_bundled_properties()
|
| /third_party/typescript/tests/baselines/reference/ |
| D | genericClasses4.js | 6 fmap<B>(f: (a: A) => B): Vec2_T<B> { field in Vec2_T
27 Vec2_T.prototype.fmap = function (f) { method in Vec2_T
|
| D | genericClasses4.types | 10 fmap<B>(f: (a: A) => B): Vec2_T<B> {
11 >fmap : <B>(f: (a: A) => B) => Vec2_T<B>
|
| D | genericClasses4.symbols | 13 fmap<B>(f: (a: A) => B): Vec2_T<B> {
14 >fmap : Symbol(Vec2_T.fmap, Decl(genericClasses4.ts, 3, 45))
|
| /third_party/boost/libs/graph/example/ |
| D | dfs-example.cpp | 22 dfs_time_visitor(TimeMap dmap, TimeMap fmap, T& t) in dfs_time_visitor() argument
23 : m_dtimemap(dmap), m_ftimemap(fmap), m_time(t) in dfs_time_visitor()
|
| /third_party/boost/libs/hana/benchmark/transform/ |
| D | compile.mpl11.list.erb.cpp | 20 using result = boost::mpl11::fmap<f, list>::type;
|
| /third_party/typescript/tests/cases/compiler/ |
| D | genericClasses4.ts | 5 fmap<B>(f: (a: A) => B): Vec2_T<B> { method in Vec2_T
|
| /third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/akg/ |
| D | akg_kernel_json_decoder.cc | 52 const std::map<std::string, AbstractShapeTransferFunc> fmap{ in GetFakeAbstractShape() local
60 auto iter = fmap.find(format); in GetFakeAbstractShape()
61 if (iter == fmap.end()) { in GetFakeAbstractShape()
|
| /third_party/mindspore/tests/ut/python/dataset/ |
| D | test_var_batch_map.py | 253 def batch_map_config(num, r, fbatch, fmap, col_names, res): argument
255 .batch(batch_size=fbatch, input_columns=col_names, per_batch_map=fmap).repeat(r)
|
| /third_party/mesa3d/src/gallium/drivers/crocus/ |
| D | crocus_state.c | 984 float *fmap = (float *)map; in gen4_upload_curbe() local
989 fmap[offset + i * 4 + 0] = fixed_plane[i][0]; in gen4_upload_curbe()
990 fmap[offset + i * 4 + 1] = fixed_plane[i][1]; in gen4_upload_curbe()
991 fmap[offset + i * 4 + 2] = fixed_plane[i][2]; in gen4_upload_curbe()
992 fmap[offset + i * 4 + 3] = fixed_plane[i][3]; in gen4_upload_curbe()
999 fmap[offset + i * 4 + 0] = cp->ucp[j][0]; in gen4_upload_curbe()
1000 fmap[offset + i * 4 + 1] = cp->ucp[j][1]; in gen4_upload_curbe()
1001 fmap[offset + i * 4 + 2] = cp->ucp[j][2]; in gen4_upload_curbe()
1002 fmap[offset + i * 4 + 3] = cp->ucp[j][3]; in gen4_upload_curbe()
|