A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/zlib_2inftrees_8c_source.html below:

NCBI C++ ToolKit: src/util/compress/zlib/inftrees.c Source File

12  " inflate 1.2.12 Copyright 1995-2022 Mark Adler "

;

34 unsigned short FAR

*lens;

38 unsigned short FAR

*work;

55  const unsigned short FAR

*base;

56  const unsigned short FAR

*extra;

59  unsigned short

offs[

MAXBITS

+1];

60  static const unsigned short

lbase[31] = {

61

3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,

62

35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};

63  static const unsigned short

lext[31] = {

64

16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,

65

19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 199, 202};

66  static const unsigned short

dbase[32] = {

67

1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,

68

257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,

69

8193, 12289, 16385, 24577, 0, 0};

70  static const unsigned short

dext[32] = {

71

16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,

72

23, 23, 24, 24, 25, 25, 26, 26, 27, 27,

73

28, 28, 29, 29, 64, 64};

109  for

(sym = 0; sym < codes; sym++)

116  if

(root >

max

) root =

max

;

118

here.

op

= (

unsigned

char)64;

119

here.

bits

= (

unsigned

char)1;

120

here.

val

= (

unsigned

short)0;

128  if

(root <

min

) root =

min

;

135  if

(left < 0)

return

-1;

146  for

(sym = 0; sym < codes; sym++)

147  if

(lens[sym] != 0) work[offs[lens[sym]]++] = (

unsigned

short)sym;

204

low = (unsigned)(-1);

216

here.

bits

= (

unsigned

char)(

len

- drop);

217  if

(work[sym] + 1U <

match

) {

218

here.

op

= (

unsigned

char)0;

219

here.

val

= work[sym];

221  else if

(work[sym] >=

match

) {

222

here.

op

= (

unsigned

char)(extra[work[sym] -

match

]);

223

here.

val

= base[work[sym] -

match

];

226

here.

op

= (

unsigned

char)(32 + 64);

231

incr = 1U << (

len

- drop);

236  next

[(huff >> drop) + fill] = here;

240

incr = 1U << (

len

- 1);

254  len

= lens[work[sym]];

258  if

(

len

> root && (huff &

mask

) != low) {

268

left = (

int

)(1 << curr);

269  while

(curr + drop <

max

) {

270

left -=

count

[curr + drop];

271  if

(left <= 0)

break

;

284

(*table)[low].op = (

unsigned

char)curr;

285

(*table)[low].bits = (

unsigned

char)root;

286

(*table)[low].val = (

unsigned

short)(

next

- *

table

);

294

here.

op

= (

unsigned

char)64;

295

here.

bits

= (

unsigned

char)(

len

- drop);

296

here.

val

= (

unsigned

short)0;

ncbi::TMaskedQueryRegions mask

static DLIST_TYPE *DLIST_NAME() next(DLIST_LIST_TYPE *list, DLIST_TYPE *item)

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 table

static int match(PCRE2_SPTR start_eptr, PCRE2_SPTR start_ecode, uint16_t top_bracket, PCRE2_SIZE frame_size, pcre2_match_data *match_data, match_block *mb)

const char inflate_copyright[]

int ZLIB_INTERNAL inflate_table(codetype type, unsigned short FAR *lens, unsigned codes, code FAR *FAR *table, unsigned FAR *bits, unsigned short FAR *work)

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