Lines Matching +defs:val +defs:is
3 * This software is part of the ast package *
5 * and is licensed under the *
9 * A copy of the License is available at *
36 " file is specified then that partition is refined. A partition file,"
37 " suitable for use by \bpin\b, \bpzip\b(1) or \bpop\b(1) is listed"
38 " on the standard output. The input \afile\a is referred to as"
42 " [+(1)?If \b--partition\b is not specified then a"
52 " both ordering and partitioning is NP-complete.]"
53 " [+(3)?The optimal partition for the ordering from step (2) is"
65 " \abzip\a is not fully supported by \apzip\a, pending further"
68 " on another invocation; this information is saved in \bpin-\b\abase\a,"
69 " where \abase\a is the base name (no directory) of \afile\a. Saved"
76 " columns in the partition. If \acolumns\a is followed by `%' then"
83 " exceeds \bmaxhigh\b. If \bmaxhigh\b is followed by `%' then the limit"
84 " is \bmaxhigh\b percent of the total number of columns.]:[maxhigh:=40%]"
87 " partition groups and permutation. The partition file is a sequence"
92 " \abegin\a[-\aend\a]] where \abegin\a is the beginning column offset"
93 " (starting at 0), and \aend\a is the ending column offset for an"
97 " Each high frequency partition group is processed as"
105 " is determined by sampling the input if not specified.]#[row-size]"
119 " than one \afile\a is specified then the record size and name are"
120 " printed for each file. If the sample is insufficient, or if"
121 " \b--verify\b is specified, then all of the data read to determine"
133 "[X:prefix?Uncompressed data contains a prefix that is defined by \acount\a"
134 " and an optional \aterminator\a. This data is not \bpzip\b compressed."
473 * (np+1) is used as tmp workspace
474 * return 1 if the best merge is better than i and pp separately
580 error(3, "%s: `%s' is invalid", buf, q);
860 error(3, "%s: `%s' is invalid", buf, s);
1253 * dynamic program to find optimal partition based on zip sizes in val
1257 optimize_dynamic(Optimize_method_t* method, unsigned char* buf, unsigned char* dat, size_t** val, size_t* cst, size_t* sol, size_t row, size_t tot, size_t grp)
1277 val[i][j] = field(buf, dat, i, j, row, tot);
1279 val[i][j] = ~0;
1288 cst[i] = val[0][i];
1292 new = cst[j] + val[j+1][i];
1303 * greedy algorithm to approximate optimal partition based on zip sizes in val
1307 optimize_greedy(Optimize_method_t* method, unsigned char* buf, unsigned char* dat, size_t** val, size_t* cst, size_t* sol, size_t row, size_t tot, size_t grp)
1313 cst[0] = val[0][0] = field(buf, dat, 0, 0, row, tot);
1317 val[sol[i-1] + 1][i] = field(buf, dat, sol[i-1]+1, i, row, tot);
1318 val[i][i] = field(buf, dat, i, i, row, tot);
1319 expand = val[sol[i-1] + 1][i];
1320 new = cst[i-1] + val[i][i];
1322 cst[i] = val[i][i];
1334 * based on zip sizes in val
1338 optimize_transitive(Optimize_method_t* method, unsigned char* buf, unsigned char* dat, size_t** val, size_t* cst, size_t* sol, size_t row, size_t tot, size_t grp)
1343 cst[0] = val[0][0] = field(buf, dat, 0, 0, row, tot);
1347 val[i][i] = field(buf, dat, i, i, row, tot);
1349 if (expand <= val[i-1][i-1] + val[i][i])
1356 cst[i] = val[i][i];
1364 * the first entry is the default
1393 * the first entry is the default
1456 struct stat is;
1678 error(3, "-r row-size is required");
1700 if (stat(state.input, &is))
1710 if (!stat(state.cachefile, &cs) && cs.st_mtime < is.st_mtime && remove(state.cachefile))
1745 size_t** val;
1751 val = matrix(row);
1759 (*optimize_method->fun)(optimize_method, buf, dat, val, cst, sol, row, tot, maxgrp);
1773 free(val);