/dports/misc/vxl/vxl-3.3.2/core/vbl/tests/ |
H A D | vbl_test_local_minima.cxx | 23 bool success = !minima.empty(); in vbl_test_local_minima_1d() 24 for (double i : minima) in vbl_test_local_minima_1d() 27 success = success && minima[0] > 0 && minima[n / 2] > 0 && minima[n - 1] > 0; in vbl_test_local_minima_1d() 72 …success = success && minima[0][nc / 2] > 0 && minima[nr / 2][0] > 0 && minima[nr - 1][nc / 2] > 0 … in vbl_test_local_minima_2d() 73 …minima[nr / 2][nc - 1] > 0 && minima[0][0] > 0 && minima[nr - 1][0] > 0 && minima[0][nc - 1] > 0 && in vbl_test_local_minima_2d() 148 …success = success && minima[n1 / 2][n2 / 2][n3 / 2] > 0 && minima[0][0][0] > 0 && minima[n1 - 1][0… in vbl_test_local_minima_3d() 149 minima[0][n2 - 1][0] > 0 && minima[n1 - 1][n2 - 1][0] > 0 && minima[0][0][n3 - 1] > 0 && in vbl_test_local_minima_3d() 150 …minima[n1 - 1][0][n3 - 1] > 0 && minima[0][n2 - 1][n3 - 1] > 0 && minima[n1 - 1][n2 - 1][n3 - 1] >… in vbl_test_local_minima_3d() 152 …success = success && minima[n1 / 2][0][0] > 0 && minima[0][n2 / 2][0] > 0 && minima[0][0][n3 / 2] … in vbl_test_local_minima_3d() 153 … minima[n1 / 2][n2 - 1][0] > 0 && minima[n1 - 1][n2 / 2][0] > 0 && minima[n1 - 1][0][n3 / 2] > 0; in vbl_test_local_minima_3d() [all …]
|
/dports/lang/gleam/gleam-0.18.2/cargo-crates/smawk-0.3.1/src/ |
H A D | recursive.rs | 17 let mut minima = vec![0; matrix.nrows()]; in row_minima() localVariable 19 minima in row_minima() 30 minima in column_minima() 50 minima: &mut [usize], in recursive_inner() 62 minima[mid] = offset + min_idx; in recursive_inner() 88 let minima = vec![0]; in recursive_1x1() localVariable 99 let minima = vec![0, 0]; in recursive_2x1() localVariable 107 let minima = vec![1]; in recursive_1x2() localVariable 118 let minima = vec![1, 1]; in recursive_2x2() localVariable 130 let minima = vec![0, 0, 0]; in recursive_3x3() localVariable [all …]
|
H A D | brute_force.rs | 49 let minima = vec![0]; in brute_force_1x1() localVariable 50 assert_eq!(row_minima(&matrix), minima); in brute_force_1x1() 60 let minima = vec![0, 0]; in brute_force_2x1() localVariable 61 assert_eq!(row_minima(&matrix), minima); in brute_force_2x1() 68 let minima = vec![1]; in brute_force_1x2() localVariable 69 assert_eq!(row_minima(&matrix), minima); in brute_force_1x2() 79 let minima = vec![1, 1]; in brute_force_2x2() localVariable 80 assert_eq!(row_minima(&matrix), minima); in brute_force_2x2() 91 let minima = vec![0, 0, 0]; in brute_force_3x3() localVariable 104 let minima = vec![0, 0, 0, 0]; in brute_force_4x4() localVariable [all …]
|
H A D | lib.rs | 173 let mut minima = vec![0; matrix.nrows()]; in smawk_row_minima() localVariable 178 &mut minima, in smawk_row_minima() 180 minima in smawk_row_minima() 206 &mut minima, in smawk_column_minima() 208 minima in smawk_column_minima() 217 mut minima: &mut [usize], in smawk_inner() 253 minima[cols[c + 1]] in smawk_inner() 263 minima[col] = pair.1; in smawk_inner() 336 let row = minima[col]; in online_column_minima() 461 let minima = vec![(0, 0)]; in online_1x1() localVariable [all …]
|
/dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/smawk-0.3.1/src/ |
H A D | recursive.rs | 17 let mut minima = vec![0; matrix.nrows()]; in row_minima() localVariable 19 minima in row_minima() 30 minima in column_minima() 50 minima: &mut [usize], in recursive_inner() 62 minima[mid] = offset + min_idx; in recursive_inner() 88 let minima = vec![0]; in recursive_1x1() localVariable 99 let minima = vec![0, 0]; in recursive_2x1() localVariable 107 let minima = vec![1]; in recursive_1x2() localVariable 118 let minima = vec![1, 1]; in recursive_2x2() localVariable 130 let minima = vec![0, 0, 0]; in recursive_3x3() localVariable [all …]
|
H A D | brute_force.rs | 49 let minima = vec![0]; in brute_force_1x1() localVariable 50 assert_eq!(row_minima(&matrix), minima); in brute_force_1x1() 60 let minima = vec![0, 0]; in brute_force_2x1() localVariable 61 assert_eq!(row_minima(&matrix), minima); in brute_force_2x1() 68 let minima = vec![1]; in brute_force_1x2() localVariable 69 assert_eq!(row_minima(&matrix), minima); in brute_force_1x2() 79 let minima = vec![1, 1]; in brute_force_2x2() localVariable 80 assert_eq!(row_minima(&matrix), minima); in brute_force_2x2() 91 let minima = vec![0, 0, 0]; in brute_force_3x3() localVariable 104 let minima = vec![0, 0, 0, 0]; in brute_force_4x4() localVariable [all …]
|
H A D | lib.rs | 173 let mut minima = vec![0; matrix.nrows()]; in smawk_row_minima() localVariable 178 &mut minima, in smawk_row_minima() 180 minima in smawk_row_minima() 206 &mut minima, in smawk_column_minima() 208 minima in smawk_column_minima() 217 mut minima: &mut [usize], in smawk_inner() 253 minima[cols[c + 1]] in smawk_inner() 263 minima[col] = pair.1; in smawk_inner() 336 let row = minima[col]; in online_column_minima() 461 let minima = vec![(0, 0)]; in online_1x1() localVariable [all …]
|
/dports/devel/py-maturin/maturin-0.11.3/cargo-crates/smawk-0.3.1/src/ |
H A D | recursive.rs | 17 let mut minima = vec![0; matrix.nrows()]; in row_minima() localVariable 19 minima in row_minima() 30 minima in column_minima() 50 minima: &mut [usize], in recursive_inner() 62 minima[mid] = offset + min_idx; in recursive_inner() 88 let minima = vec![0]; in recursive_1x1() localVariable 99 let minima = vec![0, 0]; in recursive_2x1() localVariable 107 let minima = vec![1]; in recursive_1x2() localVariable 118 let minima = vec![1, 1]; in recursive_2x2() localVariable 130 let minima = vec![0, 0, 0]; in recursive_3x3() localVariable [all …]
|
H A D | brute_force.rs | 49 let minima = vec![0]; in brute_force_1x1() localVariable 50 assert_eq!(row_minima(&matrix), minima); in brute_force_1x1() 60 let minima = vec![0, 0]; in brute_force_2x1() localVariable 61 assert_eq!(row_minima(&matrix), minima); in brute_force_2x1() 68 let minima = vec![1]; in brute_force_1x2() localVariable 69 assert_eq!(row_minima(&matrix), minima); in brute_force_1x2() 79 let minima = vec![1, 1]; in brute_force_2x2() localVariable 80 assert_eq!(row_minima(&matrix), minima); in brute_force_2x2() 91 let minima = vec![0, 0, 0]; in brute_force_3x3() localVariable 104 let minima = vec![0, 0, 0, 0]; in brute_force_4x4() localVariable [all …]
|
H A D | lib.rs | 173 let mut minima = vec![0; matrix.nrows()]; in smawk_row_minima() localVariable 178 &mut minima, in smawk_row_minima() 180 minima in smawk_row_minima() 206 &mut minima, in smawk_column_minima() 208 minima in smawk_column_minima() 217 mut minima: &mut [usize], in smawk_inner() 253 minima[cols[c + 1]] in smawk_inner() 263 minima[col] = pair.1; in smawk_inner() 336 let row = minima[col]; in online_column_minima() 461 let minima = vec![(0, 0)]; in online_1x1() localVariable [all …]
|
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-input/src/main/java/de/lmu/ifi/dbs/elki/datasource/filter/normalization/columnwise/ |
H A D | AttributeWiseMinMaxNormalization.java | 68 private double[] minima; field in AttributeWiseMinMaxNormalization 90 this.minima = minima != null ? minima : EMPTY_ARRAY; in AttributeWiseMinMaxNormalization() 96 return (minima.length == 0 || maxima.length == 0); in prepareStart() 102 if(minima.length == 0 || maxima.length == 0) { in prepareProcessInstance() 104 minima = new double[dimensionality]; in prepareProcessInstance() 108 minima[i] = Double.MAX_VALUE; in prepareProcessInstance() 120 minima[d] = val; in prepareProcessInstance() 160 …return maxima[dimension] > minima[dimension] ? maxima[dimension] - minima[dimension] : maxima[dime… in factor() 231 private double[] minima = EMPTY_ARRAY; field in AttributeWiseMinMaxNormalization.Parameterizer 239 minima = minimaP.getValue().clone(); in makeOptions() [all …]
|
/dports/graphics/ocrad/ocrad-0.27/ |
H A D | feats_test0.cc | 92 const int lm = lp.minima(), rm = rp.minima(); in test_235Esz() 161 if( tp.minima( b.height() / 4 ) != 1 || bp.minima( b.height() / 4 ) != 1 ) in test_EFIJLlT() 269 tp.minima() == 1 && bp.minima() == 1 ) in test_EFIJLlT() 359 if( bp.minima( b.height() / 4 ) != 1 || tp.minima( b.height() / 2 ) != 1 || in test_frst() 513 if( tp.minima( b.height() / 5 ) == 2 && tp.minima( b.height() / 4 ) == 2 && in test_HKMNUuvwYy() 770 if( tp.minima() == 1 && bp.minima() == 1 && rp.istip() ) in test_line() 794 if( lp.minima() == 1 && rp.minima() == 1 && 2 * b.height() >= b.width() && in test_line() 826 if( lp.minima() == 1 && rp.minima() == 1 ) in test_line() 842 if( slope1 < 0 && slope2 < 0 && lp.minima() == 1 && rp.minima() == 2 ) in test_line() 844 if( slope1 > 0 && slope2 > 0 && lp.minima() == 2 && rp.minima() == 1 ) in test_line() [all …]
|
H A D | feats_test1.cc | 41 if( bp.minima( b.height() / 10 + 1 ) == 2 && bp.isctip() && tp.minima() == 1 ) in test_49ARegpq() 101 if( bp.minima() == 1 ) in test_49ARegpq() 119 tp.minima() == 2 && bp.minima() == 2 && !rp.isconvex() ) return '#'; in test_4ADQao() 120 if( tp.minima() == 1 && bp.minima() == 1 ) in test_4ADQao() 140 const int m = bp.minima(); in test_4ADQao() 154 if( bp.minima() > 1 || rp.minima() > 1 || b.test_Q() ) in test_4ADQao() 164 tp.minima() == 1 && bp.minima() == 1 ) return 'D'; in test_4ADQao() 166 ( bp.minima() > 1 || rp.minima() > 1 ) ) return 'a'; in test_4ADQao() 179 ( bp.minima( b.height() / 4 ) != 1 || tp.minima( h.vcenter() - b.top() ) != 1 ) ) return 0; in test_6abd() 216 const int m = tp.minima( b.height() / 2 ); in test_6abd() [all …]
|
/dports/misc/vxl/vxl-3.3.2/core/vbl/ |
H A D | vbl_local_minima.hxx | 16 assert(minima.size()==n); in local_minima() 23 minima[i] = T(0); in local_minima() 31 minima[c]=dmin; in local_minima() 38 minima[0]=in[1]-in[0]; in local_minima() 54 assert(nr==minima.rows() && nc==minima.cols()); in local_minima() 63 minima[r][c] = T(0); in local_minima() 146 minima[0][c] = dmin; in local_minima() 205 minima[r][0] = dmin; in local_minima() 260 minima[0][0] = dmin; in local_minima() 281 minima[0][nc-1] = dmin; in local_minima() [all …]
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/docs/static_site/src/_sass/ |
H A D | minima.scss | 21 @import "minima/simple-grid"; 71 "minima/base", 72 "minima/layout", 73 "minima/syntax-highlighting", 74 "minima/home", 75 "minima/blog", 76 "minima/features", 77 "minima/ecosystem", 78 "minima/docs", 79 "minima/getting_started", [all …]
|
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/docs/static_site/src/_sass/ |
H A D | minima.scss | 21 @import "minima/simple-grid"; 71 "minima/base", 72 "minima/layout", 73 "minima/syntax-highlighting", 74 "minima/home", 75 "minima/blog", 76 "minima/features", 77 "minima/ecosystem", 78 "minima/docs", 79 "minima/getting_started", [all …]
|
/dports/multimedia/gstreamer1-plugins-rust/gst-plugins-rs-d0466b3eee114207f851b37cae0015c0e718f021/cargo-crates/textwrap-0.14.2/src/wrap_algorithms/ |
H A D | optimal_fit.rs | 39 fn get<T>(&self, i: usize, minima: &[(usize, T)]) -> usize { in get() 42 let line_number = 1 + self.get(minima[pos].0, &minima); in get() 194 let minima = smawk::online_column_minima(0, widths.len(), |minima, i, j| { in wrap_optimal_fit() localVariable 196 let line_number = line_numbers.get(i, &minima); in wrap_optimal_fit() 214 let mut cost = minima[i].1 + NLINE_PENALTY; in wrap_optimal_fit() 243 let mut lines = Vec::with_capacity(line_numbers.get(fragments.len(), &minima)); in wrap_optimal_fit() 246 let prev = minima[pos].0; in wrap_optimal_fit()
|
/dports/lang/gleam/gleam-0.18.2/cargo-crates/textwrap-0.14.2/src/wrap_algorithms/ |
H A D | optimal_fit.rs | 39 fn get<T>(&self, i: usize, minima: &[(usize, T)]) -> usize { in get() 42 let line_number = 1 + self.get(minima[pos].0, &minima); in get() 194 let minima = smawk::online_column_minima(0, widths.len(), |minima, i, j| { in wrap_optimal_fit() localVariable 196 let line_number = line_numbers.get(i, &minima); in wrap_optimal_fit() 214 let mut cost = minima[i].1 + NLINE_PENALTY; in wrap_optimal_fit() 243 let mut lines = Vec::with_capacity(line_numbers.get(fragments.len(), &minima)); in wrap_optimal_fit() 246 let prev = minima[pos].0; in wrap_optimal_fit()
|
/dports/accessibility/wl-gammarelay-rs/wl-gammarelay-rs-0.2.1/cargo-crates/textwrap-0.14.2/src/wrap_algorithms/ |
H A D | optimal_fit.rs | 39 fn get<T>(&self, i: usize, minima: &[(usize, T)]) -> usize { in get() 42 let line_number = 1 + self.get(minima[pos].0, &minima); in get() 194 let minima = smawk::online_column_minima(0, widths.len(), |minima, i, j| { in wrap_optimal_fit() localVariable 196 let line_number = line_numbers.get(i, &minima); in wrap_optimal_fit() 214 let mut cost = minima[i].1 + NLINE_PENALTY; in wrap_optimal_fit() 243 let mut lines = Vec::with_capacity(line_numbers.get(fragments.len(), &minima)); in wrap_optimal_fit() 246 let prev = minima[pos].0; in wrap_optimal_fit()
|
/dports/converters/yj-bruceadams/yj-1.1.34/cargo-crates/textwrap-0.14.2/src/wrap_algorithms/ |
H A D | optimal_fit.rs | 39 fn get<T>(&self, i: usize, minima: &[(usize, T)]) -> usize { in get() 42 let line_number = 1 + self.get(minima[pos].0, &minima); in get() 194 let minima = smawk::online_column_minima(0, widths.len(), |minima, i, j| { in wrap_optimal_fit() localVariable 196 let line_number = line_numbers.get(i, &minima); in wrap_optimal_fit() 214 let mut cost = minima[i].1 + NLINE_PENALTY; in wrap_optimal_fit() 243 let mut lines = Vec::with_capacity(line_numbers.get(fragments.len(), &minima)); in wrap_optimal_fit() 246 let prev = minima[pos].0; in wrap_optimal_fit()
|
/dports/www/firefox/firefox-99.0/third_party/rust/textwrap/src/wrap_algorithms/ |
H A D | optimal_fit.rs | 39 fn get<T>(&self, i: usize, minima: &[(usize, T)]) -> usize { in get() 42 let line_number = 1 + self.get(minima[pos].0, &minima); in get() 194 let minima = smawk::online_column_minima(0, widths.len(), |minima, i, j| { in wrap_optimal_fit() localVariable 196 let line_number = line_numbers.get(i, &minima); in wrap_optimal_fit() 214 let mut cost = minima[i].1 + NLINE_PENALTY; in wrap_optimal_fit() 243 let mut lines = Vec::with_capacity(line_numbers.get(fragments.len(), &minima)); in wrap_optimal_fit() 246 let prev = minima[pos].0; in wrap_optimal_fit()
|
/dports/x11/swayr/swayr-v0.11.2/cargo-crates/textwrap-0.14.2/src/wrap_algorithms/ |
H A D | optimal_fit.rs | 39 fn get<T>(&self, i: usize, minima: &[(usize, T)]) -> usize { in get() 42 let line_number = 1 + self.get(minima[pos].0, &minima); in get() 194 let minima = smawk::online_column_minima(0, widths.len(), |minima, i, j| { in wrap_optimal_fit() localVariable 196 let line_number = line_numbers.get(i, &minima); in wrap_optimal_fit() 214 let mut cost = minima[i].1 + NLINE_PENALTY; in wrap_optimal_fit() 243 let mut lines = Vec::with_capacity(line_numbers.get(fragments.len(), &minima)); in wrap_optimal_fit() 246 let prev = minima[pos].0; in wrap_optimal_fit()
|
/dports/textproc/jql/jql-3.0.6/cargo-crates/textwrap-0.14.2/src/wrap_algorithms/ |
H A D | optimal_fit.rs | 39 fn get<T>(&self, i: usize, minima: &[(usize, T)]) -> usize { in get() 42 let line_number = 1 + self.get(minima[pos].0, &minima); in get() 194 let minima = smawk::online_column_minima(0, widths.len(), |minima, i, j| { in wrap_optimal_fit() localVariable 196 let line_number = line_numbers.get(i, &minima); in wrap_optimal_fit() 214 let mut cost = minima[i].1 + NLINE_PENALTY; in wrap_optimal_fit() 243 let mut lines = Vec::with_capacity(line_numbers.get(fragments.len(), &minima)); in wrap_optimal_fit() 246 let prev = minima[pos].0; in wrap_optimal_fit()
|
/dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/textwrap-0.14.2/src/wrap_algorithms/ |
H A D | optimal_fit.rs | 39 fn get<T>(&self, i: usize, minima: &[(usize, T)]) -> usize { in get() 42 let line_number = 1 + self.get(minima[pos].0, &minima); in get() 194 let minima = smawk::online_column_minima(0, widths.len(), |minima, i, j| { in wrap_optimal_fit() localVariable 196 let line_number = line_numbers.get(i, &minima); in wrap_optimal_fit() 214 let mut cost = minima[i].1 + NLINE_PENALTY; in wrap_optimal_fit() 243 let mut lines = Vec::with_capacity(line_numbers.get(fragments.len(), &minima)); in wrap_optimal_fit() 246 let prev = minima[pos].0; in wrap_optimal_fit()
|
/dports/www/miniserve/miniserve-0.18.0/cargo-crates/textwrap-0.14.2/src/wrap_algorithms/ |
H A D | optimal_fit.rs | 39 fn get<T>(&self, i: usize, minima: &[(usize, T)]) -> usize { in get() 42 let line_number = 1 + self.get(minima[pos].0, &minima); in get() 194 let minima = smawk::online_column_minima(0, widths.len(), |minima, i, j| { in wrap_optimal_fit() localVariable 196 let line_number = line_numbers.get(i, &minima); in wrap_optimal_fit() 214 let mut cost = minima[i].1 + NLINE_PENALTY; in wrap_optimal_fit() 243 let mut lines = Vec::with_capacity(line_numbers.get(fragments.len(), &minima)); in wrap_optimal_fit() 246 let prev = minima[pos].0; in wrap_optimal_fit()
|