/dports/math/gmp/gmp-6.2.1/tests/rand/ |
H A D | t-rand.c | 27 #define ENTS 10 /* Number of entries in array when macro 32 const char *z1[ENTS] = {"0", "1", "1", "1", "1", "0", "1", "1", "1", "1"}; 33 const char *z2[ENTS] = {"0", "3", "1", "3", "3", "0", "3", "3", "3", "1"}; 34 const char *z3[ENTS] = {"4", "3", "1", "7", "3", "0", "3", "3", "3", "1"}; 35 const char *z4[ENTS] = {"c", "3", "1", "f", "b", "8", "3", "3", "3", "1"}; 181 for (i = 0; i < ENTS; i++) in main() 213 for (i = 0; i < ENTS; i++) in main() 250 for (i = 0; i < ENTS; i++) in main() 256 if (i != ENTS - 1) in main() 266 for (i = 0; i < ENTS; i++) in main() [all …]
|
/dports/math/gap/gap-4.11.0/extern/gmp/tests/rand/ |
H A D | t-rand.c | 27 #define ENTS 10 /* Number of entries in array when macro 32 const char *z1[ENTS] = {"0", "1", "1", "1", "1", "0", "1", "1", "1", "1"}; 33 const char *z2[ENTS] = {"0", "3", "1", "3", "3", "0", "3", "3", "3", "1"}; 34 const char *z3[ENTS] = {"4", "3", "1", "7", "3", "0", "3", "3", "3", "1"}; 35 const char *z4[ENTS] = {"c", "3", "1", "f", "b", "8", "3", "3", "3", "1"}; 181 for (i = 0; i < ENTS; i++) in main() 213 for (i = 0; i < ENTS; i++) in main() 250 for (i = 0; i < ENTS; i++) in main() 256 if (i != ENTS - 1) in main() 266 for (i = 0; i < ENTS; i++) in main() [all …]
|
/dports/math/mingw32-libgmp/gmp-6.0.0/tests/rand/ |
H A D | t-rand.c | 27 #define ENTS 10 /* Number of entries in array when macro 32 const char *z1[ENTS] = {"0", "1", "1", "1", "1", "0", "1", "1", "1", "1"}; 33 const char *z2[ENTS] = {"0", "3", "1", "3", "3", "0", "3", "3", "3", "1"}; 34 const char *z3[ENTS] = {"4", "3", "1", "7", "3", "0", "3", "3", "3", "1"}; 35 const char *z4[ENTS] = {"c", "3", "1", "f", "b", "8", "3", "3", "3", "1"}; 181 for (i = 0; i < ENTS; i++) in main() 213 for (i = 0; i < ENTS; i++) in main() 250 for (i = 0; i < ENTS; i++) in main() 256 if (i != ENTS - 1) in main() 266 for (i = 0; i < ENTS; i++) in main() [all …]
|
/dports/math/mpir/mpir-3.0.0/tests/rand/ |
H A D | t-rand.c | 31 #define ENTS 10 /* Number of entries in array when macro 36 char *z1[ENTS] = {"0", "1", "1", "1", "1", "0", "1", "1", "1", "1"}; 37 char *z2[ENTS] = {"0", "3", "1", "3", "3", "0", "3", "3", "3", "1"}; 38 char *z3[ENTS] = {"4", "3", "1", "7", "3", "0", "3", "3", "3", "1"}; 39 char *z4[ENTS] = {"c", "3", "1", "f", "b", "8", "3", "3", "3", "1"}; 190 for (i = 0; i < ENTS; i++) 220 for (i = 0; i < ENTS; i++) 255 for (i = 0; i < ENTS; i++) 261 if (i != ENTS - 1) 271 for (i = 0; i < ENTS; i++) [all …]
|
/dports/math/kalker/gmp-mpfr-sys-21966f4bfb56c87d407eb14c72e92ef4e55856aa/gmp-6.2.1-c/tests/rand/ |
H A D | t-rand.c | 27 #define ENTS 10 /* Number of entries in array when macro 32 const char *z1[ENTS] = {"0", "1", "1", "1", "1", "0", "1", "1", "1", "1"}; 33 const char *z2[ENTS] = {"0", "3", "1", "3", "3", "0", "3", "3", "3", "1"}; 34 const char *z3[ENTS] = {"4", "3", "1", "7", "3", "0", "3", "3", "3", "1"}; 35 const char *z4[ENTS] = {"c", "3", "1", "f", "b", "8", "3", "3", "3", "1"}; 181 for (i = 0; i < ENTS; i++) in main() 213 for (i = 0; i < ENTS; i++) in main() 250 for (i = 0; i < ENTS; i++) in main() 256 if (i != ENTS - 1) in main() 266 for (i = 0; i < ENTS; i++) in main() [all …]
|
/dports/devel/simgear/simgear-2020.3.11/simgear/nasal/ |
H A D | hash.c | 28 #define TAB(h) ((int*)&(ENTS(h)[1<<(h)->lgsz])) 92 ENTS(hr)[ent].key = key; in hashset() 94 ENTS(hr)[ent].val = val; in hashset() 119 hashset(hr2, ENTS(hr)[TAB(hr)[i]].key, ENTS(hr)[TAB(hr)[i]].val); in resize() 132 *out = ENTS(hr)[ent].val; in naHash_get() 165 naVec_append(dst, ENTS(hr)[TAB(hr)[i]].key); in naHash_keys() 174 naiGCMark(ENTS(hr)[TAB(hr)[i]].key); in naiGCMarkHash() 175 naiGCMark(ENTS(hr)[TAB(hr)[i]].val); in naiGCMarkHash() 237 HashEnt* ents = ENTS(hr); in naiHash_sym() 269 ENTS(hr)[TAB(hr)[cell]].key = *sym; in naiHash_newsym() [all …]
|
/dports/science/eccodes/eccodes-2.23.0-Source/definitions/bufr/tables/0/wmo/15/codetables/ |
H A D | 8014.table | 5 4 4 ONE-MINUTE MINIMUM VALUE - ABOVE THE UPPER LIMIT FOR ASSESSM" ENTS OF RVR (P) 6 5 5 ONE-MINUTE MINIMUM VALUE - BELOW THE LOWER LIMIT FOR ASSESSM" ENTS OF RVR (M) 8 7 7 ONE-MINUTE MAXIMUM VALUE - ABOVE THE UPPER LIMIT FOR ASSESSM" ENTS OF RVR (P) 9 8 8 ONE-MINUTE MAXIMUM VALUE - BELOW THE LOWER LIMIT FOR ASSESSM" ENTS OF RVR (M)
|
H A D | 8009.table | 10 9 9 ASCENDING, OBSERVATION INTERVALS SELECTED BY PRESSURE INCREM" ENTS 11 10 10 ASCENDING, OBSERVATION INTERVALS SELECTED BY PRESSURE INCREM" ENTS, UNSTEADY
|
/dports/science/eccodes/eccodes-2.23.0-Source/definitions/bufr/tables/0/wmo/16/codetables/ |
H A D | 8014.table | 5 4 4 ONE-MINUTE MINIMUM VALUE - ABOVE THE UPPER LIMIT FOR ASSESSM" ENTS OF RVR (P) 6 5 5 ONE-MINUTE MINIMUM VALUE - BELOW THE LOWER LIMIT FOR ASSESSM" ENTS OF RVR (M) 8 7 7 ONE-MINUTE MAXIMUM VALUE - ABOVE THE UPPER LIMIT FOR ASSESSM" ENTS OF RVR (P) 9 8 8 ONE-MINUTE MAXIMUM VALUE - BELOW THE LOWER LIMIT FOR ASSESSM" ENTS OF RVR (M)
|
H A D | 8009.table | 10 9 9 ASCENDING, OBSERVATION INTERVALS SELECTED BY PRESSURE INCREM" ENTS 11 10 10 ASCENDING, OBSERVATION INTERVALS SELECTED BY PRESSURE INCREM" ENTS, UNSTEADY
|
/dports/science/eccodes/eccodes-2.23.0-Source/definitions/bufr/tables/0/wmo/17/codetables/ |
H A D | 8014.table | 5 4 4 ONE-MINUTE MINIMUM VALUE - ABOVE THE UPPER LIMIT FOR ASSESSM" ENTS OF RVR (P) 6 5 5 ONE-MINUTE MINIMUM VALUE - BELOW THE LOWER LIMIT FOR ASSESSM" ENTS OF RVR (M) 8 7 7 ONE-MINUTE MAXIMUM VALUE - ABOVE THE UPPER LIMIT FOR ASSESSM" ENTS OF RVR (P) 9 8 8 ONE-MINUTE MAXIMUM VALUE - BELOW THE LOWER LIMIT FOR ASSESSM" ENTS OF RVR (M)
|
H A D | 8009.table | 10 9 9 ASCENDING, OBSERVATION INTERVALS SELECTED BY PRESSURE INCREM" ENTS 11 10 10 ASCENDING, OBSERVATION INTERVALS SELECTED BY PRESSURE INCREM" ENTS, UNSTEADY
|
/dports/mail/s-nail/s-nail-14.9.23/mk/ |
H A D | make-okey-map.pl | 32 my ($S, @ENTS, $CTOOL, $CTOOL_EXE) = ($VERB ? ' ' : ''); 113 push @ENTS, \%vals 273 foreach my $e (@ENTS){ 292 foreach my $e (@ENTS){ 351 foreach my $e (@ENTS){ 475 foreach my $e (@ENTS){ 497 my $t = (@ENTS < 0xFF ? 'u8' : (@ENTS < 0xFFFF ? 'u16' : 'u32'));
|
H A D | make-tcap-map.pl | 19 my ($S, $CAPS_LEN, $BIND_START, @CAPS_NAMES, @ENTS) = 72 push @ENTS, [$_]; 91 push @ENTS, [$1, $e, $CAPS_LEN]; 135 foreach my $ent (@ENTS){
|
H A D | su-make-errors.sh | 372 my ($S, @ENTS, $CTOOL, $CTOOL_EXE) = ($ENV{VERB} ? ' ' : ''); 528 foreach my $e (@ENTS){ 549 foreach my $e (@ENTS){ 566 foreach my $e (@ENTS){ 590 foreach my $e (@ENTS){ 603 my $t = (@ENTS < 0xFF ? 'u8' : (@ENTS < 0xFFFF ? 'u16' : 'u32'));
|
/dports/games/keeperrl/keeperrl-alpha23/ |
H A D | enemy_factory.h | 23 ENTS,
|
H A D | model_builder.cpp | 294 EnemyId::ENTS})) in trySingleMapModel() 368 case EnemyId::ENTS: return BiomeId::FORREST; in getBiome()
|
H A D | campaign_builder.cpp | 180 {ViewId::ENT, EnemyId::ENTS, "Tree spirits", VillainType::LESSER}, in getLesserVillains()
|
H A D | enemy_factory.cpp | 489 case EnemyId::ENTS: in getById()
|
/dports/emulators/z80pack/z80pack-1.37/imsaisim/ |
H A D | scs1.hex | 107 107 ENTS 0483H
|
H A D | scs1.asm | 783 CALL ENTS 789 ENTS: CALL CRLF label 795 JC ENTS ;JUMP IF CR FOUND
|
H A D | scs1.prn | 897 0479 CD8304 CALL ENTS 903 0483 CD0E01 ENTS: CALL CRLF 909 0495 DA8304 JC ENTS ;JUMP IF CR FOUND 2672 ENTR 0476 ENTS 0483 EO1 0574 EOF 0573
|
/dports/emulators/z80pack/z80pack-1.37/altairsim/ |
H A D | als8-rom.hex | 102 102 ENTS E80BH
|
/dports/math/sc-im/sc-im-0.8.2/ |
H A D | CHANGES | 183 … an ent that for instance has a @sum()... it used to remove its vertex and THE ENTS LINKED to THEM!
|
/dports/misc/libemos/libemos-4.5.9-Source/bufrtables/ |
H A D | C_a464db92d9b7520fec19512f4f270131.distinct | 2254 ENTS 2256 ENTS, UNSTEADY 2321 ENTS OF RVR (P) 2323 ENTS OF RVR (M) 2326 ENTS OF RVR (P) 2328 ENTS OF RVR (M)
|