| /dports/multimedia/schroedinger/schroedinger-1.0.11/testsuite/tables2/ |
| H A D | lowdelay_tables.c | 47 for(i=0;i<N>>n_levels;i++){ in gain_test()
51 for(i=N>>(n_levels-level+1);i<N>>(n_levels-level);i++){ in gain_test()
59 for(i=0;i<n_levels;i++){ in gain_test()
60 interleave(a,N>>(n_levels-1-i)); in gain_test()
95 int n_levels; in main() local
110 for(n_levels=1;n_levels<=4;n_levels++){ in main()
112 for(i=0;i<=n_levels;i++){ in main()
115 for(i=0;i<=n_levels;i++){ in main()
120 for(i=0;i<n_levels;i++){ in main()
126 for(i=0;i<n_levels*2+1;i++){ in main()
[all …]
|
| /dports/multimedia/schroedinger/schroedinger-1.0.11/testsuite/ |
| H A D | wavelet_noise_gain.c | 46 for(i=0;i<N>>n_levels;i++){ in gain_test()
50 for(i=N>>(n_levels-level+1);i<N>>(n_levels-level);i++){ in gain_test()
58 for(i=0;i<n_levels;i++){ in gain_test()
59 synth(a,N>>(n_levels-1-i),filter); in gain_test()
78 int n_levels; in main() local
93 for(n_levels=1;n_levels<=4;n_levels++){ in main()
95 for(i=0;i<=n_levels;i++){ in main()
98 for(i=0;i<=n_levels;i++){ in main()
103 for(i=0;i<n_levels;i++){ in main()
109 for(i=0;i<n_levels*2+1;i++){ in main()
[all …]
|
| /dports/devel/py-qutip/qutip-4.6.2/qutip/tests/ |
| H A D | test_basis_transformation.py | 39 def real_hermitian(n_levels): argument
40 qobj = qutip.Qobj(0.5 - np.random.random_sample((n_levels, n_levels)))
44 def imaginary_hermitian(n_levels): argument
45 qobj = qutip.Qobj(1j*(0.5 - np.random.random_sample((n_levels, n_levels))))
49 def complex_hermitian(n_levels): argument
50 return real_hermitian(n_levels) + imaginary_hermitian(n_levels)
53 def rand_bra(n_levels): argument
54 return qutip.rand_ket(n_levels).dag()
64 H1 = hermitian_constructor(n_levels)
74 psi0 = qutip.rand_ket(n_levels)
[all …]
|
| /dports/math/gismo/gismo-21.12.0/src/gsMultiGrid/ |
| H A D | gsMultiGrid.hpp | 25 …: n_levels(transferMatrices.size()+1), m_ops(n_levels), m_smoother(n_levels), m_prolong(n_levels-1… in gsMultiGridOp()
28 std::vector<SpMatrixRowMajorPtr> transferMatrixPtrs(n_levels); in gsMultiGridOp()
29 for (index_t i=0; i<n_levels-1; ++i) in gsMultiGridOp()
41 …: n_levels(transferMatrices.size()+1), m_ops(n_levels), m_smoother(n_levels), m_prolong(n_levels-1… in gsMultiGridOp()
54 …: n_levels(ops.size()), m_ops(ops), m_smoother(n_levels), m_prolong(prolongation), m_restrict(rest… in gsMultiGridOp()
69 m_ops[n_levels-1] = makeMatrixOp(mat); in init()
71 for ( index_t i = n_levels - 2; i >= 0; --i ) in init()
80 for ( index_t i=0; i<n_levels-1; ++i ) in init()
200 GISMO_ASSERT (rhs.size() == static_cast<size_t>(n_levels), in fullMultiGrid()
203 std::vector<Matrix> u(n_levels); in fullMultiGrid()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/brip/ |
| H A D | brip_filter_bank.cxx | 24 brip_filter_bank::brip_filter_bank(unsigned n_levels, in brip_filter_bank() argument
32 if (n_levels == 1) {// only one level in the pyramid in brip_filter_bank()
36 double ninv = 1.0/(n_levels-1); in brip_filter_bank()
43 n_levels_ = n_levels; in set_params()
47 if (n_levels == 1) {// only one level in the pyramid in set_params()
51 double ninv = 1.0/(n_levels-1); in set_params()
56 brip_filter_bank::brip_filter_bank(unsigned n_levels, in brip_filter_bank() argument
67 if (n_levels == 1) { // only one level in the pyramid in brip_filter_bank()
71 double ninv = 1.0/(n_levels-1); in brip_filter_bank()
191 n_levels_ = n_levels; in load_filter_responses()
[all …]
|
| H A D | brip_filter_bank.h | 42 brip_filter_bank(unsigned n_levels, double scale_range, float lambda0,
46 brip_filter_bank(unsigned n_levels, double scale_range, float lambda0,
56 unsigned n_levels() const {return n_levels_;} in n_levels() function
71 bool load_filter_responses(std::string const& dir, unsigned n_levels);
73 …void set_params(unsigned n_levels, double scale_range, float lambda0, float lambda1, float theta_i…
|
| /dports/devel/tla/tla-1.3.5/src/hackerlab/arrays/ |
| H A D | pow2-array.c | 240 int n_levels; in make_pow2_array_rules() local
251 n_levels = 1; in make_pow2_array_rules()
261 ++n_levels; in make_pow2_array_rules()
276 n_levels = 1; in make_pow2_array_rules()
282 levels[n_levels].addr_shift = shift; in make_pow2_array_rules()
283 levels[n_levels].addr_mask = mask; in make_pow2_array_rules()
284 ++n_levels; in make_pow2_array_rules()
292 defaults = (void **)lim_malloc (limits, n_levels * sizeof (void *)); in make_pow2_array_rules()
301 defaults[n_levels - 1] = default_page; in make_pow2_array_rules()
302 for (x = n_levels - 2; x >= 0; --x) in make_pow2_array_rules()
[all …]
|
| /dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwdft/xc/ |
| H A D | xc_sicutil.F | 33 subroutine xc_sicdeg(i_degen, evals, n_levels, act_levels) argument
38 integer i_degen(2), evals(2), n_levels(2)
59 n_levels(isp) = aux_levels
61 n_levels(isp) = 0
65 if (n_levels(isp).ne.0) then
66 if(n_levels(isp).gt.act_levels) n_levels(isp) = act_levels
|
| /dports/science/nwchem-data/nwchem-7.0.2-release/src/nwdft/xc/ |
| H A D | xc_sicutil.F | 33 subroutine xc_sicdeg(i_degen, evals, n_levels, act_levels) argument
38 integer i_degen(2), evals(2), n_levels(2)
59 n_levels(isp) = aux_levels
61 n_levels(isp) = 0
65 if (n_levels(isp).ne.0) then
66 if(n_levels(isp).gt.act_levels) n_levels(isp) = act_levels
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/ipts/ |
| H A D | ipts_entropy_pyramid.cxx | 43 if (smooth_pyramid.n_levels()==0) return; in ipts_entropy_pyramid()
52 int n_levels = 0; in ipts_entropy_pyramid() local
53 for (int i=0;i<smooth_pyramid.n_levels();++i) in ipts_entropy_pyramid()
58 smooth_im.image().nj()>2*half_width+1) n_levels++; in ipts_entropy_pyramid()
62 entropy_pyramid.resize(n_levels,vimt_image_2d_of<float>()); in ipts_entropy_pyramid()
63 for (int i=0;i<n_levels;++i) in ipts_entropy_pyramid()
|
| H A D | ipts_orientation_pyramid.cxx | 23 if (smooth_pyramid.n_levels()==0) return; in ipts_orientation_pyramid()
27 int n_levels = smooth_pyramid.n_levels(); in ipts_orientation_pyramid() local
30 orient_pyramid.resize(n_levels,vimt_image_2d_of<vxl_byte>()); in ipts_orientation_pyramid()
31 for (int i=0;i<n_levels;++i) in ipts_orientation_pyramid()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bpgl/icam/ |
| H A D | icam_depth_trans_pyramid.cxx | 36 unsigned n_levels) in init() argument
40 n_levels_ = n_levels; in init()
51 depth_pyramid_=vil_pyramid_image_view<double>(depth_sptr,n_levels); in init()
55 for (unsigned i = 1; i<n_levels; ++i) { in init()
64 unsigned n_levels) in icam_depth_trans_pyramid() argument
66 this->init(base_transform, n_levels); in icam_depth_trans_pyramid()
74 unsigned n_levels, in icam_depth_trans_pyramid() argument
79 this->init(base_transform, n_levels); in icam_depth_trans_pyramid()
90 unsigned n_levels, in icam_depth_trans_pyramid() argument
96 this->init(base_transform, n_levels); in icam_depth_trans_pyramid()
|
| H A D | icam_depth_trans_pyramid.h | 34 unsigned n_levels);
39 unsigned n_levels,
46 unsigned n_levels,
53 unsigned n_levels,
59 unsigned n_levels() const {return n_levels_;} in n_levels() function
90 unsigned n_levels);
|
| /dports/science/octopus/octopus-10.5/src/grid/ |
| H A D | multigrid.F90 | 104 integer :: i, n_levels, np, order local
125 n_levels = 3
146 if ( n_levels <= 0 )then
147 n_levels=n_levels-3
152 n_levels=n_levels+1
155 n_levels=n_levels-1
158 mgrid%n_levels = n_levels
160 SAFE_ALLOCATE(mgrid%level(0:n_levels))
171 do i = 1, mgrid%n_levels
199 do i = 0, mgrid%n_levels
[all …]
|
| /dports/net/openmpi/openmpi-4.1.1/ompi/patterns/net/ |
| H A D | netpatterns_knomial_tree.c | 44 int n_levels,pow_k; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node() local
72 n_levels = 0; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
76 n_levels++; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
82 pow_k = n_levels; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
88 n_levels--; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
541 int n_levels; in ompi_netpatterns_setup_recursive_knomial_tree_node() local
557 n_levels = 0; in ompi_netpatterns_setup_recursive_knomial_tree_node()
562 n_levels++; in ompi_netpatterns_setup_recursive_knomial_tree_node()
569 n_levels--; in ompi_netpatterns_setup_recursive_knomial_tree_node()
706 int n_levels; in ompi_netpatterns_setup_recursive_doubling_n_tree_node() local
[all …]
|
| /dports/net/openmpi3/openmpi-3.1.6/ompi/patterns/net/ |
| H A D | netpatterns_knomial_tree.c | 44 int n_levels,pow_k; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node() local
72 n_levels = 0; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
76 n_levels++; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
82 pow_k = n_levels; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
88 n_levels--; in ompi_netpatterns_setup_recursive_knomial_allgather_tree_node()
541 int n_levels; in ompi_netpatterns_setup_recursive_knomial_tree_node() local
557 n_levels = 0; in ompi_netpatterns_setup_recursive_knomial_tree_node()
562 n_levels++; in ompi_netpatterns_setup_recursive_knomial_tree_node()
569 n_levels--; in ompi_netpatterns_setup_recursive_knomial_tree_node()
706 int n_levels; in ompi_netpatterns_setup_recursive_doubling_n_tree_node() local
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/vimt/ |
| H A D | vimt_dog_pyramid_builder_2d.hxx | 85 for (int i=0; i<im_pyr.n_levels();++i) in empty_pyr()
92 void vimt_dog_pyramid_builder_2d<T>::check_pyr(vimt_image_pyramid& im_pyr, int n_levels) const in check_pyr()
94 const int got_levels = im_pyr.n_levels(); in check_pyr()
95 if (got_levels >= n_levels && im_pyr(0).is_class(work_im_.is_a())) in check_pyr()
97 if (im_pyr.n_levels()==n_levels) return; in check_pyr()
100 for (int i=n_levels;i<got_levels;++i) in check_pyr()
103 im_pyr.data().resize(n_levels); in check_pyr()
107 im_pyr.data().resize(n_levels); in check_pyr()
110 for (int i=0;i<n_levels;++i) in check_pyr()
|
| H A D | vimt_gaussian_pyramid_builder_2d.hxx | 119 for (int i=0; i<im_pyr.n_levels();++i) in empty_pyr()
126 void vimt_gaussian_pyramid_builder_2d<T>::check_pyr(vimt_image_pyramid& im_pyr, int n_levels) const in check_pyr()
128 const int got_levels = im_pyr.n_levels(); in check_pyr()
129 if (got_levels >= n_levels && im_pyr(0).is_class(work_im_.is_a())) in check_pyr()
131 if (im_pyr.n_levels()==n_levels) return; in check_pyr()
134 for (int i=n_levels;i<got_levels;++i) in check_pyr()
137 im_pyr.data().resize(n_levels); in check_pyr()
141 im_pyr.resize(n_levels,vimt_image_2d_of<T>()); in check_pyr()
231 int oldsize = image_pyr.n_levels(); in extend()
|
| H A D | vimt_image_pyramid.hxx | 29 const int n_levels = in.n_levels(); in vimt_image_pyramid_flatten() local
30 assert(n_levels > 0); in vimt_image_pyramid_flatten()
34 for (int i =0; i<n_levels; ++i) in vimt_image_pyramid_flatten()
42 for (int i=0, offset=0; i<n_levels; ++i) in vimt_image_pyramid_flatten()
|
| H A D | vimt_scale_pyramid_builder_2d.hxx | 163 for (int i=0; i<im_pyr.n_levels();++i) in emptyPyr()
170 void vimt_scale_pyramid_builder_2d<T>::checkPyr(vimt_image_pyramid& im_pyr, int n_levels) const in checkPyr()
172 const int got_levels = im_pyr.n_levels(); in checkPyr()
173 if (got_levels >= n_levels) //&& im_pyr(0).is_a()==work_im_.is_a()) in checkPyr()
175 if (im_pyr.n_levels()==n_levels) return; in checkPyr()
178 for (int i=n_levels;i<got_levels;++i) in checkPyr()
181 im_pyr.data().resize(n_levels); in checkPyr()
185 im_pyr.data().resize(n_levels); in checkPyr()
188 for (int i=0;i<n_levels;++i) in checkPyr()
278 int oldsize = image_pyr.n_levels(); in extend()
|
| /dports/math/libmesh/libmesh-1.6.2/src/solvers/ |
| H A D | petsc_dm_wrapper.C | 474 unsigned int n_levels = MeshTools::n_levels(mesh); in init_and_attach_petscdm() local
493 n_levels = 1; in init_and_attach_petscdm()
593 if (n_levels > 1 ) in init_and_attach_petscdm()
616 if ( n_levels >= 1 ) in init_and_attach_petscdm()
634 if (n_levels > 1 ) in init_and_attach_petscdm()
664 if ( i != n_levels ) in init_and_attach_petscdm()
1103 _dms.resize(n_levels); in init_dm_data()
1104 _sections.resize(n_levels); in init_dm_data()
1106 _ctx_vec.resize(n_levels); in init_dm_data()
1107 _pmtx_vec.resize(n_levels); in init_dm_data()
[all …]
|
| /dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/stats/ |
| H A D | base.py | 66 levels=None, n_levels=None):
69 if n_levels is None:
71 self.n_levels = np.max(all_pairs) + 1
73 self.n_levels = n_levels
105 k = self.n_levels
|
| /dports/misc/vxl/vxl-3.3.2/contrib/mul/vimt3d/ |
| H A D | vimt3d_gaussian_pyramid_builder_3d.hxx | 75 int vimt3d_gaussian_pyramid_builder_3d<T>::n_levels(const vimt3d_image_3d_of<T>& base_image) const in n_levels() function in vimt3d_gaussian_pyramid_builder_3d
215 for (int i=0; i<im_pyr.n_levels();++i) in emptyPyr()
224 const int got_levels = im_pyr.n_levels(); in checkPyr()
225 if (got_levels >= n_levels && im_pyr(0).is_a()==work_im1_.is_a()) in checkPyr()
227 if (im_pyr.n_levels()==n_levels) return; in checkPyr()
230 for (int i=n_levels;i<got_levels;++i) in checkPyr()
233 im_pyr.data().resize(n_levels); in checkPyr()
237 im_pyr.resize(n_levels,vimt3d_image_3d_of<T>()); in checkPyr()
266 int max_levels=n_levels(base_image); in build()
347 int max_levels=n_levels(static_cast<const vimt3d_image_3d_of<T>&>(image_pyr(0))); in extend()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/source/multigrid/ |
| H A D | mg_transfer_component.cc | 128 mg_dof.get_triangulation().n_levels(), in reinit_vector_by_components()
198 mg_dof.get_triangulation().n_levels(), in reinit_vector_by_components()
322 const unsigned int n_levels = mg_dof.get_triangulation().n_levels(); in build() local
328 sizes.resize(n_levels); in build()
329 for (unsigned int l = 0; l < n_levels; ++l) in build()
366 copy_to_and_from_indices.resize(n_levels); in build()
382 prolongation_matrices.reserve(n_levels - 1); in build()
383 prolongation_sparsities.reserve(n_levels - 1); in build()
385 for (unsigned int i = 0; i < n_levels - 1; ++i) in build()
404 for (unsigned int level = 0; level < n_levels - 1; ++level) in build()
[all …]
|
| /dports/math/gap/gap-4.11.0/pkg/automgrp-1.3.2/gap/ |
| H A D | treehomsg.gi | 113 n_levels := Length(levels);
117 if gens_ptr[1] > Length(levels[n_levels-1]) then
118 if IsEmpty(levels[n_levels]) then
123 elif n_levels > iter!.max_len then
129 n_levels := n_levels + 1;
136 if not elm in elm_list{levels[n_levels-2]} and
137 not elm in elm_list{levels[n_levels-1]} and
138 not elm in elm_list{levels[n_levels]}
144 Print("n_levels: ", n_levels, "\n");
148 Add(levels[n_levels], Length(elm_list));
[all …]
|