16, 17, 18, 0, 8, 7, 9, 6,
16510, 5, 11, 4, 12, 3, 13, 2,
1703, 4, 5, 6, 7, 8, 9, 10,
17111, 13, 15, 17, 19, 23, 27, 31,
17235, 43, 51, 59, 67, 83, 99, 115,
173131, 163, 195, 227, 258, 0, 0
1780, 0, 0, 0, 0, 0, 0, 0,
1791, 1, 1, 1, 2, 2, 2, 2,
1803, 3, 3, 3, 4, 4, 4, 4,
1815, 5, 5, 5, 0, 99, 99
1851, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
186257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
1878193, 12289, 16385, 24577
1900, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6,
1917, 7, 8, 8, 9, 9, 10, 10, 11, 11,
2280x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff,
2290x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff
232 #define NEEDBITS(n) { \ 233 while ( k < (n) ) { \ 234 b |= ((ulg)Nlmzip_ReadByte()) << k; \ 238 #define DUMPBITS(n) { \ 325memset(c, 0,
sizeof(c));
340 for( j = 1; j <=
BMAX; j++ ) {
360 for(y = 1 << j; j <
i; j++, y <<= 1)
363 if((y -= c[
i]) < 0)
370p = c + 1; xp = x + 2;
407z = (z =
g- w) > (
Uint4)
l?
l: z;
408 if((
f= 1 << (j = k - w)) >
a+ 1)
414 if((
f<<= 1) <= *++xp)
422 if((q = (
struct huft*)
malloc((z + 1)*
sizeof(
struct huft))) ==
439 r.e = (
uch)(16 + j);
447 r.b = (
uch)(k - w);
452 r.e = (
uch)(*p < 256 ? 16 : 15);
453 r.v.n = (
ush)(*p);
458 r.e = (
uch)
e[*p - s];
459 r.v.n = d[*p++ - s];
464 for(j =
i>> w; j < z; j +=
f)
468 for(j = 1 << (k - 1);
i& j; j >>= 1)
473 while((
i& ((1 << w) - 1)) != x[h])
482 returny != 0 &&
g!= 1;
502 while( p !=
NULL) {
543 if( (
e= (
t= tl + ((
Uint4)
b& ml))->
e) > 16 ) {
575 if( (
e= (
t=
td+ ((
Uint4)
b& md))->
e) > 16 ) {
656 if(
n!= (
Uint4)((~
b) & 0xffff) ) {
701 for(
i= 0;
i< 144;
i++ ) {
704 for(;
i< 256;
i++) {
707 for(;
i< 280;
i++) {
710 for(;
i< 288;
i++) {
720 for(
i= 0;
i< 30;
i++ ) {
772nl = 257 + ((
Uint4)
b& 0x1f);
776nd = 1 + ((
Uint4)
b& 0x1f);
780nb = 4 + ((
Uint4)
b& 0xf);
783 if( nl > 286 || nd > 30 ) {
789 for(j = 0; j < nb; j++) {
794 for(; j < 19; j++ ) {
818}
else if(j == 16) {
820j = 3 + ((
Uint4)
b& 3);
828}
else if(j == 17) {
830j = 3 + ((
Uint4)
b& 7);
841j = 11 + ((
Uint4)
b& 0x7f);
void Nlmzip_ReadUndo(void)
unsigned char Nlmzip_window[2L *0x8000]
static int inflate_codes(struct huft *, struct huft *, int, int)
static unsigned short mask_bits[]
static int inflate_dynamic(void)
static int inflate_fixed(void)
static unsigned short cplens[]
static int huft_free(struct huft *)
static int huft_build(Uint4 *, Uint4, Uint4, ush *, ush *, struct huft **, int *)
static int inflate_block(int *)
static int inflate_stored(void)
uint32_t Uint4
4-byte (32-bit) unsigned integer
unsigned int
A callback function used to compare two keys in a database.
<!DOCTYPE HTML >< html > n< header > n< title > PubSeq Gateway Help Page</title > n< style > n td
if(yy_accept[yy_current_state])
double r(size_t dimension_, const Int4 *score_, const double *prob_, double theta_)
static SLJIT_INLINE sljit_ins l(sljit_gpr r, sljit_s32 d, sljit_gpr x, sljit_gpr b)
int g(Seg_Gsm *spe, Seq_Mtf *psm, Thd_Gsm *tdg)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4