Home
last modified time | relevance | path

Searched refs:bnd (Results 1 – 22 of 22) sorted by relevance

/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/
H A Dprocess_maxima.hpp20 active_bound_list_itr<T> do_maxima(active_bound_list_itr<T>& bnd, in do_maxima() argument
27 auto bnd_next = std::next(bnd); in do_maxima()
28 auto return_bnd = bnd; in do_maxima()
36 intersect_bounds(*(*bnd), *(*bnd_next), (*bnd)->current_edge->top, cliptype, in do_maxima()
38 std::iter_swap(bnd, bnd_next); in do_maxima()
39 bnd = bnd_next; in do_maxima()
43 if ((*bnd)->ring && (*bndMaxPair)->ring) { in do_maxima()
44 add_local_maximum_point(*(*bnd), *(*bndMaxPair), (*bnd)->current_edge->top, manager, in do_maxima()
46 } else if ((*bnd)->ring || (*bndMaxPair)->ring) { in do_maxima()
50 *bnd = nullptr; in do_maxima()
[all …]
H A Dactive_bound_list.hpp36 for (auto const& bnd : bnds) { in operator <<() local
38 out << *bnd; in operator <<()
48 for (auto const& bnd : bnds) { in output_edges() local
54 out << "[[" << bnd->current_edge->bot.x << "," << bnd->current_edge->bot.y << "],["; in output_edges()
55 out << bnd->current_edge->top.x << "," << bnd->current_edge->top.y << "]]"; in output_edges()
119 inline bool is_maxima(bound<T>& bnd, T y) { in is_maxima() argument
120 return bnd.next_edge == bnd.edges.end() && bnd.current_edge->top.y == y; in is_maxima()
124 inline bool is_maxima(active_bound_list_itr<T>& bnd, T y) { in is_maxima() argument
125 return is_maxima(*(*bnd), y); in is_maxima()
129 inline bool is_intermediate(bound<T>& bnd, T y) { in is_intermediate() argument
[all …]
H A Dprocess_horizontal.hpp40 auto bnd = std::next(horz_bound); in process_horizontal_left_to_right() local
42 while (bnd != active_bounds.end()) { in process_horizontal_left_to_right()
43 if (*bnd == nullptr) { in process_horizontal_left_to_right()
44 ++bnd; in process_horizontal_left_to_right()
51 hp_itr->x < wround<T>((*bnd)->current_x) && in process_horizontal_left_to_right()
59 if ((*bnd)->current_x > static_cast<double>((*horz_bound)->current_edge->top.x)) { in process_horizontal_left_to_right()
65 if (wround<T>((*bnd)->current_x) == (*horz_bound)->current_edge->top.x && in process_horizontal_left_to_right()
74 mapbox::geometry::point<T>(wround<T>((*bnd)->current_x), scanline_y), in process_horizontal_left_to_right()
80 if (is_maxima_edge && bnd == bound_max_pair) { in process_horizontal_left_to_right()
93 intersect_bounds(*(*horz_bound), *(*bnd), in process_horizontal_left_to_right()
[all …]
H A Dbound.hpp77 const bound<T>& bnd) { in operator <<() argument
78 out << " Bound: " << &bnd << std::endl; in operator <<()
79 out << " current_x: " << bnd.current_x << std::endl; in operator <<()
80 out << " last_point: " << bnd.last_point.x << ", " << bnd.last_point.y << std::endl; in operator <<()
81 out << *(bnd.current_edge); in operator <<()
82 out << " winding count: " << bnd.winding_count << std::endl; in operator <<()
83 out << " winding_count2: " << bnd.winding_count2 << std::endl; in operator <<()
84 out << " winding_delta: " << static_cast<int>(bnd.winding_delta) << std::endl; in operator <<()
85 out << " maximum_bound: " << bnd.maximum_bound << std::endl; in operator <<()
86 if (bnd.side == edge_left) { in operator <<()
[all …]
H A Dlocal_minimum_util.hpp67 bound<T> bnd; in create_bound_towards_minimum() local
68 std::swap(bnd.edges, edges); in create_bound_towards_minimum()
69 return bnd; in create_bound_towards_minimum()
103 bound<T> bnd; in create_bound_towards_minimum() local
105 std::swap(edges, bnd.edges); in create_bound_towards_minimum()
107 bnd.edges.reserve(static_cast<std::size_t>(std::distance(edges.begin(), next_edge))); in create_bound_towards_minimum()
108 std::move(edges.begin(), next_edge, std::back_inserter(bnd.edges)); in create_bound_towards_minimum()
111 std::reverse(bnd.edges.begin(), bnd.edges.end()); in create_bound_towards_minimum()
112 return bnd; in create_bound_towards_minimum()
118 bound<T> bnd; in create_bound_towards_maximum() local
[all …]
H A Dring_util.hpp31 void set_hole_state(bound<T>& bnd, in set_hole_state() argument
34 auto bnd_itr = std::find(active_bounds.rbegin(), active_bounds.rend(), &bnd); in set_hole_state()
53 bnd.ring->parent = nullptr; in set_hole_state()
54 rings.children.push_back(bnd.ring); in set_hole_state()
56 bnd.ring->parent = bndTmp->ring; in set_hole_state()
57 bndTmp->ring->children.push_back(bnd.ring); in set_hole_state()
166 bound<T>& bnd, in hot_pixel_set_left_to_right() argument
171 T x_min = get_edge_min_x(*(bnd.current_edge), y); in hot_pixel_set_left_to_right()
173 T x_max = get_edge_max_x(*(bnd.current_edge), y); in hot_pixel_set_left_to_right()
185 point_ptr<T> op = bnd.ring->points; in hot_pixel_set_left_to_right()
[all …]
H A Dsnap_rounding.hpp99 for (auto bnd = active_bounds.begin(); bnd != active_bounds.end();) { in process_hot_pixel_edges_at_top_of_scanbeam() local
100 if (*bnd == nullptr) { in process_hot_pixel_edges_at_top_of_scanbeam()
101 ++bnd; in process_hot_pixel_edges_at_top_of_scanbeam()
104 bound<T>& current_bound = *(*bnd); in process_hot_pixel_edges_at_top_of_scanbeam()
105 auto bnd_curr = bnd; in process_hot_pixel_edges_at_top_of_scanbeam()
121 ++bnd; in process_hot_pixel_edges_at_top_of_scanbeam()
H A Dintersect_util.hpp335 for (auto& bnd : active_bounds) { in update_current_x() local
336 bnd->pos = pos++; in update_current_x()
337 bnd->current_x = get_current_x(*bnd->current_edge, top_y); in update_current_x()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/util/
H A Dtile_cover_impl.cpp64 Bound bnd; in create_bound_towards_maximum() local
65 bnd.points.reserve(static_cast<std::size_t>(std::distance(begin, next_pt))); in create_bound_towards_maximum()
66 std::copy(begin, next_pt, std::back_inserter(bnd.points)); in create_bound_towards_maximum()
67 bnd.winding = true; in create_bound_towards_maximum()
68 return bnd; in create_bound_towards_maximum()
89 Bound bnd; in create_bound_towards_minimum() local
90 bnd.points.reserve(static_cast<std::size_t>(std::distance(begin, next_pt))); in create_bound_towards_minimum()
92 std::reverse_copy(begin, next_pt, std::back_inserter(bnd.points)); in create_bound_towards_minimum()
93 bnd.winding = false; in create_bound_towards_minimum()
94 return bnd; in create_bound_towards_minimum()
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8852be/phl/hal_g6/phy/rf/halrf_8852b/
H A Dhalrf_dpk_8852b.c665 u16 bnd[15] = {0xbf1, 0xaa5, 0x97d, 0x875, 0x789, in _dpk_dgain_mapping_8852b() local
670 if (dgain >= bnd[0]) in _dpk_dgain_mapping_8852b()
672 else if ((bnd[0] > dgain) && (dgain >= bnd[1])) in _dpk_dgain_mapping_8852b()
674 else if ((bnd[1] > dgain) && (dgain >= bnd[2])) in _dpk_dgain_mapping_8852b()
676 else if ((bnd[2] > dgain) && (dgain >= bnd[3])) in _dpk_dgain_mapping_8852b()
678 else if ((bnd[3] > dgain) && (dgain >= bnd[4])) in _dpk_dgain_mapping_8852b()
680 else if ((bnd[4] > dgain) && (dgain >= bnd[5])) in _dpk_dgain_mapping_8852b()
682 else if ((bnd[5] > dgain) && (dgain >= bnd[6])) in _dpk_dgain_mapping_8852b()
684 else if ((bnd[6] > dgain) && (dgain >= bnd[7])) in _dpk_dgain_mapping_8852b()
686 else if ((bnd[7] > dgain) && (dgain >= bnd[8])) in _dpk_dgain_mapping_8852b()
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8852bs/phl/hal_g6/phy/rf/halrf_8852b/
H A Dhalrf_dpk_8852b.c665 u16 bnd[15] = {0xbf1, 0xaa5, 0x97d, 0x875, 0x789, in _dpk_dgain_mapping_8852b() local
670 if (dgain >= bnd[0]) in _dpk_dgain_mapping_8852b()
672 else if ((bnd[0] > dgain) && (dgain >= bnd[1])) in _dpk_dgain_mapping_8852b()
674 else if ((bnd[1] > dgain) && (dgain >= bnd[2])) in _dpk_dgain_mapping_8852b()
676 else if ((bnd[2] > dgain) && (dgain >= bnd[3])) in _dpk_dgain_mapping_8852b()
678 else if ((bnd[3] > dgain) && (dgain >= bnd[4])) in _dpk_dgain_mapping_8852b()
680 else if ((bnd[4] > dgain) && (dgain >= bnd[5])) in _dpk_dgain_mapping_8852b()
682 else if ((bnd[5] > dgain) && (dgain >= bnd[6])) in _dpk_dgain_mapping_8852b()
684 else if ((bnd[6] > dgain) && (dgain >= bnd[7])) in _dpk_dgain_mapping_8852b()
686 else if ((bnd[7] > dgain) && (dgain >= bnd[8])) in _dpk_dgain_mapping_8852b()
[all …]
/OK3568_Linux_fs/kernel/arch/arm/boot/dts/
H A Drk3126-bnd-d708-avb.dts7 #include "rk3126-bnd-d708.dtsi"
10 model = "Rockchip RK3126 bnd-d708 board";
H A Drk3126-bnd-d708.dts7 #include "rk3126-bnd-d708.dtsi"
10 model = "Rockchip RK3126 bnd-d708 board";
/OK3568_Linux_fs/yocto/poky/bitbake/lib/toaster/toastergui/static/js/
H A Djsrender.min.js3bnd:a,unlinked:!0},tagName:":",cvt:e,flow:!0,tagCtx:n}),d&&(d.tag=o,o.linkCtx=d),n.ctx=L(n.ctx,(d?… property
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dsel-sched-ir.h239 #define BLIST_BND(L) (&(L)->u.bnd)
348 struct _bnd bnd; member
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dsel-sched-ir.h239 #define BLIST_BND(L) (&(L)->u.bnd)
348 struct _bnd bnd; member
/OK3568_Linux_fs/kernel/tools/arch/x86/lib/
H A Dx86-opcode-map.txt362 # bnd registers and Ev for everything else is OK because the instruction
/OK3568_Linux_fs/kernel/arch/x86/lib/
H A Dx86-opcode-map.txt362 # bnd registers and Ev for everything else is OK because the instruction
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/info/
H A Das.info11943 '-madd-bnd-prefix'
26487 * '-madd-bnd-prefix' option, i386: i386-Options. (line 159)
26488 * '-madd-bnd-prefix' option, x86-64: i386-Options. (line 159)
H A Dgdb.info21164 values present on bnd0raw and bnd registers are presented as follows:
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/info/
H A Das.info11943 '-madd-bnd-prefix'
26487 * '-madd-bnd-prefix' option, i386: i386-Options. (line 159)
26488 * '-madd-bnd-prefix' option, x86-64: i386-Options. (line 159)
H A Dgdb.info21164 values present on bnd0raw and bnd registers are presented as follows: