Searched refs:NP (Results 1 – 11 of 11) sorted by relevance
| /original-bsd/usr.bin/spell/ |
| H A D | spell.h | 36 #define NP (sizeof(p)/sizeof(p[0])) macro
52 long pow2[NP][NW];
74 for (i=0; i<NP; i++) {
|
| H A D | spellin.c | 41 for (i=0; i<NP; i++) {
|
| H A D | spellout.c | 48 for (i=0; i<NP; i++) {
|
| H A D | spell.c | 568 for(i=0; i<NP; i++) {
|
| /original-bsd/usr.bin/spline/ |
| H A D | spline.c | 21 #define NP 1000 macro
23 struct proj { int lbf,ubf; float a,b,lb,ub,quant,mult,val[NP]; } x,y;
234 for(n=0;n<NP;n++){ in readin()
|
| /original-bsd/libexec/getty/ |
| H A D | gettytab.h | 109 #define NP gettyflags[21].value macro
|
| H A D | main.c | 450 if (!NP) {
|
| /original-bsd/sys/luna68k/stand/ |
| H A D | getline.c-big | 204 { nil_operation }, /* 0x0C NP */
|
| /original-bsd/old/ms/ |
| H A D | tmac.s | 43 .wh 0 NP
|
| /original-bsd/contrib/dungeon/ |
| H A D | dungeon.doc | 53 NP.FOR -parser, part 0
|
| /original-bsd/games/fortune/datfiles/ |
| H A D | fortunes2 | 11026 solved. The only difficulty is that the problem is NP complete and will
41381 The algorithm for finding the longest path in a graph is NP-complete.
|