Lines Matching refs:entries
229 * each 2-D array has 2^6*2^5 = 2048 or 2^6*2^6 = 4096 entries. Note that
279 * The fserrors[] array has (#columns + 2) entries; the extra entry at
727 * cell (because the inner loop has to be over cells, not colormap entries).
738 * eliminate colormap entries that are far away from the subbox; typically
739 * three-fourths of the colormap entries are rejected by Heckbert's criterion,
743 * can't eliminate as many colormap entries. Empirically the best subbox
781 /* Locate the colormap entries close enough to an update box to be candidates
784 * candidate colormap entries is returned, and their colormap indexes are
912 * Return the indexes of the closest entries in the bestcolor[] array.
989 /* Fill the inverse-colormap entries in the update box that contains */
1018 /* Determine which colormap entries are close enough to be candidates
1567 // We need to shift the palette entries up
1587 // Fill the first 20 entries with Windows system colours
1591 PALETTEENTRY* entries = new PALETTEENTRY[windowsSystemColourCount];
1592 ::GetSystemPaletteEntries(hDC, 0, windowsSystemColourCount, entries);
1597 r[i] = entries[i].peRed;
1598 g[i] = entries[i].peGreen;
1599 b[i] = entries[i].peBlue;
1601 delete[] entries;
1612 // Blank out any remaining palette entries