Home
last modified time | relevance | path

Searched refs:ilevel (Results 1 – 25 of 680) sorted by relevance

12345678910>>...28

/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/gw/Transfer/
H A Dsubint.f90497 ilevel=ilevel-1
501 if (ilevel.le.0) then
526 ilevel=ilevel+1
533 lmnt(ilevel)=lmnt(ilevel)+1
535 ilevel=ilevel-1
536 if (ilevel.le.0) then
748 ilevel=ilevel-1
752 if (ilevel.le.0) then
784 ilevel=ilevel+1
791 lmnt(ilevel)=lmnt(ilevel)+1
[all …]
/dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/gw/Transfer/
H A Dsubint.f90497 ilevel=ilevel-1
501 if (ilevel.le.0) then
526 ilevel=ilevel+1
533 lmnt(ilevel)=lmnt(ilevel)+1
535 ilevel=ilevel-1
536 if (ilevel.le.0) then
748 ilevel=ilevel-1
752 if (ilevel.le.0) then
784 ilevel=ilevel+1
791 lmnt(ilevel)=lmnt(ilevel)+1
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/src/OPENMP/
H A Drespa_omp.cpp75 for (int ilevel=0; ilevel < nlevels; ++ilevel) in setup() local
76 fprintf(screen," %d:%g",ilevel+1, step[ilevel]); in setup()
117 for (int ilevel = 0; ilevel < nlevels; ilevel++) { in setup() local
166 copy_f_flevel(ilevel); in setup()
211 for (int ilevel = 0; ilevel < nlevels; ilevel++) { in setup_minimal() local
261 copy_f_flevel(ilevel); in setup_minimal()
273 copy_flevel_f(ilevel); in recurse()
325 } else if (ilevel == 0) { in recurse()
337 if (ilevel) recurse(ilevel-1); in recurse()
416 if (newton[ilevel]) { in recurse()
[all …]
/dports/science/lammps/lammps-stable_29Sep2021/src/
H A Drespa.cpp337 for (int ilevel = nlevels-2; ilevel >= 0; ilevel--) in init() local
338 step[ilevel] = step[ilevel+1]/loop[ilevel]; in init()
342 for (int ilevel = 0; ilevel < nlevels; ilevel++) { in init() local
345 if (level_bond == ilevel || level_angle == ilevel || in init()
379 for (int ilevel=0; ilevel < nlevels; ++ilevel) in setup() local
425 for (int ilevel = 0; ilevel < nlevels; ilevel++) { in setup() local
501 for (int ilevel = 0; ilevel < nlevels; ilevel++) { in setup_minimal() local
595 for (int ilevel = nlevels-2; ilevel >= 0; ilevel--) in reset_dt() local
596 step[ilevel] = step[ilevel+1]/loop[ilevel]; in reset_dt()
668 if (ilevel) recurse(ilevel-1); in recurse()
[all …]
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/src/
H A Drespa.cpp334 for (int ilevel = nlevels-2; ilevel >= 0; ilevel--) in init() local
335 step[ilevel] = step[ilevel+1]/loop[ilevel]; in init()
339 for (int ilevel = 0; ilevel < nlevels; ilevel++) { in init() local
342 if (level_bond == ilevel || level_angle == ilevel || in init()
347 if (level_pair == ilevel || level_inner == ilevel || in init()
393 for (int ilevel = 0; ilevel < nlevels; ilevel++) { in setup() local
461 for (int ilevel = 0; ilevel < nlevels; ilevel++) { in setup_minimal() local
539 for (int ilevel = nlevels-2; ilevel >= 0; ilevel--) in reset_dt() local
540 step[ilevel] = step[ilevel+1]/loop[ilevel]; in reset_dt()
555 if (ilevel) recurse(ilevel-1); in recurse()
[all …]
/dports/biology/cd-hit/cdhit-4.8.1/
H A Dclstr2xml.pl21 for($ilevel=$n;$ilevel>0;$ilevel--){
31 $nextlevel=$ilevel-1;
33 if($ilevel>1){
39 if($ilevel<$n){
41 my $j=$ilevel;
52 if($ilevel==$n){$topsize++;}
73 $nextlevel=$ilevel-1;
75 if($ilevel>1){
79 $size{"$key##$ilevel"}=$this_no;
81 if($ilevel<$n){
[all …]
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Registration/Common/include/
H A DitkRecursiveMultiResolutionPyramidImageFilter.hxx104 int ilevel; in GenerateData() local
119 for ( ilevel = this->GetNumberOfLevels() - 1; ilevel > -1; ilevel-- ) in GenerateData()
125 outputPtr = this->GetOutput(ilevel); in GenerateData()
222 this->GraftNthOutput(ilevel, swapPtr); in GenerateData()
271 int ilevel, idim; in GenerateOutputRequestedRegion() local
281 for ( ilevel = refLevel + 1; ilevel < static_cast< int >( this->GetNumberOfLevels() ); in GenerateOutputRequestedRegion()
282 ilevel++ ) in GenerateOutputRequestedRegion()
290 factors[idim] = this->GetSchedule()[ilevel - 1][idim] / this->GetSchedule()[ilevel][idim]; in GenerateOutputRequestedRegion()
314 requestedRegion.Crop( this->GetOutput(ilevel)-> in GenerateOutputRequestedRegion()
321 for ( ilevel = refLevel - 1; ilevel > -1; ilevel-- ) in GenerateOutputRequestedRegion()
[all …]
H A DitkMultiResolutionPyramidImageFilter.hxx220 unsigned int ilevel, idim; in IsScheduleDownwardDivisible() local
222 for ( ilevel = 0; ilevel < schedule.rows() - 1; ilevel++ ) in IsScheduleDownwardDivisible()
226 if ( schedule[ilevel][idim] == 0 ) in IsScheduleDownwardDivisible()
230 if ( ( schedule[ilevel][idim] % schedule[ilevel + 1][idim] ) > 0 ) in IsScheduleDownwardDivisible()
294 unsigned int ilevel, idim; in GenerateData() local
298 for ( ilevel = 0; ilevel < m_NumberOfLevels; ilevel++ ) in GenerateData()
399 for ( unsigned int ilevel = 0; ilevel < m_NumberOfLevels; ilevel++ ) in GenerateOutputInformation() local
401 outputPtr = this->GetOutput(ilevel); in GenerateOutputInformation()
461 unsigned int ilevel, idim; in GenerateOutputRequestedRegion() local
468 for ( ilevel = 0; ilevel < m_NumberOfLevels; ilevel++ ) in GenerateOutputRequestedRegion()
[all …]
/dports/net/mpich2/mpich2-1.5/src/mpe2/src/slog2sdk/src/viewer/zoomable/
H A DYaxisTree.java150 int ilevel; in update_leveled_paths() local
165 for ( ilevel = 1; ilevel <= max_level; ilevel++ ) in update_leveled_paths()
166 leveled_paths[ ilevel ] = new ArrayList(); in update_leveled_paths()
188 ilevel = 0; in update_leveled_paths()
189 next_expanding_level = ilevel; in update_leveled_paths()
190 while ( ilevel < max_level && isAllExpanded ) { in update_leveled_paths()
191 paths = leveled_paths[ ilevel ].iterator(); in update_leveled_paths()
196 ilevel++; in update_leveled_paths()
198 if ( ilevel > max_level ) in update_leveled_paths()
201 next_expanding_level = ilevel - 1; in update_leveled_paths()
[all …]
H A DDiagnosis.java21 private int ilevel = 0; field in Diagnosis
31 ilevel = 0; in Diagnosis()
83 ilevel -= 1; in print()
86 for ( int ii = ilevel; ii > 0; ii -= 1 ) in print()
92 ilevel += 1; in print()
100 ilevel -= 1; in println()
103 for ( int ii = ilevel; ii > 0; ii -= 1 ) in println()
110 ilevel += 1; in println()
112 if ( ilevel == 0 ) { in println()
/dports/science/xcrysden/xcrysden-1.6.2/C/
H A Dpolygonise.c105 SurfNmlAver(surf.numT[ilevel], surf.numV[ilevel], in WrapperSurfSmoothing()
106 normal[ilevel], vertex[ilevel], tri2verIN[ilevel], sign_P, 0); in WrapperSurfSmoothing()
112 int ilevel, in MarchingCubes() argument
136 surf.numT[ilevel] = 0; in MarchingCubes()
137 surf.numV[ilevel] = 0; in MarchingCubes()
144 if ( isostate.tri2verIN_malloc[ilevel] ) free((FREE_ARG) tri2verIN[ilevel] ); in MarchingCubes()
177 tri2verIN[ilevel] = xcRealloc2xBiggerTrigInfo( tri2verIN[ilevel], &mem_size ); in MarchingCubes()
260 tri2verIN[ilevel], vertex[ilevel], vertex_status, in MarchingCubes()
270 vertex[ilevel][ivrt] = triangles[i].p[0]; tri2verIN[ilevel][i].ver_ind[0] = ivrt++; in MarchingCubes()
282 SurfNmlAver(ntriangl, nvertex, normal[ilevel], vertex[ilevel], tri2verIN[ilevel], sign, 0); in MarchingCubes()
[all …]
/dports/security/helib/HElib-1.3.1/src/
H A DBenesNetwork.cpp42 ilevel[d][delta_j] = 0; in recursiveGeneralBenesInit()
53 ilevel[d][delta_j] = 0; in recursiveGeneralBenesInit()
54 ilevel[d][delta_j + 1] = 0; in recursiveGeneralBenesInit()
60 ilevel[d][delta_j] = 1; in recursiveGeneralBenesInit()
61 ilevel[d][delta_j + 1] = -1; in recursiveGeneralBenesInit()
99 NTL::Vec<short>* last_level[] = {&level[nlev - 1 - d], &ilevel[d]}; in recursiveGeneralBenesInit()
246 ilevel); in recursiveGeneralBenesInit()
256 ilevel); in recursiveGeneralBenesInit()
298 NTL::Vec<NTL::Vec<short>> ilevel; in GeneralBenesNetwork() local
299 ilevel.SetLength(2 * k - 1); in GeneralBenesNetwork()
[all …]
/dports/math/py-yt/yt-4.0.1/yt/frontends/ramses/
H A Dio_utils.pyx27 cdef INT64_t ilevel, icpu, n, ndim, skip_len
52 for ilevel in range(nlevelmax):
55 ng = numbl[ilevel, icpu]
77 if ilevel >= min_level:
93 cdef INT64_t ilevel, icpu, skip_len
115 for ilevel in range(nlevelmax):
122 if file_ilevel != ilevel+1:
128 if ilevel >= min_level:
166 for ilevel in range(nlevels):
169 nc = level_count[icpu, ilevel]
[all …]
/dports/audio/dssi/dssi-1.1.1/scripts/
H A Dtableofcontents.pl18 my $ilevel = 0;
27 if ($ibase < 0) { $ibase = $level; $ilevel = $ibase-1; }
30 while ($level > $ilevel) {
32 $ilevel ++;
34 while ($level < $ilevel) {
35 undef $sectionNumbers[$ilevel];
37 $ilevel --;
/dports/science/sparta/sparta-20Oct2021/src/
H A Dgrid_id.cpp154 for (int ilevel = level-1; ilevel >= 0; ilevel--) { in id_uniform_level() local
155 nx = plevels[ilevel].nx; in id_uniform_level()
156 ny = plevels[ilevel].ny; in id_uniform_level()
157 nz = plevels[ilevel].nz; in id_uniform_level()
164 parentbits = plevels[ilevel].nbits; in id_uniform_level()
306 for (int ilevel = 0; ilevel < level; ilevel++) { in id_neigh_same_level() local
307 nxyz = &plevels[ilevel].nx; in id_neigh_same_level()
343 for (int ilevel = level-1; ilevel >= 0; ilevel--) { in id_neigh_same_level() local
344 nxyz = &plevels[ilevel].nx; in id_neigh_same_level()
351 parentbits = plevels[ilevel].nbits; in id_neigh_same_level()
[all …]
/dports/devel/app-builder/app-builder-3.4.2/vendor/golang.org/x/image/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/workhorse/vendor/golang.org/x/image/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]
/dports/www/gohugo/hugo-0.91.2/vendor/golang.org/x/image/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]
/dports/net-im/dendrite/dendrite-0.5.1/vendor/golang.org/x/image/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]
/dports/www/beehive/beehive-0.4.0/vendor/golang.org/x/image/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]
/dports/net-im/matterbridge/matterbridge-1.22.3/vendor/golang.org/x/image/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]
/dports/www/mattermost-server/mattermost-server-6.0.2/vendor/golang.org/x/image/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/golang.org/x/image/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/golang.org/x/image/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]
/dports/x11/wallutils/wallutils-5.10.0/vendor/golang.org/x/image/image-6944b10bf410/vp8/
H A Dfilter.go40 abs(p2-p1) > ilevel ||
41 abs(p1-p0) > ilevel ||
42 abs(q1-q0) > ilevel ||
44 abs(q3-q2) > ilevel {
191 ilevel := level
194 ilevel >>= 2
196 ilevel >>= 1
199 ilevel = x
202 if ilevel < 1 {
203 ilevel = 1
[all …]

12345678910>>...28