| /dports/textproc/miller/miller-5.10.2/go/reg-test/expected/ |
| H A D | case-dsl-pythonic-division.sh.out | 9 ni1 -75
24 ni1 -75
39 ni1 -75
54 ni1 -75
69 ni1 -75
84 ni1 -75
99 ni1 -75
114 ni1 -75
129 ni1 -75
144 ni1 -75
[all …]
|
| H A D | case-dsl-type-inference.sh.out | 9 ni1 -75
22 ni1 -75
46 ni1 -75
59 ni1 -75
72 ni1 -75
85 ni1 -75
98 ni1 -75
111 ni1 -75
124 ni1 -75
137 ni1 -75
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/spatial/ckdtree/src/ |
| H A D | query.cxx | 176 nodeinfo *ni1; in allocate() local
185 ni1->m = m; in allocate()
187 return ni1; in allocate()
230 nodeinfo *ni1; in query_single_point() local
239 ni1 = nipool.allocate(); in query_single_point()
240 ni1->node = self->ctree; in query_single_point()
243 ni1->min_distance = 0; in query_single_point()
286 node = ni1->node; in query_single_point()
331 inode = ni1->node; in query_single_point()
417 tmp = ni1; in query_single_point()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/core/vil/algo/ |
| H A D | vil_find_4con_boundary.h | 22 int ni1, int nj1, in vil_next_point_below_thresh4() argument
31 if (i<ni1 && p[istep]<=threshold) { ++i; p+=istep; dir=3; return; } in vil_next_point_below_thresh4()
50 … int ni1, int nj1, std::ptrdiff_t istep, std::ptrdiff_t jstep, in vil_next_point_above_thresh4() argument
58 if (i<ni1 && p[istep]>=threshold) { ++i; p+=istep; dir=3; return; } in vil_next_point_above_thresh4()
86 int ni1 = image.ni()-1; in vil_find_4con_boundary_below_threshold() local
95 while (i<ni1 && p[istep]<=threshold) {i++;p+=istep;} in vil_find_4con_boundary_below_threshold()
110 vil_next_point_below_thresh4(i,j,dir,p,ni1,nj1,istep,jstep,threshold); in vil_find_4con_boundary_below_threshold()
129 int ni1 = image.ni()-1; in vil_find_4con_boundary_above_threshold() local
138 while (i<ni1 && p[istep]>=threshold) {i++;p+=istep;} in vil_find_4con_boundary_above_threshold()
153 vil_next_point_above_thresh4(i,j,dir,p,ni1,nj1,istep,jstep,threshold); in vil_find_4con_boundary_above_threshold()
|
| H A D | vil_flood_fill.h | 26 unsigned ni1=image.ni()-1; in vil_flood_fill_row() local
33 while (ihi<ni1 && *p==v) { ihi++; *p=new_v; p+=istep;} in vil_flood_fill_row()
48 unsigned ni1=image.ni()-1; in vil_flood_fill4() local
51 if (seed_i>ni1 || seed_j>nj1) return; // Seed outside image in vil_flood_fill4()
103 unsigned ni1=image.ni()-1; in vil_flood_fill4() local
106 if (seed_i>ni1 || seed_j>nj1) return; // Seed outside image in vil_flood_fill4()
156 unsigned ni1=image.ni()-1; in vil_flood_fill8() local
159 if (seed_i>ni1 || seed_j>nj1) return; // Seed outside image in vil_flood_fill8()
177 if (ihi<ni1) ihi++; in vil_flood_fill8()
214 unsigned ni1=image.ni()-1; in vil_flood_fill8() local
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bil/algo/ |
| H A D | bil_trace_8con_boundary.cxx | 13 int ni1, int nj1, in bil_next_8con_boundary_point() argument
21 if (i<ni1 && p[istep]) { ++i; p+=istep; dir=5; return; } in bil_next_8con_boundary_point()
23 if (i<ni1 && j<nj1 && p[istep+jstep]) { in bil_next_8con_boundary_point()
38 if (i<ni1 && j>0 && p[istep-jstep]) { in bil_next_8con_boundary_point()
80 unsigned int ni1 = image.ni()-1; in bil_trace_8con_boundary() local
95 bil_next_8con_boundary_point(i,j,dir,p,ni1,nj1,istep,jstep); in bil_trace_8con_boundary()
107 bil_next_8con_boundary_point(i,j,dir,p,ni1,nj1,istep,jstep); in bil_trace_8con_boundary()
116 bil_next_8con_boundary_point(i,j,dir,p,ni1,nj1,istep,jstep); in bil_trace_8con_boundary()
120 bil_next_8con_boundary_point(i,j,dir,p,ni1,nj1,istep,jstep); in bil_trace_8con_boundary()
|
| H A D | bil_trace_4con_boundary.cxx | 13 int ni1, int nj1, in bil_next_4con_boundary_point() argument
21 if (i<ni1 && p[istep]) { ++i; p+=istep; dir=3; return; } in bil_next_4con_boundary_point()
57 unsigned int ni1 = image.ni()-1; in bil_trace_4con_boundary() local
72 bil_next_4con_boundary_point(i,j,dir,p,ni1,nj1,istep,jstep); in bil_trace_4con_boundary()
83 bil_next_4con_boundary_point(i,j,dir,p,ni1,nj1,istep,jstep); in bil_trace_4con_boundary()
92 bil_next_4con_boundary_point(i,j,dir,p,ni1,nj1,istep,jstep); in bil_trace_4con_boundary()
|
| /dports/lang/mono/mono-5.10.1.57/mcs/class/System/Test/System.CodeDom/ |
| H A D | CodeNamespaceImportCollectionTest.cs | 53 CodeNamespaceImport ni1 = new CodeNamespaceImport ("A"); in Add()
59 coll.Add (ni1); in Add()
61 Assert.AreEqual (0, ((IList) coll).IndexOf (ni1), "#2"); in Add()
86 CodeNamespaceImport ni1 = new CodeNamespaceImport ("A"); in AddRange()
93 coll.AddRange (new CodeNamespaceImport[] {ni1, ni2}); in AddRange()
95 Assert.AreEqual (0, ((IList) coll).IndexOf (ni1), "#2"); in AddRange()
100 Assert.AreEqual (0, ((IList) coll).IndexOf (ni1), "#5"); in AddRange()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/vil3d/tests/ |
| H A D | test_algo_abs_shuffle_distance.cxx | 53 unsigned ni1=Nx-10, nj1=Ny-10, nk1=Nz-10; in test_algo_abs_shuffle_distance() local
54 vil3d_image_view<int> sub_im1 = vil3d_crop(image0,2,ni1,2,nj1,2,nk1); in test_algo_abs_shuffle_distance()
55 vil3d_image_view<int> sub_im2 = vil3d_crop(image0,3,ni1,2,nj1,2,nk1); in test_algo_abs_shuffle_distance()
56 vil3d_image_view<int> sub_im3 = vil3d_crop(image0,4,ni1,2,nj1,2,nk1); in test_algo_abs_shuffle_distance()
57 image1.set_size(ni1,nj1,nk1); in test_algo_abs_shuffle_distance()
71 vil3d_image_view<int> image2(ni1,nj1,nk1); in test_algo_abs_shuffle_distance()
|
| /dports/math/libmesh/libmesh-1.6.2/tests/mesh/ |
| H A D | extra_integers.C | 42 unsigned int ni1 = mesh.add_node_integer("ni1"); in build_mesh() local
61 return {i1, r1, ni1, ni2, nr1, nr2}; in build_mesh()
70 ni1 = ini[2], in test_and_set_initial_data() local
90 CPPUNIT_ASSERT_EQUAL(node->get_extra_integer(ni1), DofObject::invalid_id); in test_and_set_initial_data()
132 ni1 = ini[2], in test_helper() local
143 CPPUNIT_ASSERT_EQUAL(ni1, mesh.add_node_integer("ni1")); in test_helper()
162 const unsigned int i1 = ini[0], ni1 = ini[2], ni2 = ini[3]; in checkpoint_helper() local
179 CPPUNIT_ASSERT_EQUAL(ni1, mesh2.add_node_integer("ni1")); in checkpoint_helper()
|
| /dports/math/suitesparse-config/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-klu/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-rbio/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-ldl/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-spqr/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-colamd/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-btf/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-amd/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|
| /dports/math/suitesparse-csparse/SuiteSparse-5.10.1/GraphBLAS/Source/ |
| H A D | GB_ijsort.c | 190 int64_t ni1 = 1 ; in GB_ijsort() local
194 if (I1 [ni1-1] != I1 [k]) in GB_ijsort()
196 I1 [ni1] = I1 [k] ; in GB_ijsort()
197 I1k [ni1] = ni - I1k [k] ; in GB_ijsort()
198 ni1++ ; in GB_ijsort()
201 ASSERT (ni1 == ni2) ; in GB_ijsort()
202 for (int64_t k = 0 ; k < ni1 ; k++) in GB_ijsort()
|