| /dports/games/0ad/0ad-0.0.23b-alpha/source/lib/ |
| H A D | bits.h | 97 inline T bits(T num, size_t lo_idx, size_t hi_idx) in bits() argument
99 const size_t numBits = (hi_idx - lo_idx)+1; // # bits to return in bits()
100 T result = T(num >> lo_idx); in bits()
113 inline T SetBitsTo(T num, size_t lo_idx, size_t hi_idx, size_t value) in SetBitsTo() argument
115 const size_t numBits = (hi_idx - lo_idx)+1; in SetBitsTo()
117 const T mask = bit_mask<T>(numBits) << lo_idx; in SetBitsTo()
119 result = T(result | (value << lo_idx)); in SetBitsTo()
|
| /dports/graphics/dssim/dssim-3.1.2/cargo-crates/libaom-sys-0.9.1/vendor/av1/encoder/ |
| H A D | intra_mode_search_utils.h | 110 int lo_idx = 0, hi_idx = BINS - 1; in get_hist_bin_idx() local
114 lo_idx = 0; in get_hist_bin_idx()
117 lo_idx = 8; in get_hist_bin_idx()
120 lo_idx = 16; in get_hist_bin_idx()
123 lo_idx = 24; in get_hist_bin_idx()
127 for (int idx = lo_idx; idx <= hi_idx; idx++) { in get_hist_bin_idx()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libaom/source/libaom/av1/encoder/ |
| H A D | intra_mode_search_utils.h | 96 int lo_idx = 0, hi_idx = BINS - 1; in get_hist_bin_idx() local
100 lo_idx = 0; in get_hist_bin_idx()
103 lo_idx = 8; in get_hist_bin_idx()
106 lo_idx = 16; in get_hist_bin_idx()
109 lo_idx = 24; in get_hist_bin_idx()
113 for (int idx = lo_idx; idx <= hi_idx; idx++) { in get_hist_bin_idx()
|
| /dports/science/axom/axom-0.6.1/src/axom/primal/tests/ |
| H A D | primal_clip.cpp | 308 int lo_idx = -1, hi_idx = -1; in unit_check_poly_clip() local
313 lo_idx = i; in unit_check_poly_clip()
322 EXPECT_NE(lo_idx, -1); in unit_check_poly_clip()
330 expectedNbrs[0] = {3, lo_idx}; in unit_check_poly_clip()
331 expectedNbrs[1] = {2, lo_idx}; in unit_check_poly_clip()
334 expectedNbrs[lo_idx] = {0, 1}; in unit_check_poly_clip()
|
| /dports/multimedia/aom/aom-3.2.0/av1/encoder/ |
| H A D | intra_mode_search_utils.h | 112 int lo_idx = 0, hi_idx = BINS - 1; in get_hist_bin_idx() local
116 lo_idx = 0; in get_hist_bin_idx()
119 lo_idx = 8; in get_hist_bin_idx()
122 lo_idx = 16; in get_hist_bin_idx()
125 lo_idx = 24; in get_hist_bin_idx()
129 for (int idx = lo_idx; idx <= hi_idx; idx++) { in get_hist_bin_idx()
|
| /dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.h | 215 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx);
353 avl_slice(avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param);
|
| H A D | avl.c | 1082 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx) in avl_span() argument
1084 *lo_idx = t->count + 1; in avl_span()
1122 *lo_idx = n + get_rank (a); in avl_span()
2169 avl_slice (avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param) in avl_slice() argument
2176 if (lo_idx > hi_idx || lo_idx > t->count) in avl_slice()
2178 if (lo_idx < 1) in avl_slice()
2179 lo_idx = 1; in avl_slice()
2198 if (lo_idx < hi_idx) in avl_slice()
2200 avl_node *cur = node_find_index (lo_idx, t); in avl_slice()
2202 if (node_slice (&tt->root, &cur, t, tt->count = hi_idx - lo_idx) < 0) in avl_slice()
|
| /dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.h | 215 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx);
353 avl_slice(avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param);
|
| H A D | avl.c | 1082 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx) in avl_span() argument
1084 *lo_idx = t->count + 1; in avl_span()
1122 *lo_idx = n + get_rank (a); in avl_span()
2169 avl_slice (avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param) in avl_slice() argument
2176 if (lo_idx > hi_idx || lo_idx > t->count) in avl_slice()
2178 if (lo_idx < 1) in avl_slice()
2179 lo_idx = 1; in avl_slice()
2198 if (lo_idx < hi_idx) in avl_slice()
2200 avl_node *cur = node_find_index (lo_idx, t); in avl_slice()
2202 if (node_slice (&tt->root, &cur, t, tt->count = hi_idx - lo_idx) < 0) in avl_slice()
|
| /dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.h | 215 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx);
353 avl_slice(avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param);
|
| H A D | avl.c | 1082 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx) in avl_span() argument
1084 *lo_idx = t->count + 1; in avl_span()
1122 *lo_idx = n + get_rank (a); in avl_span()
2169 avl_slice (avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param) in avl_slice() argument
2176 if (lo_idx > hi_idx || lo_idx > t->count) in avl_slice()
2178 if (lo_idx < 1) in avl_slice()
2179 lo_idx = 1; in avl_slice()
2198 if (lo_idx < hi_idx) in avl_slice()
2200 avl_node *cur = node_find_index (lo_idx, t); in avl_slice()
2202 if (node_slice (&tt->root, &cur, t, tt->count = hi_idx - lo_idx) < 0) in avl_slice()
|
| /dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.h | 215 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx);
353 avl_slice(avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param);
|
| H A D | avl.c | 1082 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx) in avl_span() argument
1084 *lo_idx = t->count + 1; in avl_span()
1122 *lo_idx = n + get_rank (a); in avl_span()
2169 avl_slice (avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param) in avl_slice() argument
2176 if (lo_idx > hi_idx || lo_idx > t->count) in avl_slice()
2178 if (lo_idx < 1) in avl_slice()
2179 lo_idx = 1; in avl_slice()
2198 if (lo_idx < hi_idx) in avl_slice()
2200 avl_node *cur = node_find_index (lo_idx, t); in avl_slice()
2202 if (node_slice (&tt->root, &cur, t, tt->count = hi_idx - lo_idx) < 0) in avl_slice()
|
| /dports/print/tex-aleph/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.h | 215 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx);
353 avl_slice(avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param);
|
| H A D | avl.c | 1082 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx) in avl_span() argument
1084 *lo_idx = t->count + 1; in avl_span()
1122 *lo_idx = n + get_rank (a); in avl_span()
2169 avl_slice (avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param) in avl_slice() argument
2176 if (lo_idx > hi_idx || lo_idx > t->count) in avl_slice()
2178 if (lo_idx < 1) in avl_slice()
2179 lo_idx = 1; in avl_slice()
2198 if (lo_idx < hi_idx) in avl_slice()
2200 avl_node *cur = node_find_index (lo_idx, t); in avl_slice()
2202 if (node_slice (&tt->root, &cur, t, tt->count = hi_idx - lo_idx) < 0) in avl_slice()
|
| /dports/print/tex-luatex/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.h | 215 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx);
353 avl_slice(avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param);
|
| H A D | avl.c | 1082 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx) in avl_span() argument
1084 *lo_idx = t->count + 1; in avl_span()
1122 *lo_idx = n + get_rank (a); in avl_span()
2169 avl_slice (avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param) in avl_slice() argument
2176 if (lo_idx > hi_idx || lo_idx > t->count) in avl_slice()
2178 if (lo_idx < 1) in avl_slice()
2179 lo_idx = 1; in avl_slice()
2198 if (lo_idx < hi_idx) in avl_slice()
2200 avl_node *cur = node_find_index (lo_idx, t); in avl_slice()
2202 if (node_slice (&tt->root, &cur, t, tt->count = hi_idx - lo_idx) < 0) in avl_slice()
|
| /dports/print/tex-xetex/texlive-20150521-source/texk/web2c/mplibdir/ |
| H A D | avl.h | 215 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx);
353 avl_slice(avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param);
|
| H A D | avl.c | 1082 avl_tree t, avl_size_t * lo_idx, avl_size_t * hi_idx) in avl_span() argument
1084 *lo_idx = t->count + 1; in avl_span()
1122 *lo_idx = n + get_rank (a); in avl_span()
2169 avl_slice (avl_tree t, avl_size_t lo_idx, avl_size_t hi_idx, void *param) in avl_slice() argument
2176 if (lo_idx > hi_idx || lo_idx > t->count) in avl_slice()
2178 if (lo_idx < 1) in avl_slice()
2179 lo_idx = 1; in avl_slice()
2198 if (lo_idx < hi_idx) in avl_slice()
2200 avl_node *cur = node_find_index (lo_idx, t); in avl_slice()
2202 if (node_slice (&tt->root, &cur, t, tt->count = hi_idx - lo_idx) < 0) in avl_slice()
|
| /dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_span-718.0.0/src/ |
| H A D | caching_source_map_view.rs | 176 let (lo_idx, hi_idx) = match (lo_cache_idx, hi_cache_idx) { in span_data_to_lines_and_cols()
213 let lo = &self.line_cache[lo_idx]; in span_data_to_lines_and_cols()
|
| /dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_span-722.0.0/src/ |
| H A D | caching_source_map_view.rs | 176 let (lo_idx, hi_idx) = match (lo_cache_idx, hi_cache_idx) { in span_data_to_lines_and_cols()
213 let lo = &self.line_cache[lo_idx]; in span_data_to_lines_and_cols()
|
| /dports/lang/rust/rustc-1.58.1-src/compiler/rustc_span/src/ |
| H A D | caching_source_map_view.rs | 176 let (lo_idx, hi_idx) = match (lo_cache_idx, hi_cache_idx) { in span_data_to_lines_and_cols()
213 let lo = &self.line_cache[lo_idx]; in span_data_to_lines_and_cols()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/rustc-ap-rustc_span/src/ |
| H A D | caching_source_map_view.rs | 176 let (lo_idx, hi_idx) = match (lo_cache_idx, hi_cache_idx) { in span_data_to_lines_and_cols()
213 let lo = &self.line_cache[lo_idx]; in span_data_to_lines_and_cols()
|
| /dports/math/octave-forge-image/image-2.12.0/inst/ |
| H A D | stretchlim.m | 127 lo_idx = floor (tol(1) * plane_length) + 1; variable
130 if (lo_idx == 1 && hi_idx == plane_length)
136 lo_hi_idx = [lo_idx; hi_idx] .+ strides;
|
| H A D | imadjust.m | 211 lo_idx = [1 repmat({":"}, 1, ndims (in))]; variable
214 li = in(lo_idx{:});
230 lo = out(lo_idx{:});
|