| /third_party/boost/boost/intrusive/detail/ |
| D | common_slist_algorithms.hpp | 46 ; this_node != (p_next = NodeTraits::get_next(p)) in get_previous_node()
60 node_ptr next = NodeTraits::get_next(this_node); in unique()
65 { return !NodeTraits::get_next(this_node); } in inited()
69 const_node_ptr this_node(NodeTraits::get_next(prev_node)); in unlink_after()
70 NodeTraits::set_next(prev_node, NodeTraits::get_next(this_node)); in unlink_after()
78 NodeTraits::set_next(this_node, NodeTraits::get_next(prev_node)); in link_after()
84 node_ptr p(NodeTraits::get_next(bp)); in incorporate_after()
92 node_ptr next_b = NodeTraits::get_next(bb); in transfer_after()
93 node_ptr next_e = NodeTraits::get_next(be); in transfer_after()
94 node_ptr next_p = NodeTraits::get_next(bp); in transfer_after()
[all …]
|
| D | slist_node.hpp | 49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next() function
52 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const node_ptr & n) in get_next() function
|
| D | list_node.hpp | 59 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next() function
62 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const node_ptr & n) in get_next() function
|
| /third_party/boost/boost/intrusive/ |
| D | circular_slist_algorithms.hpp | 190 node_ptr p_next = NodeTraits::get_next(p); in get_previous_previous_node()
191 node_ptr p_next_next = NodeTraits::get_next(p_next); in get_previous_previous_node()
195 p_next_next = NodeTraits::get_next(p_next); in get_previous_previous_node()
213 p = NodeTraits::get_next(p); in count()
228 if(NodeTraits::get_next(this_node)) in unlink()
256 const node_ptr this_next = NodeTraits::get_next(this_node); in swap_nodes()
257 const node_ptr other_next = NodeTraits::get_next(other_node); in swap_nodes()
280 node_ptr i = NodeTraits::get_next(p), e(p); in reverse()
282 node_ptr nxt(NodeTraits::get_next(i)); in reverse()
301 node_ptr first = NodeTraits::get_next(p); in move_backwards()
[all …]
|
| D | circular_list_algorithms.hpp | 84 { return !NodeTraits::get_next(this_node); } in inited()
111 node_ptr next = NodeTraits::get_next(this_node); in unique()
128 p = NodeTraits::get_next(p); in count()
143 node_ptr next(NodeTraits::get_next(this_node)); in unlink()
194 node_ptr next(NodeTraits::get_next(prev_node)); in link_after()
227 node_ptr next_this(NodeTraits::get_next(this_node)); in swap_nodes()
229 node_ptr next_other(NodeTraits::get_next(other_node)); in swap_nodes()
282 node_ptr n(NodeTraits::get_next(i)); in transfer()
303 node_ptr f(NodeTraits::get_next(p)); in reverse()
304 node_ptr i(NodeTraits::get_next(f)), e(p); in reverse()
[all …]
|
| D | linear_slist_algorithms.hpp | 172 p = NodeTraits::get_next(p); in count()
189 node_ptr this_nxt = NodeTraits::get_next(this_node); in swap_trailing_nodes()
190 node_ptr other_nxt = NodeTraits::get_next(other_node); in swap_trailing_nodes()
205 node_ptr i = NodeTraits::get_next(p); in reverse()
208 node_ptr nxti(NodeTraits::get_next(i)); in reverse()
229 if(!n || !p || !NodeTraits::get_next(p)){ in move_first_n_backwards()
244 first = NodeTraits::get_next(first); in move_first_n_backwards()
284 if(!n || !p || !NodeTraits::get_next(p)) in move_first_n_forward()
294 while(!!(next_to_it = node_traits::get_next(old_last))){ in move_first_n_forward()
296 new_last = node_traits::get_next(new_last); in move_first_n_forward()
[all …]
|
| D | list.hpp | 290 node_algorithms::link_before(node_traits::get_next(this->get_root_node()), to_insert); in push_front()
352 node_ptr to_erase = node_traits::get_next(this->get_root_node()); in pop_front_and_dispose()
366 { return *priv_value_traits().to_value_ptr(node_traits::get_next(this->get_root_node())); } in front()
374 { return *priv_value_traits().to_value_ptr(node_traits::get_next(this->get_root_node())); } in front()
398 { return iterator(node_traits::get_next(this->get_root_node()), this->priv_value_traits_ptr()); } in begin()
414 …{ return const_iterator(node_traits::get_next(this->get_root_node()), this->priv_value_traits_ptr(… in cbegin()
705 bp = node_traits::get_next(bp); in erase_and_dispose()
1023 if(node_traits::get_next(this->get_root_node()) in sort()
1150 …(node_traits::get_next(root_node), root_node, detail::key_nodeptr_comp<Pred, value_traits>(pred, &… in remove_if()
1153 this->erase( const_iterator(node_traits::get_next(root_node), this->priv_value_traits_ptr()) in remove_if()
[all …]
|
| D | slist.hpp | 492 node_ptr to_erase = node_traits::get_next(this->get_root_node()); in pop_front_and_dispose()
511 { return *this->priv_value_traits().to_value_ptr(node_traits::get_next(this->get_root_node())); } in front()
519 …{ return *this->priv_value_traits().to_value_ptr(detail::uncast(node_traits::get_next(this->get_ro… in front()
555 … { return iterator (node_traits::get_next(this->get_root_node()), this->priv_value_traits_ptr()); } in begin()
563 …{ return const_iterator (node_traits::get_next(this->get_root_node()), this->priv_value_traits_ptr… in begin()
571 …{ return const_iterator(node_traits::get_next(this->get_root_node()), this->priv_value_traits_ptr(… in cbegin()
1097 node_ptr fp(node_traits::get_next(bfp)); in s_erase_after_and_dispose()
1101 fp = node_traits::get_next(fp); in s_erase_after_and_dispose()
1132 node_ptr fp(node_traits::get_next(bfp)); in erase_after_and_dispose()
1136 fp = node_traits::get_next(fp); in erase_after_and_dispose()
[all …]
|
| D | hashtable.hpp | 384 node_ptr nxt(node_traits::get_next(p)); in get_bucket_before_begin()
386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
388 nxt = node_traits::get_next(nxt); in get_bucket_before_begin()
398 node_ptr last_node_group = group_traits::get_next(first_node_of_group); in get_bucket_before_begin()
399 slist_node_ptr possible_end = node_traits::get_next(last_node_group); in get_bucket_before_begin()
403 last_node_group = group_traits::get_next(first_node_of_group); in get_bucket_before_begin()
404 possible_end = node_traits::get_next(last_node_group); in get_bucket_before_begin()
413 while((n = node_traits::get_next(nb)) != first_in_group){ in get_prev_to_first_in_group()
414 nb = group_traits::get_next(n); //go to last in group in get_prev_to_first_in_group()
421 node_ptr const nxt_ptr(node_traits::get_next(to_erase_ptr)); in erase_from_group()
[all …]
|
| /third_party/mindspore/tests/ut/cpp/python_input/gtest_input/pre_activate/ |
| D | getnext_tensor_move_elimination_test.py | 20 get_next = P.GetNext([ms.float32], [[1, 64, 112, 112]], 1, "") variable
44 res = get_next()
52 res = get_next()
65 res = get_next()
72 res = get_next()
85 res = get_next()
93 res = get_next()
107 res = get_next()
114 res = get_next()
|
| D | insert_tensor_move_for_getnext.py | 21 get_next = P.GetNext([ms.float32, ms.int32], [[32, 64], [32]], 2, "") variable
43 res = get_next()
48 res = get_next()
|
| /third_party/mindspore/tests/ut/python/mindrecord/ |
| D | test_mindrecord_base.py | 82 for index, x in enumerate(reader.get_next()):
136 for index, x in enumerate(reader.get_next()):
183 for index, x in enumerate(reader.get_next()):
209 for index, x in enumerate(reader.get_next()):
234 for index, x in enumerate(reader.get_next()):
251 for index, x in enumerate(reader.get_next()):
268 for index, x in enumerate(reader.get_next()):
284 for index, x in enumerate(reader.get_next()):
411 for index, x in enumerate(reader.get_next()):
493 for index, x in enumerate(reader.get_next()):
[all …]
|
| D | skip_test_issue.py | 43 for index, x in enumerate(reader.get_next()):
63 for index, x in enumerate(reader.get_next()):
180 iterator = reader.get_next()
186 iterator = reader.get_next()
267 for index, x in enumerate(reader.get_next()):
308 for _ in reader.get_next():
347 for index, x in enumerate(reader.get_next()):
388 for index, x in enumerate(reader.get_next()):
438 for index, _ in enumerate(reader.get_next()):
548 for _ in reader.get_next():
[all …]
|
| D | test_mnist_to_mr.py | 64 for _, x in enumerate(reader.get_next()):
74 for _, x in enumerate(reader.get_next()):
134 for x, data, label in zip(reader.get_next(), train_data, train_labels):
141 for x, data, label in zip(reader.get_next(), test_data, test_labels):
|
| D | skip_test_mindrecord_shard.py | 74 iterator = dataset.get_next()
79 iterator = dataset.get_next()
150 iterator = dataset.get_next()
156 iterator = dataset.get_next()
336 iterator = dataset.get_next()
342 iterator = dataset.get_next()
|
| /third_party/ffmpeg/libavformat/ |
| D | bmv.c | 38 int get_next; member
66 c->get_next = 1; in bmv_read_header()
76 while (c->get_next) { in bmv_read_packet()
106 c->get_next = 0; in bmv_read_packet()
114 c->get_next = 1; in bmv_read_packet()
|
| /third_party/mesa3d/src/compiler/glsl/ |
| D | lower_jumps.cpp | 300 while (!ir->get_next()->is_tail_sentinel()) { in truncate_after_instruction()
301 ((ir_instruction *)ir->get_next())->remove(); in truncate_after_instruction()
308 while (!ir->get_next()->is_tail_sentinel()) { in move_outer_block_inside()
309 ir_instruction *move_ir = (ir_instruction *)ir->get_next(); in move_outer_block_inside()
482 if(ir->get_next()->is_tail_sentinel() && (this->loop.nesting_depth == 0 in should_lower_jump()
490 if(this->function.nesting_depth == 0 && ir->get_next()->is_tail_sentinel()) in should_lower_jump()
522 if(this->loop.nesting_depth == 0 && ir->get_next()->is_tail_sentinel()) in visit()
769 exec_node* next = ir->get_next(); in visit()
802 for(ir_after = (ir_instruction*)ir->get_next(); !ir_after->is_tail_sentinel();) in visit()
808 ir_instruction* ir_next = (ir_instruction*)ir_after->get_next(); in visit()
[all …]
|
| /third_party/mindspore/mindspore/mindrecord/ |
| D | filereader.py | 61 def get_next(self): member in FileReader
71 iterator = self._reader.get_next()
75 iterator = self._reader.get_next()
|
| D | shardreader.py | 79 def get_next(self): member in ShardReader
86 return self._reader.get_next()
|
| /third_party/boost/boost/spirit/home/support/iterators/detail/ |
| D | split_functor_input_policy.hpp | 84 functor_type::get_next(mp, curtok); in get_input()
91 functor_type::get_next(mp, mp.shared()->curtok); in advance_input()
147 functor_type::get_next(mp, curtok); in get_input()
154 mp.ftor.get_next(mp, mp.shared()->curtok); in advance_input()
|
| /third_party/mindspore/tests/ut/cpp/pre_activate/ascend/enhancer/ |
| D | insert_tensor_move_for_getnext_test.cc | 54 auto get_next = ret->input(1)->cast<CNodePtr>()->input(1); in TEST_F() local
55 get_next->set_kernel_info(std::make_shared<device::KernelInfo>()); in TEST_F()
56 AnfAlgo::SetSelectKernelBuildInfo(builder.Build(), get_next.get()); in TEST_F()
|
| /third_party/boost/boost/container/detail/ |
| D | block_slist.hpp | 51 static node_ptr get_next(const_node_ptr n) in get_next() function
106 slist_node *n = slist_algo::node_traits::get_next(&m_slist); in release()
109 n = slist_algo::node_traits::get_next(n); in release()
|
| D | block_list.hpp | 50 static node_ptr get_next(const_node_ptr n) in get_next() function
122 list_node *n = list_algo::node_traits::get_next(&m_list); in release()
125 n = list_algo::node_traits::get_next(n); in release()
|
| /third_party/mindspore/tests/ut/python/parallel/ |
| D | test_get_next.py | 34 self.get_next = P.GetNext(types, shapes, output_num, "")
42 data, label = self.get_next()
153 self.get_next = P.GetNext([ms.float32, ms.int32], [[32, 64], [32]], 2, "")
156 return self.get_next()
|
| /third_party/mindspore/tests/st/pynative/ |
| D | test_pynative_sync_control.py | 28 self.get_next = P.GetNext([mstype.float32], [(1, 1)], 1, "test")
31 x = self.get_next()
|