| # | Line 1 | Line 1 | |
|---|---|---|
| 1 | – | /* |
| 2 | – | |
| 1 | #ifndef lint | |
| 2 | < | static char SCCSid[] = "$SunId$ LBL"; |
| 2 | > | static const char RCSid[] = "$Id$"; |
| 3 | #endif | |
| 4 | + | /* |
| 5 | CUT - Median bisection (k-d tree) algorithm for color image quantization | |
| 6 | ||
| 7 | flaw: doesn't always create as many colors as requested | |
| # | Line 121 | Line 120 | struct index *ii,*io; /* box ii will go into io, the o | |
| 120 | } | |
| 121 | io[0].o = o1; | |
| 122 | io[0].freq = (freq>>1)-count; | |
| 123 | < | io[1].freq = (freq+1>>1)+count; |
| 123 | > | io[1].freq = ((freq+1)>>1)+count; |
| 124 | /* printf(" at %3d %d=%d+%d\n",io[1].o-off,freq,io[0].freq,io[1].freq); */ | |
| 125 | } | |
| – | Removed lines |
| + | Added lines |
| < | Changed lines |
| > | Changed lines |