Searched refs:cost (Results 1 - 8 of 8) sorted by relevance
| /haiku-fatelf/src/bin/coreutils/src/ |
| H A D | fmt.c | 54 cost of 50 means that it is as bad as a line 5 characters too short
76 /* Basic cost per line. */
93 we assign a very high cost -- it should be avoided unless things are
110 and/or cause more overflows in cost calculations. FIXME: Remove these
146 COST best_cost; /* cost of best paragraph starting here */
784 - find a low-cost line break near the end,
882 /* Return the constant component of the cost of breaking before the
888 COST cost; local
890 cost = LINE_COST;
897 cost
922 COST cost; local
[all...] |
| /haiku-fatelf/src/add-ons/translators/webp/libwebp/enc/ |
| H A D | cost.c | 14 #include "cost.h"
21 // Boolean-cost cost table
53 // Level cost tables
342 int cost = 0; local
346 cost += VP8BitCost(bits & 1, probas[i]);
351 return cost;
370 // Starting at level 67 and up, the variable part of the cost is
378 // Mode cost tables.
380 // These are the fixed probabilities (in the coding trees) turned into bit-cost
[all...] |
| H A D | quant.c | 16 #include "cost.h"
429 score_t cost; // bit cost member in struct:__anon2864
468 score_t cost; local
486 cost = VP8BitCost(0, last_proba);
487 best_score = RDScoreTrellis(lambda, cost, max_error);
492 NODE(n, m).cost = 0;
524 cur->cost = MAX_COST;
541 score_t cost, base_cost, score; local
543 if (prev->cost >
[all...] |
| H A D | frame.c | 18 #include "cost.h"
37 CostArray* cost; member in struct:__anon2861
55 // Reset the statistics about: number of skips, token proba, level cost,...
72 // Returns the bit-cost for coding the skip probability.
84 size += 8 * 256; // cost of signaling the skip_proba_ itself.
141 // Return the total bit-cost for coding the probability updates.
185 res->cost = enc->proba_.level_cost_[coeff_type];
208 const uint16_t *t = res->cost[VP8EncBands[n]][ctx];
209 int cost; local
211 cost
[all...] |
| /haiku-fatelf/src/add-ons/media/plugins/ffmpeg/libbz2/ |
| H A D | compress.c | 256 UInt16 cost[BZ_N_GROUPS]; local
353 Calculate the cost of this group as coded
356 for (t = 0; t < nGroups; t++) cost[t] = 0;
383 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
384 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
385 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
391 for (t = 0; t < nGroups; t++) cost[
[all...] |
| /haiku-fatelf/src/libs/ncurses/ncurses/tty/ |
| H A D | hashmap.c | 124 /* approximate update cost */
128 int cost = 0; local
133 cost++;
135 return cost;
141 int cost = 0; local
150 cost++;
152 return cost;
156 * Returns true when moving line 'from' to line 'to' seems to be cost
172 * On the left side of >= is the cost before moving;
173 * on the right side -- cost afte
[all...] |
| H A D | lib_mvcur.c | 54 ** old ncurses optimizer: less accurate cost computations (in fact,
70 ** cost swamps the computation overhead (and as machines get faster, this
126 * int _char_padding; // cost of character put
127 * int _cr_cost; // cost of (carriage_return)
128 * int _cup_cost; // cost of (cursor_address)
129 * int _home_cost; // cost of (cursor_home)
130 * int _ll_cost; // cost of (cursor_to_ll)
132 * int _ht_cost; // cost of (tab)
133 * int _cbt_cost; // cost of (back_tab)
135 * int _cub1_cost; // cost o
248 int cost = _nc_msec_cost(cap, affcnt); local
[all...] |
| /haiku-fatelf/src/bin/less/ |
| H A D | screen.c | 1343 * Return the cost of displaying a termcap string.
1361 cost(t) function
1372 * cost (see cost() function).
1388 if (cost(t1) < cost(t2))
|
Completed in 126 milliseconds