Home
last modified time | relevance | path

Searched refs:max_rank (Results 1 – 4 of 4) sorted by relevance

/third_party/boost/boost/geometry/algorithms/detail/overlay/
Dsort_by_side.hpp527 void assign_ranks(rank_type min_rank, rank_type max_rank, int side_index) in assign_ranks()
535 = max_rank >= min_rank in assign_ranks()
536 ? ranked.rank >= min_rank && ranked.rank <= max_rank in assign_ranks()
537 : ranked.rank >= min_rank || ranked.rank <= max_rank in assign_ranks()
602 rank_type max_rank = 0; in assign_zones() local
606 if (ranked_point.rank > max_rank) in assign_zones()
608 max_rank = ranked_point.rank; in assign_zones()
622 rank_type const undefined_rank = max_rank + 1; in assign_zones()
650 if (rank_at_next_zone > max_rank) in assign_zones()
/third_party/boost/tools/build/src/util/
Dsequence.py48 max_rank = max_element (ranks)
52 if ranks [0] == max_rank:
/third_party/boost/libs/geometry/test/algorithms/overlay/
Dsort_by_side_basic.cpp160 std::size_t const max_rank = sbs.m_ranked_points.back().rank; in apply_get_turns() local
161 std::vector<bg::signed_size_type> right_count(max_rank + 1, -1); in apply_get_turns()
204 BOOST_CHECK_MESSAGE(max_rank == expected_max_rank, in apply_get_turns()
207 << " detected=" << max_rank); in apply_get_turns()
/third_party/boost/boost/pending/
Drelaxed_heap.hpp426 group& parent, size_type idx, size_type r, size_type max_rank) in build_tree() argument
432 this_group.children = root.children + (idx * max_rank); in build_tree()
437 idx = build_tree(this_group, idx, i, max_rank); in build_tree()