/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/nwpwlib/utilities/ |
H A D | nwpw_spline.F | 73 khi = nx+1 79 khi = khi - 1 83 khi = khi + 1 113 khi = nx+1 118 khi = khi - 1 122 khi = khi + 1 145 khi = nx+1 174 khi = nx+1 180 khi = khi - 1 184 khi = khi + 1 [all …]
|
/dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/nwpwlib/utilities/ |
H A D | nwpw_spline.F | 73 khi = nx+1 79 khi = khi - 1 83 khi = khi + 1 113 khi = nx+1 118 khi = khi - 1 122 khi = khi + 1 145 khi = nx+1 174 khi = nx+1 180 khi = khi - 1 184 khi = khi + 1 [all …]
|
/dports/biology/wise/wise2.4.1/src/dnaindex/ |
H A D | kmer_hash.c | 83 KmerHashIndex * khi; in new_KmerHashIndex() local 102 out->handle = (void*) khi; in new_KmerHashIndex() 154 assert(khi); in retrieve_by_kmer_KmerHashIndex() 177 assert(khi); in next_filled_kmer_KmerHashIndex() 229 assert(khi); in insert_by_kmer_KmerHashIndex() 231 if(kmer > khi->max_kmer) khi->max_kmer = kmer; in insert_by_kmer_KmerHashIndex() 232 if(kmer < khi->min_kmer) khi->min_kmer = kmer; in insert_by_kmer_KmerHashIndex() 279 assert(khi); in free_KmerHashIndex() 284 khb = &khi->bucket[i]; in free_KmerHashIndex() 293 free(khi->bucket); in free_KmerHashIndex() [all …]
|
H A D | kmer_hash.dy | 111 KmerHashIndex * khi; 130 out->handle = (void*) khi; 180 assert(khi); 202 assert(khi); 253 assert(khi); 255 if(kmer > khi->max_kmer) khi->max_kmer = kmer; 256 if(kmer < khi->min_kmer) khi->min_kmer = kmer; 302 assert(khi); 307 khb = &khi->bucket[i]; 316 free(khi->bucket); [all …]
|
/dports/math/plplot-ada/plplot-5.15.0/lib/qsastime/ |
H A D | dsplint.c | 56 khi = n; in dsplint() 61 if ( xa[khi] < x ) in dsplint() 74 klo = khi - 1; in dsplint() 91 khi = klo + 1; in dsplint() 93 if ( xa[khi] <= x ) in dsplint() 95 khi = n; in dsplint() 97 if ( xa[khi] < x ) in dsplint() 103 while ( khi - klo > 1 ) in dsplint() 105 k = ( khi + klo ) / 2; in dsplint() 108 khi = k; in dsplint() [all …]
|
/dports/math/plplot/plplot-5.15.0/lib/qsastime/ |
H A D | dsplint.c | 56 khi = n; in dsplint() 61 if ( xa[khi] < x ) in dsplint() 74 klo = khi - 1; in dsplint() 91 khi = klo + 1; in dsplint() 93 if ( xa[khi] <= x ) in dsplint() 95 khi = n; in dsplint() 97 if ( xa[khi] < x ) in dsplint() 103 while ( khi - klo > 1 ) in dsplint() 105 k = ( khi + klo ) / 2; in dsplint() 108 khi = k; in dsplint() [all …]
|
/dports/science/lammps/lammps-stable_29Sep2021/src/MANYBODY/ |
H A D | pair_meam_spline.h | 130 int khi = N - 1; in eval() local 131 while (khi - klo > 1) { in eval() 132 int k = (khi + klo) / 2; in eval() 134 khi = k; in eval() 147 int khi = klo + 1; in eval() 148 double a = Xs[khi] - x; in eval() 170 int khi = N - 1; in eval() local 171 while (khi - klo > 1) { in eval() 174 khi = k; in eval() 189 int khi = klo + 1; in eval() [all …]
|
H A D | pair_meam_sw_spline.h | 117 int khi = N - 1; in eval() local 118 while (khi - klo > 1) { in eval() 119 int k = (khi + klo) / 2; in eval() 121 khi = k; in eval() 136 int khi = klo + 1; in eval() 137 double a = Xs[khi] - x; in eval() 159 int khi = N - 1; in eval() local 160 while (khi - klo > 1) { in eval() 163 khi = k; in eval() 179 int khi = klo + 1; in eval() [all …]
|
/dports/deskutils/howm/howm-1.4.7/doc/ |
H A D | ChangeLog | 1 2020-12-31 HIRAOKA Kazuyuki <khi@users.osdn.me> 9 2020-10-16 HIRAOKA Kazuyuki <khi@users.osdn.me> 13 2020-10-15 HIRAOKA Kazuyuki <khi@users.osdn.me> 18 2020-02-21 HIRAOKA Kazuyuki <khi@users.osdn.me> 22 2018-12-31 HIRAOKA Kazuyuki <khi@users.osdn.me> 30 2018-02-25 HIRAOKA Kazuyuki <khi@users.osdn.me> 34 2018-01-02 HIRAOKA Kazuyuki <khi@users.osdn.me> 38 2016-12-31 HIRAOKA Kazuyuki <khi@users.sourceforge.jp> 46 2016-12-31 HIRAOKA Kazuyuki <khi@users.sourceforge.jp> 55 2015-12-31 HIRAOKA Kazuyuki <khi@users.sourceforge.jp> [all …]
|
/dports/math/p5-Math-Spline/Math-Spline-0.02/ |
H A D | Spline.pm | 31 my ($klo,$khi)=($i,$i+1); 32 my $h=$x->[$khi]-$x->[$klo]; 34 my $a=($x->[$khi]-$v)/$h; 36 return $a*$y->[$klo] + $b*$y->[$khi] 38 +($b*$b*$b-$b)*$y2->[$khi])*($h*$h)/6.0; 43 my ($klo,$khi)=(0,$#{$x}); 45 while (($khi-$klo)>1) { 46 $k=int(($khi+$klo)/2); 53 my ($x,$v,$khi)=@_; $khi+=1; 55 while($v>$x->[$khi] and $khi<$n) { $khi++; } [all …]
|
/dports/science/octopus/octopus-10.5/src/species/ |
H A D | spline.cc | 90 int k,khi,klo; in splint() local 94 khi = n-1; in splint() 96 while ( khi - klo > 1 ) in splint() 100 khi = k; in splint() 106 if (khi > n-1) { in splint() 115 h = xa[khi] - xa[klo]; in splint() 129 int k,khi,klo; in splintd() local 133 khi = n-1; in splintd() 135 while ( khi - klo > 1 ) in splintd() 139 khi = k; in splintd() [all …]
|
/dports/science/nwchem-data/nwchem-7.0.2-release/src/dimqm/ |
H A D | CubicSpline.F | 103 integer :: khi local 114 khi = klo + 1 125 h = xa(khi) - xa(klo) 126 a = ( xa(khi) - x ) / h 155 integer :: khi 167 khi = klo + 1 178 h = xa(khi) - xa(klo) 179 a = ( xa(khi) - x ) / h 208 integer :: khi local 219 khi = klo + 1 [all …]
|
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/dimqm/ |
H A D | CubicSpline.F | 103 integer :: khi local 114 khi = klo + 1 125 h = xa(khi) - xa(klo) 126 a = ( xa(khi) - x ) / h 155 integer :: khi 167 khi = klo + 1 178 h = xa(khi) - xa(klo) 179 a = ( xa(khi) - x ) / h 208 integer :: khi local 219 khi = klo + 1 [all …]
|
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/optimization/direct/ |
H A D | MultiDirectionalSimplex.java | 38 private final double khi; field in MultiDirectionalSimplex 73 final double khi, final double gamma) { in MultiDirectionalSimplex() argument 74 this(n, 1d, khi, gamma); in MultiDirectionalSimplex() 88 final double khi, final double gamma) { in MultiDirectionalSimplex() argument 91 this.khi = khi; in MultiDirectionalSimplex() 116 final double khi, final double gamma) { in MultiDirectionalSimplex() argument 119 this.khi = khi; in MultiDirectionalSimplex() 147 final double khi, final double gamma) { in MultiDirectionalSimplex() argument 150 this.khi = khi; in MultiDirectionalSimplex() 169 original, khi, comparator); in iterate()
|
H A D | NelderMeadSimplex.java | 44 private final double khi; field in NelderMeadSimplex 88 final double rho, final double khi, in NelderMeadSimplex() argument 93 this.khi = khi; in NelderMeadSimplex() 109 final double rho, final double khi, in NelderMeadSimplex() argument 111 this(n, 1d, rho, khi, gamma, sigma); in NelderMeadSimplex() 139 final double rho, final double khi, in NelderMeadSimplex() argument 144 this.khi = khi; in NelderMeadSimplex() 176 final double rho, final double khi, in NelderMeadSimplex() argument 181 this.khi = khi; in NelderMeadSimplex() 229 xE[j] = centroid[j] + khi * (xR[j] - centroid[j]); in iterate()
|
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/main/java/org/apache/commons/math3/optim/nonlinear/scalar/noderiv/ |
H A D | MultiDirectionalSimplex.java | 35 private final double khi; field in MultiDirectionalSimplex 70 final double khi, final double gamma) { in MultiDirectionalSimplex() argument 71 this(n, 1d, khi, gamma); in MultiDirectionalSimplex() 85 final double khi, final double gamma) { in MultiDirectionalSimplex() argument 88 this.khi = khi; in MultiDirectionalSimplex() 113 final double khi, final double gamma) { in MultiDirectionalSimplex() argument 116 this.khi = khi; in MultiDirectionalSimplex() 144 final double khi, final double gamma) { in MultiDirectionalSimplex() argument 147 this.khi = khi; in MultiDirectionalSimplex() 166 original, khi, comparator); in iterate()
|
H A D | NelderMeadSimplex.java | 41 private final double khi; field in NelderMeadSimplex 85 final double rho, final double khi, in NelderMeadSimplex() argument 90 this.khi = khi; in NelderMeadSimplex() 106 final double rho, final double khi, in NelderMeadSimplex() argument 108 this(n, 1d, rho, khi, gamma, sigma); in NelderMeadSimplex() 136 final double rho, final double khi, in NelderMeadSimplex() argument 141 this.khi = khi; in NelderMeadSimplex() 173 final double rho, final double khi, in NelderMeadSimplex() argument 178 this.khi = khi; in NelderMeadSimplex() 226 xE[j] = centroid[j] + khi * (xR[j] - centroid[j]); in iterate()
|
/dports/ftp/wget/wget-1.21.2/src/ |
H A D | hsts.c | 134 if (khi) in hsts_find_entry() 146 if (khi) in hsts_find_entry() 163 return khi; in hsts_find_entry() 182 khi->created = created; in hsts_new_entry_internal() 183 khi->max_age = max_age; in hsts_new_entry_internal() 190 if (check_expired && ((khi->created + khi->max_age) < khi->created)) in hsts_new_entry_internal() 206 xfree (khi); in hsts_new_entry_internal() 257 if (khi && match_type == CONGRUENT_MATCH && created > khi->created) in hsts_store_merge() 260 khi->created = created; in hsts_store_merge() 266 else if (!khi) in hsts_store_merge() [all …]
|
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwdft/lr_tddft_grad/ |
H A D | tddft_grad_get_dens.F | 16 + ilo,ihi,jlo,jhi,klo,khi,llo,lhi,g_d) 28 integer klo, khi ! limits on the k-label 74 call ga_get(g_d(1),klo,khi,llo,lhi,dkla,blen) 76 call ga_get(g_d(3),klo,khi,llo,lhi,pkla,blen) 78 call ga_get(g_d(5),klo,khi,llo,lhi,xpykla,blen) 86 call ga_get(g_d(1),ilo,ihi,klo,khi,dika,blen) 87 call ga_get(g_d(1),klo,khi,jlo,jhi,dkja,blen) 90 call ga_get(g_d(3),ilo,ihi,klo,khi,pika,blen) 91 call ga_get(g_d(3),klo,khi,jlo,jhi,pkja,blen) 110 call ga_get(g_d(2),klo,khi,llo,lhi,dklb,blen) [all …]
|
/dports/science/nwchem-data/nwchem-7.0.2-release/src/nwdft/lr_tddft_grad/ |
H A D | tddft_grad_get_dens.F | 16 + ilo,ihi,jlo,jhi,klo,khi,llo,lhi,g_d) 28 integer klo, khi ! limits on the k-label 74 call ga_get(g_d(1),klo,khi,llo,lhi,dkla,blen) 76 call ga_get(g_d(3),klo,khi,llo,lhi,pkla,blen) 78 call ga_get(g_d(5),klo,khi,llo,lhi,xpykla,blen) 86 call ga_get(g_d(1),ilo,ihi,klo,khi,dika,blen) 87 call ga_get(g_d(1),klo,khi,jlo,jhi,dkja,blen) 90 call ga_get(g_d(3),ilo,ihi,klo,khi,pika,blen) 91 call ga_get(g_d(3),klo,khi,jlo,jhi,pkja,blen) 110 call ga_get(g_d(2),klo,khi,llo,lhi,dklb,blen) [all …]
|
/dports/deskutils/howm/howm-1.4.7/ |
H A D | ChangeLog | 1 2020-12-31 HIRAOKA Kazuyuki <khi@users.osdn.me> 7 2020-12-29 HIRAOKA Kazuyuki <khi@users.osdn.me> 15 2020-10-15 HIRAOKA Kazuyuki <khi@users.osdn.me> 19 2020-09-14 HIRAOKA Kazuyuki <khi@users.osdn.me> 24 2018-09-29 HIRAOKA Kazuyuki <khi@users.osdn.me> 28 2019-12-31 HIRAOKA Kazuyuki <khi@users.osdn.me> 32 2019-08-18 HIRAOKA Kazuyuki <khi@users.osdn.me> 41 2018-12-31 HIRAOKA Kazuyuki <khi@users.osdn.me> 45 2018-09-29 HIRAOKA Kazuyuki <khi@users.osdn.me> 49 2018-09-29 HIRAOKA Kazuyuki <khi@users.osdn.me> [all …]
|
/dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/uccsdt/ |
H A D | triples_kernels.F | 4 & ilo, ihi, jlo, jhi, klo, khi, 31 do k = klo, khi 118 kend = khi 196 kend = khi 262 do k = klo, khi 339 do k = klo, khi 426 kend = khi 494 kend = khi 565 kend = khi 636 kend = khi [all …]
|
/dports/science/nwchem-data/nwchem-7.0.2-release/src/uccsdt/ |
H A D | triples_kernels.F | 4 & ilo, ihi, jlo, jhi, klo, khi, 31 do k = klo, khi 118 kend = khi 196 kend = khi 262 do k = klo, khi 339 do k = klo, khi 426 kend = khi 494 kend = khi 565 kend = khi 636 kend = khi [all …]
|
/dports/misc/vxl/vxl-3.3.2/v3p/dcmtk/dcmimgle/include/ |
H A D | displint.h | 136 register unsigned int khi = na - 1; in Interpolation() local 140 if ((xa[klo] > x[i]) || (xa[khi] < x[i])) // optimization in Interpolation() 143 khi = na - 1; in Interpolation() 145 … while (khi - klo > 1) // search right place in the table, if necessary in Interpolation() 147 k = (khi + klo) >> 1; in Interpolation() 149 khi = k; in Interpolation() 153 if (xa[khi] == x[i]) // optimization: use known values in Interpolation() 154 y[i] = ya[khi]; in Interpolation() 157 h = (T3_)xa[khi] - (T3_)xa[klo]; in Interpolation() 160 a = ((T3_)xa[khi] - (T3_)x[i]) / h; in Interpolation() [all …]
|
/dports/math/arb/arb-2.21.1/arb_hypgeom/ |
H A D | legendre_p_ui_one.c | 19 slong j, k, khi, klo, u, r; in sum_rs_inner() local 30 khi = k; in sum_rs_inner() 33 for (j = klo; j <= khi; j++) in sum_rs_inner() 39 fmpz_ui_mul_ui(c + khi - j, aa, bb); in sum_rs_inner() 41 fmpz_mul2_uiui(c + khi - j, c + khi - j + 1, aa, bb); in sum_rs_inner() 44 for (j = khi; j >= klo; j--) in sum_rs_inner() 49 if (j == khi) in sum_rs_inner() 55 fmpz_mul(c + khi - j, c + khi - j, c + u); in sum_rs_inner() 63 if (k == khi) in sum_rs_inner() 66 arb_mul_fmpz(s, s, c + khi - k, prec); in sum_rs_inner() [all …]
|