- 1、本文档共16页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
不规则窗口建立的优化技术(Optimization techniques for building irregular windows)
不规则窗口建立的优化技术(Optimization techniques for building irregular windows)
To create irregular window, is mainly used to search each pixel in the bitmap, and then to display the CRgn object are established each pixel on the screen, and then through the Rgn to like
The combination of construction of irregular window. Using this method first to specify a shielded RGB color value (usually the color pixels are not displayed), then each of the bitmap scan
A pixel RGB color value, and compared with the shielding of RGB value, if not equal to the creation of a CRgn object are combined with other CRgn objects. When scanning all pixels, has
For irregular is not a shield RGB color value area. The original code:
Void (AnomalyWindow CWnd*pWnd, int nBmpID, COLORREF rcMask)
{
CBitmap bitmap;
CDC dcMem;
Bitmap.LoadBitmap (nBmpID);
DcMem.CreateCompatibleDC ((pWnd-GetDC));
DcMem.SelectObject (bitmap);
BITMAP bt;
Bitmap.GetObject (sizeof (BT), bt);
CRgn RGN, temprgn;
Int i, j;
COLORREF rc;
Rgn.CreateRectRgn (0,0,0,0);
For (i=0; ibt.bmWidth; i++)
{
For (j=0; jbt.bmHeight; j++)
{
Rc=dcMem.GetPixel (I, J);
If (RC =rcMask!)
{
Temprgn.CreateRectRgn (I, J, i+1, j+1);
Rgn.CombineRgn (rgn, temprgn, RGN_OR);
(temprgn.DeleteObject);
}
}
}
PWnd-SetWindowRgn ((HRGN) RGN, TRUE);
(dcMem.DeleteDC);
(bitmap.DeleteObject);
(rgn.DeleteObject);
}
The main part of the above method is obviously in the scanning part of pixel, as for the use of CRgn objects is introduced to do more. Obviously this is a very time-consuming operation, because a width of W, height of H bitmap will cycle W*H, for example, to do a 800*600 irregular window to 480000 cycles! If so, before display will be waiting for a relatively long period of time. Thus the efficiency will be very low!
Any kind of algorithms are in time and space interaction. In some cases, the time required for the less efficient algorithm will occupy more space, and small space occupation time will increase the relative algorithm. By my door in the above algorithm i
您可能关注的文档
- java多线程程序设计详细解析(Java multithreaded programming, detailed analysis).doc
- java反射+多线程+异常处理(Java reflection + multithreading + exception handling).doc
- java多线程编程详解(Java multithreaded programming detailed).doc
- java学习之路不走弯路,就是捷径(Java learning path no detours is a shortcut.).doc
- java学习课堂笔记(Java learning notes).doc
- java学习(java学习).doc
- java常用单词(Java common words).doc
- java常用英语词组(Java commonly used English phrases.).doc
- java常用类(Java common classes).doc
- java根据反射进行get、set(Java performs get and set on reflection).doc
文档评论(0)