Home
last modified time | relevance | path

Searched refs:n_slice (Results 1 – 8 of 8) sorted by relevance

/dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/regression/
H A Ddimred.py19 def _prep(self, n_slice):
34 self._split_wexog = np.array_split(x, n_slice)
70 n_slice = self.exog.shape[0] // slice_n
72 self._prep(n_slice)
121 n_slice = self.n_slice
152 for i in range(n_slice):
217 n_slice = self.exog.shape[0] // slice_n
227 split_exog = np.array_split(x, n_slice)
238 self.n_slice = n_slice
374 n_slice = self.exog.shape[0] // slice_n
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/angle/third_party/VK-GL-CTS/src/external/openglcts/modules/glesext/geometry_shader/
H A DesextcGeometryShaderLayeredFramebuffer.cpp169 unsigned int n_slice = 0; in iterate() local
212 for (n_slice = 0; n_slice < sizeof(slice_pixels_ptr) / sizeof(slice_pixels_ptr[0]); ++n_slice) in iterate()
214 slice_pixels_ptr[n_slice][0] = 0; in iterate()
215 slice_pixels_ptr[n_slice][1] = (unsigned char)(n_slice * 255 / 4); in iterate()
216 slice_pixels_ptr[n_slice][2] = (unsigned char)(n_slice * 255 / 8); in iterate()
217 slice_pixels_ptr[n_slice][3] = (unsigned char)(n_slice * 255 / 12); in iterate()
234 for (n_slice = 0; n_slice < sizeof(slice_pixels_ptr) / sizeof(slice_pixels_ptr[0]); ++n_slice) in iterate()
236 unsigned char* ref_slice_ptr = ref_slice_pixels_ptr[n_slice]; in iterate()
237 unsigned char* slice_ptr = slice_pixels_ptr[n_slice]; in iterate()
/dports/math/faiss/faiss-1.7.1/faiss/
H A DIVFlib.cpp164 n_slice = 0; in SlidingIndexWindow()
195 !remove_oldest || n_slice > 0, in step()
218 for (int j = 0; j + 1 < n_slice; j++) { in step()
221 sizesi[n_slice - 1] = ils->ids[i].size(); in step()
230 n_slice++; in step()
237 for (int j = 0; j + 1 < n_slice; j++) { in step()
242 n_slice--; in step()
H A DIVFlib.h92 int n_slice; member
/dports/biology/phyml/phyml-3.3.20200621/src/
H A Dinvitee.h23 int Number_Of_Comb_Slices(int m, int num_elem, int *n_slice);
H A Dinvitee.c777 int i, j, k, f, n_otu, *indic, *n_slice, *slice_numbers; in K_Constant_Prior_Times_Log() local
790 …n_slice = (int *)mCalloc(n_otu - 1, sizeof(int)); //vector of the numb… in K_Constant_Prior_Times_Log()
919 n_slice[i]++; in K_Constant_Prior_Times_Log()
947 tot_num_comb = tot_num_comb * n_slice[i]; in K_Constant_Prior_Times_Log()
986 r = rand()%(n_slice[i]); in K_Constant_Prior_Times_Log()
1608 free(n_slice); in K_Constant_Prior_Times_Log()
1617 int Number_Of_Comb_Slices(int m, int num_elem, int *n_slice) in Number_Of_Comb_Slices() argument
1624 for(i = m; i < num_elem; i++) num_comb = num_comb * n_slice[i]; in Number_Of_Comb_Slices()
/dports/math/faiss/faiss-1.7.1/tests/
H A Dtest_sliding_ivf.cpp133 printf(" current n_slice = %d\n", window.n_slice); in test_sliding_window()
/dports/science/nest/nest-simulator-3.1/testsuite/pytests/
H A Dtest_NodeCollection.py149 n_slice = n[:5]
150 n_list = n_slice.tolist()