Home
last modified time | relevance | path

Searched refs:right_ (Results 1 – 25 of 44) sorted by relevance

12

/third_party/boost/boost/icl/detail/
Dmap_algo.hpp35 co_iterator right_ = right_common_lower_; in intersects() local
36 while(right_ != right_common_upper_) in intersects()
37 if(!(left.find(key_value<CoObjectT>(right_++))==left.end())) in intersects()
63 typename MapT::const_iterator right_ = right.begin(); in lexicographical_distinct_equal() local
66 right_ = next_proton(right_, right); in lexicographical_distinct_equal()
68 while(left_ != left.end() && right_ != right.end()) in lexicographical_distinct_equal()
70 if(!(left_->first == right_->first && left_->second == right_->second)) in lexicographical_distinct_equal()
74 ++right_; in lexicographical_distinct_equal()
76 right_ = next_proton(right_, right); in lexicographical_distinct_equal()
79 return left_ == left.end() && right_ == right.end(); in lexicographical_distinct_equal()
Dsubset_comparer.hpp37 static int apply(typename LeftT::const_iterator& left_, typename RightT::const_iterator& right_) in apply()
40 co_value<RightT>(right_)); in apply()
47 static int apply(typename LeftT::const_iterator& left_, typename RightT::const_iterator& right_) in apply()
49 if(co_value<LeftT>(left_) == co_value<RightT>(right_)) in apply()
68 static int apply(typename LeftT::const_iterator& left_, typename RightT::const_iterator& right_) in apply()
81 ::type::apply(left_, right_); in apply()
229 typename RightT::const_iterator right_ = right_begin; in subset_compare() local
233 state = step.next_both(left_, right_); in subset_compare()
Dinterval_subset_comparer.hpp35 static int apply(typename LeftT::const_iterator& left_, typename RightT::const_iterator& right_) in apply()
38 icl::co_value<RightT>(right_)); in apply()
45 static int apply(typename LeftT::const_iterator& left_, typename RightT::const_iterator& right_) in apply()
47 if(icl::co_value<LeftT>(left_) == icl::co_value<RightT>(right_)) in apply()
66 static int apply(typename LeftT::const_iterator& left_, typename RightT::const_iterator& right_) in apply()
79 ::type::apply(left_, right_); in apply()
344 typename RightT::const_iterator right_ = right_begin; in subset_compare() local
350 case Step::nextboth: state = step.next_both(left_, right_); break; in subset_compare()
351 case Step::nextleft: state = step.next_left(left_, right_); break; in subset_compare()
352 case Step::nextright: state = step.next_right(left_, right_); break; in subset_compare()
Dinterval_set_algo.hpp235 typename Type::iterator& right_) in join_nodes() argument
238 interval_type right_interval = key_value<Type>(right_); in join_nodes()
239 object.erase(right_); in join_nodes()
247 typename Type::iterator& right_) in join_on_left() argument
251 BOOST_ASSERT(exclusive_less(key_value<Type>(left_), key_value<Type>(right_))); in join_on_left()
252 BOOST_ASSERT(joinable(object, left_, right_)); in join_on_left()
254 join_nodes(object, left_, right_); in join_on_left()
261 typename Type::iterator& right_) in join_on_right() argument
265 BOOST_ASSERT(exclusive_less(key_value<Type>(left_), key_value<Type>(right_))); in join_on_right()
266 BOOST_ASSERT(joinable(object, left_, right_)); in join_on_right()
[all …]
Delement_comparer.hpp190 typename RightT::const_iterator right_ = right_begin; in element_compare() local
196 case Step::nextboth: state = step.next_both (left_, right_); break; in element_compare()
197 case Step::nextleft: state = step.next_left (left_, right_); break; in element_compare()
198 case Step::nextright: state = step.next_right(left_, right_); break; in element_compare()
Dset_algo.hpp93 typename SetType::const_iterator right_ = common_lwb_right_, found_; in intersects() local
94 while(right_ != common_upb_right_) in intersects()
96 found_ = left.find(*right_++); in intersects()
Dassociated_value.hpp23 co_equal(typename Type::const_iterator left_, typename CoType::const_iterator right_, in co_equal() argument
26 return co_value<Type>(left_) == co_value<CoType>(right_); in co_equal()
/third_party/boost/boost/intrusive/detail/
Drbtree_node.hpp50 node_ptr parent_, left_, right_; member
62 node_ptr parent_, left_, right_; member
96 { return n->right_; } in get_right()
99 { return n->right_; } in get_right()
102 { n->right_ = r; } in set_right()
152 { return n->right_; } in get_right()
155 { return n->right_; } in get_right()
158 { n->right_ = r; } in set_right()
Davltree_node.hpp47 node_ptr parent_, left_, right_; member
57 node_ptr parent_, left_, right_; member
91 { return n->right_; } in get_right()
94 { return n->right_; } in get_right()
97 { n->right_ = r; } in set_right()
143 { return n->right_; } in get_right()
146 { n->right_ = r; } in set_right()
Dtree_node.hpp36 node_ptr parent_, left_, right_; member
66 { return n->right_; } in get_right()
69 { return n->right_; } in get_right()
72 { n->right_ = r; } in set_right()
/third_party/boost/libs/coroutine2/example/
Dtree.h59 static ptr_t create( node::ptr_t left_, node::ptr_t right_) in create()
60 { return ptr_t( new branch( left_, right_) ); } in create()
62 branch( node::ptr_t left_, node::ptr_t right_) : in branch()
63 left( left_), right( right_) in branch()
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/kernels/image/soft_dvpp/utils/
Dsoft_vpc.cc65 right_(0), in SoftVpc()
91 …VPC_CHECK_COND_FAIL_PRINT_RETURN((left_ < right_), dpFail, "left(%u) should be < right(%u).", left… in CheckParamter()
92 …VPC_CHECK_COND_FAIL_PRINT_RETURN((right_ < in_width_), dpFail, "right(%u) should be < inWidth(%u).… in CheckParamter()
98 uint32_t crop_width = right_ - left_ + 1; in CheckParamter()
101 … "right(%u) - left(%u) + 1 = crop_width(%u) should be >= 10.", right_, left_, in CheckParamter()
115 left_, right_, out_width); // Up to 16x magnification in CheckParamter()
119 right_, out_width); in CheckParamter()
134 right_ = (crop.right & 0x1) ? crop.right : (crop.right - 1); // Take an odd number downwards. in Init()
169 right_ = in_width_ - 1; in OutputChangeToInput()
275 uint32_t in_width = right_ - left_ + 1; in BuildResizeStack()
[all …]
/third_party/boost/libs/coroutine/example/asymmetric/
Dtree.h61 static ptr_t create( node::ptr_t left_, node::ptr_t right_) in create()
62 { return ptr_t( new branch( left_, right_) ); } in create()
64 branch( node::ptr_t left_, node::ptr_t right_) : in branch()
65 left( left_), right( right_) in branch()
/third_party/boost/boost/spirit/home/support/detail/lexer/parser/tree/
Dselection_node.hpp20 selection_node (node *left_, node *right_) : in selection_node() argument
21 node (left_->nullable () || right_->nullable ()), in selection_node()
23 _right (right_) in selection_node()
Dsequence_node.hpp20 sequence_node (node *left_, node *right_) : in sequence_node() argument
21 node (left_->nullable () && right_->nullable ()), in sequence_node()
23 _right (right_) in sequence_node()
/third_party/boost/libs/intrusive/example/
Ddoc_splay_algorithms.cpp21 my_node *parent_, *left_, *right_; member
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
39 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; } in set_right()
Ddoc_splaytree_algorithms.cpp21 my_node *parent_, *left_, *right_; member
37 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
38 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; } in set_right()
Ddoc_avltree_algorithms.cpp21 my_node *parent_, *left_, *right_; member
39 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
40 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; } in set_right()
Ddoc_rbtree_algorithms.cpp21 my_node *parent_, *left_, *right_; member
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
39 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; } in set_right()
Ddoc_treap_algorithms.cpp21 my_node *parent_, *left_, *right_; member
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
39 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; } in set_right()
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/somas/
Dsomas_solver_pre.cc42 if (tensors[index1]->right_) in CheckTensors()
44 << " already has a right tensor (id: " << tensors[index1]->right_->index_; in CheckTensors()
60 tensors[index1]->right_ = tensors[index2]; in AddContiguousInfoInMap()
79 tensors_sol[index1]->right_ = tensors_sol[index2]; in AddContiguousInfoInMultiMaps()
267 if (tensor->left_ == nullptr && tensor->right_ != nullptr) in SolverOutputLog()
269 else if (tensor->left_ != nullptr && tensor->right_ != nullptr) in SolverOutputLog()
271 else if (tensor->left_ != nullptr && tensor->right_ == nullptr) in SolverOutputLog()
Dsomas_solver_alg.cc150 allocated_tensor = allocated_tensor->right_; in findOffset()
161 …ock_tensor = block.m_start_tensor_; block_tensor != nullptr; block_tensor = block_tensor->right_) { in findOffset()
175 allocated_tensor = allocated_tensor->right_; in findOffset()
216 tensor = tensor->right_; in addElem()
257 tensor = tensor->right_; in Eval()
/third_party/googletest/googlemock/src/
Dgmock-matchers.cc126 right_(graph_->RhsSize(), kUnused) {} in MaxBipartiteMatchState()
197 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) { in TryAugment()
200 right_[irhs] = ilhs; in TryAugment()
220 ::std::vector<size_t> right_;
/third_party/boost/libs/fusion/test/sequence/
Dtree.hpp49 , typename fusion::detail::call_param<Right>::type right_ = Right() in tree()
51 : segments(left_, data_view(data_), right_) in tree()
/third_party/boost/boost/spirit/home/qi/operator/
Ddifference.hpp51 difference(Left const& left_, Right const& right_) in difference()
52 : left(left_), right(right_) {} in difference()

12