class Point { private int x,y; public Point(int x,int y) { this.x=x; //this它代表當前對象名 this.y=y; } public void Draw() { } public Point() { this(0,0); //this(參數)調用本類中另一種形成的建構函式 } } class Circle extends Point { private int radius; public circle(int
有關DLL的編寫代碼,在VC裡面建立一個Win32 Dynamic-Link Library類型的空項目,源碼如下:// DllProject.cpp : Defines the entry point for the DLL application.//#include <windows.h>#define DLLEXPORT extern "C" _declspec(dllexport)DLLEXPORT int add(int a, int b);DLLEXPORT int
Setup has detected at least another Rational product with a higher version number. Technote (FAQ) ProblemThis technote identifies the cause and resolution to the error, setup has detected at least another Rational product with a higher version,
OllyDbg 的快捷命令欄外掛程式快捷命令來源:http://www.anqn.com/article/d/2005-07-13/a091225.shtml 自己驗證了一下,挺好用的。CALC 判斷運算式 WATCH 添加監視運算式 AT / FOLLOW Disassemble at address 在地址進行反組譯碼 ORIG Disassemble at EIP 反組譯碼於 EIP DUMP Dump at address 在地址轉存 DA Dump as disassembly
RIGHT-ROTATE(T, x) 1 y ← left[x] ▹ Set y. 2 left[x] ← right[y] ▹ Turn y's right subtree into x's left subtree. 3 p[right[y]] ← x 4 p[y] ← p[x] ▹ Link x's parent to y. 5 if p[x] = nil[T] 6 then root[T] ← y 7
1 堆排序演算法分析MAX-HEAPIFY(A, i) 1 l ← LEFT(i) 2 r ← RIGHT(i) 3 if l ≤ heap-size[A] and A[l] > A[i] 4 then largest ← l 5 else largest ← i 6 if r ≤ heap-size[A] and A[r] > A[largest] 7 then largest ← r 8 if largest ≠ i 9 then