Most of you know about compiled bitmaps. Pieces of ASM code that modify a block of memory. Fast but hard to clip. What about this: Say you have a surface destination bitmap (dest) and a source bitmap with transparent parts. A reverse compiled bitmap would know the exact location of all the transparent blocks so it would copy the pixels from the dest to the src, overwritting whereever the transparent pixels are at. Once that is done, the src can be copied back to the dest in one copy, or row by row if clipping occurs. I''m no ASM programmer and only slightly understand it. Just wondering if it were a feasible idea that brought about a fast transparent bitblt. Thank you Dino M. Gambone Dino M. Gambone
Good judgement is gained through experience. Experience, however, is gained through bad judgement.