| /dports/science/afni/afni-AFNI_21.3.16/src/python_scripts/scripts/ |
| H A D | realtime_receiver.py | 593 npairs = rti.nextra//2
594 if npairs > 0:
597 for ind in range(npairs):
628 return 0, vals[0:npairs] # return the partial list
|
| /dports/science/py-abipy/abipy-0.9.0/abipy/electrons/tests/ |
| H A D | test_lobster.py | 84 npairs = len(coxp.total)
85 sum_all /= (npairs)
|
| /dports/print/ttf2pt1/ttf2pt1-3.4.4/scripts/ |
| H A D | forceiso | 416 $npairs=0;
437 $npairs++;
441 if($npairs!=0) {
442 printf("StartKernPairs %d\n", $npairs);
444 $npairs=0;
|
| /dports/news/inn/inn-2.6.4/expire/ |
| H A D | makehistory.c | 872 size_t npairs = 0; in main() local
927 npairs = atoi(optarg); in main()
1008 HISctl(History, HISCTLS_NPAIRS, &npairs); in main()
|
| /dports/news/inn-current/inn-2.7-20211226/expire/ |
| H A D | makehistory.c | 899 size_t npairs = 0; in main() local
954 npairs = atoi(optarg); in main()
1035 HISctl(History, HISCTLS_NPAIRS, &npairs); in main()
|
| /dports/net/stone/stone-2.4/ |
| H A D | stone.c | 6970 int npairs = 1; in doReadWrite() local
6986 if (p[1]) npairs++; in doReadWrite()
7006 for (i=0; i < npairs; i++) proto2fdset(1, &ro, &wo, &eo, p[i]); in doReadWrite()
7012 for (i=0; i < npairs; i++) { in doReadWrite()
7044 for (i=0; i < npairs; i++) { in doReadWrite()
|
| /dports/math/gap/gap-4.11.0/src/ |
| H A D | objfgelm.cc | 112 Obj NewWord(Obj type, UInt npairs) in NewWord() argument
119 NewBag(T_DATOBJ, 2 * sizeof(Obj) + npairs * BITS_WORDTYPE(type) / 8L); in NewWord()
120 ADDR_OBJ(word)[1] = INTOBJ_INT(npairs); in NewWord()
1225 UInt npairs,i,ebits,exps,expm; in NBits_LengthWord() local
1230 npairs = NPAIRS_WORD(w); in NBits_LengthWord()
1239 for (i = 0; i < npairs; i++) in NBits_LengthWord()
|
| H A D | objfgelm.h | 124 Obj NewWord(Obj type, UInt npairs);
|
| /dports/math/gap/gap-4.11.0/pkg/automgrp-1.3.2/gap/ |
| H A D | utilsfrgrp.gi | 295 did_smth, npairs, transform,
543 npairs := StructuralCopy(pairs);
558 tmp := List(npairs, p -> []);
563 npairs := StructuralCopy(tmp);
575 tmp := StructuralCopy(npairs);
580 npairs := StructuralCopy(tmp);
588 tmp := StructuralCopy(npairs);
593 npairs := StructuralCopy(tmp);
605 tmp := StructuralCopy(npairs);
610 npairs := StructuralCopy(tmp);
[all …]
|
| /dports/math/py-statsmodels/statsmodels-0.13.1/statsmodels/graphics/ |
| H A D | tukeyplot.py | 7 npairs = len(results)
41 for pair in range(npairs):
44 fsp.axhline(y=npairs-pair, xmin=data.mean(), xmax=data[1], linewidth=1.25,
47 fsp.axhline(y=npairs-pair, xmin=data[0], xmax=data.mean(), linewidth=1.25,
|
| /dports/math/prng/prng-3.0.2/examples/ |
| H A D | pairs.c | 77 int i,npairs; in main() local
99 npairs = atoi(argv[2]); in main()
102 npairs = 10000; in main()
103 printf("\nHow many pairs [%d] ",npairs); in main()
105 if (input[0] != 0 ) npairs = atoi(input); in main()
125 fprintf(stderr,"%d pairs from %s\n",npairs,prng_long_name(g)); in main()
129 for(i=0;i<npairs;i++) in main()
|
| /dports/lang/spidermonkey17/js/src/ |
| H A D | jsopcode.c | 256 jsatomid npairs; in js_Disassemble1() local
263 npairs = GET_ATOM_INDEX(pc2); in js_Disassemble1()
266 while (npairs) { in js_Disassemble1()
276 npairs--; in js_Disassemble1()
3604 jsatomid npairs, k; in Decompile() local
3615 npairs = GET_ATOM_INDEX(pc2); in Decompile()
3622 for (k = 0; k < npairs; k++) { in Decompile()
4712 jsatomid npairs; in js_DecompileValueGenerator() local
4718 npairs = GET_ATOM_INDEX(pc2); in js_DecompileValueGenerator()
4720 while (npairs) { in js_DecompileValueGenerator()
[all …]
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/oops/ |
| H A D | generateOopMap.cpp | 552 int npairs = lookupswitch.number_of_pairs(); in jump_targets_do() local
554 while(--npairs >= 0) { in jump_targets_do()
555 LookupswitchPair pair = lookupswitch.pair_at(npairs); in jump_targets_do()
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/oops/ |
| H A D | generateOopMap.cpp | 552 int npairs = lookupswitch.number_of_pairs(); in jump_targets_do() local
554 while(--npairs >= 0) { in jump_targets_do()
555 LookupswitchPair pair = lookupswitch.pair_at(npairs); in jump_targets_do()
|
| /dports/deskutils/calibre/calibre-src-5.34.0/src/calibre/utils/fonts/sfnt/ |
| H A D | kern.py | 50 version, length, coverage, npairs = unpack_from(b'>4H', raw)
53 length, coverage, tuple_index, npairs = unpack_from(b'>L3H', raw)
59 for i in range(npairs):
73 npairs = len(entries)
74 if npairs == 0:
77 entry_selector = max_power_of_two(npairs)
79 range_shift = (npairs - (2 ** entry_selector)) * 6
87 return header + pack(b'>4H', npairs, search_range, entry_selector,
|
| /dports/comms/libfec/fec-3.0.1/ |
| H A D | fec.h | 19 int update_viterbi27_blk(void *vp,unsigned char sym[],int npairs);
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/indexmap/ |
| H A D | Cargo.toml | 19 …nThe indexmap is a hash table where the iteration order of the key-value\npairs is independent of …
|
| /dports/www/firefox/firefox-99.0/third_party/rust/indexmap/ |
| H A D | Cargo.toml | 19 …nThe indexmap is a hash table where the iteration order of the key-value\npairs is independent of …
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/rust/indexmap/ |
| H A D | Cargo.toml | 19 …nThe indexmap is a hash table where the iteration order of the key-value\npairs is independent of …
|
| /dports/games/sgt-puzzles/puzzles-20220128.c43a34f/ |
| H A D | solo.c | 3448 int npairs; in merge_some_cages() local
3451 npairs = 0; in merge_some_cages()
3477 pairs[npairs].b1 = i; in merge_some_cages()
3478 pairs[npairs].b2 = j; in merge_some_cages()
3489 while (npairs > 0) { in merge_some_cages()
3496 i = random_upto(rs, npairs); in merge_some_cages()
3499 if (i != npairs-1) in merge_some_cages()
3500 pairs[i] = pairs[npairs-1]; in merge_some_cages()
3501 npairs--; in merge_some_cages()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/indexmap/ |
| H A D | Cargo.toml | 19 …nThe indexmap is a hash table where the iteration order of the key-value\npairs is independent of …
|
| /dports/editors/emacs-devel/emacs-4d1968b/src/ |
| H A D | pdumper.c | 2647 ptrdiff_t npairs = ASIZE (h->key_and_value) / 2; in hash_table_freeze() local
2649 h->next = h->hash = make_fixnum (npairs); in hash_table_freeze()
2651 h->next_free = (npairs == h->count ? -1 : h->count); in hash_table_freeze()
|
| /dports/science/afni/afni-AFNI_21.3.16/src/rickr/ |
| H A D | realtime1.c | 760 int swap_2( void * ptr, int npairs ) in swap_2() argument
765 for ( count = 0; count < npairs; count++ ) in swap_2()
|
| H A D | realtime.c | 810 int swap_2( void * ptr, int npairs ) in swap_2() argument
815 for ( count = 0; count < npairs; count++ ) in swap_2()
|
| H A D | realtime.h | 70 int swap_2 ( void * ptr, int npairs );
|