Searched defs:cost (Results 1 - 6 of 6) sorted by relevance
/osnet-11/usr/src/lib/libcurses/screen/ |
H A D | mvcur.c | 91 int hu, /* cost home + relative */ 92 hd, /* cost home-down + relative */ 93 rl, /* cost relative */ 94 cm; /* cost direct cursor motion */ 112 /* cost of using cm */ 145 /* cost using relative movements */ 150 /* cost of homing to upper-left corner first */ 154 /* cost of homing to lower-left corner first */ 189 int cy, cost; local 193 cost [all...] |
H A D | wrefresh.c | 803 int x1, x2, blnk, idch, cost, cost_ich1, match; local 809 cost = _COST(dcfixed) + (parm_dch ? _COST(Parm_dch) : 812 cost = _INFINITY; 814 if (match >= cost) { 872 cost = SP->phys_irm ? 0 : _COST(icfixed); 874 cost += _COST(Parm_ich); 877 cost += cost_ich1; 880 cost = _COST(Parm_ich); 882 cost = cost_ich1; 884 if ((cost [all...] |
/osnet-11/usr/src/lib/libxcurses/src/libc/xcurses/ |
H A D | mvcur.c | 50 * Make_seq_best() swaps the values of the pointers if s1->cost > s2->cost. 53 if (s1->cost > s2->cost) { \ 59 #define zero_seq(seq) ((seq)->end = (seq)->vec, (seq)->cost = 0) 64 int cost; /* cost of vector */ member in struct:Sequence 76 if (seq1->cost >= __MOVE_INFINITY || seq2->cost >= __MOVE_INFINITY) 77 seq1->cost 447 cost(cap, index, p1, p2) function [all...] |
H A D | doupdate.c | 76 short cost; member in struct:cost_op 96 STATIC int cost(int, int); 296 * along the line and jump only when the cost of redrawing 300 /* First time addressing this row or cost of 650 * This is a modified Gosling cost algorithm that takes into account 657 cost(fr, lr) function 667 /* Prepare initial row and column of cost matrix. 675 LC(fr,fr).cost = 0; 678 LC(fr,nr).cost = cc * 3; 682 LC(nr,fr).cost [all...] |
/osnet-11/usr/src/lib/libxcurses2/src/libc/xcurses/ |
H A D | mvcur.c | 54 * Make_seq_best() swaps the values of the pointers if s1->cost > s2->cost. 57 if (s1->cost > s2->cost) { \ 63 #define zero_seq(seq) ((seq)->end = (seq)->vec, (seq)->cost = 0) 68 int cost; /* cost of vector */ member in struct:Sequence 79 if (seq1->cost >= __MOVE_INFINITY || seq2->cost >= __MOVE_INFINITY) 80 seq1->cost 434 cost(char *cap, int index, int p1, int p2) function [all...] |
H A D | doupdate.c | 73 short cost; member in struct:cost_op 96 static int cost(int, int); 780 * This is a modified Gosling cost algorithm that takes into account 792 cost(int fr, int lr) function 803 * Prepare initial row and column of cost matrix. 811 LC(fr, fr).cost = MOVE_COST; 814 LC(fr, nr).cost = cc * INSERT_COST; 818 LC(nr, fr).cost = cc * DELETE_COST; 827 lcp->cost = LC(or, nr).cost; [all...] |
Completed in 21 milliseconds