/dports/devel/boost-docs/boost_1_72_0/boost/sort/common/util/ |
H A D | insert.hpp | 61 Compare comp, Iter2_t it_aux) in insert_sorted() argument 82 move_forward(it_aux, mid, last); in insert_sorted() 91 mv_first = std::upper_bound(first, mv_last, it_aux[i - 1], comp); in insert_sorted() 93 *(it1 - 1) = std::move(it_aux[i - 1]); in insert_sorted() 99 Compare comp, Iter2_t it_aux) in insert_sorted_backward() argument 119 move_forward(it_aux, first, mid); in insert_sorted_backward() 128 mv_last = std::lower_bound(mv_first, last, it_aux[i], comp); in insert_sorted_backward() 130 *(it1) = std::move(it_aux[i]); in insert_sorted_backward()
|
/dports/devel/hyperscan/boost_1_75_0/boost/sort/common/util/ |
H A D | insert.hpp | 61 Compare comp, Iter2_t it_aux) in insert_sorted() argument 82 move_forward(it_aux, mid, last); in insert_sorted() 91 mv_first = std::upper_bound(first, mv_last, it_aux[i - 1], comp); in insert_sorted() 93 *(it1 - 1) = std::move(it_aux[i - 1]); in insert_sorted() 99 Compare comp, Iter2_t it_aux) in insert_sorted_backward() argument 119 move_forward(it_aux, first, mid); in insert_sorted_backward() 128 mv_last = std::lower_bound(mv_first, last, it_aux[i], comp); in insert_sorted_backward() 130 *(it1) = std::move(it_aux[i]); in insert_sorted_backward()
|
/dports/devel/boost-python-libs/boost_1_72_0/boost/sort/common/util/ |
H A D | insert.hpp | 61 Compare comp, Iter2_t it_aux) in insert_sorted() argument 82 move_forward(it_aux, mid, last); in insert_sorted() 91 mv_first = std::upper_bound(first, mv_last, it_aux[i - 1], comp); in insert_sorted() 93 *(it1 - 1) = std::move(it_aux[i - 1]); in insert_sorted() 99 Compare comp, Iter2_t it_aux) in insert_sorted_backward() argument 119 move_forward(it_aux, first, mid); in insert_sorted_backward() 128 mv_last = std::lower_bound(mv_first, last, it_aux[i], comp); in insert_sorted_backward() 130 *(it1) = std::move(it_aux[i]); in insert_sorted_backward()
|
/dports/devel/R-cran-BH/BH/inst/include/boost/sort/common/util/ |
H A D | insert.hpp | 61 Compare comp, Iter2_t it_aux) in insert_sorted() argument 82 move_forward(it_aux, mid, last); in insert_sorted() 91 mv_first = std::upper_bound(first, mv_last, it_aux[i - 1], comp); in insert_sorted() 93 *(it1 - 1) = std::move(it_aux[i - 1]); in insert_sorted() 99 Compare comp, Iter2_t it_aux) in insert_sorted_backward() argument 119 move_forward(it_aux, first, mid); in insert_sorted_backward() 128 mv_last = std::lower_bound(mv_first, last, it_aux[i], comp); in insert_sorted_backward() 130 *(it1) = std::move(it_aux[i]); in insert_sorted_backward()
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/sort/common/util/ |
H A D | insert.hpp | 61 Compare comp, Iter2_t it_aux) in insert_sorted() argument 82 move_forward(it_aux, mid, last); in insert_sorted() 91 mv_first = std::upper_bound(first, mv_last, it_aux[i - 1], comp); in insert_sorted() 93 *(it1 - 1) = std::move(it_aux[i - 1]); in insert_sorted() 99 Compare comp, Iter2_t it_aux) in insert_sorted_backward() argument 119 move_forward(it_aux, first, mid); in insert_sorted_backward() 128 mv_last = std::lower_bound(mv_first, last, it_aux[i], comp); in insert_sorted_backward() 130 *(it1) = std::move(it_aux[i]); in insert_sorted_backward()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/sort/common/util/ |
H A D | insert.hpp | 61 Compare comp, Iter2_t it_aux) 82 move_forward(it_aux, mid, last); in ~circular_buffer() 91 mv_first = std::upper_bound(first, mv_last, it_aux[i - 1], comp); 93 *(it1 - 1) = std::move(it_aux[i - 1]); 99 Compare comp, Iter2_t it_aux) in initialize() 119 move_forward(it_aux, first, mid); in initialize() 128 mv_last = std::lower_bound(mv_first, last, it_aux[i], comp); in initialize() 130 *(it1) = std::move(it_aux[i]); in initialize()
|
/dports/devel/boost-libs/boost_1_72_0/boost/sort/common/util/ |
H A D | insert.hpp | 61 Compare comp, Iter2_t it_aux) in insert_sorted() argument 82 move_forward(it_aux, mid, last); in insert_sorted() 91 mv_first = std::upper_bound(first, mv_last, it_aux[i - 1], comp); in insert_sorted() 93 *(it1 - 1) = std::move(it_aux[i - 1]); in insert_sorted() 99 Compare comp, Iter2_t it_aux) in insert_sorted_backward() argument 119 move_forward(it_aux, first, mid); in insert_sorted_backward() 128 mv_last = std::lower_bound(mv_first, last, it_aux[i], comp); in insert_sorted_backward() 130 *(it1) = std::move(it_aux[i]); in insert_sorted_backward()
|
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/sort/common/util/ |
H A D | insert.hpp | 61 Compare comp, Iter2_t it_aux) in insert_sorted() argument 82 move_forward(it_aux, mid, last); in insert_sorted() 91 mv_first = std::upper_bound(first, mv_last, it_aux[i - 1], comp); in insert_sorted() 93 *(it1 - 1) = std::move(it_aux[i - 1]); in insert_sorted() 99 Compare comp, Iter2_t it_aux) in insert_sorted_backward() argument 119 move_forward(it_aux, first, mid); in insert_sorted_backward() 128 mv_last = std::lower_bound(mv_first, last, it_aux[i], comp); in insert_sorted_backward() 130 *(it1) = std::move(it_aux[i]); in insert_sorted_backward()
|
/dports/devel/boost-docs/boost_1_72_0/boost/sort/common/ |
H A D | range.hpp | 125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward() local 126 return range<Iter2_t>(dest.first, it_aux); in move_forward() 141 Iter2_t it_aux = util::move_backward(dest.first + src.size(), src.first, in move_backward() local 257 Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, in merge() local 259 return range<Iter3_t>(dest.first, it_aux); in merge() 305 Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, in merge_half() local 307 return range<Iter2_t>(dest.first, it_aux); in merge_half()
|
/dports/devel/hyperscan/boost_1_75_0/boost/sort/common/ |
H A D | range.hpp | 125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward() local 126 return range<Iter2_t>(dest.first, it_aux); in move_forward() 141 Iter2_t it_aux = util::move_backward(dest.first + src.size(), src.first, in move_backward() local 257 Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, in merge() local 259 return range<Iter3_t>(dest.first, it_aux); in merge() 305 Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, in merge_half() local 307 return range<Iter2_t>(dest.first, it_aux); in merge_half()
|
/dports/devel/R-cran-BH/BH/inst/include/boost/sort/common/ |
H A D | range.hpp | 125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward() local 126 return range<Iter2_t>(dest.first, it_aux); in move_forward() 141 Iter2_t it_aux = util::move_backward(dest.first + src.size(), src.first, in move_backward() local 257 Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, in merge() local 259 return range<Iter3_t>(dest.first, it_aux); in merge() 305 Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, in merge_half() local 307 return range<Iter2_t>(dest.first, it_aux); in merge_half()
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/sort/common/ |
H A D | range.hpp | 125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward() local 126 return range<Iter2_t>(dest.first, it_aux); in move_forward() 141 Iter2_t it_aux = util::move_backward(dest.first + src.size(), src.first, in move_backward() local 257 Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, in merge() local 259 return range<Iter3_t>(dest.first, it_aux); in merge() 305 Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, in merge_half() local 307 return range<Iter2_t>(dest.first, it_aux); in merge_half()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/sort/common/ |
H A D | range.hpp | 125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward() local 126 return range<Iter2_t>(dest.first, it_aux); in move_forward() 141 Iter2_t it_aux = util::move_backward(dest.first + src.size(), src.first, in move_backward() local 257 Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, in merge() local 259 return range<Iter3_t>(dest.first, it_aux); in merge() 305 Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, in merge_half() local 307 return range<Iter2_t>(dest.first, it_aux); in merge_half()
|
/dports/devel/boost-libs/boost_1_72_0/boost/sort/common/ |
H A D | range.hpp | 125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward() local 126 return range<Iter2_t>(dest.first, it_aux); in move_forward() 141 Iter2_t it_aux = util::move_backward(dest.first + src.size(), src.first, in move_backward() local 257 Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, in merge() local 259 return range<Iter3_t>(dest.first, it_aux); in merge() 305 Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, in merge_half() local 307 return range<Iter2_t>(dest.first, it_aux); in merge_half()
|
/dports/devel/boost-python-libs/boost_1_72_0/boost/sort/common/ |
H A D | range.hpp | 125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward() local 126 return range<Iter2_t>(dest.first, it_aux); in move_forward() 141 Iter2_t it_aux = util::move_backward(dest.first + src.size(), src.first, in move_backward() local 257 Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, in merge() local 259 return range<Iter3_t>(dest.first, it_aux); in merge() 305 Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, in merge_half() local 307 return range<Iter2_t>(dest.first, it_aux); in merge_half()
|
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/sort/common/ |
H A D | range.hpp | 125 Iter2_t it_aux = util::move_forward(dest.first, src.first, src.last); in move_forward() local 126 return range<Iter2_t>(dest.first, it_aux); in move_forward() 141 Iter2_t it_aux = util::move_backward(dest.first + src.size(), src.first, in move_backward() local 257 Iter3_t it_aux = util::merge(src1.first, src1.last, src2.first, src2.last, in merge() local 259 return range<Iter3_t>(dest.first, it_aux); in merge() 305 Iter2_t it_aux = util::merge_half(src1.first, src1.last, src2.first, in merge_half() local 307 return range<Iter2_t>(dest.first, it_aux); in merge_half()
|
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/operator/subgraph/tensorrt/ |
H A D | tensorrt-inl.h | 386 auto it_aux = in_aux_dict_.find(param_name); in CreateSubgraphNode() local 387 if (it_aux != in_aux_dict_.end()) { in CreateSubgraphNode() 388 cache = it_aux->second; in CreateSubgraphNode()
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/operator/subgraph/tensorrt/ |
H A D | tensorrt-inl.h | 386 auto it_aux = in_aux_dict_.find(param_name); in CreateSubgraphNode() local 387 if (it_aux != in_aux_dict_.end()) { in CreateSubgraphNode() 388 cache = it_aux->second; in CreateSubgraphNode()
|