Home
last modified time | relevance | path

Searched refs:l_base (Results 1 – 3 of 3) sorted by relevance

/third_party/boost/boost/move/algo/
Dadaptive_sort.hpp83 , typename iterator_traits<RandIt>::size_type const l_base in adaptive_sort_build_blocks() argument
90 BOOST_ASSERT(0 == ((l_build_buf / l_base)&(l_build_buf/l_base-1))); in adaptive_sort_build_blocks()
104 kbuf = kbuf < l_base ? 0 : kbuf; in adaptive_sort_build_blocks()
109 … l_merged = op_insertion_sort_step_left(first_block, elements_in_blocks, l_base, comp, move_op()); in adaptive_sort_build_blocks()
123 l_merged = insertion_sort_step(first_block, elements_in_blocks, l_base, comp); in adaptive_sort_build_blocks()
386 , Unsigned &n_keys, Unsigned &l_intbuf, Unsigned &l_base, Unsigned &l_build_buf in adaptive_sort_build_params() argument
393 l_base = 0u; in adaptive_sort_build_params()
401 l_intbuf = size_type(ceil_sqrt_multiple(len, &l_base)); in adaptive_sort_build_params()
464 l_base = min_value<Unsigned>(n_keys, AdaptiveSortInsertionSortThreshold); in adaptive_sort_build_params()
551 size_type l_base = 0; in adaptive_sort_impl() local
[all …]
/third_party/boost/boost/regex/v4/
Dmatch_results.hpp610 BidiIterator l_base = (p1->first == l_end) ? this->prefix().first : (*this)[0].first; in maybe_assign() local
651 base1 = ::boost::BOOST_REGEX_DETAIL_NS::distance(l_base, p1->first); in maybe_assign()
652 base2 = ::boost::BOOST_REGEX_DETAIL_NS::distance(l_base, p2->first); in maybe_assign()
Dperl_matcher.hpp388 BidiIterator l_base) in perl_matcher() argument
390 position(first), backstop(l_base), re(e), traits_inst(e.get_traits()), in perl_matcher()