/dports/print/tex-xetex/texlive-20150521-source/texk/web2c/web2c/ |
H A D | main.c | 27 #define hash_prime 7883 macro 59 int hash_list[hash_prime]; 144 i = (i + i + id[j]) % hash_prime; in hash() 187 for (h = 0; h < hash_prime; h++) in remove_locals() 213 for (i = 0; i < hash_prime; hash_list[i++] = -1) in initialize()
|
/dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/web2c/ |
H A D | main.c | 27 #define hash_prime 7883 macro 59 int hash_list[hash_prime]; 144 i = (i + i + id[j]) % hash_prime; in hash() 187 for (h = 0; h < hash_prime; h++) in remove_locals() 213 for (i = 0; i < hash_prime; hash_list[i++] = -1) in initialize()
|
/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/web2c/ |
H A D | main.c | 27 #define hash_prime 7883 macro 59 int hash_list[hash_prime]; 144 i = (i + i + id[j]) % hash_prime; in hash() 187 for (h = 0; h < hash_prime; h++) in remove_locals() 213 for (i = 0; i < hash_prime; hash_list[i++] = -1) in initialize()
|
/dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/web2c/ |
H A D | main.c | 27 #define hash_prime 7883 macro 59 int hash_list[hash_prime]; 144 i = (i + i + id[j]) % hash_prime; in hash() 187 for (h = 0; h < hash_prime; h++) in remove_locals() 213 for (i = 0; i < hash_prime; hash_list[i++] = -1) in initialize()
|
/dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/web2c/ |
H A D | main.c | 27 #define hash_prime 7883 macro 59 int hash_list[hash_prime]; 144 i = (i + i + id[j]) % hash_prime; in hash() 187 for (h = 0; h < hash_prime; h++) in remove_locals() 213 for (i = 0; i < hash_prime; hash_list[i++] = -1) in initialize()
|
/dports/print/tex-aleph/texlive-20150521-source/texk/web2c/web2c/ |
H A D | main.c | 27 #define hash_prime 7883 macro 59 int hash_list[hash_prime]; 144 i = (i + i + id[j]) % hash_prime; in hash() 187 for (h = 0; h < hash_prime; h++) in remove_locals() 213 for (i = 0; i < hash_prime; hash_list[i++] = -1) in initialize()
|
/dports/print/tex-luatex/texlive-20150521-source/texk/web2c/web2c/ |
H A D | main.c | 27 #define hash_prime 7883 macro 59 int hash_list[hash_prime]; 144 i = (i + i + id[j]) % hash_prime; in hash() 187 for (h = 0; h < hash_prime; h++) in remove_locals() 213 for (i = 0; i < hash_prime; hash_list[i++] = -1) in initialize()
|
/dports/devel/cpputest/cpputest-4.0/src/CppUTest/ |
H A D | MemoryLeakDetector.cpp | 389 return (unsigned long)((size_t)memory % hash_prime); in hash() 394 for (int i = 0; i < hash_prime; i++) in clearAllAccounting() 416 for (int i = 0; i < hash_prime; i++) in getTotalLeaks() 423 for (int i = 0; i < hash_prime; i++) { in getFirstLeak() 432 for (int i = 0; i < hash_prime; i++) { in getFirstLeakForAllocationStage() 445 for (++i; i < hash_prime; i++) { in getNextLeak() 458 for (++i; i < hash_prime; i++) { in getNextLeakForAllocationStage()
|
/dports/devel/sgb/sgb-20090810_1/ |
H A D | gb_words.w | 405 typedef Vertex *hash_table[hash_prime]; 466 for (h=htab[0]+(raw_hash-(ch(q)<<20)) % hash_prime; *h; hdown(0)) { 472 for (h=htab[1]+(raw_hash-(ch(q+1)<<15)) % hash_prime; *h; hdown(1)) { 478 for (h=htab[2]+(raw_hash-(ch(q+2)<<10)) % hash_prime; *h; hdown(2)) { 484 for (h=htab[3]+(raw_hash-(ch(q+3)<<5)) % hash_prime; *h; hdown(3)) { 490 for (h=htab[4]+(raw_hash-ch(q+4)) % hash_prime; *h; hdown(4)) { 516 for (h=htab[0]+(raw_hash-(ch(q)<<20)) % hash_prime; *h; hdown(0)) { 527 for (h=htab[0]+(raw_hash-(ch(q)<<20)) % hash_prime; *h; hdown(0)) { 532 for (h=htab[1]+(raw_hash-(ch(q+1)<<15)) % hash_prime; *h; hdown(1)) { 542 for (h=htab[3]+(raw_hash-(ch(q+3)<<5)) % hash_prime; *h; hdown(3)) { [all …]
|
/dports/math/hpipm/hpipm-0.1.1/experimental/andrea/notes/ |
H A D | notes.blg | 2 Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
|
/dports/math/gap/gap-4.11.0/pkg/gbnp/doc/nmo/ |
H A D | nmo_doc.blg | 2 Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
|
/dports/math/gap/gap-4.11.0/pkg/hap-1.25/doc/tutorial/ |
H A D | HapTutorial.blg | 2 Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
|
/dports/math/gap/gap-4.11.0/pkg/gbnp/doc/ |
H A D | gbnp_doc.blg | 2 Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
|
/dports/math/gap/gap-4.11.0/pkg/forms/doc/ |
H A D | forms.blg | 2 Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
|
/dports/devel/cpputest/cpputest-4.0/include/CppUTest/ |
H A D | MemoryLeakDetector.h | 189 hash_prime = MEMORY_LEAK_HASH_TABLE_SIZE enumerator 191 MemoryLeakDetectorList table_[hash_prime];
|
/dports/math/gap/gap-4.11.0/pkg/NoCK-1.4/doc/ |
H A D | manual.blg | 2 Capacity: max_strings=100000, hash_size=100000, hash_prime=85009
|
/dports/math/gap/gap-4.11.0/pkg/francy-1.2.4/doc/ |
H A D | Francy.blg | 2 Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
|
/dports/math/gap/gap-4.11.0/pkg/hapcryst-0.1.13/lib/datatypes/doc/ |
H A D | resolutionAccess.blg | 2 Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
|
/dports/lang/abcl/abcl-src-1.8.0/doc/manual/ |
H A D | abcl.blg | 2 Capacity: max_strings=35307, hash_size=35307, hash_prime=30011
|
/dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/ |
H A D | bibtex.ch | 168 ', hash_size=', hash_size:1, ', hash_prime=', hash_prime:1); 252 @d hash_size=5000 {must be |>= max_strings| and |>= hash_prime|} 259 {|hash_size| and |hash_prime| are now computed.} 287 @!hash_prime: integer; 295 if (hash_prime >= (16384-64)) then bad:=10*bad+6; 623 @d max_hash_value = hash_prime+hash_prime-2+127 {|h|'s maximum value} 1667 hash_prime := 2; 1668 primes[k] := hash_prime; 1671 while hash_prime < hash_want do 1692 hash_prime := j; [all …]
|
/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/ |
H A D | bibtex.ch | 168 ', hash_size=', hash_size:1, ', hash_prime=', hash_prime:1); 252 @d hash_size=5000 {must be |>= max_strings| and |>= hash_prime|} 259 {|hash_size| and |hash_prime| are now computed.} 287 @!hash_prime: integer; 295 if (hash_prime >= (16384-64)) then bad:=10*bad+6; 623 @d max_hash_value = hash_prime+hash_prime-2+127 {|h|'s maximum value} 1667 hash_prime := 2; 1668 primes[k] := hash_prime; 1671 while hash_prime < hash_want do 1692 hash_prime := j; [all …]
|
/dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/ |
H A D | bibtex.ch | 168 ', hash_size=', hash_size:1, ', hash_prime=', hash_prime:1); 252 @d hash_size=5000 {must be |>= max_strings| and |>= hash_prime|} 259 {|hash_size| and |hash_prime| are now computed.} 287 @!hash_prime: integer; 295 if (hash_prime >= (16384-64)) then bad:=10*bad+6; 623 @d max_hash_value = hash_prime+hash_prime-2+127 {|h|'s maximum value} 1667 hash_prime := 2; 1668 primes[k] := hash_prime; 1671 while hash_prime < hash_want do 1692 hash_prime := j; [all …]
|
/dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/ |
H A D | bibtex.ch | 168 ', hash_size=', hash_size:1, ', hash_prime=', hash_prime:1); 252 @d hash_size=5000 {must be |>= max_strings| and |>= hash_prime|} 259 {|hash_size| and |hash_prime| are now computed.} 287 @!hash_prime: integer; 295 if (hash_prime >= (16384-64)) then bad:=10*bad+6; 623 @d max_hash_value = hash_prime+hash_prime-2+127 {|h|'s maximum value} 1667 hash_prime := 2; 1668 primes[k] := hash_prime; 1671 while hash_prime < hash_want do 1692 hash_prime := j; [all …]
|
/dports/print/tex-aleph/texlive-20150521-source/texk/web2c/ |
H A D | bibtex.ch | 168 ', hash_size=', hash_size:1, ', hash_prime=', hash_prime:1); 252 @d hash_size=5000 {must be |>= max_strings| and |>= hash_prime|} 259 {|hash_size| and |hash_prime| are now computed.} 287 @!hash_prime: integer; 295 if (hash_prime >= (16384-64)) then bad:=10*bad+6; 623 @d max_hash_value = hash_prime+hash_prime-2+127 {|h|'s maximum value} 1667 hash_prime := 2; 1668 primes[k] := hash_prime; 1671 while hash_prime < hash_want do 1692 hash_prime := j; [all …]
|
/dports/print/tex-luatex/texlive-20150521-source/texk/web2c/ |
H A D | bibtex.ch | 168 ', hash_size=', hash_size:1, ', hash_prime=', hash_prime:1); 252 @d hash_size=5000 {must be |>= max_strings| and |>= hash_prime|} 259 {|hash_size| and |hash_prime| are now computed.} 287 @!hash_prime: integer; 295 if (hash_prime >= (16384-64)) then bad:=10*bad+6; 623 @d max_hash_value = hash_prime+hash_prime-2+127 {|h|'s maximum value} 1667 hash_prime := 2; 1668 primes[k] := hash_prime; 1671 while hash_prime < hash_want do 1692 hash_prime := j; [all …]
|