ThreeF

摘要： 炮姐的88行代码,亮瞎了..有待研究#include <windows.h>#include <stdio.h>#include <time.h>#include <conio.h>#include <stdlib.h>char gcText[] = " 1LJTSZ#";struct tetris { int _pool[16][32], (*pool)[32], tmap[8][4][16]; int x, y, s, st, t;}gt;void trsInit() { int sp[8][4] = {{15 阅读全文

摘要： http://www.codeproject.com/Articles/633/Introduction-to-COM-What-It-Is-and-How-to-Use-ItPurpose of this ArticleI have written thistutorialfor programmers who are just starting out inCOMand need some help in understanding the basics. The article briefly covers theCOMspecification, and then explains s 阅读全文

摘要： #include <windows.h>#include <shobjidl.h> int WINAPI wWinMain(HINSTANCE hInstance, HINSTANCE, PWSTR pCmdLine, int nCmdShow){ HRESULT hr = CoInitializeEx(NULL, COINIT_APARTMENTTHREADED | COINIT_DISABLE_OLE1DDE); if (SUCCEEDED(hr)) { IFileOpenDialog *pFileOpen; // Create... 阅读全文

摘要： 后缀数组就是将字符串所有后缀排序后的数组，设字符串为S，令后缀Suffix(i)表示S[i..len(S)]。用两个数组记录所有后缀的排序结果：Rank[i]记录Suffix(i)排序后的序号，即Suffix[i]在所有后缀中是第Rank[i]小的后缀SA[i]记录第i位后缀的首字母位置，即Suffix[SA[i]]在所有后缀中是第i小的后缀然后就是怎么快速求所有后缀的顺序了，其中的关键是如何减少两个后缀比较的复杂度方法是倍增法，定义一个字符串的k-前缀为该字符串的前k个字符组成的串，关于在k-后缀上的定义Suffix(k,i)、SA[k,i]和Rank[k,i]类似于前，则有若Rank[k, 阅读全文

摘要： http://blogs.msdn.com/b/vcblog/archive/2009/02/03/rvalue-references-c-0x-features-in-vc10-part-2.aspxPart 1of this series coveredlambdas,auto, andstatic_assert.Today, I'm going to talk aboutrvalue references, which enable two different things:move semanticsandperfect forwarding. This post will b 阅读全文