The current method i use for creating a color dword for direct draw is something like this: ((red/dwShadesOfRed) << dwRedBitShift) | ((green/dwShadesOfGreen) << dwGreenBitShift) | ((blue/dwShadesOfBlue) << dwBlueBitShift)) Would it be a good idea to have three pregenerated tables like Color_R[255], Color_G[255], Color_B[255], each containing the bit representation of a color component of that value. And then create colors with: (Color_R[red] | Color_G[green] | Color_B[blue]) Wich would be faster? /CMN Edited by - cmn on 9/2/00 4:16:11 AM Edited by - CMN on 9/2/00 4:17:39 AM

The lookup table would be faster since divisions are slow.

However, if dwShadesOfRed, dwShadesOfGreen, dwShadesOfBlue are powers of 2 (2,4,8,...) you can do the division using a shift and it might be faster than a lookup table.

Thanks for the advice.