Home
last modified time | relevance | path

Searched refs:depths (Results 1 – 25 of 3738) sorted by relevance

12345678910>>...150

/dports/games/xmris/xmris.4.04/
H A Dmove.c33 max = cptr[0].depths[2] < cptr[CELL_STRIDE].depths[2] ?
34 cptr[CELL_STRIDE].depths[2] : cptr[0].depths[2];
51 min = cptr[0].depths[3] > cptr[CELL_STRIDE].depths[3] ?
52 cptr[CELL_STRIDE].depths[3] : cptr[0].depths[3];
705 ((cptr[0].depths[1] - cptr[CELL_STRIDE * 2].depths[0] >=
708 cptr[CELL_STRIDE - 1].depths[3] + cptr[0].depths[1] >=
791 ((cptr[-2].depths[3] - cptr[0].depths[2] >=
1010 &sptr[!!(cptr[0].depths[0] || cptr[0].depths[2])]);
1014 &sptr[!!(cptr[0].depths[0] || cptr[0].depths[3])]);
1018 &sptr[!!(cptr[0].depths[1] || cptr[0].depths[3])]);
[all …]
/dports/databases/grass7/grass-7.8.6/lib/raster3d/test/
H A Dtest_put_get_value_large_file.c81 region.depths = depths; in test_large_file()
95 G_percent(z, region.depths, 1); in test_large_file()
128 G_percent(z, region.depths, 1); in test_large_file()
176 region.depths = depths; in test_large_file_zeros()
189 G_percent(z, region.depths, 1); in test_large_file_zeros()
210 G_percent(z, region.depths, 1); in test_large_file_zeros()
258 region.depths = depths; in test_large_file_random()
279 G_percent(z, region.depths, 1); in test_large_file_random()
305 G_percent(z, region.depths, 1); in test_large_file_random()
358 region.depths = depths; in test_large_file_sparse_random()
[all …]
H A Dtest_main.c24 struct Option *unit, *integration, *depths, *rows, *cols, *tile_size; member
45 param.depths = G_define_option(); in set_params()
46 param.depths->key = "depths"; in set_params()
47 param.depths->type = TYPE_INTEGER; in set_params()
48 param.depths->required = NO; in set_params()
49 param.depths->answer = "20"; in set_params()
50 …param.depths->description = "The number of depths to be used for the large file put/get value test… in set_params()
89 int depths, rows, cols, tile_size; in main() local
107 depths = atoi(param.depths->answer); in main()
128 returnstat += unit_test_put_get_value_large_file(depths, rows, cols, tile_size); in main()
[all …]
/dports/math/R-cran-ddalpha/ddalpha/R/
H A Ddepth.contours.r171 if(is.na(depths) || is.null(depths))
172 depths = 10
173 if(length(depths) == 1 && depths > 1)
174 depths = seq(0.0001, 1, length.out = depths)
204 if(is.na(depths) || is.null(depths))
206 if(length(depths) == 1 && depths > 1)
207 depths = seq(0.0001, 1, length.out = depths)
234 if(is.na(depths) || is.null(depths))
237 if(length(depths) == 1 && depths > 1)
274 if(is.na(depths) || is.null(depths))
[all …]
H A Dseparator.polynomial.r11 rbind(ddalpha$patterns[[i]]$depths,
20 rbind(ddalpha$patterns[[i]]$depths, ddalpha$patterns[[j]]$depths),
116 val <- depths[i,1]
119 if(depths[i,2] > res){
127 val <- depths[i,1]
130 if(depths[i,2] < res){
139 …res = (colSums(sapply(depths[,1], '^', (1:length(polynomial)))*polynomial) - depths[,2])*c(rep(-1,…
159 val <- depths[i,1]
162 if(depths[i,2] > res){
168 val <- depths[i,1]
[all …]
H A Dddalpha.classify.r55 depths <- matrix(nrow=0, ncol=ddalpha$numPatterns) #? functionVar
75 depths <- matrix(nrow=0, ncol=ddalpha$numPatterns)
85 depths <- objects,
89 for (i in 1:nrow(depths)){
90 if (sum(depths[i,]) > 0){
98 depths <- suppressWarnings( as.matrix(depths[classifiableIndices,,drop=F],
109 if (nrow(depths) > 0){
118 …votes <- matrix(rep(0, nrow(depths)*ddalpha$numPatterns), nrow=nrow(depths), ncol=ddalpha$numPatte…
125 for (obj in 1:nrow(depths)){
133 for (i in 1:nrow(depths)){
[all …]
H A Ddepth.qhpeeling.r17 ddalpha$patterns[[i]]$depths =
25 depths <- NULL functionVar
42 depths <- cbind(depths, ds)
44 return (depths)
74 depths <- rep(0, nrow(x)) functionVar
80 depths <- depths + as.vector(is.in.convex(x, tmpData, nrow(tmpData)))
84 return (depths / nrow(data))
/dports/databases/grass7/grass-7.8.6/raster3d/r3.out.vtk/
H A DwriteVTKData.c106 int rows, cols, depths; in write_vtk_points() local
117 depths = region.depths; in write_vtk_points()
124 for (z = 0; z < depths; z++) { in write_vtk_points()
250 int rows, cols, depths, count; in write_vtk_unstructured_grid_cells() local
254 depths = region.depths; in write_vtk_unstructured_grid_cells()
265 for (z = 0; z < depths; z++) { in write_vtk_unstructured_grid_cells()
326 depths = region.depths; in write_vtk_data()
391 int rows, cols, depths; in write_vtk_rgb_data() local
399 depths = region.depths; in write_vtk_rgb_data()
466 int rows, cols, depths; in write_vtk_vector_data() local
[all …]
/dports/graphics/blender/blender-2.91.0/source/blender/bmesh/tools/
H A Dbmesh_path_region_uv.c81 return (((depths[0][index] != -1) && (depths[1][index] != -1)) && in bm_loop_region_test()
82 ((depths[0][index] + depths[1][index]) < pass)); in bm_loop_region_test()
89 if (bm_loop_region_test(l, depths, pass)) { in bm_loop_region_test_chain()
103 return bm_loop_region_test(l, depths, pass); in bm_loop_region_test_chain()
169 int *depths[2] = {NULL}; in mesh_calc_path_region_elem() local
191 depths[side] = MEM_mallocN(sizeof(*depths[side]) * bm->totloop, __func__); in mesh_calc_path_region_elem()
192 copy_vn_i(depths[side], bm->totloop, -1); in mesh_calc_path_region_elem()
218 depths[side][l_end_index] = 0; in mesh_calc_path_region_elem()
250 depths[side][BM_elem_index_get(l_iter)] = depths[side][l_a_index]; in mesh_calc_path_region_elem()
396 if (depths[side]) { in mesh_calc_path_region_elem()
[all …]
H A Dbmesh_path_region.c83 return (((depths[0][index] != -1) && (depths[1][index] != -1)) && in bm_vert_region_test()
84 ((depths[0][index] + depths[1][index]) < pass)); in bm_vert_region_test()
91 if (bm_vert_region_test(v, depths, pass)) { in bm_vert_region_test_chain()
105 return bm_vert_region_test(v, depths, pass); in bm_vert_region_test_chain()
166 int *depths[2] = {NULL}; in mesh_calc_path_region_elem() local
188 depths[side] = MEM_mallocN(sizeof(*depths[side]) * bm->totvert, __func__); in mesh_calc_path_region_elem()
189 copy_vn_i(depths[side], bm->totvert, -1); in mesh_calc_path_region_elem()
197 depths[side][BM_elem_index_get(v)] = 0; in mesh_calc_path_region_elem()
215 depths[side][v_end_index] = 0; in mesh_calc_path_region_elem()
379 if (depths[side]) { in mesh_calc_path_region_elem()
[all …]
/dports/math/R-cran-recipes/recipes/tests/testthat/
H A Dtest_depth.R10 depths <- bake(trained, new_data = iris) globalVar
11 depths <- depths[, grepl("depth", names(depths))] globalVar
12 depths <- as.data.frame(depths) globalVar
22 expect_equal(depths[, i], exp_res[, i])
44 depths <- bake(trained, new_data = iris) globalVar
45 depths <- depths[, grepl("depth", names(depths))] globalVar
46 depths <- as.data.frame(depths) globalVar
56 head(depths)
59 expect_equal(depths[, i], exp_res[, i])
/dports/databases/grass7/grass-7.8.6/lib/raster3d/testsuite/
H A Draster3d_lib_test.py23 self.assertModule("test.raster3d.lib", unit="large", depths=91, rows=89, cols=87)
24 …self.assertModule("test.raster3d.lib", unit="large", depths=91, rows=89, cols=87, tile_size=8)
25 …self.assertModule("test.raster3d.lib", unit="large", depths=91, rows=89, cols=87, tile_size=5…
26 …self.assertModule("test.raster3d.lib", unit="large", depths=91, rows=89, cols=87, tile_size=1…
27 …self.assertModule("test.raster3d.lib", unit="large", depths=91, rows=89, cols=87, tile_size=3…
30 … self.assertModule("test.raster3d.lib", flags="l", unit="large", depths=91, rows=89, cols=87)
31 …self.assertModule("test.raster3d.lib", flags="l", unit="large", depths=91, rows=89, cols=87, …
32 …self.assertModule("test.raster3d.lib", flags="l", unit="large", depths=91, rows=89, cols=87, …
33 …self.assertModule("test.raster3d.lib", flags="l", unit="large", depths=91, rows=89, cols=87, …
34 …self.assertModule("test.raster3d.lib", flags="l", unit="large", depths=91, rows=89, cols=87, …
/dports/editors/calligra/calligra-3.2.1/sheets/tests/
H A DTestDependencies.cpp95 QMap<Cell, int> depths = m_map->dependencyManager()->depths(); in testDepths() local
96 QCOMPARE(depths[a1], 0); in testDepths()
97 QCOMPARE(depths[a2], 1); in testDepths()
98 QCOMPARE(depths[a3], 2); in testDepths()
99 QCOMPARE(depths[a4], 3); in testDepths()
104 depths = m_map->dependencyManager()->depths(); in testDepths()
105 QCOMPARE(depths[a1], 0); in testDepths()
106 QCOMPARE(depths[a2], 0); in testDepths()
107 QCOMPARE(depths[a3], 1); in testDepths()
108 QCOMPARE(depths[a4], 2); in testDepths()
/dports/graphics/vigra/vigra-8acd73a/include/vigra/random_forest/
H A Drf_earlystopping.hxx68 ArrayVector<double> depths; member in vigra::StopAfterTree
90 depths.push_back(double(k+1)/double(SB::tree_count_)); in after_prediction()
95 depths.push_back(double(k+1)/double(SB::tree_count_)); in after_prediction()
110 ArrayVector<double> depths; member in vigra::StopAfterVoteCount
125 depths.push_back(double(k+1)/double(SB::tree_count_)); in after_prediction()
161 ArrayVector<double> depths; member in vigra::StopIfConverging
226 ArrayVector<double> depths; member in vigra::StopIfMargin
298 ArrayVector<double> depths; member in vigra::StopIfBinTest
343 depths.push_back(double(k+1)/double(SB::tree_count_)); in after_prediction()
379 ArrayVector<double> depths; member in vigra::StopIfProb
[all …]
/dports/devel/hyperscan/hyperscan-5.4.0/src/nfagraph/
H A Dng_som_add_redundancy.cpp82 const vector<DepthMinMax> &depths) { in getDepth() argument
83 return depths.at(g[v].index); in getDepth()
88 const vector<DepthMinMax> &depths) { in hasFloatingPred() argument
90 const DepthMinMax &d = getDepth(u, g, depths); in hasFloatingPred()
103 const DepthMinMax &d = getDepth(source(e, g), g, depths); in forkVertex()
120 u32 clone_idx = depths.size(); // next index to be used in forkVertex()
124 depths.push_back(DepthMinMax(clone_depth, clone_depth)); in forkVertex()
144 bool addSomRedundancy(NGHolder &g, vector<DepthMinMax> &depths) { in addSomRedundancy() argument
162 const DepthMinMax &d = getDepth(v, g, depths); in addSomRedundancy()
177 if (hasFloatingPred(v, g, depths)) { in addSomRedundancy()
[all …]
/dports/textproc/p5-WordNet-Similarity/WordNet-Similarity-2.07/t/utils/
H A DwnDepths.t45 my @depths = <FH>;
47 my $line = $depths[0];
58 for (1..$#depths) {
59 my $line = $depths[$_];
154 @depths = sort @depths;
165 is (scalar @depths, scalar @keys);
167 for (0..$#depths) {
168 is ($depths[$_], $keys[$_]);
173 print KFFH @depths;
/dports/databases/grass7/grass-7.8.6/raster/r.to.rast3/
H A Dmain.c63 for (i = 0; i < depths; i++) in fatal_error()
106 int rows, cols, depths; in raster_to_g3d() local
114 depths = region.depths; in raster_to_g3d()
119 depths, rows, cols); in raster_to_g3d()
123 G_percent(z, depths, 1); in raster_to_g3d()
140 fatal_error(map, fd, depths, in raster_to_g3d()
150 fatal_error(map, fd, depths, in raster_to_g3d()
160 fatal_error(map, fd, depths, in raster_to_g3d()
254 for (i = 0; i < region.depths; i++) { in main()
263 name, i + 1, region.depths); in main()
[all …]
/dports/math/R-cran-ddalpha/ddalpha/man/
H A DCustomMethods.Rd56 calculates the depths
70 #### Custom depths ####
102 depths <- NULL
112 depths <- cbind(depths, depth_wrt_i)
115 return (depths)
233 depths[,classifier$index1]
235 depths[,classifier$index2]
294 depths <- NULL
302 depths <- cbind(depths, depth_wrt_i)
305 return (depths)
[all …]
/dports/www/opencart/opencart-3.0.3.8/upload/system/storage/vendor/scssphp/scssphp/src/Formatter/
H A DNested.php77 static $depths;
84 $depths = [ 0 ];
96 while ($block->depth < end($depths) || ($block->depth == 1 && end($depths) == 1)) {
97 array_pop($depths);
118 if ($block->depth > end($depths)) {
122 $depths[] = $block->depth;
125 array_pop($depths);
127 $depths[] = $block->depth;
169 array_pop($depths);
175 $depths[] = $block->depth;
[all …]
/dports/www/tikiwiki/tiki-21.2/vendor_bundled/vendor/scssphp/scssphp/src/Formatter/
H A DNested.php77 static $depths;
84 $depths = [ 0 ];
96 while ($block->depth < end($depths) || ($block->depth == 1 && end($depths) == 1)) {
97 array_pop($depths);
118 if ($block->depth > end($depths)) {
122 $depths[] = $block->depth;
125 array_pop($depths);
127 $depths[] = $block->depth;
169 array_pop($depths);
175 $depths[] = $block->depth;
[all …]
/dports/www/orangehrm/orangehrm-4.9/symfony/lib/vendor/scssphp/scssphp/src/Formatter/
H A DNested.php83 static $depths;
90 $depths = [ 0 ];
102 while ($block->depth < end($depths) || ($block->depth == 1 && end($depths) == 1)) {
103 array_pop($depths);
125 if ($block->depth > end($depths)) {
129 $depths[] = $block->depth;
132 array_pop($depths);
134 $depths[] = $block->depth;
176 array_pop($depths);
182 $depths[] = $block->depth;
[all …]
/dports/www/nextcloud/nextcloud/3rdparty/scssphp/scssphp/src/Formatter/
H A DNested.php81 static $depths;
88 $depths = [ 0 ];
100 while ($block->depth < end($depths) || ($block->depth == 1 && end($depths) == 1)) {
101 array_pop($depths);
123 if ($block->depth > end($depths)) {
127 $depths[] = $block->depth;
130 array_pop($depths);
132 $depths[] = $block->depth;
174 array_pop($depths);
180 $depths[] = $block->depth;
[all …]
/dports/www/moodle310/moodle/lib/scssphp/Formatter/
H A DNested.php78 static $depths;
85 $depths = [ 0 ];
97 while ($block->depth < end($depths) || ($block->depth == 1 && end($depths) == 1)) {
98 array_pop($depths);
119 if ($block->depth > end($depths)) {
122 $depths[] = $block->depth;
125 array_pop($depths);
126 $depths[] = $block->depth;
168 array_pop($depths);
174 $depths[] = $block->depth;
[all …]
/dports/www/moodle311/moodle/lib/scssphp/Formatter/
H A DNested.php81 static $depths;
88 $depths = [ 0 ];
100 while ($block->depth < end($depths) || ($block->depth == 1 && end($depths) == 1)) {
101 array_pop($depths);
123 if ($block->depth > end($depths)) {
127 $depths[] = $block->depth;
130 array_pop($depths);
132 $depths[] = $block->depth;
174 array_pop($depths);
180 $depths[] = $block->depth;
[all …]
/dports/www/moodle39/moodle/lib/scssphp/Formatter/
H A DNested.php78 static $depths;
85 $depths = [ 0 ];
97 while ($block->depth < end($depths) || ($block->depth == 1 && end($depths) == 1)) {
98 array_pop($depths);
119 if ($block->depth > end($depths)) {
122 $depths[] = $block->depth;
125 array_pop($depths);
126 $depths[] = $block->depth;
168 array_pop($depths);
174 $depths[] = $block->depth;
[all …]

12345678910>>...150