Home
last modified time | relevance | path

Searched refs:left_ (Results 1 – 25 of 49) sorted by relevance

12

/third_party/boost/boost/icl/detail/
Dmap_algo.hpp62 typename MapT::const_iterator left_ = left.begin(); in lexicographical_distinct_equal() local
65 left_ = next_proton(left_, left); 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()
73 ++left_; in lexicographical_distinct_equal()
75 left_ = next_proton(left_, left); 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()
39 return inclusion_compare( co_value<LeftT>(left_), 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()
228 typename LeftT::const_iterator left_ = left_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()
37 return inclusion_compare( icl::co_value<LeftT>(left_), 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()
343 typename LeftT::const_iterator left_ = left_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.hpp234 inline void join_nodes(Type& object, typename Type::iterator& left_, in join_nodes() argument
240 const_cast<interval_type&>(key_value<Type>(left_)) in join_nodes()
241 = hull(key_value<Type>(left_), right_interval); in join_nodes()
246 join_on_left(Type& object, typename Type::iterator& left_, 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()
255 return left_; in join_on_left()
260 join_on_right(Type& object, typename Type::iterator& left_, in join_on_right() argument
265 BOOST_ASSERT(exclusive_less(key_value<Type>(left_), key_value<Type>(right_))); in join_on_right()
[all …]
Delement_comparer.hpp189 typename LeftT::const_iterator left_ = left_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()
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
87 { return n->left_; } in get_left()
90 { return n->left_; } in get_left()
93 { n->left_ = l; } in set_left()
143 { return n->left_; } in get_left()
146 { return n->left_; } in get_left()
149 { n->left_ = l; } in set_left()
Davltree_node.hpp47 node_ptr parent_, left_, right_; member
57 node_ptr parent_, left_, right_; member
82 { return n->left_; } in get_left()
85 { return n->left_; } in get_left()
88 { n->left_ = l; } in set_left()
137 { return n->left_; } in get_left()
140 { n->left_ = l; } in set_left()
Dtree_node.hpp36 node_ptr parent_, left_, right_; member
57 { return n->left_; } in get_left()
60 { return n->left_; } in get_left()
63 { n->left_ = l; } in set_left()
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/kernels/image/soft_dvpp/utils/
Dsoft_vpc.cc64 left_(0), in SoftVpc()
91 …VPC_CHECK_COND_FAIL_PRINT_RETURN((left_ < right_), dpFail, "left(%u) should be < right(%u).", left… 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()
118 … "Max magnification is 16. Please check left(%u), right(%u), out_width(%u).", left_, in CheckParamter()
133 …left_ = (crop.left & 0x1) ? (crop.left + 1) : crop.left; // Round up the value to an even num… in Init()
144 in_y_data_ = in_data_ + up_ * in_width_ + left_; in Init()
145 …in_u_data_ = in_data_ + in_width_ * in_height_ + up_ * in_width_ / yuvCoeffiNum4 + left_ / yuvCoef… in Init()
147 left_ / yuvCoeffiNum2; in Init()
[all …]
/third_party/boost/libs/intrusive/example/
Ddoc_splay_algorithms.cpp21 my_node *parent_, *left_, *right_; member
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
37 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; } in set_left()
64 my_node *n = header.left_; in main()
Ddoc_splaytree_algorithms.cpp21 my_node *parent_, *left_, *right_; member
35 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
36 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; } in set_left()
63 my_node *n = header.left_; in main()
Ddoc_avltree_algorithms.cpp21 my_node *parent_, *left_, *right_; member
37 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; } in set_left()
70 my_node *n = header.left_; in main()
Ddoc_rbtree_algorithms.cpp21 my_node *parent_, *left_, *right_; member
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
37 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; } in set_left()
68 my_node *n = header.left_; in main()
Ddoc_treap_algorithms.cpp21 my_node *parent_, *left_, *right_; member
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
37 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; } in set_left()
64 my_node *n = header.left_; in main()
/third_party/skia/third_party/externals/libwebp/src/enc/
Dtoken_enc.c49 b->left_ = 0; in VP8TBufferInit()
80 b->left_ = b->page_size_; in TBufferNewPage()
95 if (b->left_ > 0 || TBufferNewPage(b)) { in AddToken()
96 const int slot = --b->left_; in AddToken()
107 if (b->left_ > 0 || TBufferNewPage(b)) { in AddConstantToken()
108 const int slot = --b->left_; in AddConstantToken()
206 const int N = (next == NULL) ? b->left_ : 0; in VP8EmitTokens()
232 const int N = (next == NULL) ? b->left_ : 0; in VP8EstimateTokenSize()
/third_party/flutter/skia/third_party/externals/libwebp/src/enc/
Dtoken_enc.c49 b->left_ = 0; in VP8TBufferInit()
80 b->left_ = b->page_size_; in TBufferNewPage()
95 if (b->left_ > 0 || TBufferNewPage(b)) { in AddToken()
96 const int slot = --b->left_; in AddToken()
107 if (b->left_ > 0 || TBufferNewPage(b)) { in AddConstantToken()
108 const int slot = --b->left_; in AddConstantToken()
206 const int N = (next == NULL) ? b->left_ : 0; in VP8EmitTokens()
232 const int N = (next == NULL) ? b->left_ : 0; in VP8EstimateTokenSize()
/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/googletest/googlemock/src/
Dgmock-matchers.cc125 left_(graph_->LhsSize(), kUnused), in MaxBipartiteMatchState()
147 GTEST_CHECK_(left_[ilhs] == kUnused) in Compute()
148 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
154 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute()
155 size_t irhs = left_[ilhs]; in Compute()
199 left_[ilhs] = irhs; in TryAugment()
219 ::std::vector<size_t> left_;
/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()
22 _left (left_), 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()
22 _left (left_), in sequence_node()
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/somas/
Dsomas_solver_pre.cc45 if (tensors[index2]->left_) in CheckTensors()
47 << " already has a left tensor (id: " << tensors[index2]->left_->index_; in CheckTensors()
61 tensors[index2]->left_ = tensors[index1]; in AddContiguousInfoInMap()
80 tensors_sol[index2]->left_ = tensors_sol[index1]; 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()
/third_party/boost/libs/fusion/test/sequence/
Dtree.hpp48 , typename fusion::detail::call_param<Left>::type left_ = Left() 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