Home
last modified time | relevance | path

Searched refs:nnow (Results 1 – 25 of 134) sorted by relevance

123456

/dports/devel/lion/lion/
H A Dtimers.c174 time_t nnow; in timers_add() local
186 time(&nnow); in timers_add()
194 nnow = mktime(ntm); in timers_add()
321 struct timeval nnow; in timers_select() local
329 timeradd(&nnow, &fuzz, &nnow); in timers_select()
333 &nnow, in timers_select()
342 &nnow, in timers_select()
343 &nnow); in timers_select()
346 if (timercmp(&nnow, in timers_select()
372 struct timeval nnow; in timers_process() local
[all …]
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/
H A Datom_optimization.F116 nnow = history%hpos + 1
117 IF (nnow > nmax) nnow = 1
121 history%hmat(nnow)%pmat = pmat
122 history%hmat(nnow)%fmat = fmat
123 history%hmat(nnow)%emat = emat
126 history%hpos = nnow
192 nnow = history%hpos
207 na = nnow + 1 - i
210 nb = nnow + 1 - j
222 na = nnow + 1 - i
[all …]
/dports/science/cp2k-data/cp2k-7.1.0/src/
H A Datom_optimization.F116 nnow = history%hpos + 1
117 IF (nnow > nmax) nnow = 1
121 history%hmat(nnow)%pmat = pmat
122 history%hmat(nnow)%fmat = fmat
123 history%hmat(nnow)%emat = emat
126 history%hpos = nnow
192 nnow = history%hpos
207 na = nnow + 1 - i
210 nb = nnow + 1 - j
222 na = nnow + 1 - i
[all …]
/dports/math/R-cran-combinat/combinat/R/
H A DnCm.R34 nnow <- n[which] functionVar
36 out[which] <- ((-1)^mnow) * Recall(mnow - nnow - 1, mnow)
42 nnow <- n[which]
52 out[which] <- unlist(lapply(seq(along = nnow), foo, nn = nnow,
56 nnow <- n[which]
58 out[which] <- exp(lgamma(nnow + 1) - lgamma(mnow + 1) - lgamma(nnow -
/dports/chinese/libime/libime-1.0.9/src/libime/core/
H A Dsegmentgraph.cpp77 const SegmentGraphNode *nold, *nnow; in check() local
80 nnow = &boost::get<1>(t); in check()
81 if (nold->index() != nnow->index() || in check()
82 segment(*old, *nold) != graph.segment(*now, *nnow)) { in check()
89 nnow = &boost::get<1>(t); in check()
90 q.emplace(nold, nnow); in check()
/dports/science/afni/afni-AFNI_21.3.16/src/
H A D3dClustCount.c268 if( nnow == nall ){ /* increase array lengths */ \
274 inow[nnow] = i ; jnow[nnow] = j ; know[nnow] = k ; \
291 int ip,jp,kp , im,jm,km , nnow ; in find_largest_cluster_NN1() local
319 for( icl=0 ; icl < nnow ; icl++ ){ in find_largest_cluster_NN1()
332 if( nnow > max_size ) max_size = nnow ; in find_largest_cluster_NN1()
344 int ip,jp,kp , im,jm,km , nnow ; in find_largest_cluster_NN2() local
372 for( icl=0 ; icl < nnow ; icl++ ){ in find_largest_cluster_NN2()
401 if( nnow > max_size ) max_size = nnow ; in find_largest_cluster_NN2()
413 int ip,jp,kp , im,jm,km , nnow ; in find_largest_cluster_NN3() local
441 for( icl=0 ; icl < nnow ; icl++ ){ in find_largest_cluster_NN3()
[all …]
H A Dthd_brainormalize.c195 inow[nnow] = (i); jnow[nnow] = (j); know[nnow] = (k); \
206 int nccc,nmmm , nall,nnow ; in THD_mask_distize() local
225 nnow = 0 ; in THD_mask_distize()
229 inow[nnow] = ii % nx ; in THD_mask_distize()
230 jnow[nnow] = (ii%nxy)/nx ; in THD_mask_distize()
231 know[nnow] = ii / nxy ; in THD_mask_distize()
233 nnow++ ; in THD_mask_distize()
270 inow[nnow] = (i); jnow[nnow] = (j); know[nnow] = (k); \
345 if( nnow >= csize ){ in clustedit3D()
346 kk = nsav+nnow ; in clustedit3D()
[all …]
H A Dthd_automask.c938 if( nnow == nall ){ /* increase array lengths */ \
944 inow[nnow] = i ; jnow[nnow] = j ; know[nnow] = k ; \
957 int nnow ; short *inow , *jnow , *know ; int nall ; in THD_mask_clust() local
1000 for( icl=0 ; icl < nnow ; icl++ ){ in THD_mask_clust()
1902 inow[nnow] = i; jnow[nnow] = j; nnow++; mmm[ijk] = 0; \
1915 short *inow , *jnow ; int nall , nnow , nkeep ; in THD_mask_clust2D() local
1956 for( icl=0 ; icl < nnow ; icl++ ){ in THD_mask_clust2D()
1973 clust_len[clust_num-1] = nnow ; in THD_mask_clust2D()
1977 if( nnow > nbest ) nbest = nnow ; /* nbest = size of biggest cluster */ in THD_mask_clust2D()
1987 nnow = clust_len[icl] ; in THD_mask_clust2D()
[all …]
H A D3dClustSim.c1779 if( nnow == nall ){ /* increase array lengths */ \
1785 inow[nnow] = i ; jnow[nnow] = j ; know[nnow] = k ; \
1803 int nnow , nall ; short *inow , *jnow , *know ; in find_largest_cluster_NN1() local
1836 for( icl=0 ; icl < nnow ; icl++ ){ in find_largest_cluster_NN1()
1849 if( nnow > max_size ) max_size = nnow ; in find_largest_cluster_NN1()
1867 int nnow , nall ; short *inow , *jnow , *know ; in find_largest_cluster_NN2() local
1900 for( icl=0 ; icl < nnow ; icl++ ){ in find_largest_cluster_NN2()
1929 if( nnow > max_size ) max_size = nnow ; in find_largest_cluster_NN2()
1947 int nnow , nall ; short *inow , *jnow , *know ; in find_largest_cluster_NN3() local
1980 for( icl=0 ; icl < nnow ; icl++ ){ in find_largest_cluster_NN3()
[all …]
H A D3dfim.c74 int nx_ref , ny_ref , ivec , nnow ; in fim3d_fimmer_compute() local
411 nnow = 0 ; in fim3d_fimmer_compute()
461 nnow++ ; in fim3d_fimmer_compute()
470 if( nnow > 0 ) nupdt++ ; in fim3d_fimmer_compute()
/dports/www/pmwiki/pmwiki-2.2.141/scripts/
H A Dnotify.php157 $nnow = time();
158 if ($nnow < $firstpost + $NotifyDelay)
162 $nextevent = $nnow + 86400;
172 if ($nnow < $msquelch) {
186 $notify[$m] = array('lastmail' => $nnow);
/dports/mail/crm114/crm114-20100106-BlameMichelson.src/
H A Dpaolo_overvars.crm24 output /\nnow match :b: to :a:'s 'bbb' section\n/
40 output /\nnow alter :a: to 'x' again\n/
/dports/security/vault/vault-1.8.2/vendor/github.com/apple/foundationdb/flow/
H A DNet2.actor.cpp580 double nnow = timer_monotonic(); in run() local
614 …if ((now-nnow) > FLOW_KNOBS->SLOW_LOOP_CUTOFF && g_nondeterministic_random->random01() < (now-nnow… in run()
615 TraceEvent("SomewhatSlowRunLoopTop").detail("Elapsed", now - nnow); in run()
651 nnow = timer_monotonic(); in run()
696 …if ((nnow-now) > FLOW_KNOBS->SLOW_LOOP_CUTOFF && g_nondeterministic_random->random01() < (nnow-now… in run()
697 …TraceEvent("SomewhatSlowRunLoopBottom").detail("Elapsed", nnow - now); // This includes the time s… in run()
699 trackMinPriority( minTaskID, nnow ); in run()
/dports/devel/p5-DateTime-Format-Roman/DateTime-Format-Roman-0.04/
H A DChanges9 - format_datetime() can nnow be used as a class method
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-config/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-colamd/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/GraphBLAS/Test/
H A Dtest45.m138 fprintf ('\nnow with lots of duplicates\n') ;
199 fprintf ('\nnow with lots of duplicates\n') ;

123456